Effect of Job Size Characteristics on Job Scheduling Performance (2000) [21 citations — 0 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Aida00effectof,author = {Kento Aida},
title = {Effect of Job Size Characteristics on Job Scheduling Performance},
booktitle = {Scheduling Strategies for Parallel Processing},
year = {2000},
pages = {1--17},
publisher = {SpringerVerlag}
}
Years of Citing Articles
Abstract:
A workload characteristic on a parallel computer depends on an administration policy or a user community for the computer system. An administrator of a parallel computer system needs to select an appropriate scheduling algorithm that schedules multiple jobs on the computer system efficiently. The goal of the work presented in this paper is to investigate mechanisms how job size characteristics affect job scheduling performance. For this goal, this paper evaluates the performance of job scheduling algorithms under various workload models, each of which has a certain characteristic related to the number of processors requested by a job, and analyzes the mechanism for job size characteristics that affect job scheduling performance significantly in the evaluation. The results showed that: (1) most scheduling algorithms classified into the first-fit scheduling showed best performance and were not affected by job size characteristics, (2) certain job size characteristics affected performance of priority scheduling significantly. The analysis of the results showed that the LJF algorithm, which dispatched the largest job first, would perfectly pack jobs to idle processors at high load, where all jobs requested power-of-two processors.
Citations
| 116 | The ANL/IBM SP scheduling system – Lifka - 1995 |
| 83 | Packing schemes for gang scheduling – Feitelson - 1996 |
| 65 | A parallel workload model and its implications for processor allocation – Downey - 1997 |
| 61 | A historical application profiler for use by parallel schedulers – Gibbons - 1997 |
| 42 | Towards Convergence in Job Schedulers for Parallel Supercomputers – Feitelson, Rudolph - 1996 |
| 23 | The EASY - LoadLeveler API project – Skovira, Chan, et al. - 1996 |
| 21 | A comparative study of real workload traces and synthetic workload models for parallel job scheduling – Lo, Mache, et al. - 1998 |
| 20 | Job scheduling in a partitionable mesh using a two-dimensional buddy system partitioning scheme – Li, Cheng - 1991 |
| 10 | Scheduling Is More Important than Processor Allocation for Hypercube Computers – Job - 1994 |
| 9 | Impact of job mix on optimizations for space sharing schedulers – Subhlok, Gross, et al. - 1996 |
