Sciweavers

68 search results - page 6 / 14
» Scalable reader-writer locks
Sort
View
WDAG
2010
Springer
216views Algorithms» more  WDAG 2010»
13 years 5 months ago
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
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...
Francois Carouge, Michael F. Spear
HPCA
1999
IEEE
14 years 4 days ago
Supporting Fine-Grained Synchronization on a Simultaneous Multithreading Processor
This paper proposes and evaluates new synchronization schemes for a simultaneous multithreaded processor. We present a scalable mechanism that permits threads to cheaply synchroni...
Dean M. Tullsen, Jack L. Lo, Susan J. Eggers, Henr...
PLDI
2009
ACM
14 years 15 days ago
Progress guarantee for parallel programs via bounded lock-freedom
Parallel platforms are becoming ubiquitous with modern computing systems. Many parallel applications attempt to avoid locks in order to achieve high responsiveness, aid scalabilit...
Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaa...
HPCA
2007
IEEE
14 years 8 months ago
A Scalable, Non-blocking Approach to Transactional Memory
Transactional Memory (TM) provides mechanisms that promise to simplify parallel programming by eliminating the need for locks and their associated problems (deadlock, livelock, pr...
Hassan Chafi, Jared Casper, Brian D. Carlstrom, Au...