• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.12
• /
• pp.568-575
• /
• 2008

Server consolidation by sever virtualization can make one physical machine(PM) to run several virtual machines simultaneously. Although It is attractive in cost, it has complex workload behaviors. For that reason, efficient resource management method is required. Dynamic relocation of virtual machine(VM)[3,4] by live migration[1,2] is one of resource management methods. We proposed SCOA(Server Consolidation Optimizing Algorithm) : a fine-grained load balancing mechanism worked on this dynamic relocation mechanism. We could obtain accurate resource distribution information through pointed physical machines on multi dimensional resource usage coordination, so we could maintain more balanced resource state. In this paper, we show the effectiveness of our algorithm by comparison of experimental results between SCOA and sandpiper[3] by software simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1210-1220
• /
• 2016

As modern warfare has changed into network centered, the ability to share situational awareness among allies become a core competency for performing operational missions. In an airborne environment, it uses a tactical data link such as Link-16 for shared situational awareness. There exist problems when it shares situational awareness over the existing data link that can not allocate slots dynamically or that can not change the number of a slot to be allocated. In addition, there was a problem that can not share this failure so that failed to improves situation awareness because of finite time slot resources. In this paper, we accommodate dynamic slot allocation and changes of slot allocation with mixed structure of TDMA (time division multiple access) and random access. We propose a technique that can be used when available slots are exhausted, and a load balancing method to prevent slot allocation delay when slot requesting or message sending is concentrated on a single subframe.

• The KIPS Transactions:PartA
• /
• v.11A no.4
• /
• pp.257-266
• /
• 2004

Mobile agents are defined as processes which can be autonomously delegated or transferred among the hosts in a network in order to perform some computations on behalf of the user and co-operate with other agents. Currently, mobile agents are used in various fields, such as electronic commerce, mobile communication, parallel processing, search of information, recovery, and so on. In pure P2P network environment, if mobile agents that require computing resources rashly migrate to another peers without consideration on the peer's capacity of resources, the peer may have a problem that the performance of the peer is degraded due to lack of resources. To solve this problem, we propose resource reservation based load balancing scheme of using RMA(Resource Management Agent) that monitors workload information of the peers and that decides migrating agents and destination peers. In mobile agent migrating procedure, if the resource of specific peer is already reserved, our resource reservation scheme prevents other mobile agents from allocating the resource.

• The KIPS Transactions:PartA
• /
• v.14A no.7
• /
• pp.443-450
• /
• 2007

Performance scalability and storage scalability become important in a large scale cluster of wireless internet proxy cache servers. Performance scalability means that the whole performance of the cluster increases linearly according as servers are added. Storage scalability means that the total size of cache storage in the cluster is constant, regardless of the number of cache servers used, if the whole cache data are partitioned and each partition is stored in each server, respectively. The Round-Robin based load balancing method generally used in a large scale server cluster shows the performance scalability but no storage scalability because all the requested URL data need to be stored in each server. The hashing based load balancing method shows storage scalability because all the requested URL data are partitioned and each partition is stored in each server, respectively. but, it shows no performance scalability in case of uneven pattern of client requests or Hot-Spot. In this paper, we propose a novel dynamic hashing method with performance and storage scalability. In a time interval, the proposed scheme keeps to find some of requested URLs allocated to overloaded servers and dynamically reallocate them to other less-loaded servers. We performed experiments using 16 PCs and experimental results show that the proposed method has the performance and storage scalability as different from the existing hashing method.

• ETRI Journal
• /
• v.32 no.2
• /
• pp.292-301
• /
• 2010

Increasing convergence among heterogeneous radio networks is expected to be a key feature of future ubiquitous services. The convergence of radio networks in combination with dynamic spectrum allocation (DSA) could be a beneficial means to solve the growing demand for radio spectrum. DSA might enhance the spectrum utilization of involved radio networks to comply with user requirements for high-quality multimedia services. This paper proposes a simple spectrum allocation algorithm and presents an analytical model of dynamic spectrum resource allocation between two networks using a 4-D Markov chain. We argue that there may exist a break-even point for choosing whether or not to adopt DSA in a system. We point out certain circumstances where DSA is not a viable alternative. We also discuss the performance of DSA against the degree of resource sharing using the proposed analytical model and simulations. The presented analytical model is not restricted to DSA, and can be applied to a general resource sharing study.

• Proceedings of the KIPE Conference
• /
• 2018.07a
• /
• pp.45-47
• /
• 2018

This paper describes the 40kV solid state pulsed power supply for environmental applications. The output specifications of the pulsed power supply are 40kV, 300A, 3kHz, and average output power of 13kW. In order to generate a high voltage, a series stacking cell structure is used which is charged in parallel and discharged in series. Due to this structure, there is no dynamic voltage balancing problem as well as static voltage balancing problem for switches used in high voltage pulse power supplies. To verify this pulse power supply design, PSpice modeling was performed. Finally, experimental results with non-inductive resistive load and gas treatment reactor proved the reliability of the solid state pulsed power supply.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.121-124
• /
• 2000

Goal of this Paper is to design and develop core kernel components f3r single processor real-time system, which include real-time schedulers, synchronization mechanism, IPC, message passing, and clock & timer. The goal also contains the basic researches on dynamic load balancing and scheduling which provide mechanism for the distributed information processing and efficient resource sharing among various information appliances based on network.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.853-855
• /
• 2001

네트워크 기술의 발전으로 저비용으로 고성능을 얻고자 하는 클러스터 시스템에 대한 연구가 많아지고 있다. SPMD(Single Program Multiple Data) 형태의 병렬 프로그램을 사용한 클러스터 시스템의 주된 성능 장애는 부하 불균등 현상이다 본 논문에서는 이러한 문제를 해결하기 위해 마스터 노드가 정보를 모으는 횟수와 주기를 시뮬레이션을 통해 최적의 값으로 결정하고 그 주기 동안에 각 노드의 태스크 당 평균 수행시간을 계산한다. 통신비용의 오버헤드를 고려한 시스템의 실행시간을 평균 수행시간으로 예측하여 각 노드가 이동할 태스크의 수를 결정하는 동적 부하 균등 알고리즘을 제안한다 제안한 알고리즘의 클러스터 시스템을 모델링하고 성능 분석을 위한 시뮬레이션을 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.75-78
• /
• 2002

데이타베이스 공유 시스템(Database Sharing System: DSS)은 고성능의 온라인 트랜잭션 처리를 위해 다수 개의 컴퓨터를 연동하는 방식으로 각 노드들은 디스크 계층에서 데이타베이스를 공유한다. DSS를 구성하는 각 노드에 트랜잭션을 할당하는 정책이 잘못될 경우 특정 트랜잭션의 폭주로 노드에 과부하가 발생할 수 있으므로. 각 노드의 성능을 최적화하기 위한 부하 분산이 필요하다. 본 논문에서는 트랜잭션 클래스에서 참조하는 데이터베이스의 핫 셋 크기, 각 노드의 메모리 크기와 CPU 성능, 동시에 실행되는 트랜잭션 수의 변화에 따른 처리량 등을 고려한 동적 부하 분산 기법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.249-251
• /
• 1999

해싱 함수를 이용하여 작업을 여러 노드에 분할해서 실행하는 해쉬 기반 병렬 조인 기법에서 Data Skew는 특정 노드에 부하를 집중시키므로 시스템의 성능을 떨어뜨린다. 본 논문에서는 기본적인 해쉬 기반 조인 기법을 데이터 공유시스템에 적용하고, Data Skew를 해결하기 위하여 동적 작업 할당과 부하가 집중된 노드의 작업을 다른 노드로 재할당하는 작업 재배치 방법을 제안한다. 제안된 기법들의 성능을 분석하기 위하여 모의 실험을 수행하였으며, 모든 노드에서 데이터베이스가 저장된 디스크를 공유하는 데이터 공유 시스템의 겨우 동적 작업 할당과 작업 재배치 방법이 효과적임을 알 수 있었다.