Sciweavers

2 search results - page 1 / 1
» Revocable locks for non-blocking programming
Sort
View
PPOPP
2005
ACM
13 years 10 months ago
Revocable locks for non-blocking programming
In this paper we present a new form of revocable lock that streamlines the construction of higher level concurrency abstractions such as atomic multi-word heap updates. The key id...
Tim Harris, Keir Fraser
ISSTA
2006
ACM
13 years 10 months ago
Run-time detection of potential deadlocks for programs with locks, semaphores, and condition variables
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. A common kind of concurrency error is deadlock, which occurs when some thread...
Rahul Agarwal, Scott D. Stoller