Abstract

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

Citations

7320	Introduction to Algorithms - CORMEN, LEISERSON, et al. - 1985
3633	Computer Architecture - A Quantitative Approach, 2nd Edition - Hennessy, Patterson - 1996
226	Algorithms for parallel memory I: Two-level memories - Vitter, Shriver - 1994
153	Calendar queues: A fast O�1� priority queue implementation for the simulation event set problem - Brown - 1988
144	The buffer tree: A new technique for optimal I/O algorithms - Arge - 1995
104	The influence of caches on the performance of sorting - LaMarca, Ladner - 1999
93	The Art of Computer Programming. In Sorting an Searching Volume 3. Third edition - Knuth
81	An empirical comparison of priority-queues and event-set implementations - Jones - 1986
66	The influence of caches on the performance of heaps - LAMARCA, R - 1996
59	Simple randomized mergesort on parallel disks - Barve, Grove, et al. - 1997
57	External Memory Algorithms - Abello, Vitter - 1999
52	The 21264: a superscalar Alpha processor with out-of-order execution. Presented at the 9 th Annual Microprocessor Forum - Keller - 1996
46	First draft of a report on the EDVAC - Neumann - 1945
35	Worst-case efficient external-memory priority queues - Brodal, Katajainen - 1998
22	bottom-up-heapsort, a new variant of heapsort beating, on an average, quicksort (if n is not very small - Wegener - 1993
19	Accessing multiple sequences through set-associative cache. Unpublished manuscript, 2000. Preliminary version - Mehlhorn, Sanders - 1999
11	Fishspear: A priority queue algorithm - Fischer, Paterson - 1994
9	L.: The External Heapsort - Teuhola, Wegner - 1988
5	External heaps combined with effective buffering - Fadel, Jakobsen, et al. - 1997
4	Stlting Brodal and Jyrki Katajainen. Worst-case efficient external-memory priority queues - Gerth - 1998
3	First draft of a report on the EDVAC - Neumann - 1945
2	Efficient priority queues in external memory. working paper - Crauser, Ferragina, et al. - 1997
1	Fast Priority Queues for Cached Memory \Delta 25 - Brengel, Crauser, et al. - 1999
1	Intel Archtecture Software Developer's Manual. Volume I: Basic Architecture - Corporation - 1997
1	On the performance of LEDA-SM - al - 1998