Sciweavers

84 search results - page 2 / 17
» Nonblocking Concurrent Data Structures with Condition Synchr...
Sort
View
IPPS
2006
IEEE
13 years 11 months ago
Making lockless synchronization fast: performance implications of memory reclamation
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
Thomas E. Hart, Paul E. McKenney, Angela Demke Bro...
JPDC
2007
84views more  JPDC 2007»
13 years 5 months ago
Performance of memory reclamation for lockless synchronization
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
Thomas E. Hart, Paul E. McKenney, Angela Demke Bro...
ICDCS
2003
IEEE
13 years 10 months ago
Obstruction-Free Synchronization: Double-Ended Queues as an Example
We introduce obstruction-freedom, a new nonblocking property for shared data structure implementations. This property is strong enough to avoid the problems associated with locks,...
Maurice Herlihy, Victor Luchangco, Mark Moir
CF
2010
ACM
13 years 10 months ago
ERBIUM: a deterministic, concurrent intermediate representation for portable and scalable performance
Tuning applications for multi-core systems involve subtle concepts and target-dependent optimizations. New languages are being designed to express concurrency and locality without...
Cupertino Miranda, Philippe Dumont, Albert Cohen, ...
VMCAI
2009
Springer
14 years 3 days ago
Shape-Value Abstraction for Verifying Linearizability
lue Abstraction for Verifying Linearizability Viktor Vafeiadis Microsoft Research, Cambridge, UK This paper presents a novel abstraction for heap-allocated data structures that kee...
Viktor Vafeiadis