Broadcast scheduling optimization for heterogeneous cluster systems
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Broadcast scheduling optimization for heterogeneous cluster systems
Journal of Algorithms
Optimal sharing of bags of tasks in heterogeneous clusters
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
On broadcasting in heterogenous networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Pipelining Broadcasts on Heterogeneous Platforms
IEEE Transactions on Parallel and Distributed Systems
Optimizing the steady-state throughput of scatter and reduce operations on heterogeneous platforms
Journal of Parallel and Distributed Computing
A framework for adaptive collective communications for heterogeneous hierarchical computing systems
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers, as commercially available off-the-shelf processors become cheaper and faster, it is now possible to build a cluster that provides high computing power within a limited budget. However, a cluster may consist of different types of processors and this heterogeneity complicates the design of efficient collective communication protocols. For example, it is a very hard combinatorial problem to find an optimal reduction schedule for such heterogeneous clusters. Nevertheless, we show that a simple technique called slowest-node-first (SNF) is very effective in designing efficient reduction protocols for heterogeneous clusters. First, we show that SNF is actually an approximation algorithm with competitive ratio two. In addition, we show that SNF does give the optimal reduction time when the cluster consists of two types of processors, and the ratio of communication speed between them is at least two.