Skip to main content

Implementable Failure Detectors in Asynchronous Systems

  • Conference paper
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1530))

Abstract

The failure detectors discussed in the literature are either impossible to implement in an asynchronous system, or their exact guarantees have not been discussed. We introduce an infinitely often accurate failure detector which can be implemented in an asynchronous system. We provide one such implementation and show its application to the fault-tolerant server maintenance problem. We also show that some natural timeout based failure detectors implemented on Unix are not sufficient to guarantee infinitely often accuracy.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. In: Proc. of the 11th ACM Symposium on Principles of Distributed Computing, August 1992, pp. 147–158 (1992)

    Google Scholar 

  2. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. JACM 43(2), 225–267 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. JACM 33(3), 499–516 (1986)

    Article  MathSciNet  Google Scholar 

  4. Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of the ACM 35(2), 288–323 (1988)

    Article  MathSciNet  Google Scholar 

  5. Fischer, M.J., Lynch, N., Paterson, M.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2) (April 1985)

    Google Scholar 

  6. Garg, V.K., Mitchell, J.R.: Detection of global predicates in a faulty environment. In: Proc. of the IEEE International Conference on Distributed Computing Systems, Amsterdam, May 1998, pp. 416–423 (1998)

    Google Scholar 

  7. Huang, Y., Kintala, C.: Software fault tolerance in the application layer. In: Lyu, M. (ed.) Software Fault Tolerance. Trends in Software, pp. 249–278. Wiley, Chichester (1995)

    Google Scholar 

  8. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Garg, V.K., Mitchell, J.R. (1998). Implementable Failure Detectors in Asynchronous Systems. In: Arvind, V., Ramanujam, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1998. Lecture Notes in Computer Science, vol 1530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49382-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-49382-2_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65384-4

  • Online ISBN: 978-3-540-49382-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics