The d-deap: a fast and simple cache-aligned d-ary deap

Authors:
Haejae Jung
Affiliations:
The School of Computer Science and Engineering, Sungshin Women's University, Seoul 136-742, Republic of Korea
Venue:
Information Processing Letters
Year:
2005

Citing 5
Cited 0

An empirical comparison of priority-queue and event-set implementations

Communications of the ACM
Min-max heaps and generalized priority queues

Communications of the ACM
The Deap—A double-ended heap to implement double-ended priority queues

Information Processing Letters
The influence of caches on the performance of heaps

Journal of Experimental Algorithmics (JEA)
Handbook Of Data Structures And Applications (Chapman & Hall/Crc Computer and Information Science Series.)

Handbook Of Data Structures And Applications (Chapman & Hall/Crc Computer and Information Science Series.)

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper presents a generalized and cache-aligned implicit version of the deap, called d-deap* that utilizes cache memory efficiently. The d-deap* is based on a tree structure that may be mapped into a cache-aligned array without padding. This results in a match between node indexes and array indexes as well as good cache utilization. Experimental results show that the d-deap* clearly outperforms the symmetric min-max heap and deap structures proposed earlier for double-ended priority queues.