On the Inherent Sequentiality of Concurrent Objects

We present $\Omega(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 oth...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on computing 2012-01, Vol.41 (3), p.519-536
Hauptverfasser:	Ellen, Faith, Hendler, Danny, Shavit, Nir
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer science
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!