A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
This paper studies parallel job scheduling in a distributed system. A simulation model is used to address performance issues associated with scheduling. Five policies are used to schedule parallel jobs over a variety of workloads. Fairness is required among competing jobs. We examine a case where the distribution of the number of parallel tasks per job and also the distribution of task service demand vary with time. Simulated results indicate that although all scheduling methods have merit, onedoi:10.1109/simsym.2003.1192804 dblp:conf/anss/KaratzaH03 fatcat:wliigysexzb5tfdsburhvheo6q