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 |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 78857992 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: ON THE INHERENT SEQUENTIALITY OF CONCURRENT OBJECTS. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Ellen%2C+Faith%22">Ellen, Faith</searchLink><relatesTo>1</relatesTo><i> faith@cs.toronto.edu</i><br /><searchLink fieldCode="AR" term="%22Hendler%2C+Danny%22">Hendler, Danny</searchLink><relatesTo>2</relatesTo><i> hendlerd@cs.bgu.ac.il</i><br /><searchLink fieldCode="AR" term="%22Shavit%2C+Nir%22">Shavit, Nir</searchLink><relatesTo>3,4</relatesTo><i> shanir@cs.tau.ac.il</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22SIAM+Journal+on+Computing%22">SIAM Journal on Computing</searchLink>. 2012, Vol. 41 Issue 3, p519-536. 18p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Data+structures%22">Data structures</searchLink><br /><searchLink fieldCode="DE" term="%22Counters+%28Computer+science%29%22">Counters (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+data+processing%22">Electronic data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+file+management%22">Electronic file management</searchLink><br /><searchLink fieldCode="DE" term="%22Information+storage+%26+retrieval+systems%22">Information storage & retrieval systems</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=78857992 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1137/08072646X Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 18 StartPage: 519 Subjects: – SubjectFull: Data structures Type: general – SubjectFull: Counters (Computer science) Type: general – SubjectFull: Electronic data processing Type: general – SubjectFull: Electronic file management Type: general – SubjectFull: Information storage & retrieval systems Type: general Titles: – TitleFull: ON THE INHERENT SEQUENTIALITY OF CONCURRENT OBJECTS. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Ellen, Faith – PersonEntity: Name: NameFull: Hendler, Danny – PersonEntity: Name: NameFull: Shavit, Nir IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 06 Text: 2012 Type: published Y: 2012 Identifiers: – Type: issn-print Value: 00975397 Numbering: – Type: volume Value: 41 – Type: issue Value: 3 Titles: – TitleFull: SIAM Journal on Computing Type: main |
| ResultId | 1 |
