The computability of relaxed data structures: Queues and stacks as examples

Nir Shavit, Gadi Taubenfeld

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

Abstract

Most concurrent data structures being designed today are versions of known sequential data structures. However, in various cases it makes sense to relax the semantics of traditional concurrent data structures in order to get simpler and possibly more efficient and scalable implementations. For example, when solving the classical producer-consumer problem by implementing a concurrent queue, it might be enough to allow the dequeue operation (by a consumer) to return and remove one of the two oldest values in the queue, and not necessarily the oldest one. We define infinitely many possible relaxations of several traditional data structures: queues, stacks and multisets, and examine their relative computational power.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings
EditorsChristian Scheideler
PublisherSpringer Verlag
Pages414-428
Number of pages15
ISBN (Print)9783319252575
DOIs
StatePublished - 2015
Event22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015 - Montserrat, Spain
Duration: 14 Jul 201516 Jul 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9439
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015
Country/TerritorySpain
CityMontserrat
Period14/07/1516/07/15

Keywords

  • Consensus number
  • Multiset
  • Queue
  • Relaxed data structure
  • Stack
  • Synchronization
  • Waitfreedom

Fingerprint

Dive into the research topics of 'The computability of relaxed data structures: Queues and stacks as examples'. Together they form a unique fingerprint.

Cite this