Non-skipping Timestamps for Byzantine Data Storage Systems-Reference-Cited by-同舟云学术

Non-skipping Timestamps for Byzantine Data Storage Systems

Published:2004 Issue: Volume: Page:405-419
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bazzi Rida A.,Ding Yin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30186-8_29.pdf

Reference18 articles.

1. Bazzi, R.A.: Access cost for asynchronous byzantine quorum systems. Distributed Computing Journal 14, 41–48 (1992)

2. Castro and Liskov. Practical byzantine fault tolerance. In: OSDI: Symposium on Operating Systems Design and Implementation. USENIX Association, Cosponsored by IEEE TCOS and ACM SIGOPS (1999)

3. Fan, R.: Efficient replication of large data objects. In: Thesis, Computer Science and Engineering, MIT (2003)

4. Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)

5. Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS) 12(3), 463–492 (1990)

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

1. Liveness and latency of Byzantine state-machine replication;Distributed Computing;2024-05-03

2. Making Byzantine consensus live;Distributed Computing;2022-09-02

3. Clairvoyant State Machine Replications;Lecture Notes in Computer Science;2018

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

5. A simple Byzantine-fault-tolerant algorithm for a multi-writer regular register;International Journal of Parallel, Emergent and Distributed Systems;2010-10