• International Journal of Contents
• /
• v.6 no.2
• /
• pp.10-13
• /
• 2010

For applications that are grid enabled, the grid can offer a resource balancing effect by scheduling grid jobs on machines with low utilization. When jobs communicate with each other, the internet, or with storage resources, an advanced scheduler could schedule them to minimize communications traffic or minimize the distance of the communications. We propose an intelligent load distribution algorithm to minimize communications traffic and distance of the communications using genetic algorithm. The experiments show the proposed load redistribution algorithm performs efficiently in the variance of load in grid environments.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.367-369
• /
• 2004

인터넷 사용자들의 증가로 인해 신뢰성 있는 차별화된 고품질의 서비스를 제공하기 위해서는, 사용자와 서비스 제공자 간의 SLA(Service Level Agreement)를 고려한 웹 서버 클러스터의 부하 분산 기능은 필수적이다. 본 논문에서는 이질 웹 서비스 환경에서 SLA 를 만족시켜주는 동적 부하분산 기법을 연구하였으며, 시뮬레이션 결과를 통해 기존의 정적 기법 보다 웹 서버의 응답시간(Response Time)성능이 개선되는 것을 확인하였다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.185-188
• /
• 2005

This paper suggests a control method for efficient topology/parameter evolution in a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynamic systems, We adopt a hierarchical breeding control mechanism with fitness-level-dependent differences to obtain better balancing of topology/parameter search - biased toward topological changes at low fitness levels, and toward parameter changes at high fitness levels. As a testbed for this approach, an eigenvalue assignment problem, which is to find bond graph models exhibiting minimal distance errors from target sets of eigenvalues, was tested and showed improved performance for various sets of eigenvalues.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.211-213
• /
• 1993

In this paper, we proposed a design method of self-learning fuzzy logic controller using fuzzy neural network. The parameters of membership function in premise are modified by descent method and also consequent parameters by learning mechanism of animal conditioning theory. The proposed method is applied to pole balancing system in order to confirm the feasibility.

• Journal of the Korean Geophysical Society
• /
• v.9 no.3
• /
• pp.249-262
• /
• 2006

The 29 May 2004 offshore Uljin, Korea earthquake was predominantly thrust-faulting at a depth of approximately 12 (±2) km. The mainshock attained the seismic moment of M0 =5.41 (±1.87)  1016 N m (Mw = 5.1). The focal mechanism indicates a subhorizontal P-axis trending 264° and plunging 2°. The orientation of P- and T-axis is consistent with the direction of absolute plate motion generally observed within the plates, hence the cause of the May 29 shock is the broad-scale stress pattern from the forces acting on the downgoing slab along the Japan trench and inhibiting forces balancing it. The 29 May 2004 earthquake occurred along a deep seated (~12 km), pre-existing feature that is expressed on the surface as the basement escarpment along the western and southern slopes of the Ulleung basin. The concentrated seismicity along this basement escarpment suggests that this feature may qualify as a seismic zone - the Ulleung basement escarpment seismic zone (UBESZ).

• 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.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.35 no.9
• /
• pp.875-882
• /
• 2011

In the present study, the imbalance in the axial-thrust and variation in the volumetric efficiency that occurred during the trimming of impeller diameter were investigated. The present study was focused on low-specific-speed multistage centrifugal pumps with a balancing piston as the balancing mechanism. The effects of impeller trimming on the axial-thrust balance in multistage pumps with horizontal and vertical axes were compared. The results showed that impeller trimming resulted in an additional axial-thrust acting in direction of pump inlet. The axial-thrust imbalance due to impeller trimming was more severe in the vertical-axis pumps than in the horizontal-axis pumps. The rate of increase in the diameter of the balancing piston, which was proportional to the rate of impeller trimming, was evaluated to maintain the axial-thrust balance. Furthermore, a simultaneous increase in the piston length and piston diameter was more effective for reducing the axial-thrust imbalance along with the volumetric efficiency drop.

• Journal of Internet Computing and Services
• /
• v.12 no.3
• /
• pp.37-47
• /
• 2011

Current researches in the Cloud focus on the appropriate interactions of cloud components in a large-scale system implementation. However, the current designs do not include intelligent methods like grouping the similar service providers based on their properties and integrating adaptive schemes for load distribution which can promote effective sharing of resource. This paper proposes an efficient virtualization of services by grouping the cloud providers to improve the service provisioning. The grouping of cloud service providers based on a cluster analysis collects the similar and related services in one group. The adaptive load balancing supports the service provisioning of the cloud system where it manages the load distribution within the group using an adaptive scheme. The proposed virtualization mechanism (GRALB) showed good results in minimizing message overhead and throughput performance compared to other methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4103-4121
• /
• 2018

Quality of Service (QoS) awareness is recognized as a key point for the success of Internet of Things (IOT).Realizing the full potential of the Internet of Things requires, a real-time task scheduling algorithm must be designed to meet the QoS need. In order to schedule tasks with diverse QoS requirements in cloud environment efficiently, we propose a task scheduling strategy based on dynamic priority and load balancing (DPLB) in this paper. The dynamic priority consisted of task value density and the urgency of the task execution, the priority is increased over time to insure that each task can be implemented in time. The scheduling decision variable is composed of time attractiveness considered earliest completion time (ECT) and load brightness considered load status information which by obtain from each virtual machine by topic-based publish/subscribe mechanism. Then sorting tasks by priority and first schedule the task with highest priority to the virtual machine in feasible VMs group which satisfy the QoS requirements of task with maximal. Finally, after this patch tasks are scheduled over, the task migration manager will start work to reduce the load balancing degree.The experimental results show that, compared with the Min-Min, Max-Min, WRR, GAs, and HBB-LB algorithm, the DPLB is more effective, it reduces the Makespan, balances the load of VMs, augments the success completed ratio of tasks before deadline and raises the profit of cloud service per second.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1147-1158
• /
• 2006

Clustering algorithm is an essential element to implement a hierarchical routing protocol, especially for a large-scale wireless sensor network. In this paper, we propose a new type of energy-efficient clustering algorithm, which maximizes the physical distance between cluster head and gateway by a neighbor node discovery mechanism. Furthermore, a slave/master patching scheme is introduced as a useful means of further improving the energy-efficiency. It has been shown that the number of cluster heads can be reduced by as many as 21% as compared with the existing clustering algorithms.