Cache-oblivious priority queue and graph algorithm applications (2002)
| Venue: | In Proc. 34th Annual ACM Symposium on Theory of Computing |
| Citations: | 56 - 10 self |
BibTeX
@INPROCEEDINGS{Arge02cache-obliviouspriority,
author = {Lars Arge and Bryan Holland-minkley and Michael A. Bender and J. Ian Munro and Erik D. Demaine},
title = {Cache-oblivious priority queue and graph algorithm applications},
booktitle = {In Proc. 34th Annual ACM Symposium on Theory of Computing},
year = {2002},
pages = {268--276},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and deletemin operations in O ( 1 B logM/B N) amortized memory B transfers, where M and B are the memory and block transfer sizes of any two consecutive levels of a multilevel memory hierarchy. In a cache-oblivious data structure, M and B are not used in the description of the structure. The bounds match the bounds of several previously developed external-memory (cache-aware) priority queue data structures, which all rely crucially on knowledge about M and B. Priority queues are a critical component in many of the best known external-memory graph algorithms, and using our cache-oblivious priority queue we develop several cacheoblivious graph algorithms.
