• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.3
• /
• pp.221-230
• /
• 2004

In general, remote monitoring systems monitor the status of distributed hosts and/or applications in real-time for diverse managerial purposes. However, most of the extant systems have a few undesirable problems. First of all, they are platform-dependent and are not resilient to network and/or host failures. Moreover, they normally focus on the resource usage trends in monitored hosts, rather than on the status change of the applications running on them. We strongly believe that the latter has more direct and profound effect on the resource usage patterns on each host. In this paper, we present the design and implementation of the Remote Applications Monitoring System (RAMS) that enables us to effectively manage distributed applications through a real-time monitoring of their respective resource usages. The RAMS is a centralized system that consists of many distributed agents and a single centralized manager. An agent on each host is in charge of collecting and reporting the status of local applications. The manager handles agent registration and provides a central access point to the selection and monitoring of distributed applications. The salient features of the system include robustness and portability The adoption of JINI greatly facilitates an automatic recovery from partial network failure and host failure.

• Journal of KIISE:Software and Applications
• /
• v.33 no.2
• /
• pp.220-230
• /
• 2006

As the computing technique and mobile devices get developed, the demand of multimedia contents for mobile environment has been increased. The multimedia contents provided on PDA has so far been limited to the materials such as video and audio. MPEG-4 is the international standard used for supporting to properly save, communicate multimedia in formation such as video, audio, image, text and two-dimensional object, which can present various, multimedia contents by using adaptation techniques. However, since most MPEG-4 contents are not used for PDA but desktop, it seems not to be played on PDA where needs low power consumption, limited memory capability and GUI, and so on. In this paper, we propose the adaptation techniques, which can present the MPEG-4 contents on PDA, using scene composition with MPEG-4. The proposed scheme consists of three subparts: physical adaptation, variation adaptation and resource adaptation. Physical adaptation adjusts the physical difference of between the authoring environment and playback environment. Event adaptation part transforms events used for desktop to the events used for playback on PDA. The resource adaptation enables efficiency of playback to promote by using the essential information table on BIFS parser. As the proposed scheme is applied to MPEG-4 player, we see that the MPEG-4 contents are efficiently played on PDA.

• Journal of Internet Computing and Services
• /
• v.11 no.1
• /
• pp.35-48
• /
• 2010

For the next generation mobile communication system, diverse wireless network techniques such as beyond 3G LTE, WiMAX/WiBro, and next generation WLAN etc. are proceeding to the form integrated into the All-IP core network. According to this development, Beyond 3G integrated into heterogeneous wireless access technologies must support the vertical handover and network to be used of several radio networks. However, unified management of each network is demanded since it is individually serviced. Therefore, in order to solve this problem this study is introducing the theory of Common Radio Resource Management (CRRM) based on Generic Link Layer (GLL). This study designs the structure and functions to support the vertical handover and propose the vertical handover algorithm of which policy-based and MCDM are composed between LTE and WLAN systems using GLL and CRRM. Finally, simulation results are presented to show the improved performance over the data throughput, handover success rate and the system service cost.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.53-59
• /
• 2016

Recently, huge stream data have been generated in real time from various applications such as wireless sensor networks, Internet of Things services, and social network services. For this reason, to develop an efficient method have become one of significant issues in order to discover useful information from such data by processing and analyzing them and employing the information for better decision making. Since stream data are generated continuously and rapidly, there is a need to deal with them through the minimum access. In addition, an appropriate method is required to analyze stream data in resource limited environments where fast processing with low power consumption is necessary. To address this issue, the sliding window model has been proposed and researched. Meanwhile, one of data mining techniques for finding meaningful information from huge data, pattern mining extracts such information in pattern forms. Frequency-based traditional pattern mining can process only binary databases and treats items in the databases with the same importance. As a result, frequent pattern mining has a disadvantage that cannot reflect characteristics of real databases although it has played an essential role in the data mining field. From this aspect, high utility pattern mining has suggested for discovering more meaningful information from non-binary databases with the consideration of the characteristics and relative importance of items. General high utility pattern mining methods for static databases, however, are not suitable for handling stream data. To address this issue, sliding window based high utility pattern mining has been proposed for finding significant information from stream data in resource limited environments by considering their characteristics and processing them efficiently. In this paper, we conduct various experiments with datasets for performance evaluation of sliding window based high utility pattern mining algorithms and analyze experimental results, through which we study their characteristics and direction of improvement.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.2
• /
• pp.48-59
• /
• 2024

As functions that support virtualization on their own in hardware are developed, user applications having various workloads are operating efficiently in the virtualization system. SR-IOV is a virtualization support function that takes direct access to PCI devices, thus giving a high I/O performance by minimizing the need for hypervisor or operating system interventions. With SR-IOV, network I/O acceleration can be realized in virtualization systems that have relatively long I/O paths compared to bare-metal systems and frequent context switches between the user area and kernel area. To take performance advantages of SR-IOV, network resource management policies that can derive optimal network performance when SR-IOV is applied to an instance such as a virtual machine(VM) or container are being actively studied.This paper evaluates and analyzes the network performance of SR-IOV implementing I/O acceleration is compared with Virtio in terms of 1) network delay, 2) network throughput, 3) network fairness, 4) performance interference, and 5) multi-network. The contributions of this paper are as follows. First, the network I/O process of Virtio and SR-IOV was clearly explained in the virtualization system, and second, the evaluation results of the network performance of Virtio and SR-IOV were analyzed based on various performance metrics. Third, the system overhead and the possibility of optimization for the SR-IOV network in a virtualization system with high VM density were experimentally confirmed. The experimental results and analysis of the paper are expected to be referenced in the network resource management policy for virtualization systems that operate network-intensive services such as smart factories, connected cars, deep learning inference models, and crowdsourcing.

• Journal of Internet Computing and Services
• /
• v.25 no.3
• /
• pp.83-92
• /
• 2024

Recently, the importance of HR analytics for data-based decision-making in establishing and operating an effective human resource management system for companies is increasing. In addition, there is growing interest in the effect of employees' perceptions of organizational justice on positive organizational behavior. Therefore, in this study, among the various factors affecting teamwork behavior, we analyzed the impact on teamwork behavior such as perception of organizational justice and organizational culture. Organizational justice has a significant impact on the formation of members' attitudes, but its meaning may vary depending on the organizational context. In this study, we divided organizational justice into four types (procedural, distributive, interpersonal, and informational fairness) and confirmed their impact on teamwork behavior. In addition, organizational culture was divided into hierarchy culture and innovation culture, and how to regulate these relationships was examined. To analyze these relationships, individual-level data collected from 657 people at domestic companies were used for analysis. According to the analysis results, in a hierarchical culture, procedural justice and information justice had a positive influence on teamwork behavior through the mediating process of job satisfaction, and in an innovative culture, interpersonal justice and information justice had a positive influence on teamwork behavior through job satisfaction. It was confirmed to have a (+) effect. These research results provide implications for people management by indicating that, although organizational justice is important to members and organizations, it may be perceived differently and have different meanings depending on the organizational context. Through the use of the information presented in this study, we will provide value that can effectively and efficiently implement a company's human resource management system.

• Journal of Internet Computing and Services
• /
• v.19 no.1
• /
• pp.77-86
• /
• 2018

For the past few years, KISTI has been servicing an online simulation execution platform, called EDISON, allowing users to conduct simulations on various scientific applications supplied by diverse computational science and engineering disciplines. Typically, these simulations accompany large-scale computation and accordingly produce a huge volume of output data. One critical issue arising when conducting those simulations on an online platform stems from the fact that a number of users simultaneously submit to the platform their simulation requests (or jobs) with the same (or almost unchanging) input parameters or files, resulting in charging a significant burden on the platform. In other words, the same computing jobs lead to duplicate consumption computing and storage resources at an undesirably fast pace. To overcome excessive resource usage by such identical simulation requests, in this paper we introduce a novel framework, called IceSheet, to efficiently manage simulation data based on execution metadata, that is, provenance. The IceSheet framework captures and stores each provenance associated with a conducted simulation. The collected provenance records are utilized for not only inspecting duplicate simulation requests but also performing search on existing simulation results via an open-source search engine, ElasticSearch. In particular, this paper elaborates on the core components in the IceSheet framework to support the search and reuse on the stored simulation results. We implemented as prototype the proposed framework using the engine in conjunction with the online simulation execution platform. Our evaluation of the framework was performed on the real simulation execution-provenance records collected on the platform. Once the prototyped IceSheet framework fully functions with the platform, users can quickly search for past parameter values entered into desired simulation software and receive existing results on the same input parameter values on the software if any. Therefore, we expect that the proposed framework contributes to eliminating duplicate resource consumption and significantly reducing execution time on the same requests as previously-executed simulations.

• Journal of Intelligence and Information Systems
• /
• v.18 no.3
• /
• pp.35-51
• /
• 2012

Cloud computing is internet-based computing where computing resources are offered over the Internet as scalable and on-demand services. In particular, in case a number of various cloud services emerge in accordance with development of internet and mobile technology, to select and provide services with which service users satisfy is one of the important issues. Most of previous works show the limitation in the degree of user satisfaction because they are based on so called concept similarity in relation to user requirements or are lack of versatility of user preferences. This paper presents cloud service selection reasoning which can be applied to the general cloud service environments including a variety of computing resource services, not limited to web services. In relation to the service environments, there are two kinds of services: atomic service and composite service. An atomic service consists of service attributes which represent the characteristics of service such as functionality, performance, or specification. A composite service can be created by composition of atomic services and other composite services. Therefore, a composite service inherits attributes of component services. On the other hand, the main participants in providing with cloud services are service users, service suppliers, and service operators. Service suppliers can register services autonomously or in accordance with the strategic collaboration with service operators. Service users submit request queries including service name and requirements to the service management system. The service management system consists of a query processor for processing user queries, a registration manager for service registration, and a selection engine for service selection reasoning. In order to enhance the degree of user satisfaction, our reasoning stands on basis of the degree of conformance to user requirements of service attributes in terms of functionality, performance, and specification of service attributes, instead of concept similarity as in ontology-based reasoning. For this we introduce so called a service attribute graph (SAG) which is generated by considering the inclusion relationship among instances of a service attribute from several perspectives like functionality, performance, and specification. Hence, SAG is a directed graph which shows the inclusion relationships among attribute instances. Since the degree of conformance is very close to the inclusion relationship, we can say the acceptability of services depends on the closeness of inclusion relationship among corresponding attribute instances. That is, the high closeness implies the high acceptability because the degree of closeness reflects the degree of conformance among attributes instances. The degree of closeness is proportional to the path length between two vertex in SAG. The shorter path length means more close inclusion relationship than longer path length, which implies the higher degree of conformance. In addition to acceptability, in this paper, other user preferences such as priority for attributes and mandatary options are reflected for the variety of user requirements. Furthermore, to consider various types of attribute like character, number, and boolean also helps to support the variety of user requirements. Finally, according to service value to price cloud services are rated and recommended to users. One of the significances of this paper is the first try to present a graph-based selection reasoning unlike other works, while considering various user preferences in relation with service attributes.

• Journal of Information Technology Application
• /
• v.2 no.1
• /
• pp.25-53
• /
• 2000

As Information Technology has developed, The structure of information system used in organizations is changing from centralized computing structure to distributed computing structure. The roles of information department have expanded, which is not only develope and maintain system but also provide usage-support service to end-user. If organization support end-user properly, they get many benefits. if they don't do it properly, they waste many resource. Therefore, the purpose of this study is the search for quality determinant factors and type of information that provide user effective service under web-based information system. The result of this study is as follow First, when SERVQUAL is used, the quality determinant factors of usage-support service are categorized three, which is responsibility and assurance, empathy and tangable, and reliability. When SERVPERF is used, the determinant factors consist of five, but the use of assurance as a factor is cautious. Second, reliability and tangability among determinant factors affect general service quality, and tangibility is most important factors. third, When the locations of user are distributed the degree of general service quality is not different whether formal or informal information center provide usage-support service. This study may suggest practical implication as follows; First, as user are good at to use information system the degree of importance for tangibility are decreased. when user are individualized and improve their ability to use information system, empathy will not be important factors any more, therfore it assume that reliability will be most important factors. Second, if organizations promote not only formal informaton center but also informal inforamtion center they may support end-user more effectively. However, this study has the following limitations: First, it is difficult to generalize the result of this study Second, service quality determinant factors used in this study don't explain the influence to general service quality fully. Third, this study analyze a simple relation between service quality determinant factor and general service quality. Finally, this study don't distinguish between information system service and information support service.

• The Journal of the Korea Contents Association
• /
• v.15 no.7
• /
• pp.1-11
• /
• 2015

In recent high performance computing system, GPGPU has been widely used to process general-purpose applications as well as graphics applications, since GPU can provide optimized computational resources for massive parallel processing. Unfortunately, GPGPU doesn't exploit computational resources on GPU in executing general-purpose applications fully, because the applications cannot be optimized to GPU architecture. Therefore, we provide GPU research guideline to improve the performance of computing systems using GPGPU. To accomplish this, we analyze the negative factors on GPU performance. In this paper, in order to clearly classify the cause of the negative factors on GPU performance, GPU core status are defined into 5 status: fully active status, partial active status, idle status, memory stall status and GPU core stall status. All status except fully active status cause performance degradation. We evaluate the ratio of each GPU core status depending on the characteristics of benchmarks to find specific reasons which degrade the performance of GPU. According to our simulation results, partial active status, idle status, memory stall status and GPU core stall status are induced by computational resource underutilization problem, low parallelism, high memory requests, and structural hazard, respectively.