• DocumentCode
    1902573
  • Title

    Node Storage Resources Sharing Strategy in the Campus Grid Computing Environment

  • Author

    Liu, Xiaojun ; Dai, Guanzhong ; Deng, Zhiqun

  • Author_Institution
    Office of Int. Cooperation, Northwestern Polytech. Univ., Xi´´an
  • fYear
    2005
  • fDate
    27-29 Nov. 2005
  • Firstpage
    88
  • Lastpage
    88
  • Abstract
    Campus grid storage service is to aggregate the storage resources voluntarily contributed by the servers in the campus network, and the storage resources in personal computers (PC) to provide the services of register, allocation, scheduling, free allocation for uses through building three level storage architecture. The voluntary nodes contributed storage resources and the users explore the storage resources according to some rules. The problem of resources sharing under this condition is a NP-complete problem. To solve it, we propose the greedy heuristic algorithm, and simulate the system performance. Finally the relation between storage resources users´ requests and system load is gotten.
  • Keywords
    computational complexity; grid computing; NP-complete problem; campus grid computing environment; campus grid storage service; node storage resources sharing strategy; Aggregates; Buildings; Computer architecture; Grid computing; Microcomputers; NP-complete problem; Network servers; Processor scheduling; Registers; Resource management;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Semantics, Knowledge and Grid, 2005. SKG '05. First International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    0-7695-2534-2
  • Electronic_ISBN
    0-7695-2534-2
  • Type

    conf

  • DOI
    10.1109/SKG.2005.96
  • Filename
    4125876