An Efficient Load Balancing Algorithm for Cluster System

Youn, Chunkyun; Chung, IlYoung

doi:10.1007/11577188_23

Cited by 3 publications

(2 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is importance of multicast communication in distributed and parallel systems. Recently, the technique has been employed in many fields [2][3][4][5]:…”

Section: Previous Schemes and Applicationsmentioning

confidence: 99%

A Service Replic Distribution Scheme Based on Group Structure

Wangli¹,

Wang²

2008

Proceedings of the 11th Joint Conference on Information Sciences (JCIS)

View full text Add to dashboard Cite

How to effectively distribute service replicas to its n nodes is of much importance in distributed and parallel systems. In many cases, the service replicas are randomly placed, and some service replicas have no relation to any nodes in which they are. So these service replicas are very difficultly accessed, and the flexibility of the system is poor. This paper presents such a novel service replicas distribution scheme. Instead of traditional method, this scheme is mainly based on the group structure that makes every node relate to the characteristics of the service replicas. The proposed scheme is very flexible to change the structures of the service applications. So the scheme can be employed to many scenarios where service replicas are needed.

show abstract

“…It is importance of multicast communication in distributed and parallel systems. Recently, the technique has been employed in many fields [2][3][4][5]:…”

Section: Previous Schemes and Applicationsmentioning

confidence: 99%

A Service Replic Distribution Scheme Based on Group Structure

Wangli¹,

Wang²

2008

Proceedings of the 11th Joint Conference on Information Sciences (JCIS)

View full text Add to dashboard Cite

show abstract

“…the time when a task arrives for processing. CPU load balancing [9] and [10] can be implemented as static scheme [2] or dynamic M. Murugananth is with the Department of Research and Development/Scientific Services, Tata Steel limited, Jamshedpur, India. Phone: +919934302578 balancing system [2].…”

Section: Introductionmentioning

confidence: 99%

Deploying CPU Load Balancing in the Linux Cluster Using Non-Repetitive CPU Selection

Jameel¹,

Murugananth²,

Chingtham³

2009

IJCEE

View full text Add to dashboard Cite

Abstract-Maintaining load balancing in a computing cluster is an evident problem in distributed systems and research in this field is not new. The challenges in designing the load balancing algorithms are immense. This paper lists some of those challenges in the design of CPU load balancing algorithm and provides solutions to some of them. The algorithm considers one node in the cluster as the Master Server and another as the Load Balancer. The master server maintains the CPU and IP information of each machine. The nodes in the cluster send their CPU status and IP information to the master server after every 30 seconds. The implementation solves "readers-writers" problem exclusively using sockets. If a number of requests are sent before the next central database update, the load balancer selects other less busy nodes in the cluster. This ensures that all nodes are allocated with the new tasks coming from remote systems, thereby maintaining a load balance among the CPUs. This implementation is highly fault tolerant and reliable, guaranteeing a high probability of task completion. Results show that this scheme handles task allocation in much optimized way and with fewer overheads. The implementation can handle CPUs ranging in numbers from 1 to 255.

show abstract

Strategy optimization of resource scheduling based on cluster rendering

Zhou

Liu

2016

Cluster Comput

View full text Add to dashboard Cite

An Efficient Load Balancing Algorithm for Cluster System

Cited by 3 publications

References 1 publication

A Service Replic Distribution Scheme Based on Group Structure

A Service Replic Distribution Scheme Based on Group Structure

Deploying CPU Load Balancing in the Linux Cluster Using Non-Repetitive CPU Selection

Strategy optimization of resource scheduling based on cluster rendering

Contact Info

Product

Resources

About