Fast Priority Queues for Cached Memory

This publication has 9 references indexed in Scilit:

• Simple randomized mergesort on parallel disks
  Parallel Computing, 1997
• The influence of caches on the performance of heaps
  ACM Journal of Experimental Algorithmics, 1996
• The buffer tree: A new technique for optimal I/O-algorithms
  Published by Springer Nature ,1995
• Algorithms for parallel memory, I: Two-level memories
  Algorithmica, 1994
• Fishspear: a priority queue algorithm
  Journal of the ACM, 1994
• The external Heapsort
  IEEE Transactions on Software Engineering, 1989
• Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
  Communications of the ACM, 1988
• An empirical comparison of priority-queue and event-set implementations
  Communications of the ACM, 1986
• First draft of a report on the EDVAC
  Published by Smithsonian Institution ,1945