Abstract
Statistics of a parallel workload on a 128-node iPSC/860 located at NASA Ames are presented. It is shown that while the number of sequential jobs dominates the number of parallel jobs, most of the resources (measured in node-seconds) were consumed by parallel jobs. Moreover, most of the sequential jobs were for system administration. The average runtime of jobs grew with the number of nodes used, so the total resource requirements of large parallel jobs were larger by more than the number of nodes they used. The job submission rate during peak day activity was somewhat lower than one every two minutes, and the average job size was small. At night, submission rate was low but job sizes and system utilization were high, mainly due to NQS. Submission rate and utilization over the weekend were lower than on weekdays. The overall utilization was 50%, after accounting for downtime. About 2/3 of the applications were executed repeatedly, some for a significant number of times.
Original language | English |
---|---|
Title of host publication | Job Scheduling Strategies for Parallel Processing - IPPS 1995 Workshop, Proceedings |
Editors | Dror G. Feitelson, Larry Rudolph |
Publisher | Springer Verlag |
Pages | 337-360 |
Number of pages | 24 |
ISBN (Print) | 3540601538, 9783540601531 |
DOIs | |
State | Published - 1995 |
Externally published | Yes |
Event | Workshop on Job Scheduling Strategies for Parallel Processing held as a prelude to the IPPS 1995 Conference - Santa Barbara, United States Duration: 25 Apr 1995 → 25 Apr 1995 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 949 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | Workshop on Job Scheduling Strategies for Parallel Processing held as a prelude to the IPPS 1995 Conference |
---|---|
Country/Territory | United States |
City | Santa Barbara |
Period | 25/04/95 → 25/04/95 |
Bibliographical note
Publisher Copyright:© 1995, Springer Verlag. All rights reserved.