4-Deap: A Fast 4-ary Deap using Cache


The KIPS Transactions:PartA, Vol. 11, No. 7, pp. 577-582, Dec. 2004
10.3745/KIPSTA.2004.11.7.577,   PDF Download:

Abstract

Double-ended Proirity queues(DEPQ) can be uesd in applications such as scheduling or sorting. The data structures for DEPQ can be constructed with or without pointers. The implicit representation without pointers uses less memory space than pointer-based representation. This paper presents a novel fast implicit heap called 4-deap* which utilizes cache memory efficiently. Experimental results show that the 4-deap* is faster than symmetric min-max heap as well as deap.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. J. Jung, "4-Deap: A Fast 4-ary Deap using Cache," The KIPS Transactions:PartA, vol. 11, no. 7, pp. 577-582, 2004. DOI: 10.3745/KIPSTA.2004.11.7.577.

[ACM Style]
Hae Jae Jung. 2004. 4-Deap: A Fast 4-ary Deap using Cache. The KIPS Transactions:PartA, 11, 7, (2004), 577-582. DOI: 10.3745/KIPSTA.2004.11.7.577.