Efficient application migration under compiler guidance

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient application migration under compiler guidance

Full text

Pdf (234 KB)

Source

ACM SIGPLAN Notices archive
Volume 40 , Issue 7 (July 2005) table of contents
Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems

SESSION: Distributed computing table of contents

Pages: 10 - 20

Year of Publication: 2005

ISSN:0362-1340

Also published in ...

Authors

Kun Zhang	Georgia Institute of Technology, Atlanta, GA
Santosh Pande	Georgia Institute of Technology, Atlanta, GA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 36, Citation Count: 2

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1070891.1065913 What is a DOI?

ABSTRACT

Mobile computing based upon wireless technology as the interconnect and PDAs, Web-enabled cell phones etc. as the end devices provide a rich infrastructure for anywhere, anytime information access. Wireless connectivity also poses tough problems [11, 12]. Network nodes may be mobile and the connectivity could be sporadic. In many cases, application mobility involving migration from one network node to another could provide interesting possibilities. However, the migration process is expensive in terms of both time and power overheads. To minimize the migration cost, an efficient strategy must decide which parts of the program should migrate to continue execution and at which program point the migration should take place.In this work we develop a compiler framework to achieve the above two goals. First, the potential migration points are decided by analyzing the call chains in the code. Then the compiler determines what parts of the program are dead at these points. At run time, using the current context of the call chain, a decision on whether to migrate now or later is taken. Such a decision depends mainly upon the cost of migration involved at the current program point vs. at a later potential migration point. Our experiments with multimedia applications show that both the migration state and the latency are significantly reduced by our techniques over the base case of migration with full state in the absence of any compiler guidance. Thus, the key contribution of the paper is to provide an efficient migration methodology removing barriers to application mobility.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alfonso Fuggetta , Gian Pietro Picco , Giovanni Vigna, Understanding Code Mobility, IEEE Transactions on Software Engineering, v.24 n.5, p.342-361, May 1998 [doi>10.1109/32.685258]
	2	Robin Kravets, Karsten Schwan and Ken Calvert. Power-aware Communication for Mobile Computers. In Mobile Multimedia Communications. 1999.
	3	Rodger Lea, Christian Jacquemot and Chorus systemes. COOL: System Support for Distributed Object-oriented Programming. In IEEE Transactions on Software Engineering. 1993.
	4	Marc Rozier, Chorus, Proceedings of the Workshop on Micro-kernels and Other Kernel Architectures, p.39-70, April 27-28, 1992
	5	Krishna A. Bharat , Luca Cardelli, Migratory applications, Proceedings of the 8th annual ACM symposium on User interface and software technology, p.132-142, November 15-17, 1995, Pittsburgh, Pennsylvania, United States [doi>10.1145/215585.215711]
	6	Bruce Lowekamp , Nancy Miller , Dean Sutherland , Thomas Gross , Peter Steenkiste , Jaspal Subhlok, A Resource Query Interface for Network-Aware Applications, Proceedings of the The Seventh IEEE International Symposium on High Performance Distributed Computing, p.189, July 28-31, 1998
	7	Yeshayahu Artsy , Raphael Finkel, Designing a Process Migration Facility: The Charlotte Experience, Computer, v.22 n.9, p.47-56, September 1989 [doi>10.1109/2.35213]
	8	Fred Douglis , John Ousterhout, Transparent process migration: design alternatives and the sprite implementation, Software—Practice & Experience, v.21 n.8, p.757-785, Aug. 1991 [doi>10.1002/spe.4380210802]
	9	John K. Ousterhout , Andrew R. Cherenson , Frederick Douglis , Michael N. Nelson , Brent B. Welch, The Sprite Network Operating System, Computer, v.21 n.2, p.23-36, February 1988 [doi>10.1109/2.16]
	10	Joseph Tardo , Luis Valente, Mobile Agent Security and Telescript, Proceedings of the 41st IEEE International Computer Conference, p.58, February 25-28, 1996
	11	George H. Forman , John Zahorjan, The Challenges of Mobile Computing, Computer, v.27 n.4, p.38-47, April 1994 [doi>10.1109/2.274999]
	12	Tomasz Imielinski , B. R. Badrinath, Mobile wireless computing: challenges in data management, Communications of the ACM, v.37 n.10, p.18-28, Oct. 1994 [doi>10.1145/194313.194317]
	13	Deborah Estrin , Ramesh Govindan , John Heidemann , Satish Kumar, Next century challenges: scalable coordination in sensor networks, Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, p.263-270, August 15-19, 1999, Seattle, Washington, United States [doi>10.1145/313451.313556]
	14	http://grouper.ieee.org/groups/802/11/index.html
	15	The SimplesSalar - arm power modeling project. http://www.eecs.umich.edu/~panalyzer
	16	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	17	Eric Jul , Henry Levy , Norman Hutchinson , Andrew Black, Fine-grained mobility in the Emerald system, ACM Transactions on Computer Systems (TOCS), v.6 n.1, p.109-133, Feb. 1988 [doi>10.1145/35037.42182]
	18	Bryan Carpenter , Geoffrey Fox , Sung Hoon Ko , Sang Lim, Object serialization for marshalling data in a Java interface to MPI, Proceedings of the ACM 1999 conference on Java Grande, p.66-71, June 12-14, 1999, San Francisco, California, United States [doi>10.1145/304065.304099]
	19	Robert S. Gray , David Kotz , Saurab Nog , Daniela Rus , George Cybenko, Mobile agents for mobile computing, Dartmouth College, Hanover, NH, 1996
	20	ARamon Lawrence. A survey of process migration mechanisms. Technical report, University of Iowa. 1998.
	21	J.M. Smith. A survey of process migration mechanisms. Technical report, Columbia University. 1995.
	22	Chung-Chi Jim Li , Elliot M. Stewart , W. Kent Fuchs, Compiler-assisted full checkpointing, Software—Practice & Experience, v.24 n.10, p.871-886, Oct. 1994 [doi>10.1002/spe.4380241002]
	23	Micah Beck , James S. Plank , Gerry Kingsley, Compiler-Assisted Checkpointing, University of Tennessee, Knoxville, TN, 1994
	24	James S. Plank, Micah Beck and Gerry Kingsley. Compiler-Assisted Memory Exclusion for Fast Checkpointing. In IEEE Technical Committee on Operating Systems and Applications Environments - Special Issue on Fault-Tolerance. 1995.
	25	Chanik Park , Junghee Lim , Kiwon Kwon , Jaejin Lee , Sang Lyul Min, Compiler-assisted demand paging for embedded systems with flash memory, Proceedings of the 4th ACM international conference on Embedded software, September 27-29, 2004, Pisa, Italy [doi>10.1145/1017753.1017775]
	26	Joseph Hall , Jason Hartline , Anna R. Karlin , Jared Saia , John Wilkes, On algorithms for efficient data migration, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.620-629, January 07-09, 2001, Washington, D.C., United States

CITED BY 2

	Kun Zhang , Santosh Pande, Minimizing downtime in seamless migrations of mobile applications, ACM SIGPLAN Notices, v.41 n.7, July 2006
	Greg Bronevetsky , Daniel J. Marques , Keshav K. Pingali , Radu Rugina , Sally A. McKee, Compiler-enhanced incremental checkpointing for OpenMP applications, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming, February 20-23, 2008, Salt Lake City, UT, USA