Scheduling on the top 50 machines

Lecture Notes in Computer Science

Volumn 3277, Issue , 2005, Pages 17-46

  Ernemann, Carsten ^a   Krogmann, Martin ^a   Lepping, Joachim ^a   Yahyapour, Ramin ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; JOB ANALYSIS; PARALLEL PROCESSING SYSTEMS; SYSTEMS ANALYSIS;

HGIH-PERFORMANCE COMPUTERS; JOB MANAGEMENT; SYSTEM DESIGNERS;

SCHEDULING;

EID: 23944445593     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11407522_2     Document Type: Conference Paper

References (5)

1. Dror G. Feitelson, Larry Rudolph, Uwe Schwiegelshohn, Kenneth C. Sevcik, and Parkson Wong. Theory and practice in parallel job scheduling. In IPPS'97 Workshop: Job Scheduling Strategies for Parallel Processing, volume 1291 of Lecture Notes in Computer Science (LNCS), pages 1-34. Springer, Berlin, April 1997.
2. 22nd TOP500 List introduced during the Supercomputer Conference (SC2003) in Phoenix, AZ. http://www.top500.org November 2003.
3. D.G. Feitelson and A.M. Weil. Utilization and Predictabillity in Scheduling the IBM SP2 with Backfilling. In Proceedings of IPPS/SPDP 1998, IEEE Computer Society, pages 542-546, 1998.
4. D. A. Lifka. The ANL/IBM SP Scheduling System. In D. G. Feitelson and L. Rudolph, editors, IPPS'95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 295-303. Springer, Berlin, Lecture Notes in Computer Science LNCS 949, 1995.
5. A. Petitet and R.C. Whaley and J. Dongarra and A. Cleary HPL - A Portable Implementation of the High-Performance Linpack Benchmark for Distributed-Memory Computers http://www.netlib.org/benchmark