Broadcast scheduling optimization for heterogeneous cluster systems

Authors:
Pangfeng Liu;Tzu-Hao Sheng
Affiliations:
Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan, R.O.C.;Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan, R.O.C.
Venue:
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Year:
2000

Citing 13
Cited 6

Broadcast networks of bounded degree

SIAM Journal on Discrete Mathematics
Tight bounds on minimum broadcast networks

SIAM Journal on Discrete Mathematics
Optimal broadcast and summation in the LogP model

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Designing broadcasting algorithms in the Postal Model for message-passing systems

Proceedings of the 4th ACM symposium on Parallel algorithms and architectures
Efficient message passing interface (MPI) for parallel computing on clusters of workstations

Journal of Parallel and Distributed Computing - Special issue on workstation clusters and network-based computing
Multicasting in heterogeneous networks

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Case for NOW (Networks of Workstations)

IEEE Micro
Efficient Collective Communication on Heterogeneous Networks of Workstations

ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Algebraic Constructions of Efficient Broadcast Networks

AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Multicast on Irregular Switch-based Networks with Wormhole Routing

HPCA '97 Proceedings of the 3rd IEEE Symposium on High-Performance Computer Architecture
Reduction Optimization in Heterogeneous Cluster Environments

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Efficient Collective Communication in Distributed Heterogeneous Systems

ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems

HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
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
Efficient trigger-broadcasting in heterogeneous clusters

Journal of Parallel and Distributed Computing
Optimizing the steady-state throughput of scatter and reduce operations on heterogeneous platforms

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 PC or workstation cluster that provides high computing power within a limited budget. However, a cluster may consist of different types of processors and this heterogeneity within a cluster complicates the design of efficient collective communication protocols. This paper shows that a simple heuristic called fastest-node-first (FNF) [3] is very effective in reducing broadcast time for heterogeneous cluster systems. Despite the fact that FNF heuristic fails to give the optimal broadcast time for a general heterogeneous network of workstation, we prove that FNF always gives the optimal broadcast time in several special cases of clusters. Based on these special case results, we show that FNF is an approximation algorithm that guarantees a competitive ratio of 2. From these theoretical results we also derive techniques to speed up the branch-and-bound search for the optimal broadcast schedule in HNOW.