• Journal of the Korea Society of Computer and Information
• /
• v.21 no.1
• /
• pp.125-129
• /
• 2016

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.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2004.11a
• /
• pp.498-502
• /
• 2004

In a link-motion mechanism, numerous links are interconnected and each link executes a constrained motion at a high speed. Due to the complicated constrained motions of the constituent links, dynamic unbalance forces and moments are generated and transmitted to the main frame. Therefore unwanted vibration is produced. This degrades productivity and precise work. Based on constrained multi-body dynamics, the kinematic analysis is carried out to enable design changes to be made. This will provide the fundamental information for significantly reducing dynamic unbalance forces and moments which are transmitted to the main frame. In this work, a link-motion punch press is selected as an example of a link-motion mechanism. To calculate the mass and inertia properties of every link comprising a link-motion punch press, 3-dimensional CAD software is utilized. The main issue in this work is to eliminate the first-order unbalance force and moment in a link-motion punch press. The mass, moment of inertia link length, location of the mass center in each link have a great impact on the degree of dynamic balancing which can be achieved maximally. Achieving good dynamic balancing in a link motion punch press is quite essential fur reliable operation at high speed.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3456-3468
• /
• 1999

Most of previous parallel join algorithms assume a database partition system(DPS), where each database partition is owned by a single processing node. While the DPS is novel in the sense that it can interconnect a large number of nodes and support a geographically distributed environment, it may suffer from poor facility for load balancing and system availability compared to the database sharing system(DSS). In this paper, we propose a dynamic load balancing strategy by exploiting the characteristics of the DSS, and then extend the conventional hash join algorithms to the DSS by using the dynamic load balancing strategy. With simulation studies under a wide variety of system configurations and database workloads, we analyze the effects of the dynamic load balancing strategy and differences in the performances of hash join algorithms in the DSS.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.314-317
• /
• 2000

Cluster system provides attractive scalability in terms of computation power and memory size. With the advances in high speed computer network technology, cluster systems are becoming increasingly competitive compared to expensive parallel machines. In parallel processing program, each task load is difficult to predict before running the program and each task is interdependent each other in many ways. Load imbalancing induces an obstacle to system performance. Most of researches in load balancing were concerned with distributed system but researches in cluster system are few. In cluster system, the dynamic load balancing algorithm which evaluates each processor's load in runtime is purpose that the load of each node are evenly distributed. But, if communication cost or node complexity becomes high, it is not effective method for all nodes to attend load balancing process. In that circumstances, it is good to reduce the number of node which attend to load balancing process. We have modeled cluster systems and proposed marginal dynamic load balancing algorithms suitable for that circumstances.

• The Journal of the Acoustical Society of Korea
• /
• v.10 no.4
• /
• pp.48-55
• /
• 1991

In this study, the unbalanced rigid rotor mounted on two pedestals is balanced u. ng the dynamic balancing procedure, and the compensating masses are estimated by the seven run method. Also, the reductions of vibration level are examined, before and after balancing procedures. In the experimental results, it is shown that the vibration amplitudes measured at the two pedestals are proportional to the unbalanced mass. The seven run method which requires measurement of vibration amplitudes only and not vibration phase angle is proved markedly useful in consideration of the dynamic balancing procedure.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1293-1296
• /
• 1997

We investigate a design methodology for master arm which is employed in remote-site control. Though counter-balancing has been employed for the purpose of lessening the actuator loads, it results in the increase of dynamic load at the task position. Therefore, there exist a trade-off between counter-balacing and dynamic performance. The concept of a composite index is introduced to simulataneously consider those two effects in the design of master arms. Several alternative designs of master arms are suggested.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.297-305
• /
• 2021

Large amount of data is being generated in gaming servers due to the increase in the number of users and the variety of game services being provided. In particular, load balancing schemes for gaming servers are crucial consideration. The existing literature proposes algorithms that distribute loads in servers by mostly concentrating on load balancing and cooperative offloading. However, many proposed schemes impose heavy restrictions and assumptions, and such a limited service classification method is not enough to satisfy the wide range of service requirements. We propose a load balancing agent that combines the dynamic allocation programming method, a type of greedy algorithm, and proximal policy optimization, a reinforcement learning. Also, we compare performances of our proposed scheme and those of a scheme from previous literature, ProGreGA, by running a simulation.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.5
• /
• pp.1986-1995
• /
• 2018

In this paper, a novel neutral-point voltage balancing scheme for NPC three-level inverters using carrier-based sinusoidal pulse width modulation (SPWM) method is developed. The new modulation approach, based on the obtained expressions of zero sequence voltage in all six sectors, can significantly suppress the low-frequency voltage oscillation in the neutral point at high modulation index and achieve a fast voltage-balancing dynamic performance. The implementation of the proposed method is very simple. Another attractive feature is that the scheme can stably control any voltage difference between the two dc-link capacitors within a certain range without using any extra hardware. Furthermore, the presented scheme is also applicable to the single-phase NPC three-level inverter. It can maintain the neutral-point voltage balance at full modulation index and improve the voltage-balancing dynamic performance of the single-phase NPC three-level inverter. The performance of the proposed strategy and its benefits over other previous techniques are verified experimentally.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.176-179
• /
• 2002

In recent years, an increasing amount of computer network research has focused on the problem of cluster system in order to achieve higher performance and lower cost. The load unbalance is the major defect that reduces performance of a cluster system that uses parallel program in a form of SPMD (Single Program Multiple Data). Also, the load unbalance is a problem of MPP (Massive Parallel Processors), and distributed system. The cluster system is a loosely-coupled distributed system, therefore, it has higher communication overhead than MPP. Dynamic load balancing can solve the load unbalance problem of cluster system and reduce its communication cost. The cluster systems considered in this paper consist of P heterogeneous nodes connected by a switch-based network. The master node can predict the average execution time of tasks for each slave node based on the information from the corresponding slave node. Then, the master node redistributes remaining tasks to each node considering the predicted execution time and the communication overhead for task migration. The proposed dynamic load balancing uses execution time prediction to optimize the task redistribution. The various performance factors such as node number, task number, and communication cost are considered to improve the performance of cluster system. From the simulation results, we verified the effectiveness of the proposed dynamic load balancing algorithm.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.12
• /
• pp.1162-1169
• /
• 2010

The dynamic balancing of a rotor system is needed to alleviate the imbalances originating from various sources encountered during blade manufacturing processes and environmental factors. This work aims at developing a comprehensive analysis system which consists of cumulative module of test D/B and selection of optimal control parameters. This system can be used for the dynamic balancing of helicopter rotors based on tracking results from the whirl tower test. For simplicity of the analysis, a linear relation is assumed between the balancing input parameters and the blade track responses leading to influence coefficients and thereby the rotor system identification is made. In addition, the balancing parameters of the individual blades are sought using the genetic algorithm and the effectiveness of the proposed method is demonstrated in comparison with the test results.