8 search results - page 1 / 2 » Linear Lower Bounds on Real-World Implementations of Concurr... |
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper proves ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
WDAG
2005
Springer
14 years 29 days ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
WDAG
1994
Springer
13 years 11 months ago
1994
Springer
We give an optimal, wait-free implementation of an increment register. An increment register is a concurrent object consisting of an integer-valued register with an increment oper...
DC
2006
13 years 7 months ago
2006
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 ...
SOSP
2009
ACM
14 years 4 months ago
2009
ACM
Bug reproduction is critically important for diagnosing a production-run failure. Unfortunately, reproducing a concurrency bug on multi-processors (e.g., multi-core) is challengin...