Title :
Job fairness in non-preemptive job scheduling
Author :
Sabin, Gerald ; Kochhar, Garima ; Sadayappan, P.
Author_Institution :
Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA
Abstract :
Job scheduling has been a much studied topic over the years. While past research has studied the effect of various scheduling policies using metrics such as turnaround time, slowdown, utilization etc., there has been little research on how fair a nonpreemptive scheduling policy is. We propose an approach to assessing fairness in nonpreemptive job scheduling. Our basic model of fairness is that no later arriving job should delay an earlier arriving job. We quantitatively assess the fairness of several job scheduling strategies and propose a new strategy that seeks to improve fairness.
Keywords :
job shop scheduling; job fairness improvement; job scheduling; nonpreemptive scheduling; Computational modeling; Computer science; Delay effects; Dynamic scheduling; High performance computing; Parallel processing; Processor scheduling; Production; Runtime; Sections;
Conference_Titel :
Parallel Processing, 2004. ICPP 2004. International Conference on
Print_ISBN :
0-7695-2197-5
DOI :
10.1109/ICPP.2004.1327920