Fishspear: a priority queue algorithm

Authors:
Michael J. Fischer;Michael S. Paterson
Affiliations:
Yale Univ., New Haven, CT;Univ. of Warwick, Coventry, UK
Venue:
Journal of the ACM (JACM)
Year:
1994

Citing 7
Cited 5

Amortized efficiency of list update and paging rules

Communications of the ACM
Self-adjusting binary search trees

Journal of the ACM (JACM)
Self adjusting heaps

SIAM Journal on Computing
Heaps on heaps

SIAM Journal on Computing
A variant of Heapsort with almost optimal number of comparisons

Information Processing Letters
Communicating sequential processes

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

On RAM priority queues

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fast priority queues for cached memory

Journal of Experimental Algorithmics (JEA)
Funnel Heap - A Cache Oblivious Priority Queue

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Fast Priority Queues for Cached Memory

ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Rank-Sensitive Priority Queues

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures

Quantified Score

Hi-index	0.01

Visualization

Abstract

The Fishspear priority queue algorithm is presented and analyzed. Fishspear is comparable to the usual heap algorithm in its worst-case running time, and its relative performance is much better in many common situations. Fishspear also differs from the heap method in that it can be implemented efficiently using sequential storage such as stacks or tapes, making it potentially attractive for implementation of very large queues on paged memory systems.