5 search results - page 1 / 1 » Data Structures Resilient to Memory Faults: An Experimental ... |
WEA
2010
Springer
13 years 2 months ago
2010
Springer
FOCS
1996
IEEE
13 years 8 months ago
1996
IEEE
We study the tolerance of data structures to memory faults. We observe that many pointerbased data structures (e.g., linked lists, trees, etc.) are highly nonresilient to faults. ...
HIPC
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
WEA
2007
Springer
13 years 10 months ago
2007
Springer
We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures...
SIGMOD
2008
ACM
14 years 4 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...