• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.397-400
• /
• 2005

SM 프로젝트는 SI 프로젝트와 달리 고객의 요청 사항(CSR)이 있을 때 마다 개발 계획을 세우고 관리를 하여야 하며 동시에 고객의 개발 요청 내용 외에도 운영업무에 대한 계획도 같이 세워 져야 한다. 하지만 대부분의 SM 프로젝트에서는 한 두 사람의 경험이나 판단으로 계획이 작성, 할당되며 운영업무에 대한 계획의 정확도도 떨어져 업무 load balancing 이 잘 되지 않는다. 본 논문에서는 이러한 문제 해결을 위해 효과적인 SM 프로젝트에서의 EFFROT ESTIMATION 프로세스를 제안하여 업무 load balancing 을 이루는 방안을 제시하고자 한다.

• Korean Journal of Cognitive Science
• /
• v.23 no.2
• /
• pp.165-184
• /
• 2012

To investigate how the valence of unattended background picture modulates perceptual processing of a target letter, participants were required to detect a target letter among six letters superimposed on an IAPS picture. Perceptual load was manipulated by varying the difficulty of letter detection, and behavioral results showed more accurate and faster detection responses at the low-load condition than at the high-load condition. The analysis of ERP data of control condition at which six letters were presented without an IAPS picture showed perceptual load effects on mean amplitude of N1 and P1 ERP components. At experimental condition including an IAPS picture, interaction between valence and perceptual load was observed on mean amplitude of N1 at posterior visual processing area, and the amplitude difference between low-load condition and high-load condition was larger on a negative background picture than on a neutral background picture. The results suggest that more attentional capacity might be consumed by a negative picture than by a neutral picture, and suggest that unattended affective picture is processed automatically and influence the early perceptual processing of target stimulus.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.5
• /
• pp.1362-1372
• /
• 1999

Ray-tracing algorithm can synthesize photo-realistic image, but its computational cost is high. Fast image synthesis based on ray-tracing is one of the most important topics in computer graphics. There are two methods for high speed ray-tracing. First this paper discusses various load distribution and scheduling of multiprocessor for high sped ray-tracing. Then this paper proposes load distribution strategies based on them, implements and evaluates it on multiprocessor. The experiment results show that the proposed method can solve the unbalanced load problem of dynamic load distribution, and scan line method and dot method among a kind of static load distribution strategies disperse the load efficiently.

• Journal of Information Processing Systems
• /
• v.19 no.5
• /
• pp.702-712
• /
• 2023

Load balancing plays a crucial role in ensuring the stable operation of information management systems during periods of high user access requests; therefore, load balancing approaches should be reasonably selected. Moreover, appropriate load balancing techniques could also result in an appropriate allocation of system resources, improved system service, and economic benefits. Nginx is one of the most widely used loadbalancing software packages, and its deployment is representative of load-balancing application research. This study introduces Nginx into an educational administration system, builds a server cluster, and compares and sets the optimal cluster working strategy based on the characteristics of the system, Furthermore, it increases the stability of the system when user access is highly concurrent and uses the Nginx reverse proxy service function to improve the cluster's ability to resist illegal attacks. Finally, through concurrent access verification, the system cluster construction becomes stable and reliable, which significantly improves the performance of the information system service. This research could inform the selection and application of load-balancing software in information system services.

• Journal of Aerospace System Engineering
• /
• v.13 no.5
• /
• pp.57-64
• /
• 2019

Recently, avionics systems are being developed as integrated modular architecture applying the modular integration design of the functional unit to reduce maintenance costs and increase operating performance. Additionally, a partitioning operating system based on virtualization technology was used to process various mission control functions. In virtualization technology, the CPU processing load distribution is a key consideration. Especially, the uncertainty of the I/O processing time is a risk factor in the design of reliable avionics systems. In this paper, we examine the influence of the I/O processing method by comparing and analyzing the CPU processing load by the I/O processing method through use of case analysis and applying it to the example of spatial-temporal partitioning.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.776-787
• /
• 2000

Write requests which stored in disk cache of the RAID5 controller should be destaged to disk arrays according to the destage algorithm. As the response performance of the parallel IO request is being hit by the effect of the destage, several destage algorithms have been studied to enhance the performance of he RAID5 controller. Among the destage algorithms, the load balancing destage algorithm has better performance than other destage algorithms when system load is highly increased. But the load balancing destage algorithm gives priority to load balance among the disks in disk arrays, therefore, when some disks are affected by the very heavy system load caused by small data requests, the load balancing destage algorithm cannot enhance the performance of parallel IO requests effectively since it makes effort to maintain the load balance without the benefit of the locality of the write requests. This paper proposes a new RAID5 controller that applied reference-load balancing destage algorithm which decides the destage priority based on the reference history and load distribution of the disks. The simulation results show that RAID5 controller with the reference-load balancing destage algorithm has better performance than previous load balancing destage algorithm.

• Journal of KIISE
• /
• v.44 no.11
• /
• pp.1209-1218
• /
• 2017

A variety of sensors is widely used these days, and it has become much easier to acquire spatial big data streams from various sources. Since spatial data streams have inherently skewed and dynamically changing distributions, the system must effectively distribute the load among workers. Previous studies to solve this load imbalance problem are not directly applicable to processing spatial data. In this research, we propose Adaptive Spatial Key Grouping (ASKG). The main idea of ASKG is, by utilizing the previous distribution of the data streams, to adaptively suggest a new grouping scheme that evenly distributes the future load among workers. We evaluate the validity of the proposed algorithm in various environments, by conducting an experiment with real datasets while varying the number of workers, input rate, and processing overhead. Compared to two other alternative algorithms, ASKG improves the system performance in terms of load imbalance, throughput, and latency.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.3
• /
• pp.363-370
• /
• 2010

Load forecasting has always been essential to the operation and planning of power systems in deregulated electricity markets. Various methods have been proposed for load forecasting, and the neural network is one of the most widely accepted and used techniques. However, to obtain more accurate results, more information is needed as input variables, resulting in huge computational costs in the learning process. In this paper, to reduce training time in multi-layer perceptron-based short-term load forecasting, a graphics processing unit (GPU)-based computing method is introduced. The proposed approach is tested using the Korea electricity market historical demand data set. Results show that GPU-based computing greatly reduces computational costs.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.1
• /
• pp.53-59
• /
• 2004

In case of load forcasting the most important problem is to deal with the load of special days. According this paper presents forecasting method for speaial days peak load by neural networks model. by means of neural networks mothod using the historical past special- days load data, special-days load was directly forecasted, and forecasting % error showed good result as 1∼2% except vacation season in summer Consequently, it is capable of directly special days load, With the models, precision of forecasting was brought satisfactory result. When neural networks was compared with the orthogonal polynomials models at a view of the results of special-days load forecasting, neural networks model which used pattern conversion ratio was more effective on forecasting for special-days load. On the other hand, in case of short special-days load forecasting, both were valid.

• Journal of Information Processing Systems
• /
• v.10 no.4
• /
• pp.628-645
• /
• 2014

In past few years, distributed hash table (DHT)-based P2P systems have been proven to be a promising way to manage decentralized index information and provide efficient lookup services. However, the skewness of users' preferences regarding keywords contained in a multi-keyword query causes a query load imbalance that combines both routing and response load. This imbalance means long file retrieval latency that negatively influences the overall system performance. Although index replication has a great potential for alleviating this problem, existing schemes did not explicitly address it or incurred high cost. To overcome this issue, we propose, in this paper, an integrated solution that consists of three replication schemes to alleviate query load imbalance while minimizing the cost. The first scheme is an active index replication that is used in order to decrease routing load in the system and to distribute response load of an index among peers that store replicas of the index. The second scheme is a proactive pointer replication that places location information of each index to a predetermined number of peers for reducing maintenance cost between the index and its replicas. The third scheme is a passive index replication that guarantees the maximum query load of peers. The result of simulations indicates that the proposed schemes can help alleviate the query load imbalance of peers. Moreover, it was found by comparison that our schemes are more cost-effective on placing replicas than PCache and EAD.