Enterprises are looking at Grid computing as a technology of enormous potential. However, there are several issues which require immediate attention before Grid can become an important component of the IT infrastructure. One such issue is migration of legacy applications to the Grid environment. In such cases, it becomes imperative to understand whether the application performance would significantly improve on migration. In this paper an attempt is made to provide a systematic framework called the Grid Application Migration Framework (GAMF) for handling the migration process. The framework consists of Grid Code Analyzer (GCA), an independently deployable component which generates a Directed Acyclic Graph (DAG). The paper also proposes a DAG reducer algorithm for reducing the DAG. The framework is tested with several proprietary and open source C as well as Java codes. In the paper, we take three sample open source applications and demonstrate the usefulness of the framework. Finally, a small sample is analyzed and recoded to show that validity of the proposed mechanisms.
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
W. Gropp, E. Lusk and A. Skjellum. Using MPI, 2nd edition MIT Press, Nov 1999.
A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM: Parallel Virtual Machine - A User’s Guide and Tutorial for Networked Parallel Programming MIT Press, May 1994.
L. Dagum and R. Menon. OpenMP: An Industry-Standard API for Shared-Memory Programming IEEE Computational Science and Engineering vol. 5, no. 1, Jan 1998.
T. Yang and A. Gerasoulis. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. Parallel Distrib. Syst., vol. 5, no. 9 pages 951-967, Sept 1994.
V. Sarkar. Patitioning and Scheduling Parallel Programs for Multiprocessors May 1989.
J.J. Hwang, Y-C. Chow, F.D. Anger and C.Y. Lee. Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Comput., vol. 18, Apr 1989.
Y-K. Kwok and I. Ahmed. Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys, vol. 31, no. 4, Dec 1999.
T.G. Lewis and H. El-Rewini. Parallax: A Tool for Parallel Program Scheduling. IEEE Parallel and Distributed Technology, vol. 1, no. 3, pages 62-72, May 1993.
T. Yang and A. Gerasoulis. PYRROS: Static Task Scheduling and Code Generation for Message-Passing Multiprocessors. Proc. 6th ACM Int’l Conf. SuperComputing, pages 428-433, ACM Press, New York, 1992.
P-Grade Team. Parallel Grid Runtime and Application Development Environment. User’s Manual Version 8.4.2, http://www.lpds.sztaki.hu/smith/pgrade-manual/manual.html, accessed on 21st April, 2006.
I. Ahmed, Y-K. Kwok, M-Y. Wu, and W. Shu. CASCH: A Tool for Computer-Aided Scheduling IEEE Concurrency, Oct 2000.
R. Nallan, A. Chakrabarti, S. Sengupta, and A. Upadhyay. A Systematic Approach for Application Migration in a Grid Computing Environment. Asia Pacific Services Computing Conf.(APSCC), China, Dec 2006.
http://www.acm.inf.ethz.ch/ProblemSetArchive/BEU SWERC/1998/index.html.
A.Gerasoulis and T. Yang. On the granularity and clustering of directed acyclic task graphs. IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 6, June 1993.
Javasim available at http://javasim.ncl.ac.uk/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this paper
Cite this paper
Enaganti, S.K., Damodaran, A., Chakrabarti, A. (2007). A Framework for Analysis of Legacy Code Migration to Grid Environment. In: Priol, T., Vanneschi, M. (eds) Towards Next Generation Grids. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-72498-0_20
Download citation
DOI: https://doi.org/10.1007/978-0-387-72498-0_20
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-72497-3
Online ISBN: 978-0-387-72498-0
eBook Packages: Computer ScienceComputer Science (R0)