Fast Priority Queues for Cached Memory

ACM Journal of Experimental Algorithmics

Volumn 5, Issue , 2000, Pages 7-

  Sanders, Peter ^a  

^a Max Planck Insititute for Computer Sciences   (Germany)

Author keywords

Cache; Cache efficiency; Data structure; External memory; Heap; Implementation; Multi way merging; Priority queue; Secondary storage

Indexed keywords

EID: 85016902710     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/351827.384249     Document Type: Article

References (24)

1. Aege, L. 1995. The buffer tree: A new technique for optimal I/O-algorithms. In 4th WADS, Number 955 in LNCS (1995), pp. 334-345. Springer.
2. Baeve, R. D., Geove, E. F., and Vittee, J. S. 1997. Simple randomized mergesort on parallel disks. Parallel Computing 23, 4, 601-631.
3. Beengel, K., Ceausee, A., Meyee, U., and Feeeagina, P. 1999. An experimental study of prioritty queues in external memory. In 3rd International Workshop on Algorithmic Engineering (WAE) (1999), pp. 345-359. full paper in ACM Journal of Experimental Algorithmics.
4. Beodal, G. S. and Katajainen, J. 1998. Worst-case efficient external-memory priority queues. In 6th Scandinavian Workshop on Algorithm Theory, Number 1432 in LNCS (1998), pp. 107-118. Springer Verlag, Beriin.
5. Beown, R. 1988. Calendar queues: A fast 0(1) priority queue implementation for the simulation event set problem. Communications of the ACM 31, 10, 1220-1227.
6. Coemen, T. H., Leiseeson, C. E., and Rivest, R. L. 1990. Introduction to Algorithms. McGraw-Hill.
7. Fadel, R., Jakobsen, K. V., Katajainen, J., and Teuhola, J. 1997. External heaps combined with effective buffering. In 4ih Australasian Theory Symposium, Volume 19-2 of Australian Computer Science Communications (1997), pp. 72-78. Springer.
8. Fischee, M. J. and Pateeson, M. S. 1994. Fishspear: A priority queue algorithm. Journal of the ACM 41, 1, 3-30.
9. Hennessy, J. L. and Patteeson, D. A. 1996. Computer Architecture a Quantitative Approach. Morgan Kaufmann.
10. Intel Corporation. 1997. Intel Architecture Software Developer's Manual. Volume I: Basic Architecture. P.O. Box 5937, Denver, CO, 80217-9808, http://www.intel.coin: Intel Corporation. Ordering Number 243190.
11. Jones, D. 1986. An empirical comparison of priority-queue and event set implementations. Communications of the ACM 29, 4, 300-311.
12. Kellee, J. 1996. The 21264: A superscalar alpha processor with out-of-order execution. In Microprocessor Forum (October 1996).
13. Knuth, D. E. 1973. The Art of Computer Programming - Sorting and Searching, Volume 3. Addison Wesley.
14. LaMaeca, A. and Ladnee, R. E. 1996. The influence of caches on the performance of heaps. ACM Journal of Experimental Algorithmics 1, 4.
15. LaMaeca, A. and Ladnee, R. E. 1997. The influence of caches on the performance of sorting. In 8th Symposium on Discrete Algorithm (1997), pp. 370-379.
16. MIPS Technologies, Inc. 1998. Ro Microprocessor User's Manual (2.0 ed.). MIPS Technologies, Inc. http://www.niips.coni.
17. Neumann, J. V. 1945. First draft of a report on the EDVAC. Technical report. University of Pennsylvania.
18. Sandees, P. 1999. Accessing multiple sequences through set associative caches. In ICALP, Number 1644 in LNCS (1999), pp. 655-664.
19. Sun Microsystems. 1997. UltraSPARC-IIi User's Manual. Sun Microsystems.
20. Vengeoff, D. E. 1995. TPIE User Manual and Reference. Duke University, http://www.cs.duke.edu/’dev/tpie_honie_page.html.
21. Vittee, J. S. 1998. External memory algorithms. In 6th European Symposium on Algorithms, Number 1461 in LNCS (1998), pp. 1-25. Springer.
22. Vittee, J. S. and Sheivee, E. A. M. 1994. Algorithms for parallel memory I: Two level memories. Algorithmic 12, 2-3, 110-147.
23. Wegenee, I. 1993. BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT, beating, on an average, QUICKSORT (if n is not very small). Theoretical Computer Science 118, 1 (Sept.), 81-98.
24. Wegnee, L. M. and Teuhola, J. L. 1989. The external heapsort. IEEE Transactions on Software Engineering 15, 7 (July), 9-925.