Dyn-MPI: Supporting MPI on medium-scale, non-dedicated clusters

Journal of Parallel and Distributed Computing

Volumn 66, Issue 6, 2006, Pages 822-838

  Weatherly, D Brent ^a   Lowenthal, David K ^a   Nakazawa, Mario ^b   Lowenthal, Franklin ^c  

^a The University of Georgia ^*  (United States)

^b BEREA COLLEGE   (United States)

^c CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Adaptive; Load balancing; MPI; Non dedicated clusters

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SOFTWARE; DATA REDUCTION; PROBLEM SOLVING; RESOURCE ALLOCATION; STORAGE ALLOCATION (COMPUTER);

ADAPTIVE; LOAD BALANCING; MPI; NON-DEDICATED CLUSTERS;

PARALLEL PROCESSING SYSTEMS;

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

References (38)

1. A. Acharya, G. Edjlali, J. Saltz. The utility of exploiting idle workstations for parallel computation, in: Sigmetrics, May 1997, pp. 225-236.
2. S.P. Amarasinghe, J.M. Anderson, M.S. Lam, C.-W. Tseng, The SUIF compiler for scalable parallel machines, in: Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, February 1995.
3. J. Anderson, M. Lam, Global optimizations for parallelism and locality on scalable parallel machines, in: Proceedings of ACM Conference on Programming Language Design and Implementation, June 1993, pp. 112-125.
4. Arpaci-Dusseau A.C. Implicit coscheduling: coordinated scheduling with implicit information in distributed systems. ACM Trans. Comput. Systems 19 3 (2001) 283-331
5. D. Bailey, J. Barton, T. Lasinski, H. Simon, The NAS parallel benchmarks, RNR-91-002, NASA Ames Research Center, August 1991.
6. V. Balasundaram, G. Fox, K. Kennedy, U. Kremer, An static performance estimator to guide data partitioning decisions, in: Third ACM Symposium on Principles and Practice of Parallel Programming, April 1991, pp. 213-223.
7. M. Bhandarkar, L.V. Kale, E. de Sturler, J. Hoeflinger, Adaptive load balancing for MPI programs, in: International Conference on Computational Science, San Francisco, CA, May 2001, pp. 108-117.
8. Bhatt N., Chung F.R.K., Leighton F.T., and Rosenberg A.L. On optimal strategies for cycle-stealing in networks of workstations. IEEE Trans. Comput. 46 5 (1997) 545-557
9. S. Dwarkadas, A.L. Cox, W. Zwaenepoel, An integrated compile-time/run-time software distributed shared memory system, in: Proceedings of ASPLOS VII, 1996, pp. 186-197.
10. Edjlali G., Agrawal G., Sussman A., Humphries J., and Saltz J. Runtime and compiler support for programming in adaptive parallel environments. Sci. Programming 6 2 (1997) 215-227
11. D. Feitelson, A survey of scheduling in multiprogrammed parallel systems, Technical Report RC 19790 (87657), IBM T. J. Watson Research Center, October 1994.
12. J. Garcia, E. Ayguade, J. Labarta, Dynamic data distribution with control flow analysis, in: Supercomputing '96, November 1996.
13. M. Gupta, P. Banerjee, PARADIGM: a compiler for automated data distribution on multicomputers, in: Proceedings of the 1993 ACM International Conference on Supercomputing, July 1993, pp. 357-367.
14. Havlak P., and Kennedy K. An implementation of interprocedural bounded regular section analysis. IEEE Trans. Parallel Distributed Systems 2 3 (1991) 350-360
15. Hiranandani S., Kennedy K., and Tseng C.-W. Compiling Fortran D for MIMD distributed-memory machines. Commun. ACM 35 8 (1992) 66-80
16. High Performance Fortran language specification, November 1994.
17. Hu Y.C., Lu H., Cox A.L., and Zwaenepoel W. OpenMP for networks of SMPs. J. Parallel Distributed Comput. 60 12 (2000) 1512-1530
18. L.V. Kale, S. Krishnan, Charm++: a portable concurrent object oriented system based on C++, in: OOPSLA '93, September 1993, pp. 91-108.
19. J. Ke, E. Speight, Tern: migrating threads in an MPI runtime environment, Technical Report CSL-TR-2001-1016, Cornell, November 2001.
20. Kennedy K., and Kremer U. Automatic data layout for distributed-memory machines. ACM Trans. Programming Languages Systems 20 4 (1998) 869-916
21. O. Lawlor, M. Bhandarkar, L.V. Kale, Adaptive MPI, TR 02-05, University of Illinois, 2002.
22. Leutenegger S.T., and Sun X.-H. Limitations of cycle stealing for parallel processing on a network of homogeneous workstations. J. Parallel Distributed Comput. 43 2 (1997) 169-178
23. Li K., and Hudak P. Memory coherence in shared virtual memory systems. ACM Trans. Comput. Systems 7 4 (1989)
24. Message Passing Interface Forum MPIF, MPI-2: extensions to the message-passing interface, Technical Report, University of Tennessee, Knoxville, 1996.
25. B. Moon, J. Saltz, Adaptive runtime support for direct simulation monte carlo methods on distributed memory architectures, in: Scalable High Performance Computing Conference, May 1994, pp. 176-183.
26. D.G. Morris, D.K. Lowenthal, Accurate data redistribution cost estimation in software distributed shared memory systems, in: Eighth ACM Symposium on Principles and Practice of Parallel Programming, June 2001, pp. 62-71.
27. Pal Singh J., Hennessy J.L., and Gupta A. Scaling parallel programs for multiprocessors: methodology and examples. Computer 26 7 (1993) 42-50
28. J. Pal Singh, W.-D. Weber, A. Gupta, SPLASH: Stanford parallel applications for shared-memory, Technical Report CSL-TR-91-469, Stanford University, April 1991.
29. D.J. Palermo, P. Banerjee, Automatic selection of dynamic data partitioning schemes for distributed-memory multicomputers, in: Proceedings of the Eighth Workshop on Languages and Compilers for Parallel Computing, August 1995.
30. Pbs user guide. 〈http://www.doesciencegrid.org/public/pbs/homepage.html 〉.
31. Price G.W., and Lowenthal D.K. A comparative analysis of fine-grain threads packages. J. Parallel Distributed Comput. 63 11 (2003)
32. U. Rencuzogullari, S. Dwarkadas, Dynamic adaptation to available resources for parallel computing in an autonomous network of workstations, in: Eighth ACM Symposium on Principles and Practice of Parallel Programming, June 2001, pp. 72-81.
33. Ryu K.D., and Hollingsworth J.K. Exploiting fine-grained idle periods in networks of workstations. IEEE Trans. Parallel Distributed Systems 11 7 (2000) 683-698
34. A. Scherer, H. Lu, T. Gross, W. Zwaenepoel, Transparent adaptive parallelism on NOWs using OpenMP, in: Proceedings of the Seventh ACM Symposium on Principles and Practice of Parallel Programming, May 1999, pp. 96-106.
35. G. Shao, R. Wolski, F. Berman, Modeling the cost of redistribution in scheduling, in: Eighth SIAM Conference on Parallel Processing for Scientific Computation, March 1997.
36. P.G. Sobalvarro, Demand-based coscheduling of parallel jobs on multiprogrammed multiprocessors, Ph.D. Thesis, MIT, Cambridge, MA, 1997.
37. D.B. Weatherly, D.K. Lowenthal, F. Lowenthal, Dyn-MPI: supporting MPI on non dedicated clusters (extended version), Technical Report 03-003, University of Georgia, January 2003.
38. R. Wolski, N. Spring, J. Hayes, Predicting the CPU availability of time-shared unix systems on the computational grid, in: Eighth High-Performance Distributed Computing Conference, August 1999.