No Access

MOBILE AGENT BASED CHECKPOINTING WITH CONCURRENT INITIATIONS

PARTHA SARATHI MANDAL

INRIA Futurs, Laboratoire de Recherche en Informatique, University Paris Sud, 91405 Orsay cedex, France

Part of this work was done while the author was in Indian Statistical Institute.

Search for more papers by this author

and

KRISHNENDU MUKHOPADHYAYA

Advanced Computing and Microelectronics Unit, Indian Statistical Institute, 203, B T Road, Kolkata - 700 108, India

Search for more papers by this author

https://doi.org/10.1142/S0129054107005157Cited by:2 (Source: Crossref)

Abstract

Traditional message passing based checkpointing and rollback recovery algorithms perform well for tightly coupled systems. In wide area distributed systems these algorithms may suffer from large overhead due to message passing delay and network traffic. Mobile agents offer an attractive option for designing checkpointing schemes for wide area distributed systems. Network topology is assumed to be arbitrary. Processes are mobile agent enabled. When a process wants to take a checkpoint, it just creates one mobile agent. Concurrent initiations by multiple processes are allowed. Synchronization and creation of a consistent global state (CGS) for checkpointing is managed by the mobile agent(s). In the worst case, for k concurrent initiations among n processes, checkpointing algorithm requires a total of O(kn) hops by all the mobile agents. A mobile agent carries O(n/k) (on the average) size data.

Keywords:

References

L. Alvisi, K. Bhatia and K. Marzullo, Distributed Computing 15(1), 1 (2002), DOI: 10.1007/s446-002-8026-7. Crossref, Web of Science, Google Scholar
B. Bhargava and S. R. Lian, Independent checkpointing and concurrent rollback for recovery in distributed systems - an optimistic approach, Proc. 7th IEEE Symp. Reliable Distributed Syst. (1988) pp. 3–12. Google Scholar
J. Cao et al. , Checkpointing and rollback of wide-area distributed applications using mobile agents , Proc. IEEE Int. Parallel and Distributed Processing Symp. ( 2001 ) . Google Scholar
K. M. Chandy and L. Lamport, ACM Trans. on Computer Systems 3(1), 63 (1985), DOI: 10.1145/214451.214456. Crossref, Web of Science, Google Scholar
G. Cao and M. Singhal, IEEE Trans. Parallel and Distributed Syst. 9(12), 1213 (1998). Web of Science, Google Scholar
E. N. Elnozahyet al., ACM Computing Surveys 34(3), 375 (2002), DOI: 10.1145/568522.568525. Crossref, Web of Science, Google Scholar
J. M. Hlaryet al., Distributed Computing 13(1), 29 (2000). Crossref, Web of Science, Google Scholar
D. Johnson and W. Zwaenepoel, J. of Algorithms 3(11), 462 (1990). Google Scholar
J. L. Kin and T. Park, IEEE Trans. Parallel and Distributed Syst. 5(8), 955 (1998). Google Scholar
R. Koo and S. Toueg, IEEE Trans. Software Eng. 13(1), 23 (1987). Web of Science, Google Scholar
F. Mattern, Virtual Time and Global States of Distributed Systems, Proc. of the Workshop on Parallel and Distributed Algorithm (Elsevier Science Publishers B. V., 1989) pp. 215–226. Google Scholar
P. S. Mandal and K. Mukhopadhyaya, Checkpointing and recovery algorithms using mobile agents on a hamiltonian topology, Proc. of 6th Int. Conf. on High Performance Computing in Asia Pacific Region (HPC-2002) (2002) pp. 492–499. Google Scholar
P. S. Mandal and K. Mukhopadhyaya, Journal of Parallel and Distributed Computing (Elsevier) 64(5), 649 (2004), DOI: 10.1016/j.jpdc.2004.03.013. Crossref, Web of Science, Google Scholar
D. Manivannan and M. Singhal, IEEE Trans. Parallel and Distributed Syst. 10(7), 703 (1999), DOI: 10.1109/71.780865. Crossref, Web of Science, Google Scholar
K. Z. Meth and W. G. Tuel, Parallel checkpoint/restart without message logging, Proc. IEEE 28th Int. Conf. on Parallel Processing (2000) pp. 253–258. Google Scholar
T. Osman, W. Wagealla and A. Bargiela, IEEE Trans. on Systems, Man and Cybernetics-Part C: Applications and Reviews 34(1), 48 (2004), DOI: 10.1109/TSMCC.2003.818496. Crossref, Web of Science, Google Scholar
T. Park et al. , The Performance of Checkpointing and Replication Schemes for Fault Tolerant Mobile Agent Systems , Proc. 21th IEEE Symp. on Reliable Distributed Syst ( 2002 ) . Google Scholar
S. Pleisch and A. Schiper, FATOMAS - A fault-tolerant mobile agent system based on the agent-dependent approach, Proc. Int. Conf. on Dependable Systems and networks (2001) pp. 215–224. Google Scholar
R. Prakash and M. Singhal, IEEE Trans. Parallel and Distributed Syst. 7(10), 1035 (1996), DOI: 10.1109/71.539735. Crossref, Web of Science, Google Scholar
R. Prakash and M. Singhal, Maximal global snapshot with concurrent initiators, Proc. Sixth IEEE Symp. Parallel and Distributed Processing (1994) pp. 334–351. Google Scholar
M. Spezialetti and P. Kearns, Efficient distributed snapshots, Proc. of the 6th Int. Conf. on Distributed Computing Syst. (1986) pp. 382–388. Google Scholar
M. Strasser and K. Rothermel , System Mechanism for Partial Rollback of Mobile Agent Execution , Proc. 20th Int. Conf. on Distributed Computing Syst. ( 2000 ) . Google Scholar
R. E. Strom and S. Yemini, ACM Trans. on Computer Syst. 3(3), 204 (1985), DOI: 10.1145/3959.3962. Crossref, Web of Science, Google Scholar
N. H. Vaidya, IEEE Trans. Parallel and Distributed Syst 10(7), 694 (1999), DOI: 10.1109/71.780864. Crossref, Web of Science, Google Scholar
Y.-M. Wang, IEEE Trans. Computers 46(4), 456 (1997), DOI: 10.1109/12.588059. Crossref, Web of Science, Google Scholar