On the Inherent Sequentiality of Concurrent Objects
Author(s)Ellen, Faith; Hendler, Danny; Shavit, Nir N.
MetadataShow full item record
We present Ω(n) lower bounds on the worst case time to perform a single instance of an operation in any nonblocking implementation of a large class of concurrent data structures shared by n processes. Time is measured by the number of stalls a process incurs as a result of contention with other processes. For standard data structures such as counters, stacks, and queues, our bounds are tight. The implementations considered may apply any primitives to a base object. No upper bounds are assumed on either the number of base objects or their size.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
SIAM Journal on Computing
Society for Industrial and Applied Mathematics
Ellen, Faith, Danny Hendler, and Nir Shavit. “On the Inherent Sequentiality of Concurrent Objects.” SIAM Journal on Computing 41.3 (2012): 519–536. © 2012 Society for Industrial and Applied Mathematics
Final published version