Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Journal Article

Fast Priority Queues for Cached Memory


Sanders,  Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Sanders, P. (2000). Fast Priority Queues for Cached Memory. Journal of Experimental Algorithmics, 5, 1-25. Retrieved from http://www.jea.acm.org/2000/SandersPriority/.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-33B1-C
The cache hierarchy prevalent in todays high performance processors has to be taken into account in order to design algorithms that perform well in practice. This paper advocates the adaption of external memory algorithms to this purpose. This idea and the practical issues involved are exemplified by engineering a fast priority queue suited to external memory and cached memory that is based on $k$-way merging. It improves previous external memory algorithms by constant factors crucial for transferring it to cached memory. Running in the cache hierarchy of a workstation the algorithm is at least two times faster than an optimized implementation of binary heaps and 4-ary heaps for large inputs.