Sciweavers

Share
ASPLOS
2008
ACM

General and efficient locking without blocking

9 years 3 days ago
General and efficient locking without blocking
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of actual contention. Locking offers lower overheads, but typically reduces concurrency due to the difficulty of associating locks with the exact data that need to be accessed. Moreover, locking allows irreversible operations, is ubiquitous in legacy software, and seems unlikely to ever be completely supplanted. We believe that the trade-off between transactions and (blocking) locks has not been sufficiently exploited to obtain a "best of both worlds" mechanism, although the main components have been identified. Mechanisms for converting locks to atomic sections (which can abort and retry) have already been proposed in the literature: Rajwar and Goodman's "lock elision" (at the hardware level) and Welc et al.'s hybrid monitors (at the software level) are the best known representatives....
Yannis Smaragdakis, Anthony Kay, Reimer Behrends,
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where ASPLOS
Authors Yannis Smaragdakis, Anthony Kay, Reimer Behrends, Michal Young
Comments (0)
books