Sciweavers

9 search results - page 2 / 2
» Efficient implementation of mutual exclusion locks in large ...
Sort
View
PPOPP
1997
ACM
13 years 9 months ago
Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
Martin C. Rinard
IPPS
2009
IEEE
14 years 5 days ago
Taking the heat off transactions: Dynamic selection of pessimistic concurrency control
In this paper we investigate feedback-directed dynamic selection between different implementations of atomic blocks. We initially execute atomic blocks using STM with optimistic c...
Nehir Sönmez, Tim Harris, Adrián Crist...
DC
2006
13 years 5 months ago
On the inherent weakness of conditional primitives
Some well-known primitive operations, such as compare-and-swap, can be used, together with read and write, to implement any object in a wait-free manner. However, this paper shows ...
Faith Ellen Fich, Danny Hendler, Nir Shavit
DAGSTUHL
1994
13 years 6 months ago
A High Performance Totally Ordered Multicast Protocol
This paper presents the Reliable Multicast Protocol (RMP). RMP provides a totally ordered, reliable, atomic multicast service on top of an unreliable multicast datagram service su...
Brian Whetten, Todd Montgomery, Simon M. Kaplan