Wait-free regular storage from Byzantine components-Reference-Cited by-同舟云学术

Wait-free regular storage from Byzantine components

Published:2007-01 Issue:2 Volume:101 Page:60-65
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Abraham Ittai,Chockler Gregory,Keidar Idit,Malkhi Dahlia

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference17 articles.

1. Byzantine disk paxos: Optimal resilience with Byzantine shared memory;Abraham;Distrib. Comput.,2006

2. H. Attiya, A. Bar-Or, Sharing memory with semi-Byzantine clients and faulty storage servers, in: 22nd Symposium on Reliable Distributed Systems (SRDS), 2003

3. Disk paxos;Gafni;Distrib. Comput.,2003

4. G.R. Goodson, J.J. Wylie, G.R. Ganger, M.K. Reiter, Efficient byzantine-tolerant erasure-coded storage, in: International Conference on Dependable Systems and Networks (DSN), June 2004

5. Bounded concurrent timestamp systems using vector clocks;Haldar;J. ACM,2002

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quorum Systems: With Applications to Storage and Consensus;Synthesis Lectures on Distributed Computing Theory;2012-02-15

2. Efficient Robust Storage Using Secret Tokens;Lecture Notes in Computer Science;2009

3. Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks;Distributed Computing and Networking;2008

4. On the Time-Complexity of Robust and Amnesic Storage;Lecture Notes in Computer Science;2008

5. Amnesic Distributed Storage;Lecture Notes in Computer Science