• DocumentCode
    2053987
  • Title

    Improving parallel job scheduling by combining gang scheduling and backfilling techniques

  • Author

    Zhang, Y. ; Franke, H. ; Moreira, J.E. ; Sivasubramaniam, A.

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    133
  • Lastpage
    142
  • Abstract
    Two different approaches have been commonly used to address problems associated with space sharing scheduling strategies: (a) augmenting space sharing with backfilling, which performs out of order job scheduling; and (b) augmenting space sharing with time sharing, using a technique called coscheduling or gang scheduling. With three important experimental results-impact of priority queue order on backfilling, impact of overestimation of job execution times, and comparison of scheduling techniques-this paper presents an integrated strategy that combines backfilling with gang scheduling. Using extensive simulations based on detailed models of realistic workloads, the benefits of combining backfilling and gang scheduling are clearly demonstrated over a spectrum of performance criteria
  • Keywords
    digital simulation; performance evaluation; processor scheduling; augmenting space sharing; backfilling techniques; coscheduling; gang scheduling; parallel job scheduling; performance criteria; priority queue order; space sharing; space sharing scheduling; time sharing; Application software; Computer science; Computer simulation; Delay; Ear; Electronic switching systems; Filling; Large-scale systems; Parallel machines; Processor scheduling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing Symposium, 2000. IPDPS 2000. Proceedings. 14th International
  • Conference_Location
    Cancun
  • Print_ISBN
    0-7695-0574-0
  • Type

    conf

  • DOI
    10.1109/IPDPS.2000.845975
  • Filename
    845975