Wait-free regular storage from Byzantine components

Authors:
Ittai Abraham;Gregory Chockler;Idit Keidar;Dahlia Malkhi
Affiliations:
School of Computer Science and Engineering, The Hebrew University of Jerusalem, Israel;IBM Haifa Research Lab, Haifa University Campus, Mount Carmel, Haifa 31905, Israel;Department of Electrical Engineering, The Technion -- Israel Institute of Technology, Israel;School of Computer Science and Engineering, The Hebrew University of Jerusalem, Israel and Microsoft Research, Silicon-Valley, USA
Venue:
Information Processing Letters
Year:
2007

Citing 11
Cited 7

Fault-tolerant wait-free shared objects

Journal of the ACM (JACM)
Concurrent Reading While Writing

ACM Transactions on Programming Languages and Systems (TOPLAS)
A framework for semantic reasoning about Byzantine quorum systems

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Bounded concurrent timestamp systems using vector clocks

Journal of the ACM (JACM)
How to Construct an Atomic Variable (Extended Abstract)

Proceedings of the 3rd International Workshop on Distributed Algorithms
Minimal Byzantine Storage

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Responsive Security for Stored Data

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Efficient Byzantine-Tolerant Erasure-Coded Storage

DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Byzantine quorum systems

Distributed Computing
Disk Paxos

Distributed Computing
A practical distributed mutual exclusion protocol in dynamic peer-to-peer systems

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems

Remote storage with byzantine servers

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
On the Time-Complexity of Robust and Amnesic Storage

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Low-latency access to robust amnesic storage

LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks

ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Remote storage with byzantine servers

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Efficient Robust Storage Using Secret Tokens

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Amnesic distributed storage

DISC'07 Proceedings of the 21st international conference on Distributed Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider the problem of implementing a wait-free regular register from storage components prone to Byzantine faults. We present a simple, efficient, and self-contained construction of such a register. Our construction utilizes a novel building block, called a 1-regular register, which can be efficiently implemented from Byzantine fault-prone components.