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 条
  • [31] The Adaptive Priority Queue with Elimination and Combining
    Calciu, Irina
    Mendes, Hammurabi
    Herlihy, Maurice
    DISTRIBUTED COMPUTING (DISC 2014), 2014, 8784 : 406 - 420
  • [32] A preemptive priority queue with preemptions penalty
    Emran Mohammadi
    Mahdi Alinaghian
    The International Journal of Advanced Manufacturing Technology, 2015, 77 : 399 - 405
  • [33] Hybrid Priority Queue and its Applications
    Li, Zhouzi
    Harchol-Balter, Mor
    Scheller-Wolf, Alan
    Performance Evaluation Review, 2024, 52 (02): : 12 - 14
  • [34] A Practical, Scalable, Relaxed Priority Queue
    Zhou, Tingzhe
    Michael, Maged
    Spear, Michael
    PROCEEDINGS OF THE 48TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP 2019), 2019,
  • [35] A survey of concurrent priority queue algorithms
    Dragicevic, Kristijan
    Bauer, Daniel
    2008 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-8, 2008, : 2080 - 2085
  • [36] QUEUE LENGTH IN PRIORITY QUEUING SYSTEMS
    DANIELYA.EA
    IVANOV, GA
    TEORIYA VEROYATNOSTEI I YEYE PRIMENIYA, 1973, 18 (04): : 859 - 861
  • [37] A PRIORITY TANDEM QUEUE WITH NO INTERMEDIATE BUFFER
    CHAO, X
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1994, 45 (03) : 321 - 329
  • [38] Perfectly Secure Oblivious Priority Queue
    Ichikawa, Atsunori
    Ogata, Wakaha
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2023, E106A (03) : 272 - 280
  • [39] A two priority queue with crossover feedback
    Jewkes, EM
    Stanford, DA
    QUEUEING SYSTEMS, 2003, 43 (1-2) : 129 - 146
  • [40] PRIORITY QUEUE ADMINISTRATION BY SUBLIST INDEX
    NEVALAINEN, O
    TEUHOLA, J
    COMPUTER JOURNAL, 1979, 22 (03): : 220 - 225
12345