Memory Bounds for Concurrent Bounded Queues
Vitaly Aksenov, Nikita Koval, Petr Kuznetsov, Anton Paramonov · 2024
Concurrent data structures often require additional memory for handling synchronization issues in addition to memory for storing elements. Depending on the amount of this additional memory, implementations can be more or less memory-friendly. A memory-optimal implementation enjoys the minimal possible memory overhead, which, in practice, reduces cache misses and unnecessary memory reclamation.