An algorithmic model for heterogeneous hyper-clusters: Rationale and experience

International Journal of Foundations of Computer Science

Volumn 16, Issue 2, 2005, Pages 195-215

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

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b MACQUARIE UNIVERSITY   (Australia)

^c University of Massachusetts Amherst   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33746253855     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054105002942     Document Type: Conference Paper

References (35)

1. M. Adler, Y. Gong, A.L. Rosenberg: Sharing bags of tasks optimally in heterogeneous clusters. Submitted for publication.
2. See also, Optimal sharing of bags of tasks in heterogeneous clusters. 15th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA'03), 2003, 1-10.
3. A. Alexandrov, M.I. Ionescu, K.E. Schauser, C. Scheiman: LogGP: incorporating long messages into the LogP model for parallel computation. J. Parallel Distr. Comput. 44, 1997, 71-79.
4. T.E. Anderson, D.E. Culler, D.A.Patterson, and the NOW Team: A case for NOW (networks of processors). IEEE Micro 15, 1995, 54-64.
5. B. Awerbuch, Y. Azar, A. Fiat, F.T. Leighton: Making commitments in the face of uncertainty: how to pick a winner almost every time. 28th ACM Symp. on Theory of Computing, 1996, 519-530.
6. M. Banikazemi, V. Moorthy, D.K. Panda: Efficient collective communication on heterogeneous networks of processors. Intl. Conf. on Parallel Proc., 1998, 460-467.
7. C. Banino, O. Beaumont, L. Carter, J. Ferrante, A. Legrand, Y. Robert: Scheduling strategies for master-slave tasking on heterogeneous processor grids. IEEE Trans. Parallel and Distr. Proc. 15, 2003, 319-330.
8. A. Bar-Noy and S. Kipnis: Designing broadcasting algorithms in the postal model for message-passing systems. Math. Syst. Th. 27, 1994, 431-452.
9. O. Beaumont, A. Legrand, Y. Robert: The master-slave paradigm with heterogeneous processors. IEEE Trans. Parallel and Wistr. Systs. 14, 2003, 897-908.
10. P.B. Bhat, V.K. Prasanna, C.S. Raghavendra: Adaptive communication algorithms for distributed heterogeneous systems. J. Parallel Distr. Comput. 59, 1999, 252-279.
11. P.B. Bhat, V.K. Prasanna, C.S. Raghavendra: Efficient collective communication in distributed heterogeneous systems. 19th IEEE Intl. Conf. on Distr. Computing Systs., 1999, 15-24.
12. S.N. Bhatt, F.R.K. Chung, F.T. Leighton, and A.L. Rosenberg: On optimal strategies for cycle-stealing in networks of processors. IEEE Trans. Comp. 46, 1997, 545-557.
13. R. Blumofe and C.E. Leiserson: Space-efficient scheduling of multithreaded computations. SIAM J. Comput. 27, 1998, 202-229.
14. R. Blumofe and D.S. Park: Scheduling large-scale parallel computations on networks of processors. 3rd Intl. Symp. on High-Performance Distr. Computing, 1994, 96-105.
15. T.D. Braun, H.J. Siegel, N. Beck, L.L. Bölöni, M. Maheswaran, A. Reuther, J.P. Robertson, M.D. Theys, B. Yao, D. Hensgen, R.F. Freund (1999): A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. 8th Heterogeneous Computing Workshop, 15-29.
16. R. Buyya, D. Abramson, J. Giddy: A case for economy Grid architecture for service oriented Grid computing. 10th Heterogeneous Computing Wkshp., 2001.
17. F. Cappello, P. Fraigniaud, B. Mans, A.L. Rosenberg: HiHCoHP - Toward a realistic communication model for hierarchical hyperclusters of heterogeneous processors. Intl. Parallel and Distr. Processing Symp., 2001.
18. W. Cirne and K. Marzullo: The Computational Co-Op: gathering clusters into a metacomputer. 13th IEEE Intl. Parallel Proc. Symp., 1999, 160-166.
19. D. Culler, R.M. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken: LogP: towards a realistic model of parallel computation. C. ACM 39, 1996, 78-85.
20. S. Donaldson, J.M.D. Hill, D.B. Skillicorn: Predictable communication on unpredictable networks: implementing BSP over TCP/IP. 4th Intl. European Conf. on Parallel Processing. In Lecture Notes in Computer Science 1470, Springer-Verlag, Berlin, 1998, pp. 970-980.
21. I. Foster and C. Kesselman [eds.]: The Grid: Blueprint for a New Computing Infrastructure, Morgan-Kaufmann, San Francisco, 1999.
22. I. Foster, C. Kesselman, S. Tuecke: The anatomy of the Grid: enabling scalable virtual organizations. Intl. J. Supercomputer Applications, 2001.
23. P. Fraigniaud, B. Mans, A.L. Rosenberg: Efficient trigger broadcast in heterogeneous clusters. Submitted for publication, 2002. See also [16].
24. The Intel Philanthropic Peer-to-Peer program. 〈www.intel.com/ cure〉.
25. R. Kesavan, K. Bondalapati, D.K. Panda: Multicast on irregular switch-based networks with wormhole routing. 3rd Intl. Symp. on High-Performance Computer Architecture, 1997, 48-57.
26. J.-S. Kim, S. Ha, C.S. Jhon: Efficient barrier synchronization mechanism for the BSP model on message-passing architectures. 12th IEEE Intl. Parallel Processing Symp., 1998, 255-259.
27. E. Korpela, D. Werthimer, D. Anderson, J. Cobb, M. Lebofsky: SETI@home: massively distributed computing for SETI. In Computing in Science and Engineering (P.F. Dubois, Ed.) IEEE Computer Soc. Press, Los Alamitos, CA, 2000.
28. C.H. Papadimitriou and M. Yannakakis: Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput. 19, 1990, 322-328.
29. G.F. Pfister: In Search of Clusters. Prentice-Hall, 1995.
30. D. Reimann, V. Chaudary, I. Sethi: Modeling cone-beam tomographic reconstruction using LogSMP: an extended LogP model for clusters of SMPs. 6th Intl. Conf. on High-Performance Computing. In Lecture Notes in Computer Science 1745, Springer-Verlag, Berlin, 1999, pp. 77-83.
31. A.L. Rosenberg: Optimal schedules for cycle-stealing in a network of processors with a bag-of-tasks workload. IEEE Trans. Parallel and Distr. Systs. 13, 2002, 179-191.
32. Top 500 Supercomputer sites (2004): 〈www.top500.org/list/2004/ 06〉.
33. A.S. Tosun and A. Agarwal: Efficient broadcast algorithms for heterogeneous networks of processors. 18th Intl. Conf. on Parallel and Distr. Comput. Systs., 2000.
34. L.G. Valiant: A bridging model for parallel computation. C. ACM 33, 1990, 103-111.
35. S.W. White and D.C. Torney: Use of a processor cluster for the physical mapping of chromosomes. SIAM NEWS, March, 1993, 14-17.