A Distributed Drafting Algorithm for Load Balancing
IEEE Transactions on Software Engineering
The Gradient Model Load Balancing Method
IEEE Transactions on Software Engineering - Special issue on distributed systems
Assignment problems in parallel and distributed computing
Assignment problems in parallel and distributed computing
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
Server Load Balancing with Network Support: Active Anycast
IWAN '00 Proceedings of the Second International Working Conference on Active Networks
ISHPC '02 Proceedings of the 4th International Symposium on High Performance Computing
Object Assignment Strategy for Distributed Multimedia Systems
MMM '98 Proceedings of the 1998 Conference on MultiMedia Modeling
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)
Efficient processing of client transactions in real-time
Distributed and Parallel Databases
A task remapping technique for reliable multi-core embedded systems
CODES/ISSS '10 Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Map-reduce extensions and recursive queries
Proceedings of the 14th International Conference on Extending Database Technology
Distributed gang scheduling in networks of heterogenous workstations
Computer Communications
Failure-Aware Task Scheduling of Synchronous Data Flow Graphs Under Real-Time Constraints
Journal of Signal Processing Systems
Hi-index | 0.00 |
The objective of the study was to achieve balanced load among processors, reduce the communication overhead of the load balancing algorithm, and improve resource utilization, which results in better average response time. A communication protocol and a fully distributed algorithm for dynamic load balancing through task migration in a connected N-processor network are presented. Each processor communicates its load directly with only a subset (of the size square root N) of processors, reducing communication traffic and average response time. It is proved that the given algorithm will perform task migration even if there is only one light load processor and one heavy load processor in the system. Simulation results show that the proposed scheme can save up to 60% of the protocol messages used by the broadcast algorithms and can reduce the average response time.