ReSHAPE: A framework for dynamic resizing and scheduling of homogeneous applications in a parallel environment

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2007, Pages

  Sudarsan, Rajesh ^a   Ribbens, Calvin J ^a  

^a Virginia Polytechnic Institute and State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; SCHEDULING; THROUGHPUT;

ARRIVAL TIMES; DISTRIBUTED MEMORY PLATFORMS; INDIVIDUAL (PSS 544-7); INTERNATIONAL CONFERENCES; MPI APPLICATIONS; PARALLEL ENVIRONMENTS; PARALLEL PROCESSING; RESOURCE REQUIREMENTS; STATIC SCHEDULING; SYSTEM RESOURCES; SYSTEM THROUGHPUT; TURN-AROUND TIME (TAT);

SOFTWARE PROTOTYPING;

EID: 47249113516     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2007.73     Document Type: Conference Paper

References (16)

1. L. S. Blackford, J. Choi, A. Cleary, E. D'Azevedo, J. Demmel, I. Dhillon, J. Dongarra, S. Hammerling, G. Henry, A. Petitet, K. Stanley, D. Walker, and R. C. Whaley. ScaLAPACK User's Guide. SIAM, Philadelphia, 1997.
2. M. Chinnusamy. Data and processor mapping strategies for dynamically resizable parallel applications. Master's thesis, Virginia Tech, 2004.
3. W. Cirne and F. Berman. Using Moldability to Improve the Performance of Supercomputer Jobs. Journal of Parallel and Distributed Computing, 62(10):1571-1602, 2002.
4. J. Corbalan, X. Martorell, and J. Labarta. Performance-Driven Processor Allocation. IEEE Transactions on Parallel and Distributed, 16(7):599-611, July 2005.
5. J. Dongarra and R. C. Whaley. A user's guide to the BLACS v1.1. Technical Report CS-95-281, Computer Science Department, University of Tennesse, Knoxville, TN, 1997. Also LAPACK Working Note #94.
6. E. Huedo, R. Montero, and I. Llorente. A Framework for Adaptive Execution in Grids. Software Practice and Experience, 34(7):631-651, 2004.
7. L. V. Kalè, S. Kumar, and J. DeSouza. A malleable-job system for timeshared parallel machines. In CCGRID '02: Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, page 230, Washington, DC, USA, 2002. IEEE Computer Society.
8. C. McCann, R. Vaswani, and J. Zarhojan. A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors. ACM Transactions on Computer Systems (TOCS), 11(2):146-178, May 1993.
9. J. E. Moriera and V. K. Naik. Dynamic resource management on distributed systems using reconfigurable applications. IBM Journal of Research and Development, 41(3):303-330, May 1997.
10. MPICH2 v1.03, 2005. Available from: http://wwwunix.mcs.anl.gov/mpi/mpich.
11. N. Park, V. K. Prasanna, and C. S. Raghavendra. Efficient algorithms for block-cyclic array redistribution between processor sets. IEEE Transactions on Parallel and Distributed Systems, 10(12):1217-1240, 1999.
12. G. Swaminathan. A scheduling framework for dynamically resizable parallel applications. Master's thesis, Virginia Tech, 2004.
13. S. Tadepalli, C. J. Ribbens, and S. Varadarajan. GEMS: A job management system for fault tolerant grid computing. In J. Meyer, editor, Proceedings of High Performance Computing Symposium 2004, Soc. for Modeling and Simulation Internat, pages 59-66, San Diego, CA, 2004.
14. S. Vadhiyar and J. Dongarra. SRS - A framework for developing malleable and migratable parallel applications for distributed systems. Parallel Processing Letters, 13(2):291-312, June 2003.
15. J. B. Weissman, L. Rao, and D. England. Integrated Scheduling: The Best of Both Worlds. Journal of Parallel and Distributed Computing, 63(6):649-668, June 2003.
16. R. Wolski, G. Shao, and F. Berman. Predicting the Cost of Redistribution in Scheduling. Proceedings of 8th SIAM Conf. on Parallel Processing for Scientific Comput, 1997.