Objects shared by Byzantine processes

Authors:
Dahlia Malkhi;Michael Merritt;Michael K. Reiter;Gadi Taubenfeld
Affiliations:
School of Computer Science and Engineering, The Hebrew University of Jerusalem, Israel;AT&T Labs, 180 Park Ave., Florham Park, NJ;Department of Electrical and Computer Engineering and Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA;The Open University and the Interdisciplinary Center, Israel
Venue:
Distributed Computing
Year:
2003

Citing 21
Cited 1

Extended impossibility results for asynchronous complete networks

Information Processing Letters
Reliable scheduling in a TMR database system

ACM Transactions on Computer Systems (TOCS)
Linda in context

Communications of the ACM
Sticky bits and universality of consensus

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Memory coherence in shared virtual memory systems

ACM Transactions on Computer Systems (TOCS)
Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Ultracomputers: a teraflop before its time

Communications of the ACM
Parallel Programming Using Shared Objects and Broadcasting

Computer - Special issue on sharing: high performance at low cost
Principal Features of the VOLTAN Family of Reliable Node Architectures for Distributed Systems

IEEE Transactions on Computers - Special issue on fault-tolerant computing
More choices allow more faults: set consensus problems in totally asynchronous systems

Information and Computation
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Possibility and impossibility results in a shared memory environment

Acta Informatica
Distributing trust with the Rampart toolkit

Communications of the ACM
Computing with faulty shared objects

Journal of the ACM (JACM)
Fault-tolerant wait-free shared objects

Journal of the ACM (JACM)
Practical Byzantine fault tolerance

OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
On k-Set Consensus Problems in Asynchronous Systems

IEEE Transactions on Parallel and Distributed Systems
An Architecture for Survivable Coordination in Large Distributed Systems

IEEE Transactions on Knowledge and Data Engineering
Some Results on the Impossibility, Universality, and Decidability of Consensus

WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
The SecureRing Protocols for Securing Group Communication

HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences - Volume 3

Competitive freshness algorithms for wait-free data objects

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing

Quantified Score

Hi-index	0.01

Visualization

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