• DocumentCode
    1959152
  • Title

    Impact of Extending the Runtime of Underestimated Jobs in Backfilling Schedulers

  • Author

    Li, Bo ; Chen, Jun ; Yang, Man ; Wang, Erfei

  • Author_Institution
    Sch. of Inf. Sci. & Eng., Yunnan Univ., Kunming
  • Volume
    3
  • fYear
    2008
  • fDate
    12-14 Dec. 2008
  • Firstpage
    328
  • Lastpage
    331
  • Abstract
    In standard backfill algorithms, a job will be terminated immediately it has been processed for its estimated runtime. This drives users not to provide tight estimates to make their jobs to be scheduled earlier but at the risk of being killed. This paper presents an enhanced mechanism to tolerate underestimated jobs by continuing processing them on condition that they will not delay any other running or reserved jobs. By comparing the performance of this new mechanism with that of the standard easy backfill with simulation of real workloads, it is shown that the benefits of extending the runtime of underestimated jobs are attractive and the possible degradations are very slight.
  • Keywords
    parallel algorithms; scheduling; backfilling parallel scheduler algorithm; continuing processing; underestimated job runtime extension; Computer science; Degradation; Delay estimation; Information science; Processor scheduling; Runtime; Scheduling algorithm; Software algorithms; Software engineering; Software standards; EASY backfill; parallel scheduling; runtime estimate;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Software Engineering, 2008 International Conference on
  • Conference_Location
    Wuhan, Hubei
  • Print_ISBN
    978-0-7695-3336-0
  • Type

    conf

  • DOI
    10.1109/CSSE.2008.1483
  • Filename
    4722352