Sciweavers

Share
FOCS
2005
IEEE

Linear Lower Bounds on Real-World Implementations of Concurrent Objects

8 years 9 months ago
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
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 £ processes. For standard data structures such as counters, stacks, and queues, the bound is tight. The implementations considered may apply any deterministic primitives to a base object. No bounds are assumed on either the number of base objects or their size. Time is measured as the number of steps a process performs on base objects and the number of stalls it incurs as a result of contention with other processes.
Faith Ellen Fich, Danny Hendler, Nir Shavit
Added 24 Jun 2010
Updated 24 Jun 2010
Type Conference
Year 2005
Where FOCS
Authors Faith Ellen Fich, Danny Hendler, Nir Shavit
Comments (0)
books