• DocumentCode
    1572656
  • Title

    PB-FCFS-a task scheduling algorithm based on FCFS and backfilling strategy for grid computing

  • Author

    Jiang, Hong ; Ni, Tainwei

  • Author_Institution
    Comput. & Inf. Eng. Coll., Hohai Univ., Nanjing, China
  • fYear
    2009
  • Firstpage
    507
  • Lastpage
    510
  • Abstract
    In a task scheduling system for grid computing, most of algorithms such as reservation, backfilling, etc. are commonly used task scheduling algorithm. However, they have some insufficiencies in the system resource utilization rate and the response time due to these algorithms are insufficient in solving resource slot. In order to improve the system resource utilization rate and shorten the response time, this paper presents PB-FCFS algorithm which is a task scheduling algorithm based on FCFS and backfilling strategy for grid computing. The PB-FCFS algorithm combines backfilling and priority scheduling strategy, as well considers the resource recycling at the time of task accomplished. The simulation results show that the PB-FCFS algorithm shortens task run time and improves the system throughput rate and resource utilization rate to a certain extent.
  • Keywords
    grid computing; scheduling; task analysis; PB-FCFS algorithm; backfilling strategy; grid computing; priority scheduling strategy; system resource utilization rate; task scheduling algorithm; Algorithm design and analysis; Computational modeling; Delay; Dynamic scheduling; Educational institutions; Grid computing; Processor scheduling; Recycling; Resource management; Scheduling algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pervasive Computing (JCPC), 2009 Joint Conferences on
  • Conference_Location
    Tamsui, Taipei
  • Print_ISBN
    978-1-4244-5227-9
  • Electronic_ISBN
    978-1-4244-5228-6
  • Type

    conf

  • DOI
    10.1109/JCPC.2009.5420131
  • Filename
    5420131