Fast and space-efficient queues via relaxation

DOI10.4230/LIPICS.OPODIS.2020.14MaRDI QIDQ6834039zbMATH OpenFDO

Authors Dempsey Wade, Edward Talmage

Publication date 31 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.OPODIS.2020.14

zbMATH Keywords

message passingrelaxed data typesshared data structuresspace complexity

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites work

• An upper and lower bound for clock synchronization
• scientific article; zbMATH DE number 1351080 (Why is no real title available?)
• Improved time bounds for linearizable implementations of abstract data types
• Linearizable read/write objects
• Partially Replicated Causally Consistent Shared Memory
• Quantitative relaxation of concurrent data structures

This page was built for publication: Fast and space-efficient queues via relaxation

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