A Scalable Method for Efficient Grid Resource Discovery

  • Yan Zhang
  • Yan Jia
  • Xiaobin Huang
  • Bin Zhou
  • Jian Gu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4674)


How to discover resource rapidly and exactly in distributed and heterogeneous grid environment is a key problem that affects grid computing performance. In this paper, the P2P method is used to improve scalability of resource discovery mechanism, and a decentralized resource discovery method with well scalability is presented, this method uses binary tree to manage data, each node in grid is responsible for managing a part of resource information. Experimental result shows that the method presented in this paper can resolve many problems that exist in centralized mechanism, such as poor scalability, heavy load on resource information server and single point failure.


Grid Computing Resource Discovery P2P Binary Tree 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual 0rganization. The International Journal of Supercomputer Applications 15(3), 200–222 (2001)CrossRefGoogle Scholar
  2. 2.
    Dejanm, S.M., Vana, K., Rajan, L.: Peer-to-Peer Computing,
  3. 3.
    Globus project,
  4. 4.
    Raman, R., Livny, M., Solomon, M.: Matchmaking: Distributed Resource Management for High Throughput Computing. In: Proc of the 7th IEEE HPDC, pp. 140–146. IEEE Computer Society Press, Washington, DC (1998)Google Scholar
  5. 5.
    Chapin, S.J., Katramatos, D., Karpovich, J., Grimshaw, A.: Resource Management in Legion. Future Generation Computer System 15(5), 583–594 (1999)CrossRefGoogle Scholar
  6. 6.
    Czajkowski, K., Ferguson, D., Foster, I., Frey, J., Graham, S.: The WS-Resource Framework Version 1.0,
  7. 7.
    Iamnitchi, A., Foster, I.: On Fully Decentralized Resource Discovery in Grid Environments. In: Proceedings of 2nd IEEE/ACM International Workshop on Grid Computing 2001, pp. 51–62 (2001)Google Scholar
  8. 8.
    Andrzejak, A., Xu, Z.: Scalable, Efficient Range Queries for Grid Information Services. In: Proceedings of IEEE P2P 2002, pp. 33–40 (2002)Google Scholar
  9. 9.
    Huang, L., Wu, Z., Pan, Y.: A Scalable and Effective Architecture for Grid services’ Discovery. In:Proceedings of SemPGRID 2003, pp. 103–115 (2003)Google Scholar
  10. 10.
    Chander, A., Dawson, S., Lincoln, P., et al.: NEVRLATE: Scalable Resource Discovery. In: Proceedings of IEEE/ACM CCGrid 2002, pp. 382–388 (2002)Google Scholar
  11. 11.
    Domenico, T., Paolo, T.: Web Services for Peer-to-Peer Resource Discovery on the Grid. In: DELOS Workshop: Digital Library Architecture, pp. 73–84 (2004) Google Scholar
  12. 12.
    Karl, A., Philippe, C., Anwitaman, D.: P-Grid: A Self-organizing Structured P2P System. ACM SIGMOD Record 32, 29–33 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Yan Zhang
    • 1
  • Yan Jia
    • 1
  • Xiaobin Huang
    • 2
  • Bin Zhou
    • 1
  • Jian Gu
    • 1
  1. 1.School of Computer Science, National University of Defense Technology, Changsha,410073China
  2. 2.Department of Information Engineering, Air Force Radar Academy, Wuhan, 430019China

Personalised recommendations