An adaptive concurrent priority queue for NUMA architectures
Foteini Strati, Christina Giannoula, Dimitrios Siakavaras, Georgios Goumas, Nectarios Koziris · 2019
Designing scalable concurrent priority queues for contemporary NUMA servers is challenging. Several NUMA-unaware implementations can scale up to a high number of threads exploiting the potential parallelism of the insert operations. In contrast, in deleteMin-dominated workloads, threads compete for accessing the same memory locations, i.e. the first item in the priority queue. In such cases, NUMA-aware implementations are typically used, since they reduce the coherence traffic between the nodes of a NUMA system.