Simulating computer systems: techniques and tools
Simulating computer systems: techniques and tools
A Trace-Driven Simulation Study of Dynamic Load Balancing
IEEE Transactions on Software Engineering
Multicast routing in internetworks and extended LANs
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the Effects of Delays on Load Sharing
IEEE Transactions on Computers
Operating Systems Theory
Datagram routing for internet multicasting
SIGCOMM '84 Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium
Multicast Communication on Network Computers
IEEE Software
Optimal Distributed Algorithms for Sorting and Ranking
IEEE Transactions on Computers
Load balancing to adjust for proximity in some network topologies
Parallel Computing
Object mobility in large scale systems
Cluster Computing
The group approach in cooperative work and in load balancing
Progress in computer research
ECO: Efficient Collective Operations for Communication on Heterogeneous Networks
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
An Implementation of the Lifecycle Service Object Mobility on CORBA
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
A New Approach for Load Balancing Using Differential Load Measurement
ITCC '00 Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
Groups Partitioning Over CORBA for Cooperative Work
Cluster Computing
Resilient actors: a runtime partitioning model for pervasive computing services
Proceedings of the 2009 international conference on Pervasive services
A new two level hierarchy structuring for node partitioning in ad hoc networks
Proceedings of the 2010 ACM Symposium on Applied Computing
| Hi-index | 0.00 |
One of the major issues concerning the efficiency and effectiveness of dynamic load balancing algorithms is their scalability. As the size of the distributed computer system increases, the overheads of a load balancing algorithm may increase resulting in a poor scalability. In this paper, network partitioning strategies are proposed to reduce the communication overhead of load balancing algorithms in a large distributed system environment. Several host-grouping strategies are suggested to improve the performance of load balancing algorithms. This is achieved by limiting the exchange of load information messages within smaller groups of hosts while restricting the transfer of tasks to long distance remote hosts which involve high communication costs. The group memberships are changed dynamically to adapt the varying load conditions across the entire network. Effectiveness of the proposed strategies is evaluated by simulations.