Fast priority queues for cached memory

DOI10.1145/351827.384249zbMath1071.68513OpenAlexW2127620007MaRDI QIDQ5463402

Peter Sanders

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/351827.384249

zbMATH Keywords

priority queueexternal memoryheapcache efficiencysecondary storagemultiway merging

Mathematics Subject Classification ID

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

Related Items (7)

Balanced allocation and dictionaries with tightly packed constant size bins ⋮ I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark ⋮ Two-level heaps: a new priority queue structure with applications to the single source shortest path problem ⋮ Engineering parallel string sorting ⋮ On sorting, heaps, and minimum spanning trees ⋮ A Survey on Priority Queues ⋮ Inducing Suffix and LCP Arrays in External Memory

This page was built for publication: Fast priority queues for cached memory