2 search results - page 1 / 1 » A universal construction for wait-free transaction friendly ... |
75
Voted
SPAA
2010
ACM
14 years 11 months ago
2010
ACM
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
114
click to vote
WDAG
2010
Springer
14 years 8 months ago
2010
Springer
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...