원문정보
보안공학연구지원센터(IJSEIA)
International Journal of Software Engineering and Its Applications
Vol.9 No.1
2015.01
pp.201-212
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
AM-heap is a heap data structure with O(1) amortized insertion time and O(logn) deletion time complexities. This paper presents cache-aligned 4-ary AM-heap in which every node has four children except that the root has three children. In this heap, the leftmost node of each sibling has an index of a multiple of four. Also, every node index matches its corresponding array index and every sibling nodes smoothly fits into a single cache block. Our experimental results show that cache-aligned 4-ary AM-heap is faster than AM-heap as well as post-order heap.
목차
Abstract
1. Introduction
2. Related Works
3. Cache-aligned 4-ary AM-heap
4. Experimental Results
5. Conclusion
Acknowledgements
References
1. Introduction
2. Related Works
3. Cache-aligned 4-ary AM-heap
4. Experimental Results
5. Conclusion
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보