MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Cache-Oblivious Priority Queue and Graph Algorithm Applications (2002) [41 citations — 9 self]

by Lars Arge ,  Michael A. Bender ,  Erik D. Demaine ,  Bryan Holland-Minkley ,  J. Ian Munro
Add To MetaCart

Abstract:

queue data structure, supporting insertion, deletion, and B ) amortized memory 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.

Citations

6121 Introduction to Algorithms – Cormen, Leiserson, et al. - 2001
447 The ubiquitous b{tree – Comer - 1979
401 The input/output complexity of sorting and related problems – Aggarwal, Vitter - 1988
322 Shortest connecting networks and some generalizations – PRIM - 1957
222 External memory algorithms and data structures: Dealing with – Vitter - 2000
217 Sorting and Searching, volume 3 of The art of computer programming – Knuth - 1973
203 Organization and maintenance of large ordered indexes – Bayer, McCreight - 1985
141 The buffer tree: A new technique for optimal I/O algorithms – Arge - 1995
136 External-memory graph algorithms – Chiang, Goodrich, et al. - 1995
113 A model for hierarchical memory – Aggarwal, Alpern, et al. - 1987
102 The uniform memory hierarchy model of computation. Algorithmica – Alpern, Carter, et al. - 1994
100 Hierarchical memory with block transfer – Aggarwal, Chandra, et al. - 1987
93 Cache-oblivious B-trees – Bender, Demaine, et al. - 2000
93 An efficient parallel biconnectivity algorithm – Tarjan, Vishkin - 1985
92 An analysis of dag-consistent distributed shared-memory algorithms – Blumofe, Frigo, et al. - 1996
91 A new data structure for representing sorted lists – Huddleston, Mehlhorn - 1982
81 Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking – Cole, Vishkin - 1986
73 A functional approach to external graph algorithms – Abello, Buchsbaum, et al.
66 Locality of reference in lu decomposition with partial pivoting – Toledo - 1997
65 Improved algorithms and data structures for solving graph problems in external memory – Kumar, Schwabe - 1996
62 External memory data structures – Arge - 2002
60 The Influence of Caches on the Performance of Heaps – LaMarca, Ladner - 1996
58 Algorithms for parallel memory II: Hierarchical multilevel memories – Vitter, Shriver - 1994
55 Efficient parallel algorithms for some graph problems – Chin, Lam, et al. - 1982
54 A locality-preserving cache-oblivious dynamic dictionary – Bender, Duan, et al. - 2002
49 Cache oblivious search trees via binary trees of small height – BRODAL, FAGERBERG, et al.
49 I/O-complexity of graph algorithms – Kameshwar, Ranade - 1999
43 On external memory graph traversal – Buchsbaum, Goldwasser, et al.
30 Worst-case efficient external-memory priority queues – Brodal, Katajainen - 1998
28 The I/O-complexity of ordered binary-decision diagram manipulation – Arge - 1995
27 On external memory MST, SSSP and multi-way planar graph separation – Arge, Brodal, et al. - 2000
27 Optimized predecessor data structures for internal memory – Rahman, Cole, et al. - 2001
24 A simple randomized parallel algorithm for list-ranking – Anderson, Miller - 1990
24 Extending the Hong-Kung model to memory hierachies – Savage - 1995
18 Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms – Cole, Vishkin - 1991
16 Virtual memory algorithms – Aggarwal, Chandra - 1988
14 Heaps and heapsort on secondary storage – Fadel, Jakobsen, et al. - 1999
14 On efficient parallel strong orientation – Vishkin - 1985
5 Hierarchical memory with block transfer – Chandra, Snir - 1987
3 An ecient parallel biconnectivity algorithm – Tarjan, Vishkin - 1985
2 Worst-case ecient external-memory priority queues – Brodal, Katajainen - 1998
View or Download | Add to My Collection | Correct Errors