ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions
Full text PdfPdf (84 KB)
Source
Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing table of contents
Portland, Oregon, USA
SESSION: Brief announcements - track A table of contents
Pages: 310 - 311  
Year of Publication: 2007
ISBN:978-1-59593-616-5
Authors
Amitanand Aiyer  University of Texas at Austin, Austin, TX
Lorenzo Alvisi  University of Texas at Austin, Austin, TX
Rida A. Bazzi  Arizona State University, Pheonix, AZ
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 25,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1281100.1281147
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Amitan and S. Aiyer, Lorenzo Alvisi, and Rida A. Bazzi. Lightweight writeback for byzantine storage systems. Technical Report TR-07-13, University of Texas at Austin, Department of Computer Sciences, March 2007.
 
2
Rida A. Bazzi and Yin Ding. Non-skipping time stamps for byzantine data storage systems. In DISC'04, pages 405--419. Springer-Verlag, 2004.
 
3
Rida A. Bazzi and Yin Ding. Bounded wait-free f-resilient atomic byzantine data storage systems for an unbounded number of clients. In DISC'06, pages 299--313. Springer-Verlag, 2006.
 
4
Christian Cachin , Stefano Tessaro, Optimal Resilience for Erasure-Coded Byzantine Distributed Storage, Proceedings of the International Conference on Dependable Systems and Networks, p.115-124, June 25-28, 2006  [doi>10.1109/DSN.2006.56]
 
5
R. Fan and N. Lynch. Efficient replication of large data objects. In DISC'03, volume 2848 of LNCS, pages 75--91, October 2003.
 
6
Rachid Guerraoui and Marko Vukolic. Re?ned Quorum Systems. Technical Report LPD-REPORT-2007-001, EPFL, 2007.
7
Maurice Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.1, p.124-149, Jan. 1991  [doi>10.1145/114005.102808]
 
8
Leslie Lamport. On interprocess communication. parti: Basic formalism. Distributed Computing, 1(2):77--101, 1986.
 
9
Barbara Liskov and Rodrigo Rodrigues. Byzantine clients rendered harmless. In DISC2005, pages 311--325. Springer-Verlag, 2005.
 
10
Jean-Philippe Martin , Lorenzo Alvisi , Michael Dahlin, Minimal Byzantine Storage, Proceedings of the 16th International Conference on Distributed Computing, p.311-325, October 28-30, 2002

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.4 Distributed Systems
          Subjects: Distributed applications

Additional Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.5 Reliability
          Subjects: Fault-tolerance


General Terms:
Algorithms, Reliability, Security


Keywords:
atomic, bounded, byzantine, fault tolerance, information theoretic, replication, wait-free

Collaborative Colleagues:
Amitanand Aiyer: colleagues
Lorenzo Alvisi: colleagues
Rida A. Bazzi: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player