Wait-free Regular Storage from Byzantine Components
| dc.date.accessioned | 2005-12-22T02:25:42Z | |
| dc.date.accessioned | 2018-11-24T10:24:26Z | |
| dc.date.available | 2005-12-22T02:25:42Z | |
| dc.date.available | 2018-11-24T10:24:26Z | |
| dc.date.issued | 2005-04-05 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/30533 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/30533 | |
| dc.description.abstract | We 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.extent | 13 p. | |
| dc.format.extent | 15869015 bytes | |
| dc.format.extent | 669233 bytes | |
| dc.language.iso | en_US | |
| dc.title | Wait-free Regular Storage from Byzantine Components |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| MIT-CSAIL-TR-2005-021.pdf | 669.2Kb | application/pdf | View/ |
| MIT-CSAIL-TR-2005-021.ps | 15.86Mb | application/postscript | View/ |