45 search results - page 1 / 9 » The complexity of robust atomic storage |
282
Voted
PODC
2011
ACM
14 years 10 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...
183
click to vote
DSN
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions. We study asynchr...
190
Voted
OPODIS
2008
15 years 8 months ago
2008
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
210
Voted
IJCNN
2000
IEEE
15 years 11 months ago
2000
IEEE
A self-organizing neural network for learning and recall of complex temporal sequences is proposed. we consider a single sequence with repeated items, or several sequences with a c...
190
Voted
ISCA
2008
IEEE
16 years 1 months ago
2008
IEEE
We demonstrate how fine-grained memory protection can be used in support of transactional memory systems: first showing how a software transactional memory system (STM) can be m...