## Funnel heap - a cache oblivious priority queue (2002)

### Cached

### Download Links

- [www.cs.au.dk]
- [www.mpi-inf.mpg.de]
- [www.cs.au.dk]
- [www.brics.dk]
- [www.daimi.au.dk]
- [www.brics.dk]
- [www.daimi.au.dk]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proc. 13th Annual International Symposium on Algorithms and Computation, volume 2518 of LNCS |

Citations: | 34 - 8 self |

### BibTeX

@INPROCEEDINGS{Brodal02funnelheap,

author = {Gerth Stølting Brodal and Rolf Fagerberg},

title = {Funnel heap - a cache oblivious priority queue},

booktitle = {In Proc. 13th Annual International Symposium on Algorithms and Computation, volume 2518 of LNCS},

year = {2002},

pages = {219--228},

publisher = {Springer Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract The cache oblivious model of computation is a two-level memory model with the assumption that the parameters of the model are unknown to the algorithms. A consequence of this assumption is that an algorithm efficient in the cache oblivious model is automatically efficient in a multi-level memory model. Arge et al. recently presented the first optimal cache oblivious priority queue, and demonstrated the importance of this result by providing the first cache oblivious algorithms for graph problems. Their structure uses cache oblivious sorting and selection as subroutines. In this paper, we devise an alternative optimal cache oblivious priority queue based only on binary merging. We also show that our structure can be made adaptive to different usage profiles. 1

### Citations

8530 |
Introduction to Algorithms
- Cormen, Leiserson, et al.
- 1990
(Show Context)
Citation Context ...models for analyzing the memory access patterns of algorithms on modern computer architectures with several levels of memory and caches. The cache oblivious model, recently introduced by Frigo et al. =-=[13]-=-, is based on the I/O model of Aggarwal and Vitter [1], which has been the most widely used external memory model—see the surveys by Arge [2] and Vitter [14]. Both models assume a two-level memory hie... |

537 |
The input/output complexity of sorting and related problems
- Aggarwal, Vitter
- 1988
(Show Context)
Citation Context ...rithms on modern computer architectures with several levels of memory and caches. The cache oblivious model, recently introduced by Frigo et al. [13], is based on the I/O model of Aggarwal and Vitter =-=[1]-=-, which has been the most widely used external memory model—see the surveys by Arge [2] and Vitter [14]. Both models assume a two-level memory hierarchy where the lower level has size M and data is tr... |

320 | External Memory Algorithms and Data Structures: Dealing with Massive Data
- Vitter
- 1981
(Show Context)
Citation Context ...model, recently introduced by Frigo et al. [13], is based on the I/O model of Aggarwal and Vitter [1], which has been the most widely used external memory model—see the surveys by Arge [2] and Vitter =-=[14]-=-. Both models assume a two-level memory hierarchy where the lower level has size M and data is transfered between the two levels in blocks of B elements. The difference is that in the I/O model the al... |

254 |
Organization and maintenance of large ordered indexes
- Bayer, McCreight
- 1972
(Show Context)
Citation Context ...odel. They also presented optimal cache oblivious algorithms for matrix transposition, FFT, and sorting. Cache oblivious search trees which match the search cost of the standard (cache aware) B-trees =-=[3]-=- were presented in [4, 5, 6, 8]. Cache oblivious algorithms for computational geometry problems were developed in [4, 7]. The first cache oblivious priority queue was recently developed by Arge et al.... |

133 | Concurrent cache-oblivious B-trees
- Bender, Fineman, et al.
- 2005
(Show Context)
Citation Context ...ted optimal cache oblivious algorithms for matrix transposition, FFT, and sorting. Cache oblivious search trees which match the search cost of the standard (cache aware) B-trees [4] were presented in =-=[6,8,9,11]-=-. Cache oblivious algorithms have also been given for problems in computational geometry [6,10], for scanning dynamic sets [5], and for layout of static trees [7]. Recently, the first ⋆ Partially supp... |

79 | External memory data structures
- Arge
- 2002
(Show Context)
Citation Context ...ache oblivious model, recently introduced by Frigo et al. [13], is based on the I/O model of Aggarwal and Vitter [1], which has been the most widely used external memory model—see the surveys by Arge =-=[2]-=- and Vitter [14]. Both models assume a two-level memory hierarchy where the lower level has size M and data is transfered between the two levels in blocks of B elements. The difference is that in the ... |

72 | A locality-preserving cache-oblivious dynamic dictionary
- Bender, Duan, et al.
- 2002
(Show Context)
Citation Context ...ted optimal cache oblivious algorithms for matrix transposition, FFT, and sorting. Cache oblivious search trees which match the search cost of the standard (cache aware) B-trees [4] were presented in =-=[6,8,9,11]-=-. Cache oblivious algorithms have also been given for problems in computational geometry [6,10], for scanning dynamic sets [5], and for layout of static trees [7]. Recently, the first ⋆ Partially supp... |

64 | Cache-oblivious priority queue and graph algorithm applications
- Arge, Bender, et al.
- 2002
(Show Context)
Citation Context ...n (contract number ANS-0257/20). ⋆ ⋆ ⋆ Basic Research in Computer Science, www.brics.dk, funded by the Danish National Research Foundation.cache oblivious priority queue was developed by Arge et al. =-=[3]-=-, who also showed how this result leads to several cache oblivious graph algorithms. The structure of Arge et al. uses existing cache oblivious sorting and selection algorithms as subroutines. In this... |

63 | Cache oblivious search trees via binary trees of small height (extended abstract
- Brodal, Fagerberg, et al.
- 2002
(Show Context)
Citation Context ...ted optimal cache oblivious algorithms for matrix transposition, FFT, and sorting. Cache oblivious search trees which match the search cost of the standard (cache aware) B-trees [4] were presented in =-=[6,8,9,11]-=-. Cache oblivious algorithms have also been given for problems in computational geometry [6,10], for scanning dynamic sets [5], and for layout of static trees [7]. Recently, the first ⋆ Partially supp... |

40 | Cache oblivious distribution sweeping, in
- Brodal, Fagerberg
(Show Context)
Citation Context ...search trees which match the search cost of the standard (cache aware) B-trees [4] were presented in [6,8,9,11]. Cache oblivious algorithms have also been given for problems in computational geometry =-=[6,10]-=-, for scanning dynamic sets [5], and for layout of static trees [7]. Recently, the first ⋆ Partially supported by the Future and Emerging Technologies programme of the EU under contract number IST-199... |

31 | Scanning and traversing: maintaining data for traversals in a memory hierarchy
- Bender, Cole, et al.
(Show Context)
Citation Context ...h cost of the standard (cache aware) B-trees [4] were presented in [6,8,9,11]. Cache oblivious algorithms have also been given for problems in computational geometry [6,10], for scanning dynamic sets =-=[5]-=-, and for layout of static trees [7]. Recently, the first ⋆ Partially supported by the Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM-FT). ⋆⋆ Supporte... |

30 | Efficient tree layout in a multilevel memory hierarchy
- Bender, Demaine, et al.
(Show Context)
Citation Context ... B-trees [4] were presented in [6,8,9,11]. Cache oblivious algorithms have also been given for problems in computational geometry [6,10], for scanning dynamic sets [5], and for layout of static trees =-=[7]-=-. Recently, the first ⋆ Partially supported by the Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM-FT). ⋆⋆ Supported by the Carlsberg Foundation (contr... |

20 |
Exponential structures for cache-oblivious algorithms
- Bender, Cole, et al.
- 2001
(Show Context)
Citation Context |

11 | Fishspear: A priority queue algorithm
- Fischer, Paterson
- 1994
(Show Context)
Citation Context ...k denotes the number of smaller elements present in the priority queue. DeleteMin is amortized for free since the work is charged to the insertions. These results extend the line of research taken in =-=[12]-=-, where (a) and (c) are called size profile and max depth profile, respectively. We note that as in [10], we can relax the tall cache assumption by changing parameters in the construction. More precis... |