The Community for Technology Leaders
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) (2005)
Pittsburgh, Pennsylvania, USA
Oct. 23, 2005 to Oct. 25, 2005
ISBN: 0-7695-2468-0
pp: 165-173
Faith Ellen Fich , University of Toronto
Danny Hendler , University of Toronto
Nir Shavit , Sun Microsystems Laboratories
ABSTRACT
<p>This paper proves \Omega (\pi ) 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 (\pi ) 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.</p>
INDEX TERMS
null
CITATION

D. Hendler, F. E. Fich and N. Shavit, "Linear Lower Bounds on Real-World Implementations of Concurrent Objects," 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)(FOCS), Pittsburgh, Pennsylvania, USA, 2005, pp. 165-173.
doi:10.1109/SFCS.2005.47
95 ms
(Ver 3.3 (11022016))