On the Inherent Sequentiality of Concurrent Objects
Name
Ellen-2012-ON THE INHERENT SEQUENTIALITY OF CONCURRENT OBJECTS.pdf
Size
284.56 KB
Format
Adobe PDF
Checksum (MD5)
830b75e0df9f72a59c4630bf7edd1450
Author(s)
Ellen, Faith
Hendler, Danny
Shavit, Nir N.
Date Issued
May 2012
Journal
SIAM Journal on Computing
Publisher
Society for Industrial and Applied Mathematics
Citation
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
Version
Final published version
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/08072646x
