The supercomputers maintained by the Jülich Supercomputing Centre (JSC) are run in batch mode and are shared among all active users. Jobs are submitted to the job scheduler, which determines for each job the time of execution. It manages running and waiting jobs, sorts them by a given priority and executes the jobs by fitting them into the current system state. For users it is often difficult to comprehend the job scheduler’s algorithm. Thus, a prediction of the future system allocation of currently running and queued jobs is valuable. It helps users to plan job submissions and supports administrators by optimising the system load. This paper summarises the design and implementation of a configurable simulation for various job schedulers. The developed simulation program called JuFo focuses on the job schedulers Loadleveler and Moab as these are the most important batch systems for the supercomputers provided by the JSC. A major design goal is to keep the simulation independent from special job schedulers, which is achieved by the generic configuration of JuFo. Finally, a test framework is developed, which allows for evaluating the accuracy of the generated schedules.
[1]
Uwe Schwiegelshohn,et al.
On the Design and Evaluation of Job Scheduling Algorithms
,
1999,
JSSPP.
[2]
Peter Brucker,et al.
Complex Scheduling
,
2006
.
[3]
Wolfgang Frings,et al.
Scalable Control and Monitoring of Supercomputer Applications Using an Integrated Tool Framework
,
2011,
2011 40th International Conference on Parallel Processing Workshops.
[4]
A. Karimi,et al.
Master‟s thesis
,
2011
.
[5]
Nathaniel S. Borenstein,et al.
IBM ®
,
2009
.
[6]
Warren Smith,et al.
Resource Selection Using Execution and Queue Wait Time Predictions
,
2002
.
[7]
Richard Wolski,et al.
QBETS: queue bounds estimation from time series
,
2007,
SIGMETRICS '07.