Show simple item record

dc.contributor.authorAbraham, Ittai
dc.contributor.authorChockler, Gregory
dc.contributor.authorKeidar, Idit
dc.contributor.authorMalkhi, Dahlia
dc.contributor.otherTheory of Distributed Systems
dc.date.accessioned2005-12-22T02:25:42Z
dc.date.available2005-12-22T02:25:42Z
dc.date.issued2005-04-05
dc.identifier.otherMIT-CSAIL-TR-2005-021
dc.identifier.otherMIT-LCS-TR-984
dc.identifier.urihttp://hdl.handle.net/1721.1/30533
dc.description.abstractWe present a simple, efficient, and self-contained construction of a wait-free regular register from Byzantine storage components. Our construction utilizes a novel building block, called 1-regular register, which can be implemented from Byzantine fault-prone components with the same round complexity as a safe register, and with only a slight increase in storage space.
dc.format.extent13 p.
dc.format.extent15869015 bytes
dc.format.extent669233 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
dc.titleWait-free Regular Storage from Byzantine Components


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record