5588 search results - page 1002 / 1118 » Parallel Implementation of Bags |
125
click to vote
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
In Software Transactional Memory (STM), contention management refers to the mechanisms used to ensure forward progress-to avoid livelock and starvation, and to promote throughput ...
112
click to vote
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers a...
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
PODC
2009
ACM
16 years 3 months ago
2009
ACM
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...