Advertisement

Distributed Computing

, Volume 16, Issue 1, pp 37–48 | Cite as

Objects shared by Byzantine processes

  • Dahlia Malkhi
  • Michael Merritt
  • Michael K. Reiter
  • Gadi Taubenfeld
Original article

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).

Keywords: Byzantine faults, shared memory, emulation, consensus. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Dahlia Malkhi
    • 1
  • Michael Merritt
    • 2
  • Michael K. Reiter
    • 3
  • Gadi Taubenfeld
    • 4
  1. 1.School of Computer Science and Engineering, The Hebrew University of Jerusalem, Israel (e-mail: dalia@cs.huji.ac.il) IL
  2. 2.AT&T Labs, 180 Park Ave., Florham Park, NJ 07932-0971, USA (e-mail: mischu@research.att.com) US
  3. 3.Department of Electrical and Computer Engineering and Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA (e-mail: reiter@cmu.edu) US
  4. 4.The Open University and the Interdisciplinary Center, Israel (e-mail: gadi@cs.openu.ac.il) IL

Personalised recommendations