A distributed load-balancing policy for a multicomputer
Software—Practice & Experience
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Mapping pyramid algorithms into hypercubes
Journal of Parallel and Distributed Computing
Embedding Rectangular Grids into Square Grids with Dilation Two
IEEE Transactions on Computers
Static Rate-Optimal Scheduling of Iterative Data-Flow Programs Via Optimum Unfolding
IEEE Transactions on Computers
Grain Size Determination for Parallel Processing
IEEE Software
Load balancing in homogeneous broadcast distributed systems
Proceedings of the Computer Network Performance Symposium
Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems
IEEE Transactions on Software Engineering
Allocating Task Interaction Graphs to Processors in Heterogeneous Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Processor Assignment and Execution Sequence for Multiversion Software
IEEE Transactions on Computers
Safety and Reliability Driven Task Allocation in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Optimal placement of distributed interrelated data components using genetic algorithms
ACM-SE 37 Proceedings of the 37th annual Southeast regional conference (CD-ROM)
Intensive Data Management in Parallel Systems: A Survey
Distributed and Parallel Databases
Optimal task assignment in heterogeneous computing systems
HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
Branch-and-bound task allocation with task clustering-based pruning
Journal of Parallel and Distributed Computing
Task assignment in heterogeneous computing systems
Journal of Parallel and Distributed Computing
Optimal partitioning of nodes to space-sharing parallel tasks
Parallel Computing
| Hi-index | 14.99 |
The authors propose and evaluate an efficient hierarchical clustering and allocation algorithm that drastically reduces the interprocess communications cost while observing lower and upper bounds of utilization for the individual processors. They compare the algorithm with branch-and-bound-type algorithms that can produce allocations with minimal communication cost, and show a very encouraging time complexity/suboptimality tradeoff in favor of the algorithm, at least for a class of process clusters and their random combinations which it is believed occur naturally in distributed applications. The heuristic allocation is well suited for a changing environment, where processors may fail or be added to the system and where the workload patterns may change unpredictably and/or periodically.