• DocumentCode
    2729160
  • Title

    Utilization and predictability in scheduling the IBM SP2 with backfilling

  • Author

    Feitelson, Dror G. ; Weil, Ahuva Mu alem

  • Author_Institution
    Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
  • fYear
    1998
  • fDate
    30 Mar-3 Apr 1998
  • Firstpage
    542
  • Lastpage
    546
  • Abstract
    Scheduling jobs on the IBM SP2 system is usually done by giving each job a partition of the machine for its exclusive use. Allocating such partitions in the order that the jobs arrive (FCFS scheduling) is fair and predictable, but suffers from severe fragmentation, leading to low utilization. An alternative is to use the EASY scheduler, which uses aggressive backfilling: small jobs are moved ahead to fill in holes in the schedule, provided they do not delay the first job in the queue. The authors show that a more conservative approach, in which small jobs move ahead only if they do not delay any job in the queue, produces essentially the same benefits in terms of utilization. The conservative scheme has the added advantage that queueing times can be predicted in advance, whereas in EASY the queueing time is unbounded
  • Keywords
    IBM computers; distributed memory systems; parallel machines; processor scheduling; queueing theory; EASY scheduler; IBM SP2 scheduling; aggressive backfilling; job scheduling; partition allocation; predictability; queueing times; utilization; Computer science; Delay; Dynamic scheduling; Partitioning algorithms; Processor scheduling; Production; Runtime; Supercomputers; Uniform resource locators; Writing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing Symposium, 1998. IPPS/SPDP 1998. Proceedings of the First Merged International ... and Symposium on Parallel and Distributed Processing 1998
  • Conference_Location
    Orlando, FL
  • ISSN
    1063-7133
  • Print_ISBN
    0-8186-8404-6
  • Type

    conf

  • DOI
    10.1109/IPPS.1998.669970
  • Filename
    669970