A Robust Routing Strategy for Efficient Reallocation in Multi-Grid Environment
Keywords:Grid Computing, Grid Reallocation Strategy, Grid-Hadlock Algorithm
Grid Computing is becoming the rising procedure in this ongoing condition. System figuring is the social affair of PC resources from various territories to accomplish a run of the mill objective. The framework can be considered as a spread structure with non-instinctive workloads that incorporate innumerable, the multi-grid environment which provides the multi-tenancy startup for the multiple inputs that is transmitted in the form of the data. The routing strategy which provides the robust reallocation in the grid environment. This paper proposes a Strategic Multi-Reallocation procedure which makes the reallocation in the multi-grid environment. We Propose the Grid-Hadlock Algorithm for the efficient reallocation in the multi-grid environment. The implementation proves the maximum occupancy and its reallocation strategies more efficient. The experimental results proves the phenomenon is more efficient.
 Foster and C. Kesselman, â€œThe Grid: Blue print for a new computing infrastructureâ€, Morgan Kaufmann Publications (1999).
 Foster, C. Kesselman, J. M. Nick and S. Tuecke, â€œThe physiology of the Grid:An open grid services architecture for distributed systems integrationâ€, Grid Forum white paper, 2003.
 Volker Sander, â€œNetworking Issues for Grid Infrastructureâ€, GFD-I.037, Nov,22, 2004.
 I. Foster, C. Kesselman, C. Lee, R. Lindell, K. Nahrstedt, A.Roy. â€œA Distributed Resource Management Architecture that Supports Advance Reservations and Co-Allocationâ€, Intl Workshop on Quality of Service, 1999.
 Raicu, Y. Zhao, C. Dumitrescu, I. Foster, M. Wilde. â€œFalkon:a Fast and Light-weight tas Kexecuti ON frameworkâ€, IEEE/ACM Super Computing 2007.
 The Globus Security Team. â€œGlobus Toolkit Version 4 Grid Security Infrastructure: A Standards Perspective,â€ Technical Report, Argonne National Laboratory, MCS, 2005.
 I. Foster, C. Kesselman. â€œGlobus: A meta computing Infrastructure Toolkitâ€, Intl J. Supercomputer Applications, 11(2):115-128, 1997.
 B. Allcock, J. Bester, J. Bresnahan, A. L. chervenak, I. Foster,C. Kesselman, S. Meder, V. Nefedova, D. Quesnal, S. Tuecke.â€œData Management and Transfer in High Performance Computational Grid Environmentsâ€, Parallel Computing Journal, Vol. 28 (5), May 2002, pp. 749-771.
 J. M. Schopf, I. Raicu, L. Pearlman, N. Miller, C. Kesselman, I.Foster, M.Dâ€™Arcy. â€œMonitoring and Discovery in a Web Services Framework: Functionality and Performance of Globus Toolkit MDS4â€, Technical Report, Argonne National
Laboratory, MCS Preprint #ANL/MCS-P1315-0106, 2006.
 N. Karonis, B. Toonen, and I. Foster. MPICH-G2: A Grid- Enabled Implementation of the Message Passing Interface. Journal of Parallel and Distributed Computing, 2003.
 I. Foster, C. Kesselman, L. Pearlman, S. Tuecke, and V. Welch.â€œThe Community Authorization service: Status and Future,â€ In Proc. of Computing in High Energy Physics (CHEP), 2003.
 Introduction to Grid Computing by Bart Jacob
Michael Brown, Kentaro Fukui, Nihar Trivedi
View Full Article:
How to Cite
LicenseAuthors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under aÂ Creative Commons Attribution Licensethat allows others to share the work with an acknowledgement of the work''s authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal''s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (SeeÂ The Effect of Open Access).