A Novel Dynamic Resilient Ensemble Physical Proximity Resource Management Scheme Adopting for Distributed Environments

Abstract:

Heterogeneous grid resources in hand by completely different organization spread throughout the internet or wide area networks. In existing Distributed Hash Table (DHT) is the organization used for that mapping key to the nodes of a network based on a standardized hashing performs. to meet high scalable and dynamism resilient, thence we have a tendency to propose a Grid resource management theme called ranked Cycloid Overlay design (HCO) that\'s data locality-preserving. In HCO, we have a tendency to establish program/data locality by cluster resources based on their physical proximity and practical matching with user application. We have a tendency to any develop dynamism-resilient resource management rule, cluster-token forwarding rule, and deadline-driven resource management algorithms square measure planned. On adopting these algorithms consumes less overhead, speedy, dynamism-resilient multi resource discovery. The well-organized resource cluster, reduces communications price, and enhances resource discovery success rate flexibly extant in large scale applications.

• Periodical: Applied Mechanics and Materials (Volume 573)
• Pages: 576-581
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.573.576
• Online since: June 2014
• Authors: M. Sivalakshmi*, G. Saravanakumar, S. Shanthini Devi
• Keywords: Distributed Hash Table, Multisource Discovery, Ranked Cycloid Overlay

References

[1] D. Karger et al., Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web, " Proc. 29th Ann. ACM Symp. Theory of Computing (STOC , 97), pp.654-663, (1997).

DOI: 10.1145/258533.258660

[2] I. Foster and C. Kesselman, Globus: A Metacomputing Infrastructure Toolkit, " The Int, l J. Supercomputer Applications and High Performance Computing, vol. 11, no. 2, pp.115-128, (1997).

DOI: 10.1177/109434209701100205

[3] J. Frey, I. Foster, M. Livny, and, T. Tannenbaum, S. Tuecke, Condor-G: A Computation Management Agent for Multi institutional Grids, " Proc. IEEE 10th Int, l Symp. High Performance Distributed Computing (HPDC), (2001).

DOI: 10.1109/hpdc.2001.945176

[4] P. Druschel and A. Rowstron, Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems, " Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms Heidelberg (Middleware , 01), (2001).

DOI: 10.1007/3-540-45518-3_18

[5] I. Stoica et al., Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications, IEEE/ACM Trans. Networking, vol. 11, no. 1, pp.17-32, Feb. (2003).

DOI: 10.1109/tnet.2002.808407

[6] F. Berman et al., Adaptive Computing on the Grid Using Apples, IEEE Trans. Parallel Distributed Systems, vol. 14, no. 4, pp.369-382, Apr. (2003).

[7] M. Agrawal, A.R. Bharambe, and S. Seshan, Mercury: Supporting Scalable Multi-Attribute Range Queries, Proc. ACM SIGCOMM, pp.353-366, (2004).

DOI: 10.1145/1030194.1015507

[8] L. Huang, J. Stribling and B.Y. Zhao, , S.C. Rhea, A.D. Joseph, and J. Kubiatowicz, Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing, IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp.41-53, Jan. (2004).

DOI: 10.1109/jsac.2003.818784

[9] R. Nair and J. Smith, Virtual Machines, Virtual Machines: Versatile Platforms for Systems and Processes. Elsevier, (2005).

[10] G. Chen H. Shen, and C. Xu, Cycloid: A Scalable Constant- Degree P2P Overlay Network, Performance Evaluation—P2P Computing Systems, vol. 63, no. 3, pp.195-216, (2006).

DOI: 10.1016/j.peva.2005.01.004