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

Nir Shavit; Gadi Taubenfeld

doi:10.1007/978-3-319-25258-2_29

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

Nir Shavit, Gadi Taubenfeld

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings
Editors	Christian Scheideler
Publisher	Springer Verlag
Pages	414-428
Number of pages	15
ISBN (Print)	9783319252575
DOIs	https://doi.org/10.1007/978-3-319-25258-2_29
State	Published - 2015
Externally published	Yes
Event	22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015 - Montserrat, Spain Duration: 14 Jul 2015 → 16 Jul 2015

Publication series

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

Conference

Conference	22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015
Country/Territory	Spain
City	Montserrat
Period	14/07/15 → 16/07/15

Bibliographical note

Publisher Copyright:
© Springer International Publishing Switzerland 2015.

Keywords

Consensus number
Multiset
Queue
Relaxed data structure
Stack
Synchronization
Waitfreedom

Access to Document

10.1007/978-3-319-25258-2_29

Cite this

Shavit, N., & Taubenfeld, G. (2015). The computability of relaxed data structures: Queues and stacks as examples. In C. Scheideler (Ed.), Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings (pp. 414-428). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9439). Springer Verlag. https://doi.org/10.1007/978-3-319-25258-2_29

Shavit, Nir ; Taubenfeld, Gadi. / The computability of relaxed data structures : Queues and stacks as examples. Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings. editor / Christian Scheideler. Springer Verlag, 2015. pp. 414-428 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{dc2f89ad8e5848739e0b7b6806e379f2,

title = "The computability of relaxed data structures: Queues and stacks as examples",

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.",

keywords = "Consensus number, Multiset, Queue, Relaxed data structure, Stack, Synchronization, Waitfreedom",

author = "Nir Shavit and Gadi Taubenfeld",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015 ; Conference date: 14-07-2015 Through 16-07-2015",

year = "2015",

doi = "10.1007/978-3-319-25258-2_29",

language = "אנגלית",

isbn = "9783319252575",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "414--428",

editor = "Christian Scheideler",

booktitle = "Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings",

address = "גרמניה",

}

Shavit, N & Taubenfeld, G 2015, The computability of relaxed data structures: Queues and stacks as examples. in C Scheideler (ed.), Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9439, Springer Verlag, pp. 414-428, 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015, Montserrat, Spain, 14/07/15. https://doi.org/10.1007/978-3-319-25258-2_29

The computability of relaxed data structures: Queues and stacks as examples. / Shavit, Nir; Taubenfeld, Gadi.
Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings. ed. / Christian Scheideler. Springer Verlag, 2015. p. 414-428 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9439).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The computability of relaxed data structures

T2 - 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015

AU - Shavit, Nir

AU - Taubenfeld, Gadi

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2015.

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

KW - Consensus number

KW - Multiset

KW - Queue

KW - Relaxed data structure

KW - Stack

KW - Synchronization

KW - Waitfreedom

UR - http://www.scopus.com/inward/record.url?scp=84950326932&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-25258-2_29

DO - 10.1007/978-3-319-25258-2_29

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84950326932

SN - 9783319252575

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 414

EP - 428

BT - Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings

A2 - Scheideler, Christian

PB - Springer Verlag

Y2 - 14 July 2015 through 16 July 2015

ER -

Shavit N, Taubenfeld G. The computability of relaxed data structures: Queues and stacks as examples. In Scheideler C, editor, Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings. Springer Verlag. 2015. p. 414-428. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-25258-2_29

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

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this