On the Inherent Sequentiality of Concurrent Objects
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 proc...
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | en_US |
Published: |
Society for Industrial and Applied Mathematics
2012
|
Online Access: | http://hdl.handle.net/1721.1/75034 https://orcid.org/0000-0002-4552-2414 |