Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2004.11A.3.213

8-heap* : A fast 8-ary implicit Priority queue  

Jung, Hae-jae (성신여자대학교 컴퓨터정보학부)
Publication Information
The KIPS Transactions:PartA / v.11A, no.3, 2004 , pp. 213-216 More about this Journal
Abstract
Proirity queues(PQ) can be used in applications such as scheduling or sorting. The data structures for PQ can be constructed with or without pointers. The implicit representation without pointers uses less memory space than pointer-based representation. It if shown that a 2-heap, a traditional Implicit PQ based on a binary tree, is slower than an f-heap based on a 8-ary tree. This is because 8-heap utilizes cache memory more efficiently This paper presents a novel fast implicit heap called 8-heap＊ which is easier to implement. Experimental results show that the 8-heap＊ is faster than 8-heap as well as 2-heap.
Keywords
Data Structures; Priority Queue; Heap; Implicit;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 M. Fredman and R. Tarjan, 'Fibonacci heaps and their uses in improved network optimization algorithms,' JACM, 34(3), pp.596-615, 1987   DOI   ScienceOn
2 M. Fredrnan, R. Sedgewick, R. Sleator and R. Tarjan, 'The pairing heap: A new form of self-adjusting heap,' Algorithmica, 1, pp.111-129, March, 1986   DOI
3 T. J. Stasko and J. S. Vitter, 'Pairing heaps: experiments and analysis,' Communications of the ACM, 30(3), pp.234-249, 1987   DOI   ScienceOn
4 E. Horowitz, S. Sahni and D. Mehta, Fundamentals of Data Structures in C++, W. H. Freeman, San Francisco, 1995
5 A. LaMarca and R. Ladner, 'The Influence of Caches on the Performance of Heaps,' ACM Jounrnal of Experimental Algorithmics, 1(4), 1996   DOI
6 D. Jones, 'An empirical companson of prionty-queue and event- set implementation,' Communications of the Association for Computing Machinery, 29(4), pp.300-311, 1986   DOI   ScienceOn
7 H. Jung, S. Sahni, 'Supernode binary search trees,' International Journal of Foundations of Computer Science, 14(3), pp.465-490, Jun, 2003   DOI   ScienceOn