Fishspear: A Priority Queue Algorithm (Extended Abstract)

by Michael J. Fischer , Michael S. Paterson

Citations:

11 - 1 self

User correction supplied by mph

Datum	Value	Source
TITLE	Fishspear: A Priority Queue Algorithm (Extended Abstract)	user correction
AUTHOR NAME	Michael J. Fischer	user correction
AUTHOR AFFIL	Yale University	user correction
AUTHOR ADDR	New Haven, Connecticut	user correction
AUTHOR NAME	Michael S. Paterson	user correction
AUTHOR AFFIL		user correction
ABSTRACT	The Fishspear priority queue algorithm is presented and analyzed. Fishspear makes fewer than 80 % as many comparisons as heaps in the worst case, and its relative performance is even better in many common situations. The code itself embodies an unusual recursive structure which permits highly dynamic and data-dependent execution. Fishspear also differs from heaps in that it can be implemented efficiently using sequential storage such as stacks or tapes, making it possibly attractive for implementation of very large queues on paged memory systems. (Details of the implementation are deferred to the full paper.)	user correction
CITATIONS	5 found	ParsCit 1.0