Implementing malleability on MPI jobs

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn , Issue , 2004, Pages 215-224

  Utrera, Gladys ^a   Corbalán, Julita ^a   Labarta, Jesús ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PLACEMENT; FOLDING BY JOBTYPE (FJT); PROCESSOR ALLOCATION; SPACE SHARING;

COMPUTER ARCHITECTURE; DATA TRANSFER; MULTIPLEXING; RESOURCE ALLOCATION; SYNCHRONIZATION;

PARALLEL PROCESSING SYSTEMS;

EID: 10444256355     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACT.2004.1342555     Document Type: Conference Paper

References (12)

1. D. Bailey, T. Harris, W. Saphir, R. Wijngaart, A. Woo and M. Yarrow, "The NAS Parallel Benchmarks 2.0", Technical ReportNAS-95-020, NASA, December 1995.
2. D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, and K. C. Sevcik. "Theory and Practice in Parallel Job Scheduling". Lecture Notes in Computer Science, 1291:1-34, 1997.
3. D. G. Feitelson, B. Nitzberg. "Jobs Characteristis of a Production Parallel Scientific Workload on the NASA Ames Ipsc/860", in JSSPP Springer-Verlag, Lectures Notres in Computer Science, vol. 949, pp. 337-360, 1995.
4. C. McCann and J. Zahorjan, "Processor allocation policies for message passing parallel computers". In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 19-32, May 1994.
5. Message Passing Interface Forum. MPI: A Message -Passing Interface std. Int. Journal of SuperComp. Jobs, 8(3/4): 165-414, 1994.
6. S. Nagar, A.Banerjee, A.Sivasubramaniam, and C.R. Das. A Qoser Look at Coscheduling Approaches for a Network of Workstations. In Eleventh ACM Symposium on Parallel Algorithms
7. J. D. Padhye and L. Dowdy, Dynamic versus adaptive processor allocation policies for message passing parallel computers: an empirical comparison". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 224-243, Springer-Verlag, 1996. Lecture Notes in Computer Science Vol. 1162.
8. E. Rosti, E. Smirni, G. Serazzi, L. W. Dowdy: Analysis of Non-Work-Conserving Processor Partitioning Policies. JSSPP 1995: 165-181 and Arq, SPAA'99, Saint-Malo, France, June 1999.
9. E. Shmueli and D. G. Feitelson, "Backfilling with lookahead to optimize the performance of parallel job scheduling". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn (Eds.), pp. 228-251, Springer-Verlag, 2003. Lecture Notes in Computer Science Vol. 2862.
10. Silicon Graphics, Inc. IRIX Admin: Resource Administration, Document number 007-3700-005, http://techpubs.sgi.com, 2000.
11. Sweep3D Benchmark http://www.llnl.gov/asci_benchmarks/asci/limited/sweep3d/asci_sweep3d.html
12. G Utrera, J. Corbalán and J. Labarta. "Study of MPI applications when sharing resources", Technical Report number UPC-DAC-2003-47 Dep d'Arquitectura de Computadors, UPC, 2003. To appear in Euro-Par 200