FISHSPEAR - A PRIORITY QUEUE ALGORITHM

被引:9
|
作者
FISCHER, MJ [1 ]
PATERSON, MS [1 ]
机构
[1] UNIV WARWICK,DEPT COMP SCI,COVENTRY CV4 7AL,W MIDLANDS,ENGLAND
关键词
COMPARISON COUNT; COMPLEXITY ANALYSIS; HEAP; ONLINE ALGORITHM; PRIORITY QUEUE; RUNNING TIME; SEQUENTIAL STORAGE;
D O I
10.1145/174644.174645
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
下载
收藏
页码:3 / 30
页数:28
相关论文
共 50 条