Advertisement

Time is not a healer

Preliminary version
  • Nicola Santoro
  • Peter Widmayer
Contributed Papers Fault Tolerance
Part of the Lecture Notes in Computer Science book series (LNCS, volume 349)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Birman, K., and Joseph, T. Reliable communication in the presence of failures. ACM Trans. Comp. Syst. 5, 1 (Feb. 1987).Google Scholar
  2. [2]
    Burns, J., and Lynch, N.A. The Byzantine firing squad problem. In Adv. Comp. Res., Vol 4: Parallel and Distributed Computing, JAI Press Inc., Greenwich, Connecticut, 1987.Google Scholar
  3. [3]
    Coan, B., Dolev, D., Dwork, C., and Stockmeyer, L. The distributed firing squad problem. In Proc. 17th ACM Symp. on Theory of Computing, Providence, May 1984, 335–345.Google Scholar
  4. [4]
    Dolev, D. The Byzantine Generals strike again. J. Algorithms 3, 1 (1982), 14–30.Google Scholar
  5. [5]
    Dolev, D., Dwork, C., and Stockmeyer, L. On the minimal synchronism needed for distributed consensus. J. ACM 34, 1 (Jan. 1987), 77–97.Google Scholar
  6. [6]
    Dolev, D., Fisher, M.J., Fowler, R., Lynch, N.A., and Strong, H.R. Efficient Byzantine agreement without authentication. Inf. Control 52, 3 (1982), 256–274.Google Scholar
  7. [7]
    Dolev, D., Halpern, J.Y., and Strong, H.R. On the possibility and impossibility of achieving clock synchronization. In Proc. 16th ACM Symp. on Theory of Computing, Washington, May 1984, pp. 504–510.Google Scholar
  8. [8]
    Dolev, D. and Strong, H.R. Authenticated algorithms for Byzantine agreement. SIAM J. Computing 12, 4 (Nov. 1983), 656–666.Google Scholar
  9. [9]
    Dwork, C., Lynch, N.A., and Stockmeyer, L. Consensus in the presence of partial synchrony. J. ACM 35, 2 (April 1988), 288–323.Google Scholar
  10. [10]
    Fisher, M.J. The consensus problem in unreliable distributed systems (a brief survey). Dept.Comp. Sci. Tech. Rep. 273, Yale University, June 1983.Google Scholar
  11. [11]
    Fisher, M.J., Lynch, N.A., and Paterson, M. Impossibility of distributed consensus with one faulty process. J.ACM 32, 2 (April 1985), 374–382.Google Scholar
  12. [12]
    Hadzilacos, V. Connectivity requirements for Byzantine agreement under restricted types of failures. Distributed Computing 2, 1987, 95–103.Google Scholar
  13. [13]
    Halpern, J.Y., Simons, B., Strong, H.R., and Dolev, D. Fault tolerant clock synchronization. In Proc. 3rd ACM Symp. on Principles of Distributed Computing, Vancouver, Aug. 1984, 89–102.Google Scholar
  14. [14]
    Lamport, L. The weak Byzantine Generals problem. J.ACM 30, (July 1983), 668–676.Google Scholar
  15. [15]
    Lamport, L., and Melliar-Smith, P.M. Synchronizing clocks in presence of faults. J.ACM 32, 1 (Jan. 1985), 52–78.Google Scholar
  16. [16]
    Lamport, L., Shostak, R., and Pease, M. The Byzantine Generals problem. ACM Trans. Prog. Lang. Syst. 4, 3 (July 1982), 382–401.Google Scholar
  17. [17]
    Ling, F., and Kameda, T. Byzantine agreement under network failures. Tech. Rep.LCCR-87-18, Simon Fraser University, 1987.Google Scholar
  18. [18]
    Lundelius, J. and Lynch, N.A. A new fault-tolerant algorithm for clock synchronization. Inf. Control 62, 2 (1984), 190–204.Google Scholar
  19. [19]
    Moran, S., and Wolfstahl, Y. An extended impossibility result for asynchronous complete networks. Tech. Rep. 408, Technion, April 1986.Google Scholar
  20. [20]
    Pease, M., Shostak, R., and Lamport, L. Reaching agreement in presence of faults. J.ACM 27, 2 (April 1980), 228–234.Google Scholar
  21. [21]
    Perry, K.J. A framework for agreement. In Proc. 2nd Int. Workshop on Distributed Algorithms, Amsterdam, July 1987, 57–75.Google Scholar
  22. [22]
    Perry, K.J., and Toueg, S. Distributed agreement in the presence of processor and communication faults. IEEE Trans. Software Engineering SE-12, 3 (March 1986)Google Scholar
  23. [23]
    Santoro, N., and Widmayer, P. Distributed function evaluation in presence of transmission faults. Tech. Rep. SCS-TR-144, Carleton University, Nov. 1988.Google Scholar
  24. [24]
    Santoro, N., and Widmayer, P. Fault intolerance of synchronous networks. Tech. Rep. SCS-TR-145, Carleton University, Nov. 1988.Google Scholar
  25. [25]
    Srikanth, T.K., and Toueg, S. Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distributed Computing 2, (1987), 80–94.Google Scholar
  26. [26]
    Taubenfeld, G. Impossibility results for decision protocols. Memorandum, Technion, Jan. 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Nicola Santoro
    • 1
    • 2
  • Peter Widmayer
    • 3
  1. 1.Carleton UniversityCanada
  2. 2.Universitá di BariItaly
  3. 3.Karlsrruhe UniversityWest Germany

Personalised recommendations