FISHSPEAR - A PRIORITY QUEUE ALGORITHM

被引：9
|
作者：
FISCHER, MJ [1 ]
PATERSON, MS [1 ]
机构：
[1] UNIV WARWICK,DEPT COMP SCI,COVENTRY CV4 7AL,W MIDLANDS,ENGLAND
来源：
JOURNAL OF THE ACM | 1994年 / 41卷 / 01期
关键词：
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 条
  • [41] The Contention Avoiding Concurrent Priority Queue
    Sagonas, Konstantinos
    Winblad, Kjell
    LANGUAGES AND COMPILERS FOR PARALLEL COMPUTING, LCPC 2016, 2017, 10136 : 314 - 330
  • [42] A two priority queue with crossover feedback
    Jewkes, EM
    Stanford, DA
    QUEUEING SYSTEMS, 2003, 43 (1-2) : 129 - 146
  • [43] Efficiency of Priority Queue Architectures in FPGA
    Kohutka, Lukas
    JOURNAL OF LOW POWER ELECTRONICS AND APPLICATIONS, 2022, 12 (03)
  • [44] QUEUE LENGTH DEPENDENT PRIORITY QUEUES
    BALACHANDRAN, KR
    MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 17 (07): : 463 - 471
  • [45] Delay Analysis of a HOL Priority Queue
    Joris Walraevens
    Bart Steyaert
    Marc Moeneclaey
    Herwig Bruneel
    Telecommunication Systems, 2005, 30 : 81 - 98
  • [46] Three priority queue applications revisited
    Liao, Andrew M.
    Algorithmica (New York), 1992, 7 (04): : 415 - 427
  • [47] DESIGN AND IMPLEMENTATION OF AN EFFICIENT PRIORITY QUEUE
    VANEMDEBOAS, P
    KAAS, R
    ZIJLSTRA, E
    MATHEMATICAL SYSTEMS THEORY, 1977, 10 (02): : 99 - 127
  • [48] BOUNDS FOR A DYNAMIC-PRIORITY QUEUE
    HOLTZMAN, JM
    OPERATIONS RESEARCH, 1971, 19 (02) : 461 - &
  • [49] NONPREEMPTIVE PRIORITY QUEUE WITH BINOMIAL INPUT
    RAJESWARI, AR
    OPERATIONS RESEARCH, 1968, 16 (02) : 416 - +
  • [50] 3 PRIORITY QUEUE APPLICATIONS REVISITED
    LIAO, AM
    ALGORITHMICA, 1992, 7 (04) : 415 - 427
12345