• DocumentCode
    3351216
  • 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
  • fYear
    2004
  • fDate
    15-18 Aug. 2004
  • Firstpage
    186
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing, 2004. ICPP 2004. International Conference on
  • ISSN
    0190-3918
  • Print_ISBN
    0-7695-2197-5
  • Type

    conf

  • DOI
    10.1109/ICPP.2004.1327920
  • Filename
    1327920