7 search results - page 1 / 2 » Wait-free regular storage from Byzantine components |
IPL
2007
13 years 5 months ago
2007
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...
PODC
2011
ACM
12 years 8 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
ICDCS
2011
IEEE
12 years 5 months ago
2011
IEEE
Many distributed software systems allow participation by large numbers of untrusted, potentially faulty components on an open network. As faults are inevitable in this setting, th...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Abstract—We introduce a new class of exact MinimumBandwidth Regenerating (MBR) codes for distributed storage systems, characterized by a low-complexity uncoded repair process tha...
VLSID
2001
IEEE
14 years 5 months ago
2001
IEEE
In this paper we describe a hardware design method for memory and register arrays that allows the application of formal equivalence checking for comparing a high-level register tr...