Performance Engineering Case Study: Heap Construction

@article{Bojesen2000PerformanceEC,
  title={Performance Engineering Case Study: Heap Construction},
  author={Jesper Bojesen and Jyrki Katajainen and Maz Spork},
  journal={ACM Journal of Experimental Algorithmics},
  year={2000},
  volume={5},
  pages={15}
}
The behaviour of three methods for constructing a binary heap on a computer with a hierarchical memory is studied. The methods considered are the original one proposed by Williams [1964], in which elements are repeatedly inserted into a single heap; the improvement by Floyd [1964], in which small heaps are repeatedly merged to bigger heaps; and a recent method proposed, e.g., by Fadel et al. [1999] in which a heap is built layerwise. Both the worst-case number of instructions and that of cache… CONTINUE READING

From This Paper

Topics from this paper.
0 Citations
0 References
Similar Papers

Similar Papers

Loading similar papers…