Abstract
The computational grid is rapidly evolving into a large-scale computing infrastructure that facilitates resource sharing and problem solving over the Internet. Information services play a crucial role in grid environments for discovery of resources. The dynamic nature and the large-scale of a grid pose many challenges to information services in terms of scalability and resilience. This paper presents RDSpace which can be used as a substrate for resource discovery in grid environments. RDSpace builds a shared tuple space on top of a structured peer-to-peer overlay to achieve high scalability in dealing with a large number of computing nodes and to support range queries in discovery of resources. Another novelty of RDSpace lies in its capability to handle churn situations where nodes may join or leave the space frequently. RDSpace is evaluated from the aspects of scalability and churn handling, and the evaluation results are also presented in this paper.
Similar content being viewed by others
References
Schopf JM, Pearlman L, Miller N, Kesselman C, Foster I, D’Arcy M, Chervenak A (2006) Monitoring the grid with the Globus Toolkit MDS4. Journal of Physics: Conference Series 46:521–525
Cooke AW et al (2004) The relational grid monitoring architecture: mediating information about the grid. Journal of Grid Computing 2(4):323–339
Cai M, Frank M, Chen J, Szekely P (2004) MAAN: a multi-attribute addressable network for grid information services. Journal of Grid Computing 2(1):3–14
Groep DL, Templon J, Loomis C (2006) Crunching real data on the grid: practice and experience with the European DataGrid. Concurrency and Computation: Practice and Experience 18(9):925–940
Zhang X, Freschl JL, Schopf JM (2007) Scalability analysis of three monitoring and information systems: MDS2, R-GMA, and Hawkeye. J parallel distrib comput 67(8):883–902
Milojicic D S, et al (2002) Peer-to-peer computing. Technical Report, HPL-2002-57, HP Labs
Stoica I et al (2002) Chord: a scalable peer-to-peer lookup protocol for Internet applications. IEEE trans netw 11(1):17–32
Rowstron A, Druschel P (2001) Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proc. of IFIP/ACM Int’l Conference on Distributed Systems Platforms (Middleware), pp. 329–350
Ratnasamy S, Francis P, Handley M, Karp R M, Shenker S (2001) A scalable content-addressable network. In: Proc. of SIGCOMM, pp. 161–172
Foster I, Iamnitchi A (2003) On death, taxes, and the convergence of peer-to-peer and grid computing. In: Proc. of the 2nd International Workshop on P2P Systems, pp. 118–128
Talia D, Trunfio P (2003) Toward a synergy between P2P and grids. IEEE Internet Computing 7(4):94–96
Rhea S, Geels D, Roscoe T, Kubiatowicz J (2004) Handling churn in a DHT. In: Proc. of USENIX Annual Technical Conference, pp 127–140
Oppenheimer D, Albrecht J, Patterson D, Vahdatm A (2004) Distributed resource discovery on Planetlab with SWORD. In: Proc. of the 1st workshop on Real, Large Distributed Systems, 2004
Bharambe A R, Agrawal M, Seshan S (2004) Mercury: supporting scalable multi-attribute range queries. In: Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 353–366
Gelernter David (1985) Generative communication in LINDA. ACM Comput Surv 7(1):80–112
Rowstron Antony, Kermarrec Anne-Marie, Castro Miguel, Druschel Peter (2001) Scribe: the design of a large-scale event notification system. Microsoft Research, Cambridge
Li Z, Parashar M (2005) Comet: a scalable coordination space for decentralized distributed environments. In: Proceedings of 2nd International Workshop on Hot Topics in Peer-to-Peer Systems, San Diego, CA, USA
Murphy Amy L, Picco Gian Pietro, Roman Gruia-Catalin (2006) LIME: a coordination model and middleware supporting mobility of hosts and agents. ACM Trans Softw Eng Methodol 15(3):279–328
Christian Anne, Duarte Marco, Nielson Seth, Pound Andrea, Sandler Dan (2004) Panda: An implementation of generative communication on a structured peer-to-peer overlay. Rice University, Technique Report
Nadia Busi, Cristian Manfredini, Alberto Montresor, Gianluigi Zavattaro (2003) PeerSpaces: data-driven coordination in peer-to-peer networks. In: Proceedings of the 18th Annual ACM Symposium on Applied Computing, pp. 380–386
Wang Chia-Wei, Hsiao Hung-Chang, Sun Wen-Hung, King Chung-Ta, Sun Ming-Tsung (2007) Building a tuple space on structured peer-to-peer networks. The Journal of Supercomputing 40(3):213–227
Hsiao Hung-Chang, King Chung-Ta, Wang Chia-Wei (2005) TYPHOON: mobile distributed hash tables. J parallel distrib comput 65(2):191–206
Antony Rowstron and Peter Druschel (2001) Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In: Proceedings of the 18th ACM SOSP’01, Lake Louise, Alberta, Canada
Cristina Schmidt and Manish Parashar (2004) Analyzing the search characteristics of space filling curve-based indexing within the squid P2P data discovery system. Rutgers University, Technique Report
Schmidt Cristina, Parashar Manish (2004) Enabling flexible queries with guarantees in p2p systems. IEEE Internet Computing 8(3):19–26
Acknowledgement
The authors would like to thank Jochen Palmer for his contribution to the work.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, M., Qi, M. Facilitating resource discovery in grid environments with peer-to-peer structured tuple spaces. Peer-to-Peer Netw. Appl. 2, 283–297 (2009). https://doi.org/10.1007/s12083-009-0036-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12083-009-0036-8