TY - GEN
T1 - Linear lower bounds on real-world implementations of concurrent objects
AU - Fich, Faith Ellen
AU - Hendler, Danny
AU - Shavit, Nir
PY - 2005/12/1
Y1 - 2005/12/1
N2 - This paper proves Ω(n) 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 n 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.
AB - This paper proves Ω(n) 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 n 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.
UR - http://www.scopus.com/inward/record.url?scp=33748584321&partnerID=8YFLogxK
U2 - 10.1109/SFCS.2005.47
DO - 10.1109/SFCS.2005.47
M3 - Conference contribution
AN - SCOPUS:33748584321
SN - 0769524680
SN - 9780769524689
T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
SP - 165
EP - 173
BT - Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005
T2 - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005
Y2 - 23 October 2005 through 25 October 2005
ER -