• DocumentCode
    2534255
  • Title

    Parallel Job Scheduling Policies to Improve Fairness: A Case Study

  • Author

    Leung, Vitus J. ; Sabin, Gerald ; Sadayappan, P.

  • Author_Institution
    Sandia Nat. Labs., Albuquerque, NM, USA
  • fYear
    2010
  • fDate
    13-16 Sept. 2010
  • Firstpage
    346
  • Lastpage
    353
  • Abstract
    Balancing fairness, user performance, and system performance is a critical concern when developing and installing parallel schedulers. Sandia uses a customized scheduler to manage many of their parallel machines. A primary function of the scheduler is to ensure that the machines have good utilization and that users are treated in a "fair" manner. A separate compute process allocator (CPA) ensures that the jobs on the machines are not too fragmented in order to maximize throughput. Until recently, there has been no established technique to measure the fairness of parallel job schedulers. This paper introduces a "hybrid" fairness metric that is similar to recently proposed metrics. The metric uses the Sandia version of a "fairshare" queuing priority as the basis for fairness. The hybrid fairness metric is used to evaluate a Sandia workload. Using these results, multiple scheduling strategies are introduced to improve performance while satisfying user and system constraints.
  • Keywords
    parallel machines; queueing theory; scheduling; Sandia workload; compute process allocator; fairshare queuing priority; multiple scheduling strategy; parallel job scheduling policy; parallel machines; Laboratories; Measurement; Processor scheduling; Production; Program processors; Runtime; Schedules;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing Workshops (ICPPW), 2010 39th International Conference on
  • Conference_Location
    San Diego, CA
  • ISSN
    1530-2016
  • Print_ISBN
    978-1-4244-7918-4
  • Electronic_ISBN
    1530-2016
  • Type

    conf

  • DOI
    10.1109/ICPPW.2010.48
  • Filename
    5599092