Adaptive communication algorithms for distributed heterogeneous systems

Proceedings - 7th International Symposium on High Performance Distributed Computing, HPDC 1998

Volumn 1998-July, Issue , 1998, Pages 1-12

  Bhat, P B ^a   Prasanna, V K ^a   Raghavendra, C S ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b AEROSPACE CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; HETEROGENEOUS NETWORKS; HEURISTIC ALGORITHMS; SCHEDULING;

ADAPTIVE COMMUNICATIONS; COLLECTIVE COMMUNICATIONS; COMPUTING PLATFORM; DISTRIBUTED HETEROGENEOUS SYSTEMS; FUNDAMENTAL RESEARCH; OPEN SHOP SCHEDULING PROBLEM; PERFORMANCE IMPROVEMENTS; SCHEDULING TECHNIQUES;

SCHEDULING ALGORITHMS;

EID: 34548343129     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPDC.1998.710017     Document Type: Conference Paper

References (27)

1. R. Armstrong, D. Hensgen, and T. Kidd. The relative performance of various mapping algorithms is independent of sizable variances in runtime predictions. In Proc. Heterogeneous Computing Workshop, pages 79-87, March 1998.
2. V. Bala, J. Bruck, R. Cypher, P. Elustondo, A. Ho, C.-T. Ho, S. Kipnis, andM. Snir. CCL: A portable and tunable collective communication library for scalable parallel computers. IEEE Trans. Parallel and Distributed Systems, 6(2):154-164, February 1995.
3. P. B. Bhat, V. K. Prasanna, and C. S. Raghavendra. Adaptive communication algorithms for distributed heterogeneous systems. Manuscript, Dept. of EE-Systems, University of Southern California, May 1998.
4. H. Brasel, T. Tautenhahn, and F. Werner. Constructive heuristic algorithms for the open shop problem. Computing, 51:95-110, 1993.
5. P. Brucker. Scheduling Algorithms. Springer, 1995.
6. DARPA ISO Web Page for the BADD Program. https://www.iso.darpa.mil/WD@27000.cgi?get+iso:Office+InformationSystem+WDIihomeframes.
7. T. DeWitt, T. Gross, B. Lowekamp, N. Miller, P. Steenkiste, J. Subhlok, and D. Sutherland. ReMoS: A resourcemonitoring systemfor network-aware applications. TechnicalReport CMU-CS-97-194, School of Computer Science, Carnegie Mellon University, Dec 1997.
8. S. Fitzgerald, I. Foster, C. Kesselman, G. von Laszewskiand, W. Smith, and S. Tuecke. A directory service for configuring high-performance distributed computations. In Proc. 6th IEEE Intnl. Symp. on High Performance Distributed Computing, pages 365-375, 1997.
9. I. Foster and C. Kesselman. Globus: A metacomputing infrastructure toolkit. Intl. Journal of Supercomputer Applications, 11(2):115-128, 1997.
10. GlobusWeb Page. http://www.globus.org.
11. T. Gonzalez andS. Sahni. Open shop schedulingtominimize finish time. Journal of the ACM, 23(4):665-679, Oct. 1976.
12. A. S. Grimshaw and W. A. Wulf. Legion - a view from 50, 000 feet. In Proc. Fifth IEEE Intl. Symp. on High Performance Distributed Computing, August 1996.
13. L. H. Jamieson, P. T. Mueller, and H. J. Siegel. FFT algorithms for SIMD parallel processing systems. Journal of Parallel and Distributed Computing, 3(1):48-71, March 1986.
14. J. Kim and D. J. Lilja. Exploiting multiple heterogeneous networks to reduce communication costs in parallel programs. In Proc.HeterogeneousComputingWorkshop, pages 83-95, April 1997.
15. J. Kim and D. J. Lilja. Utilizing heterogeneous networks in distributed parallel computing systems. In Proc. Sixth IEEE Intl. Symp.High PerformanceDistributed Computing, 1997.
16. H. Korab andM. D. Brown, Eds. Virtual Environments and Distributed Computing at SC '95: GII Testbed and HPC Challenge Applications on the I-WAY. ACM/IEEE Supercomputing '95, 1995.
17. E. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart andWinston, 1976.
18. LegionWeb Page. http://legion.virginia.edu.
19. Y. W. Lim, P. B. Bhat, and V. K. Prasanna. Efficient algorithms for block-cyclic redistribution of arrays. Algorithmica, to appear.
20. M. Maheswaran and H. J. Siegel. A dynamic matching and scheduling algorithm for heterogeneouscomputing systems. In Proc. Hetero geneous Computing Workshop,, pages 57-69, March 1998.
21. MSHN Web Page. http://www.cs.nps.navy.mil/mshn.
22. D. B. Shmoys, C. Stein, and J. Wein. Improved approximation algorithms for shop scheduling problems. SIAMJ. Comput., 23(3):617-632, June 1994.
23. L. Smarr and C. E. Catlett. Metacomputing. Commns. of the ACM, 35(6):45-52, June 1992.
24. M. Tan, M. D. Theys, H. J. Siegel, N. B. Beck, and M. Jurczyk. Amathematicalmodel, heuristic, and simulation study for a basic data staging problem in a heterogeneousnetworking environment. In Proc. Heterogeneous ComputingWorkshop, pages 115-129, March 1998.
25. H. Topcuoglu, S. Hariri, W. Furmanski, J. Valente, I. Ra, D. Kim, Y. Kim, X. Bing, and B. Ye. The software architecture of a virtual distributed computing environment. In Proc. Sixth IEEE Intl. Symp. on High Performance Distributed Computing, 1997.
26. VDCE Web Page. http://www.atm.syr.edu/projects/vm/index.html.
27. C.-L. Wang, P. B. Bhat, and V. K. Prasanna. Highperformance computing for vision. Proceedingsof the IEEE, 84(7):931-946, July 1996.