A scalable resource locating service in vega grid

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With the dynamic and heterogeneous characteristics of resources in grid environment, efficient resource locating becomes a challenging issue. We propose an approach to the grid resource locating issue based on globally unique and location-independent virtual name. We implement a distributed locating service-router service, which hides the heterogeneity and dynamism of underlying resources, provides single system imaged interfaces of location-transparent global resource locating. Routers can be interconnected to arbitrary topology. The routing table of all routers maintains global router information. Changes in router information are propagated dynamically to all routers by using an incremental propagation mechanism which decreases communication traffic. The process of resource locating will not exceed three hops according to our two-segmented virtual naming scheme. Caching and replication technology is adopted to increase the efficiency and reliability of resource locating. Performance evaluation shows that, compared to existing locating mechanisms, our approach achieves a better locating efficiency, scalability and adaptability. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Mo, H., Li, Z., & Haozhi, L. (2005). A scalable resource locating service in vega grid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3795 LNCS, pp. 597–608). https://doi.org/10.1007/11590354_78

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free