Efficient trigger-broadcasting in heterogeneous clusters

Journal of Parallel and Distributed Computing

Volumn 65, Issue 5, 2005, Pages 628-642

  Fraigniaud, Pierre ^a   Mans, Bernard ^b   Rosenberg, Arnold L ^c  

^a CNRS   (France)

^b MACQUARIE UNIVERSITY   (Australia)

^c University of Massachusetts Amherst   (United States)

Author keywords

Broadcasting; Cluster computing; Collective communication; Heterogeneous clusters; NOWs

Indexed keywords

ALGORITHMS; BROADCASTING; COMPUTATION THEORY; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS; PERSONAL COMPUTERS;

CLUSTER COMPUTING; COLLECTIVE COMMUNICATION; HETEROGENEOUS CLUSTERS; NOWS;

PARALLEL PROCESSING SYSTEMS;

EID: 15844412291     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2004.12.003     Document Type: Article

References (38)

1. M. Adler, Y. Gong, A.L. Rosenberg, Optimal sharing of bags of tasks in heterogeneous clusters, 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'03), 2003, pp. 1-10.
2. A. Alexandrov, M.I. Ionescu, K.E. Schauser, and C. Scheiman LogGP incorporating long messages into the LogP model for parallel computation J. Parallel Distrib. Comput. 44 1997 71 79
3. T.E. Anderson, D.E. Culler, and D.A. Patterson The Cluster Team, A case for NOW (networks of workstations) IEEE Micro 15 1995 54 64
4. G. Ausiello, P. Crecensi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi Complexity and Approximation 1999 Springer Berlin
5. M. Banikazemi, V. Moorthy, D.K. Panda, Efficient collective communication on heterogeneous networks of workstations, International Conference on Parallel Processing, 1998, pp. 460-467.
6. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber Message multicasting in heterogeneous networks SIAM J. Comput. 30 2000 347 358
7. A. Bar-Noy, and S. Kipnis Designing broadcasting algorithms in the postal model for message-passing systems Math. Systems Theory 27 1994 431 452
8. D. Barth, P. Fraigniaud, Approximation algorithms for structured communication problems, Ninth ACM Symposium on Parallel Algorithms and Architectures, 1997, pp. 180-188. (See also: Tech. Rpt. 1239, LRI, Univ. Paris-Sud. (http://www.lri.fr/~pierre)).
9. D. Barth, P. Fraigniaud, Approximation algorithms for structured communication problems, Ninth ACM Symposium on Parallel Algorithms and Architectures, 1997, pp. 180-188. (See also: Tech. Rpt. 1239, LRI, Univ. Paris-Sud. (http://www.lri.fr/~pierre)).
10. P.B. Bhat, V.K. Prasanna, and C.S. Raghavendra Adaptive communication algorithms for distributed heterogeneous systems J. Parallel Distrib. Comput. 59 1999 252 279
11. P.B. Bhat, V.K. Prasanna, C.S. Raghavendra, Efficient collective communication in distributed heterogeneous systems, 19th IEEE International Conference on Distributed Computing and Systems, 1999, pp. 15-24.
12. F. Cappello, P. Fraigniaud, B. Mans, A.L. Rosenberg, An algorithmic model for heterogeneous clusters: rationale and experience. Intl. J. Foundations of Computer Science, to appear. see also: HiHCoHP - toward a realistic communication model for hierarchical hyperclusters of heterogeneous processors, International Parallel and Distributed Proceedings Symposium (IPDPS'01), 2001.
13. F. Cappello, P. Fraigniaud, B. Mans, A.L. Rosenberg, An algorithmic model for heterogeneous clusters: rationale and experience. Intl. J. Foundations of Computer Science, to appear. see also: HiHCoHP - toward a realistic communication model for hierarchical hyperclusters of heterogeneous processors, International Parallel and Distributed Proceedings Symposium (IPDPS'01), 2001.
14. J. Cohen, P. Fraigniaud, J.-C. Konig, A. Raspaud, Broadcasting and multicasting in cut-through routed networks, 11th IEEE International Parallel Processing Symposium, 1997, pp. 734-738.
15. D. Culler, R.M. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken LogP towards a realistic model of parallel computation Comm. ACM 39 1996 78 85
16. X. Du, and X. Zhang Coordinating parallel processes on networks of workstations J. Parallel Distrib. Comput. 46 1997 125 135
17. M. Elkin, G. Kortsarz, Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem, 34th ACM Symposium on Theory of Computing, 2002.
18. M. Elkin, G. Kortsarz, Sublogarithmic approximation for telephone multicast: path out of jungle, 14th ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 76-85.
19. M. Elkin, G. Kortsarz, Approximation algorithm for directed telephone multicast problem, 30th International Colloquium on Automata, Languages and Programming, 2003, pp. 212-223.
20. P. Fraigniaud, Approximation algorithms for minimum-time broadcast under the vertex-disjoint paths mode, in: 19th European Symposium on Algorithms (ESA '01), Lecture Notes in Computer Science, vol. 2161, Springer, Berlin, 2001, pp. 440-451.
21. P. Fraigniaud, and E. Lazard Methods and problems of communication in usual networks Discrete Appl. Math. 53 1994 79 133
22. P. Fraigniaud, and S. Vial Approximation algorithms for broadcasting and gossiping J. Parallel Distrib. Comput. 43 1997 47 55
23. M.R. Garey, and D.S. Johnson Computers and Intractability 1979 W.H. Freeman San Francisco
24. N.G. Hall, W.-P. Liu, and J.B. Sidney Scheduling in broadcast networks Networks 32 1998 233 253
25. S.M. Hedetniemi, S.T. Hedetniemi, and A. Liestman A survey of gossiping and broadcasting in communication networks Networks 18 1986 319 349
26. J. Hromkovič, R. Klasing, B. Monien, and R. Peine Dissemination of information in interconnection networks (broadcasting and gossiping) F. Hsu D.-Z. Du Combinatorial Network Theory 1997 Science Press, American Mathematical Society Providence, RI 125 212
27. S.L. Johnsson, and C.-T. Ho Optimum broadcasting and personalized communication in hypercubes IEEE Trans. Comput. 38 1989 1249 1268
28. R.M. Karp, A. Sahay, E. Santos, K.E. Schauser, Optimal broadcast and summation in the LogP model, Fifth ACM Symposium on Parallel Algorithms and Architectures, 1993, pp. 142-153.
29. R. Kesavan, K. Bondalapati, D.K. Panda, Multicast on irregular switch-based networks with wormhole routing, Third International Symposium on High-Performance Computer Architecture, 1997, pp. 48-57.
30. J.-S. Kim, S. Ha, C.S. Jhon, Efficient barrier synchronization mechanism for the BSP model on message-passing architectures, 12th IEEE International Parallel Processing Symposium, 1998, pp. 255-259.
31. G. Kortsarz, and D. Peleg Approximation algorithms for minimum time broadcast SIAM J. Discrete Math. 8 1995 401 427
32. R. Libeskind-Hadas, J. Hartline, Efficient multicast in heterogeneous networks of workstations, International Conference on Parallel Proceedings, 2000, pp. 403-410.
33. R. Libeskind-Hadas, J. Hartline, P. Boothe, G. Rae, and J. Swisher On multicast algorithms for heterogeneous networks of workstations J. Parallel Distrib. Comput. 61 2001 1665 1679
34. R. Libeskind-Hadas, D. Mazzoni, R. Rajagopalan, Optimal contention-free unicast-based multicasting in switch-based networks of workstations, 12th IEEE International Parallel Processing Symposium, 1998, pp. 358-364.
35. P. Liu, T.-H. Sheng, Broadcast scheduling optimization for heterogeneous clusters systems, 12th ACM Symposium on Parallel Algorithms and Architectures, 2000, pp. 129-136.
36. G.F. Pfister In Search of Clusters 1995 Prentice-Hall Englewood Cliffs, NJ
37. A.L. Rosenberg, On sharing bags of tasks in heterogeneous networks of workstations: greedier is not better, Third IEEE International Conference on Cluster Computing (Cluster'01), Newport Beach, CA, 2001, pp. 124-131.
38. A.S. Tosun, A. Agarwal, Efficient broadcast algorithms for heterogeneous networks of workstations, 13th International Conference on Parallel and Distributed Computing Systems, 2000.