Abstract
The Gridtec hnology emerges with the need of resource sharing and cooperation in wide area. Comparedwith the traditional single computer system, effective resource locating in Gridis difficult because of huge amount and wide-area distribution of dynamical resources. In this paper, we propose a Routing-Transferring resource discovery model, which includes three basic roles: the resource requester, the resource router and the resource provider. The provider sends its resource information to a router, which maintains this information in routing tables. When a router receives a resource request from a requester, it checks routing tables to choose a route for it andtransfer it to another router or provider. We give the formalization of this model and analyze the complexity of the SD-RT (Shortest Distance Routing-Transferring) algorithm. The analysis shows that the resource discovery time depends on topology (the longest path in the graph) and distribution of resources. When topology and distribution are definite, the SD-RT algorithm can find a resource in the shortest time. Our experiments also show that when topology is definite, the performance is determined by resource distribution, which includes two important factors: resource frequency andresource location. The testing result shows that high frequency and even location of resources can reduce the resource discovery time significantly.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. J._Chapin, D. Katramatos, J. Karpovich, A. Grimshaw: Resource Management in Legion. Future Generation Computer Systems, Vol. 15, No. 5, pp. 583594, 1999.
K. Czajkowski, S. Fitzgerald, I. Foster, C. Kesselman: Grid Information Services for DistributedResource Sharing. Proc. of the 10th IEEE Int’l Symp. on High Performance DistributedComputing(2001).
I. Foster, C. Kesselman (ed.): The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers(1998).
A. Iamnitchi, I. Foster: On Fully Decentralized Resource Discovery in GridEn vironments. International Workshop on GridComputing, Denver, CO, 2001.
J. Postel (ed.): Internet Protocol: DARPA internet program protocol specification. RFC791, September 1981.
R. Raman, M. Livny, M. Solomon: Matchmaking: DistributedResource Management for High Throughput Computing. Proc. of IEEE Intl. Symp. on High Performance DistributedComputing, Chicago, USA(1998).
Z. Xu, W. Li: HPC Research in China andthe Vega Grid Project. Keynote Speech, Proc. HPC Asia 2002, Bangalore, India, 2002.
Z. Xu, W. Li, H. Fu, Z. Zeng: The Vega Grid and Grid-BasedEd ucation. The 1st International Conference on Web-BasedLearning, HK, China, 2002.
Z. Xu, N. Sun, D. Meng, W. Li: Cluster and Grid Superservers: The Dawning Experience in China. Proc. of the 3rd IEEE International Conference on Cluster Computing(2001).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, W., Xu, Z., Dong, F., Zhang, J. (2002). Grid Resource Discovery Based on a Routing-Transferring Model. In: Parashar, M. (eds) Grid Computing — GRID 2002. GRID 2002. Lecture Notes in Computer Science, vol 2536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36133-2_13
Download citation
DOI: https://doi.org/10.1007/3-540-36133-2_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00133-1
Online ISBN: 978-3-540-36133-6
eBook Packages: Springer Book Archive