3 papers
cs.DS2026
SimdQuickHeap: The QuickHeap Reconsidered
Johannes Breitling, Ragnar Groot Koerkamp, Marvin Williams
Priority queues are data structures that maintain a dynamic collection of elements and allow inserting new elements and removing the smallest element. The most widely known and use…
cs.DS2025
BlockFIFO & MultiFIFO: Scalable Relaxed Queues
Stefan Koch, Peter Sanders, Marvin Williams
FIFO queues are a fundamental data structure used in a wide range of applications. Concurrent FIFO queues allow multiple execution threads to access the queue simultaneously. Maint…
cs.DS2025
A Simple yet Exact Analysis of the MultiQueue
Stefan Walzer, Marvin Williams
The MultiQueue is a relaxed concurrent priority queue consisting of internal priority queues, where an insertion uses a random queue and a deletion considers two random queues…