2 search results - page 1 / 1 » A universal construction for wait-free transaction friendly ... |
SPAA
2010
ACM
13 years 5 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...
WDAG
2010
Springer
13 years 2 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...