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.
机构:
Science School, Beijing University of Civil Engineering and Architecture, Beijing, China
Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun, ChinaScience School, Beijing University of Civil Engineering and Architecture, Beijing, China
Zhang, Changlun
Wang, Kaixuan
论文数: 0引用数: 0
h-index: 0
机构:
School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing, ChinaScience School, Beijing University of Civil Engineering and Architecture, Beijing, China
Wang, Kaixuan
Mu, Haibing
论文数: 0引用数: 0
h-index: 0
机构:
School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing, ChinaScience School, Beijing University of Civil Engineering and Architecture, Beijing, China