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

DOI10.1145/3583668.3594602OpenAlexW4380881059MaRDI QIDQ6202279FDOQ6202279

Authors:

Publication date: 26 March 2024

Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3583668.3594602

zbMATH Keywords

lower boundsdistributed data structuresADTsmultiplicity queuesshifting arguments

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)
• Sharing memory robustly in message-passing systems
• Quantitative relaxation of concurrent data structures
• The computability of relaxed data structures: queues and stacks as examples
• An upper and lower bound for clock synchronization
• Improved time bounds for linearizable implementations of abstract data types
• Lower bounds on message passing implementations of multiplicity-relaxed queues and stacks
• Anomalies and similarities among consensus numbers of variously-relaxed queues

This page was built for publication: Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202279)