A failsafe scheme for replicated information

  • R. Kerboul
  • R. Kung
  • F. Richard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 312)


This paper presents a distributed algorithm for managing replicated information with strong response time requirements but no serial consistency constraints. Replicated information may temporary differ while data copies are updated. However, the copies eventually converge when data modifications cease. The algorithm is failsafe against node failures, node insertions and partitioning.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Allchin 83]
    J.E. ALLCHIN "A suite of robust algorithms for maintaining replicated data using weak consistency conditions" Proc. of the 3rd Symp. on Reliability in Distributed Software and Database Systems, 1983, pp 47–56.Google Scholar
  2. [Alsberg 76]
    P.A. ALSBERG, J.D. DAY "A principle for resilient sharing of distributed resources" Proc. of the 2nd Int. Conf. on Software Engineering, San Francisco, October 1976, pp. 627–644.Google Scholar
  3. [André 82]
    J.P. ANDRE, J.C. PETIT "Dynamic software reconfiguration in a distributed system (Galaxie)" Proc. of the Int. Conference on Communications, Philadelphia, June 1982.Google Scholar
  4. [Bernstein 81]
    P.A. BERNSTEIN, N. GOODMAN "Concurrency control in distributed database systems" ACM Computing Surveys, Vol. 13, No 2, June 1981, pp 185–221.CrossRefGoogle Scholar
  5. [Bernstein 83]
    P.A. BERNSTEIN, N. GOODMAN "The failure and recovery for replicated databases" Proc. 2nd ACM Symposium on Principles of Distributed Computing, Montreal, August 1983, pp 114–121.Google Scholar
  6. [Daniels 83]
    D. DANIELS, A.Z. SPECTOR "An algorithm for replicated directories" Proc. of the 2nd ACM Symposium on Principles of Distributed Computing, August 1983. Also appears in ACM Operating Systems Review, Vol. 20, No 1, January 1986, pp. 24–43.Google Scholar
  7. [Fischer 82]
    M.J. FISCHER, A. MICHAEL "Sacrificing serializability to attain high availability of data in an unreliable network" Proc. of ACM Symp. on Principles of Database Systems, Los Angeles, March 1982, pp. 70–75.Google Scholar
  8. [Garcia 82a]
    H. GARCIA-MOLINA "Elections in a distributed computing system" IEEE Trans. on Computers, Vol. 31, No 1, January 1982, pp. 48–59.Google Scholar
  9. [Garcia 82b]
    H. GARCIA-MOLINA, G. WIEDERHOLD "Read-only transactions in a distributed database" ACM Trans. on Database Systems, Vol. 7, No 2, June 1982, pp. 209–234.CrossRefGoogle Scholar
  10. [Gifford 79]
    D.K. GIFFORD "Weighted voting for replicated data" Proc. of 7th Symp. on Operating Systems Principles, Pacific Grove, December 1979, pp. 150–162.Google Scholar
  11. [Jajodia 87]
    S. JAJODIA, C.A. MEADOWS "Mutual consistency in decentralized distributed systems" Proc. of 3rd Int. Conf. on Data Engineering, Los Angeles, February 1987, pp 396–404.Google Scholar
  12. [Kerboul 87]
    R. KERBOUL "Some aspects of replication in distributed systems" Thesis, Université de Rennes I, forthcoming.Google Scholar
  13. [Kung 85]
    A. KUNG, R. KUNG "GALAXY: a distributed real-time operating system supporting high availability" Proc. of the IEEE Int. Conf. on Real-Time Systems, San Diego, December 1985, pp. 79–87.Google Scholar
  14. [Lamport 78]
    L. LAMPORT "Time, clocks and the ordering of events in a distributed system" Communications of ACM, Vol. 21, No 7, July 1978, pp. 558–565.CrossRefGoogle Scholar
  15. [Leach 83]
    P.J. LEACH, P.H. LEVINE, B.P. DOUROS, J.A. HAMILTON, D.L. NELSON, B.N. STUMPF "The architecture of an integrated local network" IEEE Journal on Selected Areas in Communications, Vol. 1, No 5, November 1983, pp. 842–857.Google Scholar
  16. [Sarin 85]
    S.K. SARIN, B.T. BLAUSTEIN, C.W. KAUFMAN "System architecture for partition-tolerant distributed databases" IEEE Trans. on Computers, Vol. 34, No 12, December 1985, pp. 1158–1163.Google Scholar
  17. [Sarin 86]
    S.K. SARIN "Robust application design in highly available distributed databases" Proc. of the 5th Symp. on Reliability in Distributed Software and Database Systems, Los Angeles, January 1986, pp. 87–94.Google Scholar
  18. [Schlichting 83]
    R. SCHLICHTING, F. SCHNEIDER "FAil-stop processors: an approach to designing fault-tolerant distributed computing systems" ACM Trans. on Computer Systems, Vol. 1, No 3, August 1983, pp. 222–238.CrossRefGoogle Scholar
  19. [Thomas 79]
    R.H. THOMAS "A majority consensus approach to concurrency control for multiple copy databases" ACM Trans. on Database Systems, Vol. 4, No 2, June 1979, pp. 180–209.CrossRefGoogle Scholar
  20. [Wuu 84]
    G.T.J. WUU, A.J. BERNSTEIN "Efficient solutions to the replicated log and dictionary problems" Proc. of the 3rd ACM Symp. on Principles of Distributed Computing, Vancouver, August 1984, pp. 233–242. Also appears in ACM Operating System Review, Vol. 20, No 1, January 1986, pp. 57–66.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • R. Kerboul
    • 1
  • R. Kung
    • 2
  • F. Richard
    • 3
  1. 1.CNET LAA/SLC/LSRLannionFrance
  2. 2.CNET PAA/CLC/CERIssy-les-MoulineauxFrance
  3. 3.CNET LAA/SLC/LSRLannionFrance

Personalised recommendations