A DHT-Based Process Migration Policy for Mobile Clusters

A mobile cluster experiences disruption in execution of long-running applications because of its highly dynamic nature. Process migration is a solution for handling such dynamism to have seamless computing with minimal disruption. The challenge in process migration is that it should take considerably less time. This work is a novel effort at such a goal that employs a heap-based super P2P structure for the cluster. The P2P cluster transfers process state in terms of object migration between the peers through the base station. Also, while migrating processes, care is taken to maintain load balancing. As the mobile cluster has heterogeneous nodes with varying processing capabilities, we devise a mechanism for computing the capabilities of these nodes. Considering the capability and current load of the nodes the destination for process migration is chosen.

[1]  Chris Steketee,et al.  Experiences with the Implementation of a Process Migration Mechanism for Amoeba , 1996 .

[2]  Edward R. Zayas,et al.  Attacking the process migration bottleneck , 1987, SOSP '87.

[3]  Shahram Rahimi,et al.  A New High Performance Checkpointing Approach for Mobile Computing Systems , 2006 .

[4]  George Varghese,et al.  Cone: A Distributed Heap-Based Approach to Resource Selection , 2004 .

[5]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[6]  Christine Morin,et al.  Process Migration Based on Gobelins Distributed Shared Memory , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[7]  R. B. Patel,et al.  A Framework for Distributed Dynamic Load Balancing in Heterogeneous Cluster , 2007 .

[8]  Richard M. Karp,et al.  Load balancing in dynamic structured P2P systems , 2004, IEEE INFOCOM 2004.

[9]  Jonathan M. Smith,et al.  A survey of process migration mechanisms , 1988, OPSR.

[10]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[11]  Michael B. Dillencourt,et al.  Efficient Global Pointers With Spontaneous Process Migration , 2008, 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008).

[12]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[13]  Dharma P. Agrawal,et al.  Handoff in wireless mobile networks , 2002 .

[14]  Mukesh Singhal,et al.  Low-Cost Checkpointing and Failure Recovery in Mobile Computing Systems , 1996, IEEE Trans. Parallel Distributed Syst..

[15]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[16]  Guillaume Urvoy-Keller,et al.  Hierarchical Peer-To-Peer Systems , 2003, Parallel Process. Lett..

[17]  Wolfgang Kellerer,et al.  Hybrid DHT Design for Mobile Environments , 2006, AP2PC.

[18]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

[19]  Keith A. Lantz,et al.  Preemptable remote execution facilities for the V-system , 1985, SOSP 1985.

[20]  Mukesh Singhal,et al.  Advanced Concepts In Operating Systems , 1994 .

[21]  D. Janaki Ram,et al.  Anonymous Remote Computing: A Paradigm for Parallel Programming on Interconnected Workstations , 1999, IEEE Trans. Software Eng..

[22]  Maha Abdallah,et al.  Fair load balancing under skewed popularity patterns in heterogeneous DHT-based P2P systems , 2007 .

[23]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[24]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[25]  Dejan S. Milojicic,et al.  Process migration , 1999, ACM Comput. Surv..