• DocumentCode
    1936573
  • Title

    Computing Field Scheduling: A Fully Decentralized Scheduling Approach for Grid Computing

  • Author

    Dong, Zhen ; Yang, Yi ; Zhao, Chenyang ; Guo, Wei ; Li, Lian

  • Author_Institution
    Sch. of Inf. Sci. & Eng., Lanzhou Univ., Lanzhou, China
  • fYear
    2011
  • fDate
    22-23 Aug. 2011
  • Firstpage
    68
  • Lastpage
    73
  • Abstract
    Grid systems tend to grow in size, but currently deployed state-of-the-art schedulers have inherent scalability limits due to centralization. In this paper, we present a novel, fully decentralized scheduling approach for Grid Computing. The approach is inspired from the gravitational field in physics. In the approach, a task autonomously selects a suitable computing node based on local information without dedicated servers or coordinators. An important feature of the approach is that it schedules compute-intensive tasks so that the workload of Grid systems achieves balanced as soon as possible. From simulation results, the approach can scale to a large number of nodes and has a fast task convergence rate, maintaining high Grid utilization and good capability of balanced workload.
  • Keywords
    grid computing; physics; scheduling; balanced workload; compute-intensive tasks; computing field scheduling; fast task convergence rate; fully decentralized scheduling approach; gravitational field; grid computing; grid utilization; local information; physics; Computational modeling; Convergence; Grid computing; Peer to peer computing; Processor scheduling; Scalability; Scheduling; Computing Field scheduling; Grid computing; decentralized; scalability; workload balance;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Chinagrid Conference (ChinaGrid), 2011 Sixth Annual
  • Conference_Location
    Liaoning
  • Print_ISBN
    978-1-4577-0885-5
  • Type

    conf

  • DOI
    10.1109/ChinaGrid.2011.19
  • Filename
    6051735