• Journal of the Korea Society of Computer and Information
• /
• v.26 no.4
• /
• pp.113-118
• /
• 2021

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• Journal of Intelligence and Information Systems
• /
• v.15 no.1
• /
• pp.31-50
• /
• 2009

As the collected information which is static or dynamic is infinite in ubiquitous computing environments, information overload and invasion of privacy have been pressing issues in the recommendation service. In this study, we propose a recommendation service procedure through P2P, The P2P helps customer to obtain effective and secure product information because of communication among customers who have the similar preference about the products without connection to server. To evaluate the performance of the proposed recommendation service, we utilized real transaction and product data of the Korean mobile company which service character images. We developed a prototype recommender system and demonstrated that the proposed recommendation service makes an effect on recommending product in the ubiquitous environments. We expect that the information overload and invasion of privacy will be solved by the proposed recommendation procedure in ubiquitous environment.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.408-412
• /
• 2015

In base station based networks, traffic overload at the base station is inevitable. Peer-to-peer DTN which disperses the traffic overhead to each node can relieve the traffic overload at the base station. To increase the message delivery ratio and reduce the message overhead, we present novel routing using mobility information which can be obtained from each node, unlike the existing flooding based routings. In the proposed routing scheme, the routing decision metric, which is defined based on the node mobility information, is computed by using the expected distance between each node to the destination. The message is copied to other nodes that have lower expected distance to the destination than the value for the node willing to copy the message. We conducted simulations by using both a random mobility model and a real mobility trace to compare the performance of the proposed routing scheme to the existing routing scheme that does not utilize the mobility information. The performance evaluation showed the proposed routing successfully delivers messages with 10% to 30% less copies compared to previously proposed routing schemes.

• Journal of Advanced Navigation Technology
• /
• v.21 no.6
• /
• pp.529-536
• /
• 2017

The general ground control system has control and information display functions for the operation of a single unmanned aerial vehicle. Recently, the function of the single ground control system extends to the operation of multiple UAVs. As a result, operators have been exposed to more diverse tasks and are subject to task overload due to various factors during their mission. This study proposes an adaptive ground control system that reflects the operator's condition through the task overload measurement of multiple UAV operators. For this, the ground control software is developed to control multiple UAVs at the same time, and the simulator with six degree-of-freedom aircraft dynamics is constructed for realistic human-machine-interface experiments by the operators.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.11
• /
• pp.611-621
• /
• 2002

For real-time systems, multiprocessor support is indispensable to handle the large number of requests. Existing real-time on-line scheduling algorithms such as Earliest Deadline First Algorithm (EDF) and Least Laxity Algorithm (LLA) may not be suitable for scheduling real-time tasks in multiprocessor systems. Although EDF has low context switching overhead, it suffers from "multiple processor anomalies." LLA has been shown as suboptimal, but has the potential for higher context switching overhead. Earliest Deadline Zero Laxity (EDZL) solved somewhat the problems of those algorithms, however is suboptimal for only two processors. Another algorithm EDA2 shows very good performance in overload phase, however, is not suboptimal for muitiprocessors. We propose two on-line scheduling algorithms, Earliest Deadline/Least Laxity (ED/LL) and ED2/LL. ED/LL is suboptimal for multiprocessors, and has low context switching overhead and low deadline miss rate in normal load phase. However, ED/LL is ineffective when the system is overloaded. To solve this problem, ED2/LL uses ED/LL or EDZL in normal load phase and uses EDA2 in overload phase. Experimental results show that ED2/LL achieves good performance in overload phase as wet] as in normal load phase.oad phase.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.5
• /
• pp.312-325
• /
• 2006

Integration applications, such as EAI, B2Bi, need stable massive data processing systems during overload state cause by service request congestion in a short period time. In this paper, we propose the PLC (Peak Load Control)-based Worker-Linker pattern, which can effectively and stably process massive I/O transactions in spite of overload state generated by service request congestion. This pattern uses the delay time algorithm for the PLC mechanism. In this paper, we also show the example of applying the pattern to business-business integration framework and the experimental result for proving the stability of performance. According to our experiment result, the proposed delay time algorithm can stably control the heavy overload after the saturation point and has an effect on the controlling peak load.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.10
• /
• pp.1328-1336
• /
• 2014

This paper proposes Power System Health Index(PSHI) newly. The paper describes several kind of power system health indices based on two main categories, which are adequacy and security. In adequacy, four kinds of health indices of Frequency, Voltage, Reserve(Operating Reserve Power and Frequency Regulation Reserve Power) and Overload of lines and transformers are proposed. In security, four kinds of health indices of Voltage(154kV, 345kV and 765kV), Overload of lines and transformers, Power flow constraint among areas and SPS are proposed. All indices are mapped with three domains, which are indicated as Health, Margin and Risk, defined with expert interview. While domains of health, margin and risk is defined similar with the conventional well being analysis of power system. The criterion of the domains is proposed using an interview with expert operators and practical reliability codes in Korea. The several kinds of health index functions, which are linear ratio, piecewise linear ration and reverse ratio function etc. are developed in this paper. It will be expected that the developed health indices can help operators to control power system more successfully and also prevent power system from accident as like as black out in future because operator can make a decision immediately based on more easily visual information of system conditions from too much indices acquisition of complex power system.

• The Journal of Information Systems
• /
• v.29 no.2
• /
• pp.265-286
• /
• 2020

Purpose Among various psychosocial factors, negative social comparison, attention blocking to stimuli, and cognitive interference via information overload are considered most critical in hindering the effective performance improvement of computer-based idea generation. Given that the effect of negative social comparison along with a plausible solution based on the notion of performance feedback and goal setting has been successfully addressed, this study focused on the remaining issues of "attention blocking to stimuli and cognitive interference via information overload" and attempted to find a way to alleviate the effect of such process losses on performance. Design/methodology/approach A 2 × 4 between-subjects design was used, crossing cognitive ability (high and low) and personality (extroversion and introversion). Five subjects per each treatment were randomly selected to make the sample size equal. The group simulator was used to measure individual-level performance. The dependent variables were the quantity of and quality score of ideas. The manner by which these performance measures were operationalized was consistent with prior studies. An additional analysis using the number of diverse ideas was also conducted. Findings Three arguments were made in this study: (1) high cognitive individuals would perform better than low cognitive individuals, (2) extraverted individuals would perform better than introverted individuals, and (3) cognitive ability and personality would interact such that individuals in Q1 would have the highest performance. Cognitive ability had an effect on quality not quantity. Personality had an effect on both quantity and quality. An interaction between cognitive ability and personality was not found due to small sample size despite the use of the group simulator.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.743-754
• /
• 2014

Recently, Information-Centric Networking(ICN), different from traditional IP-based networking, has been highlighted. Content-Centric Networking(CCN), proposed by Van Jacobson, is a representative scheme of the ICN architectures. It can deliver messages slightly faster than the IP-based networking by focusing on the access and delivery to the content itself. However, CCN is restricted to distribute the information without transmitting the request packet in advance because it is pull-based architecture by content requester. In addition, it has a problem that the Pending Interest Table(PIT) could be overloaded easily when DDoS attack happens. In this paper, we suggest an algorithm using a push-based scheme without request packets and overcoming PIT overload situation by Interest Group Push Table(IGPT). The proposed scheme enables to transmit a large amount of content than an existing scheme during the same amount of time in terms of timely-delivery and security.

• The Journal of Information Systems
• /
• v.14 no.3
• /
• pp.82-88
• /
• 2005

Much information has been hierarchically organized to facilitate information browsing, retrieval, and dissemination. In practice, much information may be entered at any time, but only a small subset of the information may be classified into some categories in a hierarchy. Therefore, achieving document filtering (DF) in the course of document classification (DC) is an essential basis to develop an information center, which classifies suitable documents into suitable categories, reducing information overload while facilitating information sharing. In this paper, we present a technique ICenter, which conducts DF and DC by recognizing the context of discussion (COD) of each document and category. Experiments on real-world data show that, through COD recognition, the performance of ICenter is significantly better. The results are of theoretical and practical significance. ICenter may server as an essential basis to develop an information center for a user community, which shares and organizes a hierarchy of textual information.