Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2010.17A.4.167

A Study on the Runtime Test of Priority Queues  

Jung, Hae-Jae (안동대학교 공과대학 정보통신공학과)
Publication Information
The KIPS Transactions:PartA / v.17A, no.4, 2010 , pp. 167-172 More about this Journal
Abstract
This paper proposes a set of runtime test models for priority queues and shows the runtime test results based on the proposed test models for the representative priority queues: the traditional heap, post-order heap, and pairing heap. Among these heaps, the traditional heap is the worst in time complexity analyzed. But, according to our experimental results based on the test models proposed, it is shown that the slowest one is the pairing heap that utilizes pointers and the fastest one is the traditional heap. For the two implicit heaps, these results are in contrary to the fact that the post-order heap is better than the traditional heap in time complexity analyzed.
Keywords
Data Structure; Priority Queue; Heap;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Jones, "An empirical comparison of priority-queue and event-set implementations," Communications of the ACM, 29(4), pp.300-311, Apr., 1986.   DOI   ScienceOn
2 H. Jung, S. Sahni, "Supernode binary search trees," International Journal of Foundations of Computer Science, 14(3), 465-490, 2003.   DOI   ScienceOn
3 H. Jung, "The d-deap$\ast$: A fast and simple cache-aligned d-ary deap", Information Processing Letters, 93(2), pp.63-67, Jan., 2005.   DOI   ScienceOn
4 M. Fredman, R. Sedgewick, R. Sleator, and R. Tarjan, "The pairing heap: A new form of self-adjusting heap," Algorithmica, 1, pp.111-129, 1, Mar., 1986.   DOI
5 T.J. Stasko and J.S. Vitter, "Pairing heaps: experiments and analysis", Communications of the ACM, 30(3), pp.234-249, 1987.   DOI   ScienceOn
6 M. Fredman and R. Tarjan, "Fibonacci heaps and their uses in improved network optimization algorithms," JACM, 34(3), pp.596-615, 1987.   DOI   ScienceOn
7 S. Bansal, S. Sreekanth, and P. Gupta, "M-heap: A Modified heap data structures," International Journal of Foundations of Computer Science, 14(3), pp.491-502, 2003.   DOI   ScienceOn
8 J. Williams, "Algorithm 232 Heapsort," Communications of the ACM, 7(1), pp.347-348, 1964.
9 E. Horowitz, S. Sahni, and D. Mehta, Fundamentals of Data Structures in C++, W. H. Freeman, San Francisco, 1995.
10 N. Harvey and K. Zatloukal, "The Post-order heap," In Proceedings of the Third International Conference on Fun with Algorithms(FUN), May, 2004.