Scheduling on the top 50 machines

3Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Ernemann, C., Krogmann, M., Lepping, J., & Yahyapour, R. (2005). Scheduling on the top 50 machines. In Lecture Notes in Computer Science (Vol. 3277, pp. 17–46). Springer Verlag. https://doi.org/10.1007/11407522_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free