Abstract
Several features of today’s grid are based on centralized or hierarchical services. However, as the grid size increasing, some of their functions especially resource discovery should be decentralized to avoid performance bottlenecks and guarantee scalability. A novel grid resource discovery method based on adaptive k-Nearest Neighbors clustering is presented in this paper. A class is formed by a collection of nodes with some similarities in their characteristics, each class is managed by a leader and consists of members that serve as workers. Resource requests are ideally forwarded to an appropriate class leader that would then direct it to one of its workers. This method can handle resource requests by searching a small subset out of a large number of nodes by resource clustering which can improve the resource query efficiency; on the other hand, it also achieves well scalability by managing grid resources with adaptive mechanism. It is shown from a series of experiments that the method presented in this paper achieves more scalability and efficient lookup performance than other existing methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Globus project: http://www.globus.org
Raman, R., Livny, M., Solomon, M.: Matchmaking: Distributed Resource Management for High Throughput Computing. In: Proc. of the 7th IEEE HPDC, Washington DC, pp. 140–146. IEEE Computer Society Press, Los Alamitos (1998)
Iamnitchi, A., Foster, I.: On Fully Decentralized Resource Discovery in Grid Environments. In: Lee, C.A. (ed.) GRID 2001. LNCS, vol. 2242, pp. 51–62. Springer, Heidelberg (2001)
Chapin, S.J., Katramatos, D., Karpovich, J., Grimshaw, A.: Resource Management in Legion. Future Generation Computer System 5, 583–594 (1999)
Czajkowski, K., Ferguson, Foster, I., et al.: The WS-Resource Framework Version 1.0. http://www-106.ibm.com/developerworks/library/ws-resource/ws-wsrf.pdf
Hauswirth, M., Schmidt, R.: An Overlay Network for Resource Discovery in Grids. In: Andersen, K.V., Debenham, J., Wagner, R. (eds.) DEXA 2005. LNCS, vol. 3588, pp. 343–348. Springer, Heidelberg (2005)
Li, W., Xu, Z., Dong, F., Zhang, J.: Grid Resource Discovery Based on a Routing-transferring Model. In: Parashar, M. (ed.) GRID 2002. LNCS, vol. 2536, pp. 145–156. Springer, Heidelberg (2002)
Anand, P., Shaowen, W., Sukuma, G.: A Self-organized Grouping (SOG) Method for Efficient Grid Resource Discovery. In: Proceedings of the The 6th IEEE/ACM International Workshop on Grid Computing, Washington, pp. 312–317. ACM Press, New York (2005)
Bian, Z.Q., Zhang, X.G.: Pattern Recognition. The Publishing Company of Tsinghua University, Bei Jin (1999)
Iamnitchi, A., Foster, I., Numi, D.: A Peer-to-Peer Approach to Resource Location in Grid Environments. In: Proceedings of the 11th Symposium on High Performance Distributed Computing, Edinburgh, Scotland, pp. 413–429 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Y., Jia, Y., Huang, X., Zhou, B., Gu, J. (2007). A Grid Resource Discovery Method Based on Adaptive k-Nearest Neighbors Clustering. In: Dress, A., Xu, Y., Zhu, B. (eds) Combinatorial Optimization and Applications. COCOA 2007. Lecture Notes in Computer Science, vol 4616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73556-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-73556-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73555-7
Online ISBN: 978-3-540-73556-4
eBook Packages: Computer ScienceComputer Science (R0)