Advertisement

Virtual precedence in asynchronous systems: Concept and applications

  • Jean-Michel Hélary
  • Achour Mostéfaoui
  • Michel Raynal
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1320)

Abstract

This paper introduces the Virtual Precedence (VP) property. An interval-based abstraction of a computation satisfies the VP property if it is possible to timestamp its intervals in a consistent way (i.e., time does not decrease inside a process and increases after communication). A very general protocol P that builds abstractions satisfying the VP property is proposed. It is shown that the VP property encompasses logical clocks systems and communication-induced checkpointing protocols. A new and efficient protocol which ensures no local checkpoint is useless is derived from P. This protocol compares very favorably with existing protocols that solve the same problem. This shows that, due the generality of its approach, a theory (namely, here VP) can give efficient solutions to practical problems (here the prevention of useless checkpoints).

Keywords

Causality Partial Order Virtual Precedence Logical Clocks Check-pointing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Best, E. and Randell, B. A Formal Model of Atomicity in Asynchronous Systems, Acta Informatica, Vol. 16:93–124, 1981.CrossRefGoogle Scholar
  2. 2.
    Elnozahy, E.N., Johnson, D.B. and Wang, Y.M. A Survey of Rollback-Recovery Protocols in Message-Passing Systems, Technical Report CMU-CS-96-181, Carnegie-Mellon University, 1996.Google Scholar
  3. 3.
    Fidge C.J. Logical Time in Distributed Computing Systems. IEEE Computer, 24(8):11–76, 1991.Google Scholar
  4. 4.
    Lamport, L. Time, Clocks and the Ordering of Events in a Distributed System, Communications of the ACM, 21(7):558–565, 1978.CrossRefGoogle Scholar
  5. 5.
    Manivannan, D. and Singhal, M. A Low Overhead Recovery Technique Using Quasi-Synchronous Checkpointing. Proc. of the 16th Int. Conf. on Distributed Computing Systems, pp. 100–107, Hong-Kong, May 1996.Google Scholar
  6. 6.
    Mattern, F. Virtual Time and Global States of Distributed Systems. In Cosnard et al., Eds, Proc. of the Int. Workshop on Parallel and Distributed Algorithms, France, 1988, pp. 215–226, Elsevier Science Publishers, North Holland, 1989.Google Scholar
  7. 7.
    Netzer, R.H.B. and Xu, J. Necessary and Sufficient Conditions for Consistent Global Snapshots, IEEE Trans. on Par. and Dist. Sys., 6(2):165–169, 1995.CrossRefGoogle Scholar
  8. 8.
    Randell, B. System Structure for Software Fault-Tolerance, IEEE Transactions on Software Engineering, SE1(2):220–232, 1975.Google Scholar
  9. 9.
    Raynal, M. and Singhal, M. Logical Time: Capturing Causality in Distributed Systems. IEEE Computer, 29(2):49–56, February 1996.Google Scholar
  10. 10.
    Russell, D.L. State Restoration in Systems of Communicating Processes, IEEE Trans. on Soft. Eng., SE6(2):183–194, 1980.Google Scholar
  11. 11.
    Wang, Y.M. Consistent Global Checkpoints That Contain a Given Set of Local Checkpoints, IEEE Transactions on Computers, 46(4), April 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Jean-Michel Hélary
    • 1
  • Achour Mostéfaoui
    • 1
  • Michel Raynal
    • 1
  1. 1.IRISA - Campus de BeaulieuRennes CedexFrance

Personalised recommendations