Linear lower bounds on real-world implementations of concurrent objects

Faith Ellen Fich, Danny Hendler, Nir Shavit

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

25 Scopus citations

Abstract

This paper proves Ω(n) lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by n processes. For standard data structures such as counters, stacks, and queues, the bound is tight. The implementations considered may apply any deterministic primitives to a base object. No bounds are assumed on either the number of base objects or their size. Time is measured as the number of steps a process performs on base objects and the number of stalls it incurs as a result of contention with other processes.

Original languageEnglish
Title of host publicationProceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005
Pages165-173
Number of pages9
DOIs
StatePublished - 1 Dec 2005
Externally publishedYes
Event46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005 - Pittsburgh, PA, United States
Duration: 23 Oct 200525 Oct 2005

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume2005
ISSN (Print)0272-5428

Conference

Conference46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005
Country/TerritoryUnited States
CityPittsburgh, PA
Period23/10/0525/10/05

Fingerprint

Dive into the research topics of 'Linear lower bounds on real-world implementations of concurrent objects'. Together they form a unique fingerprint.

Cite this