A simple yet exact analysis of the MultiQueue

DOI10.4230/LIPICS.ESA.2025.85MaRDI QIDQ7322493zbMATH OpenFDO

Authors Stefan Walzer, M. Williams

Publication date 31 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2025.85

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Balanced Allocations
• Balanced Allocations: The Heavily Loaded Case
• Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
• Graphical balanced allocations and the (1+ )-choice process
• scientific article; zbMATH DE number 1857645 (Why is no real title available?)
• Laws of order, expensive synchronization in concurrent algorithms cannot be eliminated
• Markov Chains
• On the inherent sequentiality of concurrent objects
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• Tail bounds for sums of geometric and exponential variables
• The power of choice in priority scheduling
• TSLQueue: an efficient lock-free design for priority queues

This page was built for publication: A simple yet exact analysis of the MultiQueue

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