skip to main content
10.1145/3583668.3594602acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
short-paper

Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds

Published: 16 June 2023 Publication History

Abstract

A multiplicity queue is a concurrently-defined data type which relaxes the conditions of a linearizable FIFO queue by allowing concurrent Dequeue instances to return the same value. It would seem that this should allow faster message-passing implementations, as processes should not need to wait as long to learn about concurrent operations and previous work has shown that multiplicity queues are computationally less complex than the unrelaxed version. Intriguingly, recent work has shown that there is, in fact, little possible speedup versus an unrelaxed queue. Seeking to understand this difference between intuition and real behavior, we increase the lower bound for uniform algorithms. Further, we outline a path toward building proofs for even higher lower bounds, hypothesizing that the worst-case time to Dequeue approaches maximum message delay, which is similar to the time required for an unrelaxed Dequeue. We also give an upper bound for a special case to show that our bounds are tight at that point. To achieve our lower bounds, we use extended shifting arguments, which have been rarely used but allow larger lower bounds than traditional shifting arguments. We use these in series of inductive indistinguishability proofs which allow us to extend our proofs beyond the usual limitations of shifting arguments. This proof structure is an interesting contribution independently of the main result, as developing new lower bound proof techniques may have many uses in future work.

References

[1]
Hagit Attiya, Amotz Bar-Noy, and Danny Dolev. 1995. Sharing Memory Robustly in Message-Passing Systems. J. ACM 42, 1 (1995), 124--142.
[2]
Armando Castañeda and Miguel Piña. 2021. Fully Read/Write Fence-Free Work-Stealing with Multiplicity. In 35th International Symposium on Distributed Computing, DISC 2021, October 4--8, 2021, Freiburg, Germany (Virtual Conference) (LIPIcs, Vol. 209), Seth Gilbert (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16:1--16:20.
[3]
Armando Castañeda, Sergio Rajsbaum, and Michel Raynal. 2020. Relaxed Queues and Stacks from Read/Write Operations. In 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14--16, 2020, Strasbourg, France (Virtual Conference) (LIPIcs, Vol. 184), Quentin Bramas, Rotem Oshman, and Paolo Romano (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 13:1--13:19.
[4]
Thomas A. Henzinger, Christoph M. Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. 2013. Quantitative relaxation of concurrent data structures. In The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '13, Rome, Italy - January 23 -- 25, 2013, Roberto Giacobazzi and Radhia Cousot (Eds.). ACM, 317--328.
[5]
Colette Johnen, Adnane Khattabi, and Alessia Milani. 2022. Efficient Wait-Free Queue Algorithms with Multiple Enqueuers and Multiple Dequeuers. In 26th International Conference on Principles of Distributed Systems, OPODIS 2022, December 13--15, 2022, Brussels, Belgium (LIPIcs, Vol. 253), Eshcar Hillel, Roberto Palmieri, and Etienne Rivière (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 4:1--4:19.
[6]
Martha J. Kosa. 1999. Time Bounds for Strong and Hybrid Consistency for Arbitrary Abstract Data Types. Chic. J. Theor. Comput. Sci. 1999 (1999). http://cjtcs.cs.uchicago.edu/articles/1999/9/contents.html
[7]
Jennifer Lundelius and Nancy A. Lynch. 1984. An Upper and Lower Bound for Clock Synchronization. Information and Control 62, 2/3 (1984), 190--204.
[8]
Gil Neiger. 1994. Set-Linearizability. In Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14--17, 1994, James H. Anderson, David Peleg, and Elizabeth Borowsky (Eds.). ACM, 396.
[9]
Nir Shavit and Gadi Taubenfeld. 2016. The computability of relaxed data structures: queues and stacks as examples. Distributed Comput. 29, 5 (2016), 395--407.
[10]
Edward Talmage. 2022. Lower Bounds on Message Passing Implementations of Multiplicity-Relaxed Queues and Stacks. In Structural Information and Communication Complexity - 29th International Colloquium, SIROCCO 2022, Paderborn, Germany, June 27--29, 2022, Proceedings (Lecture Notes in Computer Science, Vol. 13298), Merav Parter (Ed.). Springer, 253--264.
[11]
Edward Talmage and Jennifer L. Welch. 2014. Improving Average Performance by Relaxing Distributed Data Structures. In Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12--15, 2014. Proceedings (Lecture Notes in Computer Science, Vol. 8784), Fabian Kuhn (Ed.). Springer, 421--438.
[12]
Edward Talmage and Jennifer L. Welch. 2019. Anomalies and similarities among consensus numbers of variously-relaxed queues. Computing 101, 9 (2019), 1349--1368.
[13]
Anh Tran and Edward Talmage. 2023. Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity Queues. arXiv:2305.11286 [cs.DC]
[14]
Jiaqi Wang, Edward Talmage, Hyunyoung Lee, and Jennifer L. Welch. 2018. Improved time bounds for linearizable implementations of abstract data types. Inf. Comput. 263 (2018), 1--30.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing
June 2023
392 pages
ISBN:9798400701214
DOI:10.1145/3583668
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 June 2023

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. distributed data structures
  2. ADTs
  3. lower bounds
  4. shifting arguments
  5. multiplicity queues

Qualifiers

  • Short-paper

Conference

PODC '23
Sponsor:

Acceptance Rates

PODC '23 Paper Acceptance Rate 29 of 110 submissions, 26%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 49
    Total Downloads
  • Downloads (Last 12 months)9
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media