Browse > Article

Extended Pairing Heap Algorithms Considering Cache Effect  

정균락 (홍익대학교 컴퓨터공학과)
김경훈 (포스데이타 SW개발부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.30, no.5_6, 2003 , pp. 250-257 More about this Journal
Abstract
As the memory access time becomes slower relative to the fast processor speed, most systems use cache memory to reduce the gap. The cache performance has an increasingly large impact on the performance of algorithms. Blocking is the well known method to utilize cache and has shown good results in multiplying matrices and search trees like d-heap. But if we use blocking in the data structures which require rotation during insertion or deletion, the execution time increases as the data movements between blocks are necessary. In this paper, we have proposed the extended pairing heap algorithms using block node and shown by experiments that our structure is superior Also in case of using block node, we use less memory space as the number of pointers decreases.
Keywords
Paring Heap; Priority Queue; Cache Memory; Data Structure; Algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. S. Lam and E. E. Rothberg. The Cache Performance and Optimizations of Blocked Algorithms. Conf on Architectural Support for Programming Languages and Operating Systems (ASPLOS IV), pages 63-74, 1991   DOI
2 Trishul M. Chilimbi, Mark D. Hill and James R. Larus. Making Pointer-Based Data Structures Cache Conscious. IEEE Computer pp. 67-74, Dec. 2000   DOI   ScienceOn
3 Eliss Horowitz, Sartaj Sahni, and Susan Anderson-Freed, Fundamental of Data Structure in C, Computer Science Press, 1993
4 Fredman, M.L., and Sdegewick, R., Sleator, D.D., and Tarjan, R.E. The pairing heap: A new form of self-adjusting heap. Algorithmica 1 (Mar, 1986.) 111-129   DOI
5 John T. Stasko and Jeffrey Scott Vitter. Pairing heaps: Experiments and Analysis. ACM (Mar 1987.) Volume 30 Number 3   DOI   ScienceOn
6 A. LaMarca and R. E. Ladner. The Influence of Caches on the Performance of Heaps. Journal of Experimental Algorithmics, Vol 1, Article 4, 1996
7 A. Lamarca and R. E. Ladner. The Influence of Caches on the Performance of Sorting . In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 370-379, 1997
8 R. E. Ladner, J. D. Fix and A. LaMarca. Cache Performance Analysis of Traversals and Random Accesses. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 613-622, 1999
9 A. LaMarca. Caches and Algorithms. Ph. D. Dissertation, University of Washington, May 1996
10 S. Cho and S. Sahni, 'Weighted Biased Leftist Trees and Modified Skip List', ACM Journal on Experimental Algorithmics, 1998   DOI