ON THE INHERENT SEQUENTIALITY OF CONCURRENT OBJECTS.
Saved in:
| Title: | ON THE INHERENT SEQUENTIALITY OF CONCURRENT OBJECTS. |
|---|---|
| Authors: | Ellen, Faith1 faith@cs.toronto.edu, Hendler, Danny2 hendlerd@cs.bgu.ac.il, Shavit, Nir3,4 shanir@cs.tau.ac.il |
| Source: | SIAM Journal on Computing. 2012, Vol. 41 Issue 3, p519-536. 18p. |
| Subjects: | Data structures, Counters (Computer science), Electronic data processing, Electronic file management, Information storage & retrieval systems |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of SIAM Journal on Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
