• DocumentCode
    3228803
  • Title

    The research on scheduling algorithms of grid spatial database

  • Author

    Liu, Xiaosheng ; Zhao, Zhiyong ; Liu, Yuxuan

  • Author_Institution
    Sch. of Archit. & Surveying Eng., Jiangxi Univ. of Sci. & Technol., Ganzhou, China
  • fYear
    2009
  • fDate
    25-28 July 2009
  • Firstpage
    808
  • Lastpage
    810
  • Abstract
    First, this paper describes several scheduling algorithms of grid spatial database, that is, the random scheduling algorithm, queue length algorithm, visit cost algorithm and queue visit cost algorithm; Second, we make some simulation experiments on the operating capacity, operating time as well as processing unit utilization to these algorithms respectively with task capacity of 500,1000,2000,5000;at last, the results show that queue visit cost algorithm is the best one among them to deal with tasks under the grid spatial database environment, which can improve the efficiency of system operation, and let the system achieve the best operation status.
  • Keywords
    grid computing; queueing theory; scheduling; visual databases; grid spatial database; queue length algorithm; queue visit cost algorithm; random scheduling algorithm; system operation capacity; Computer networks; Computer science; Costs; Data engineering; Data processing; Distributed computing; Educational technology; Grid computing; Scheduling algorithm; Spatial databases; grid; scheduling algorithms; simulation experiments; spatial database;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science & Education, 2009. ICCSE '09. 4th International Conference on
  • Conference_Location
    Nanning
  • Print_ISBN
    978-1-4244-3520-3
  • Electronic_ISBN
    978-1-4244-3521-0
  • Type

    conf

  • DOI
    10.1109/ICCSE.2009.5228161
  • Filename
    5228161