Skip to main content
SpringerLink
Log in

Objects Shared by Byzantine Processes

(Extended Abstract)

  • Conference paper
  • First Online:
Distributed Computing (DISC 2000)

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

Included in the following conference series:

Abstract

Work to date on algorithms for message-passing systems has explored a wide variety of types of faults, but corresponding work on shared memory systems has usually assumed that only crash faults are possible. In this work, we explore situations in which processes accessing shared objects can fail arbitrarily (Byzantine faults).

School of Comuter Science and Engineering, The Hebrew University of Jerusalem, Israel. daliaacs@cs.huji.ac.il

AT&T Labs, 180 Park Ave., Florham Park, NJ 07932-0971. mischu@research.att.com

Bell Laboratories, Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ 07974. reiter@research.bell-labs.com

The Open University, 16 Klausner st., P.O.B. 39328, Tel-Aviv 61392, Israel, and AT&T Labs. gadi@cs.openu.ac.il

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. P.C. Attie Wait-free Byzantine Agreement. Technical ReportNU-CCS-00-02, College of Computer Science, Northeastern University, May 2000.

    Google Scholar 

  2. Y. Afek, D. Greenberg, M. Merritt, and G. Taubenfeld. Computing with faulty shared memory. Journal of the ACM, 42(6):1231–1274, November 1995.

    Article  MATH  MathSciNet  Google Scholar 

  3. G. Bell. Ultracomputers: A teraflop before its time. Communications of the ACM, 35(8):27–47, August 1992.

    Article  Google Scholar 

  4. M. Castro and B. Liskov. Practical Byzantine fault tolerance. In Proceedings of the 3rd Symposium on Operating Systems Design and Implementation-OSDI’99, February, 1999, New Orleans, LA.

    Google Scholar 

  5. S. Chaudhuri. More choices allow more faults: set consensus problems in totally asynchronous systems. Information and Computation, 105(1): 132–158, July 1993.

    Article  MATH  MathSciNet  Google Scholar 

  6. N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444–458, April 1989.

    Article  Google Scholar 

  7. M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32:374–382, April1985.

    Google Scholar 

  8. M. Herlihy. Wait-free synchronization. A CM Transactions on Programming Languages and Systems 11(1): 124–149, January 1991.

    Article  Google Scholar 

  9. P. Jayanti, T. Chandra, and S. Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM, 45(3):451–500, May 1998.

    Article  MATH  MathSciNet  Google Scholar 

  10. P. Jayanti, and S. Toueg. Some results on the impossibility, universality, and decidability of consensus. Proc. of the 6th Int. Workshop on Distributed Algorithms: LNCS, 647, pages 69–84. Springer Verlag, Nov. 1992.

    Google Scholar 

  11. M. P. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. A CM Transactions on Programming Languages and Systems 12(3):463–492, July 1990.

    Article  Google Scholar 

  12. K. P. Kihlstrom, L. E. Moser and P. M. Melliar-Smith. The SecureRing protocols for securing group communication. In Proceedings of the 31st IEEE Hawaii Int. Conf. on System Sciences, pages 317–326, January 1998.

    Google Scholar 

  13. M. C. Loui and H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, JAI Press, 4:163–183, 1987.

    MathSciNet  Google Scholar 

  14. K. Li and P. Hudak. Memory coherence in shared virtual memory systems. ACM Trans, on Programming Languages and Systems, 7(4):321–359, 1989.

    Google Scholar 

  15. D. Malkhi and M. K. Reiter. An architecture for survivable coordination in large distributed systems. IEEE Transactions on Knowledge and Data Engineering 12(2):187–202, March/April 2000.

    Article  Google Scholar 

  16. S. Moran and Y. Wolfsthal. An extended impossibility result for asynchronous complete networks. Info. Processing Letters, 26:141–151, 1987.

    Google Scholar 

  17. F. M. Pittelli and H. Garcia-Molina. Reliable scheduling in a TMR database system. ACM Transactions on Computer Systems, 7(l):25–60, February 1989.

    Article  Google Scholar 

  18. S. A. Plotkin. Sticky bits and universality of consensus. In Proc. 8th ACM Symp. on Principles of Distributed Computing, pages 159–175, August 1989.

    Google Scholar 

  19. M. K. Reiter. Distributing trust with the Rampart toolkit. Communications of the A CM 39(4):71–74, April 1996.

    MathSciNet  Google Scholar 

  20. S. K. Shrivastava, P. D. Ezhilchelvan, N. A. Speirs, S. Tao, and A. Tully. Principal features of the VOLTAN family of reliable node architectures for distributed systems. IEEE Trans, on Computers, 41(5):542–549, May 1992.

    Article  Google Scholar 

  21. A. S. Tannenbaum, M. F. Kaashoek, and H. E. Balvrije. Parallel programming using shared objects. IEEE Computer, pages 10–19, August 1992.

    Google Scholar 

  22. G. Taubenfeld and S. Moran. Possibility and impossibility results in a shared memory environment. Ada Informatica, 33(1): 1–20, 1996.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Comuter Science and Engineering, The Hebrew University of Jerusalem, Israel

    Dahlia Malkhi

  2. AT&T Labs, 180 Park Ave., Florham Park, NJ, 07932-0971

    Michael Merritt

  3. Bell Laboratories, Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ, 07974

    Michael Reiter

  4. The Open University, 16 Klausner st., P.O.B. 39328, Tel-Aviv, 61392, Israel

    Gadi Taubenfeld

  5. AT&T Labs, Israel

    Gadi Taubenfeld

Authors
  1. Dahlia Malkhi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Merritt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Reiter
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gadi Taubenfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Brown University, 115 Waterman Street, Providence, RI 02912, USA

    Maurice Herlihy

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Malkhi, D., Merritt, M., Reiter, M., Taubenfeld, G. (2000). Objects Shared by Byzantine Processes. In: Herlihy, M. (eds) Distributed Computing. DISC 2000. Lecture Notes in Computer Science, vol 1914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40026-5_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-40026-5_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41143-7

  • Online ISBN: 978-3-540-40026-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation