• DocumentCode
    2989792
  • Title

    Efficient method for multiple resource discoveries in grid environment

  • Author

    Khanli, Leyli Mohammad ; Niari, Ali Kazemi ; Kargar, Saeed

  • Author_Institution
    CS Dept., Univ. of Tabriz, Tabriz, Iran
  • fYear
    2011
  • fDate
    4-8 July 2011
  • Firstpage
    128
  • Lastpage
    134
  • Abstract
    Grid provides an infrastructure for sharing resources with different types in the environment. The resource discovery approaches are of special importance in the grid environment. A user request may be a combination of several resources such as the processor speed, operating system type, memory size, and so on. A resource discovery mechanism should be able to discover such requests in a distributed and dynamic environment. In this paper, we propose an efficient method for the multiple resource discoveries on a tree structure simultaneously. As such, in contrary to the previous methods, it would be possible for the user to access to multiple resources only by unique request, and we could be able to discover the requested resources and make them accessible to the user. We evaluate the performance of our method by comparing it with the previous methods. The experimental results indicate that the current method for the resource discovery has a better performance.
  • Keywords
    grid computing; resource allocation; user interfaces; grid environment; resource discovery method; resource sharing; tree structure; user request; Binary trees; Dynamic scheduling; Matched filters; Operating systems; Peer to peer computing; Routing; Vegetation; Grid; Multiple resource discoveries; Tree structure; Unique request;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    High Performance Computing and Simulation (HPCS), 2011 International Conference on
  • Conference_Location
    Istanbul
  • Print_ISBN
    978-1-61284-380-3
  • Type

    conf

  • DOI
    10.1109/HPCSim.2011.5999816
  • Filename
    5999816