Skip to main content
SpringerLink
Log in

Optimal Approximate Agreement with Omission Faults

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1998)

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

Included in the following conference series:

Abstract

Approximate agreement is a building block for fault-tolerant distributed systems. It is a formalisation for the basic operation of choosing a single real value (representing say speed) for use in later computation, refleecting the different approximations to this value reported from a number of possibly-faulty processors or sensors. We develope a new algorithm that can tolerate up to o send-omission faults. We analyse the convergence attained by this algorithm, and also give a matching universal bound on the convergence available to any algorithm no matter how complicated.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. M. Azadmanesh, R. Kieckhafer, New Hybrid Fault Models for Asynchronous Approximate AgreementIEEE Trans on Computers, 45(4):439–4491996

    Article  MATH  Google Scholar 

  2. D. Dolev, N. Lynch, S. Pinter, E. Stark, W. Weihl, Reaching Approximate Agreement in the Presence of Faults, Journal of the ACM, 33(3)499–516, 1986.

    Article  MathSciNet  Google Scholar 

  3. A. Fekete, Asymptotically Optimal Algorithms for Approximate AgreementDistributedComputing 49–291990

    Article  MathSciNet  Google Scholar 

  4. A. Fekete, Asynchronous Approximate AgreementInformation and Computation 115(1):95–1241994

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Fischer, N. Lynch, A Lower Bound for the Time to Assure Interactive ConsistencyInformation Processing Letters 14(4):183–1861982.

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Fischer, N. Lynch, M. Patterson, Impossibility of Distributed Consensus withOne Faulty ProcessJournal of the ACM, 32(2):374–3821985.

    Article  MATH  Google Scholar 

  7. R. Kieckhafer, M. Azadmanesh, Reaching Approximate Agreement with Mixed-Mode FaultsIEEE Trans on Parallel and Distributed Systems, 5(1)53–631994.

    Article  MathSciNet  Google Scholar 

  8. M. Pease, R. Shostak, L. Lamport, Reaching Agreement in the Presence of FaultsJournal of the ACM 27(2):228–2341980.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Sydney, Australia

    Richard Plunkett & Alan Fekete

Authors
  1. Richard Plunkett
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan Fekete
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Korea Advanced Institute of Science and Technology, 373-1, Kusong-dong, Yusong-gu, Taejon, 305-701, Korea

    Kyung-Yong Chwa

  2. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plunkett, R., Fekete, A. (1998). Optimal Approximate Agreement with Omission Faults. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-49381-6_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65385-1

  • Online ISBN: 978-3-540-49381-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation