Scheduling on the top 50 machines

Authors:
Carsten Ernemann;Martin Krogmann;Joachim Lepping;Ramin Yahyapour
Affiliations:
Computer Engineering Institute, University Dortmund, Dortmund, Germany;Computer Engineering Institute, University Dortmund, Dortmund, Germany;Computer Engineering Institute, University Dortmund, Dortmund, Germany;Computer Engineering Institute, University Dortmund, Dortmund, Germany
Venue:
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Year:
2004

Citing 3
Cited 2

The ANL/IBM SP Scheduling System

IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Theory and Practice in Parallel Job Scheduling

IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Utilization and Predictability in Scheduling the IBM SP2 with Backfilling

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium

Using inaccurate estimates accurately

JSSPP'10 Proceedings of the 15th international conference on Job scheduling strategies for parallel processing
A job scheduling approach for multi-core clusters based on virtual malleability

Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The well-known TOP500 list ranks the 500 most powerful high-performance computers. However, the list lacks details about the job management and scheduling on these machines. As this statistic is interesting for researchers and system designers, this paper gives an overview and survey on scheduling relevant information for the first 50 entries in the TOP500 list.