L. Alvisi and K. Marzullo. Deriving optimal checkpointing protocols for distributed shared memory architectures. In K. Birman, F. Mattern, and A. Schiper, editors, Selected Papers, International Workshop in Theory and Practice in Distributed Systems, pages 111--120. SpringerVerlag, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Understanding The Message Logging Paradigm For Masking Process.. - Alvisi (1996) (4 citations) Self-citation (Alvisi) (Correct)
....it provides. We hope to show that these conditions can be easily specialized for each individual memory coherency model to obtain fault tolerant protocols that are optimal according to definitions similar to those given in Chapter 5. Some preliminary results in this direction are presented in [AM94a] Appendix A Three FBL Logging Components This Appendix contains a detailed description of an implementation of the logging components of Pi Det , Pi jLogj and Pi Log assuming a system N of n processes, of which at most f can fail concurrently. Section A.1 discusses the data ....
L. Alvisi and K. Marzullo. Deriving optimal checkpointing protocols for distributed shared memory architectures. In K. Birman, F. Mattern, and A. Schiper, editors, Selected Papers, International Workshop in Theory and Practice in Distributed Systems, pages 111--120. SpringerVerlag, 1994.
Trade-Offs in Implementing Causal Message Logging Protocols - Alvisi, Marzullo (1996) (4 citations) Self-citation (Alvisi Marzullo) (Correct)
....completely implemented is Pi Det [4] We are currently implementing the complete FBL family in order to understand better under what circumstances the simpler protocols are the more efficient ones. We have also extended the message logging specification to distributed shared memory architectures [2] and have designed optimal FBL protocols for the entry consistency memory coherency model [6] Acknowledgments We would like to thank Bruce Hoppe and Fred Schneider for their help in refining our ideas and Wanda Chiu for her detailed comments on our work. We would also like to thank Mootaz ....
L. Alvisi and K. Marzullo. Deriving optimal checkpointing protocols for distributed shared memory architectures. In Selected Papers, International Workshop in Theory and Practice in Distributed Systems, pages 111--120. Springer--Verlag, 1995.
Trade-Offs in Implementing Optimal Message Logging Protocols - Alvisi, Marzullo (1996) (5 citations) Self-citation (Alvisi Marzullo) (Correct)
....implemented is Pi 0 (1) AHM93] We are currently implementing the complete FBL family in order to understand better under what circumstances the simpler protocols are the more efficient ones. We have also extended the message logging specification to distributed shared memory architectures [AM94a] and have designed optimal FBL protocols for the entry consistency memory coherency model [BZS93] 2 The later version of Manetho is described in [Eln93] but the presentation there is ambiguous. According to the pseudocode, the protocol piggybacks AG(q[j 0 ] Gamma AG(p[i] which is still ....
L. Alvisi and K. Marzullo. Deriving optimal checkpointing protocols for distributed shared memory architectures. Submitted for publication, November 1994.
A Survey of Rollback-Recovery Protocols in.. - Elnozahy, Alvisi.. (1996) (161 citations) Self-citation (Alvisi) (Correct)
....It is generally undecidable to find the point in program execution most suitable to take a checkpoint. There are, however, several heuristics that can be used. The programmer can provide hints to the compiler about where checkpoints should be inserted or what data variables should be stored [8][44] The compiler may also be trained by running the application in an iterative manner and observing its behavior [36] The observed behavior could help decide the execution points where it would be appropriate to insert checkpoints. Compiler support could also be simplified in languages that ....
....Muller. Ensuring data security and integrity with a fast stable storage. In Proceedings of the fourth Conference on Data Engineering, pp. 285 293, Feb. 1988. 7] J.F. Bartlett. A Non Stop Kernel. In Proceedings of the 8 th ACM Symposium on Operating Systems Principles, pp. 22 29, 1981. [8] A. Beguelin, E. Seligman and P. Stephan. Application level fault tolerance in heterogeneous networks of workstations. In Journal Parallel Distributed Computing, 43(2) 147 155, Jun. 1997. 9] B. Bhargava and S. R. Lian. Independent checkpointing and concurrent rollback for recovery An ....
L. Alvisi and K. Marzullo. "Deriving optimal checkpointing protocols for distributed shared memory architectures." In Proceedings of the 1995 ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing Systems (PODC), pp. 263. Aug. 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC