Experimental evaluation of local heaps
نویسندگان
چکیده
In this paper we present a cache-aware realization of a priority queue, named a local heap, which is a slight modification of a standard binary heap. The new data structure is cache efficient, has a small computational overhead, and achieves a good worst-case performance with respect to the number of element comparisons and the number of element moves. We show both theoretically and experimentally that the data structure is competitive with a standard binary heap, provided that the number of elements stored is not small.
منابع مشابه
Evaluation of Experimental Inactivated Infectious Bursal Disease Vaccine Using a Local Very Virulent Pathotype Strain
متن کامل
Pairing Heaps are Sub - optimalbyMichael
Pairing heaps were introduced as a self-adjusting alternative to Fibonacci heaps. They provably enjoy log n amortized costs for the standard heap operations. Although it has not been veri ed that pairing heaps perform the decrease key operation in constant amortized time, this has been conjectured and extensive experimental evidence supports this conjecture. Moreover, pairing heaps have been ob...
متن کاملAn experimental evaluation of navigation piles∗
A navigation pile, which can be used as a priority queue, is an extension of a selection tree. In a compact form the whole data structure requires only a linear number of bits in addition to the elements stored. In this paper, we study the practical efficiency of three different implementations of navigation piles and compare their efficiency against two implementations of binary heaps. The res...
متن کاملLocal Reasoning with First-Class Heaps, and a New Frame Rule
Separation Logic (SL) brought an advance to program verification of data structures by interpreting (recursively defined) predicates as implicit heaps, and using a separating conjoin operator to construct heaps from disjoint subheaps. While the Frame Rule of SL facilitated local reasoning in program fragments, its restriction to disjoint subheaps means that any form of sharing between predicate...
متن کامل