A hybrid message logging-CIC protocol for constrained Checkpointability

Lecture Notes in Computer Science

Volumn 3648, Issue , 2005, Pages 644-653

  Baude, Françoise ^a   Caromel, Denis ^a   Delbé, Christian ^a   Henrio, Ludovic ^a,b  

^a INRIA   (France)

^b UNIVERSITY OF WESTMINSTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; JAVA PROGRAMMING LANGUAGE; MIDDLEWARE;

CHECKPOINTABLE PROCESSES; COMMUNICATION INDUCED CHECKPOINTING PROTOCOLS; DISTRIBUTED OBJECTS; MESSAGE RECEPTION;

NETWORK PROTOCOLS;

EID: 27144556171     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549468_71     Document Type: Conference Paper

References (19)

1. Aglets Software Development Kit. IBM, 1999. http://www.trl.ibm.com/aglets/.
2. B.Ramkumar and V.Strumpen. Portable checkpointing for heterogenous architectures. In Fault-Tolerant Parallel and Distributed Systems, pages 73-92, 1998.
3. C.Delbé. Causal ordering of asynchronous request services. In Dependable Systems and Networks - Student Forum. IEEE, June 2004.
4. B. Charron-Bost, F. Mattern, and G. Tel. Synchronous, asynchronous, and causally ordered communications. Distributed Computing, 9(4):173-191, 1996.
5. D.Briatico, A.Ciuffoletti, and L.Simoncini. A distributed domino-effect free recovery algorithm. In IEEE International Symposium on Reliability, Distributed Software, and Databases, pages 207-215, 1984.
6. D.Caromel, L.Henrio, and B.Serpette. Asynchronous and deterministic objects. In 31st ACM Symposium on Principles of Programming Languages. ACM Press, 2004.
7. D.Caromel, W.Klauser, and J.Vayssiere. Towards seamless computing and meta-computing in Java. In Geoffrey C. Fox, editor, Concurrency Practice and Experience, volume 10, pages 1043-1061. Wiley & Sons, Ltd., November 1998.
8. D.Manivannan and M.Singhal. A low-overhead recovery technique using quasi-synchronous checkpointing. In Proceedings of the 16th ICDCS, pages 100-107, 1996.
9. D.Manivannan and M.Singhal. Quasi-synchronous checkpointing: Models, characterization, and classification. In IEEE Transactions on Parallel and Distributed Systems, volume 10, pages 703-713, 1999.
10. F.Baude, D.Caromel, C.Delbé, and L.Henrio. A fault tolerance protocol for asp calculus: Design and proof. Technical Report RR-5246, INRIA, 2004.
11. G.Bronevetsky, D.Marques, K.Pingali, and P.Stodghill. Automated applicationlevel checkpointing of mpi programs. SIGPLAN Not., 38(10):84-94, 2003.
12. J.C.Ruiz-Garcia, M.O.Killijian, J.C.Fabre, and S.Chiba. Optimized object state checkpointing using compile-time reflection. In Workshop on Embedded Fault-Tolerant Systems, pages 46-48, 1998.
13. J.Howell. Straightforward Java persistence through checkpointing. In Proceedings of the 3rd International Workshop on Persistence and Java, pages 322-334, 1998.
14. J.S.Plank, M.Beck, G.Kingsley, and K.Li. Libckpt: Transparent checkpointing under Unix. In Usenix Winter Technical Conference, pages 213-223, January 1995.
15. L.Alvisi, E.N.Elnozahy, S.Rao, S.Husain, and A.De Mel. An analysis of communication induced checkpointing. In Symposium on Fault-Tolerant Computing, pages 242-249, 1999.
16. R.D.Schlichting and F.B.Schneider. Fail-stop processors: an approach to designing fault-tolerant computing systems. In ACM Transactions on Computer Systems, volume 1, pages 222-238, 1983.
17. R.E.Strom and S.Yemini. Optimistic recovery in distributed systems. In ACM Transactions on Computer Systems, volume 3, pages 204-226, 1985.
18. S.Bouchenak. Pickling threads state in the Java system. In Third European Research Seminar on Advances in Distributed Systems, 1999.
19. T.D.Chandra and S.Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, 1996.