An experimental study of priority queues in external memory

DOI10.1145/351827.384259MaRDI QIDQ5463414zbMATH OpenOpenAlexFDO

Authors Klaus Brengel, A. Crauser, Paolo Ferragina, Ulrich Meyer

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.384259

zbMATH Keywords

LEDA library

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Recommendations

• Worst-case efficient external-memory priority queues
• Fast priority queues for cached memory
• On RAM Priority Queues
• A faster external memory priority queue with DecreaseKeys
• Equivalence between priority queues and sorting in external memory

Cited in

(11)

• Revisiting priority queues for image analysis
• External memory soft heap, and hard heap, a meldable priority queue
• Equivalence between priority queues and sorting in external memory
• On RAM Priority Queues
• DecreaseKeys are expensive for external memory priority queues
• Worst-case efficient external-memory priority queues
• External memory priority queues with decrease-key and applications to graph algorithms
• A Back-to-Basics Empirical Study of Priority Queues
• A faster external memory priority queue with DecreaseKeys
• Fast priority queues for cached memory
• On sorting, heaps, and minimum spanning trees

Describes a project that uses

Uses Software

• LEDA

This page was built for publication: An experimental study of priority queues in external memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463414)