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. 1.
Citations
|
7703
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
554
|
A high-performance, portable implementation of the MPI message passing interface standard
– Gropp, Lusk, et al.
- 1996
|
|
250
|
A Survey of Gossiping and Broadcasting in Communication Networks
– Hedetniemi, Hedetniemi, et al.
- 1988
|
|
117
|
Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems
– Bar-Noy, Kipnis
- 1992
|
|
76
|
A Case for Networks of Workstations: NOW
– Anderson, Culler, et al.
- 1995
|
|
60
|
Optimal broadcast and summation in the LogP model
– Karp, Sahay, et al.
- 1993
|
|
46
|
Multicasting in heterogeneous networks
– Bar-Noy, Guha, et al.
- 1998
|
|
45
|
Efficient collective communication on heterogeneous networks of workstations
– Banikazemi, Moorthy, et al.
- 1998
|
|
41
|
Efficient Collective Communication in Distributed Heterogeneous Systems
– Bhat, Raghavendra, et al.
- 1999
|
|
33
|
Multicast on Irregular Switch-Based Networks with Wormhole Routing
– Kesavan, Bondalapati, et al.
- 1997
|
|
21
|
Broadcast networks of bounded degree
– Liestman, Peters
- 1988
|
|
18
|
Tight bounds on minimum broadcast networks
– Grigni, Peleg
- 1991
|
|
11
|
Reduction optimization in heterogeneous cluster environments
– Liu, Wang
- 2000
|
|
11
|
Generalizations of Broadcasting and Gossiping
– Richards, Liestman
- 1988
|
|
9
|
On the construction of minimal broadcast networks, Networks 19
– Gargano, Vaccaro
- 1989
|
|
9
|
A new method for constructing minimal broadcast networks, Networks 23
– Ventura, Weng
- 1993
|
|
8
|
A Class of Solutions to the Gossip Problem
– West
- 1982
|
|
2
|
Algebraic construction of efficient networks. Applied Algebra, Algebraic Algorithms, and Error Correcting codes
– Dinneen, Fellows, et al.
- 1991
|
|
2
|
et al. Efficient message passing interface(mpi) for parallel computing on clusters of workstations
– Bruck
- 1997
|
