Article

On the limits of cache-obliviousness

Authors:

Gerth Stølting Brodal,

Rolf FagerbergAuthors Info & Claims

STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Pages 307 - 315

https://doi.org/10.1145/780542.780589

Published: 09 June 2003 Publication History

Abstract

In this paper, we present lower bounds for permuting and sorting in the cache-oblivious model. We prove that (1) I/O optimal cache-oblivious comparison based sorting is not possible without a tall cache assumption, and (2) there does not exist an I/O optimal cache-oblivious algorithm for permuting, not even in the presence of a tall cache assumption.Our results for sorting show the existence of an inherent trade-off in the cache-oblivious model between the strength of the tall cache assumption and the overhead for the case M » B, and show that Funnelsort and recursive binary mergesort are optimal algorithms in the sense that they attain this trade-off.

References

[1]

P. Agarwal, L. Arge, A. Danner, and B. Holland-Minkley. On cache-oblivious multidimensional range searching. In Proc. 19th ACM Symposium on Computational Geometry, 2003. To appear.]]

Digital Library

[2]

A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116--1127, Sept. 1988.]]

Digital Library

[3]

L. Arge. External memory data structures. In Proc. 9th Annual European Symposium on Algorithms (ESA), volume 2161 of LNCS, pages 1--29. Springer, 2001.]]

Digital Library

[4]

L. Arge, M. A. Bender, E. D. Demaine, B. Holland-Minkley, and J. I. Munro. Cache-oblivious priority queue and graph algorithm applications. In Proc. 34th Ann. ACM Symp. on Theory of Computing, pages 268--276. ACM Press, 2002.]]

Digital Library

[5]

L. Arge, M. Knudsen, and K. Larsen. A general lower bound on the I/O-complexity of comparison-based algorithms. In F. K. H. A. Dehne, J.-R. Sack, N. Santoro, and S. Whitesides, editors, Algorithms and Data Structures, Third Workshop, volume 709 of LNCS, pages 83--94, Montreal, Canada, 11--13 Aug. 1993. Springer.]]

Digital Library

[6]

S. Baase and A. V. Gelder. Computer Algorithms, Introduction to Design and Analysis. Addison-Wesley, 3rd edition, 1999.]]

Digital Library

[7]

R. Bayer and E. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1:173--189, 1972.]]

Digital Library

[8]

M. Bender, R. Cole, E. Demaine, and M. Farach-Colton. Scanning and traversing: Maintaining data for traversals in a memory hierarchy. In Proc. 10th Annual European Symposium on Algorithms (ESA), volume 2461 of LNCS, pages 139--151. Springer, 2002.]]

Digital Library

[9]

M. Bender, R. Cole, and R. Raman. Exponential structures for cache-oblivious algorithms. In Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP), volume 2380 of LNCS, pages 195--207. Springer, 2002.]]

Digital Library

[10]

M. Bender, E. Demaine, and M. Farach-Colton. Efficient tree layout in a multilevel memory hierarchy. In Proc. 10th Annual European Symposium on Algorithms (ESA), volume 2461 of LNCS, pages 165--173. Springer, 2002.]]

Digital Library

[11]

M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In Proc. 41st Ann. Symp. on Foundations of Computer Science, pages 399--409. IEEE Computer Society Press, 2000.]]

Digital Library

[12]

M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In Proc. 41st Ann. Symp. on Foundations of Computer Science, pages 399--409. IEEE Computer Society Press, 2000.]]

Digital Library

[13]

G. Bilardi and E. Peserico. A characterization of temporal locality and its portability across memory hierarchies. In ICALP: Annual International Colloquium on Automata, Languages and Programming, volume 2076, pages 128--139. Springer, 2001.]]

Digital Library

[14]

G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP), volume 2380 of LNCS, pages 426--438. Springer, 2002.]]

Digital Library

[15]

G. S. Brodal and R. Fagerberg. Funnel heap - a cache oblivious priority queue. In Proc. 13th Annual International Symposium on Algorithms and Computation, volume 2518 of LNCS, pages 219--228. Springer, 2002.]]

Digital Library

[16]

G. S. Brodal, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 39--48, 2002.]]

Digital Library

[17]

M. R. Brown and R. E. Tarjan. A fast merging algorithm. Journal of the ACM, 26(2):211--226, 1979.]]

Digital Library

[18]

M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In 40th Annual Symposium on Foundations of Computer Science, pages 285--297. IEEE Computer Society Press, 1999.]]

Digital Library

[19]

S. Huddleston and K. Mehlhorn. A new data structure for representing sorted lists. Acta Informatica, 17:157--184, 1982.]]

Digital Library

[20]

F. K. Hwang and S. Lin. A simple algorithm for merging two disjoint linearly ordered sets. SIAM Journal of Computing, 1(1):31--39, 1972.]]

[21]

H. Prokop. Cache-oblivious algorithms. Master's thesis, Massachusetts Institute of Technology, June 1999.]]

[22]

N. Rahman, R. Cole, and R. Raman. Optimised predecessor data structures for internal memory. In Proc. 5th Int. Workshop on Algorithm Engineering (WAE), volume 2141, pages 67--78. Springer, 2001.]]

Digital Library

[23]

D. D. Sleator and R. E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of the ACM, 28:202--208, 1985.]]

Digital Library

[24]

J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33(2):209--271, June 2001.]]

Digital Library

Cited By

Brodal GRysgaard CSvenning RSaha BServedio R(2023)External Memory Fully Persistent Search TreesProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585140(1410-1423)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585140
Bender MChowdhury RDas RJohnson RKuszmaul WLincoln ALiu QLynch JXu HScheideler CSpear M(2020)Closing the Gap Between Cache-oblivious and Cache-adaptive AnalysisProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400274(63-73)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400274
Bender MBerry JHammond SScott Hemmert KMcCauley SMoore BMoseley BPhillips CResnick DRodrigues A(2017)Two-level main memory co-designJournal of Parallel and Distributed Computing10.1016/j.jpdc.2016.12.009102:C(213-228)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.jpdc.2016.12.009
Show More Cited By

Index Terms

On the limits of cache-obliviousness
1. Theory of computation
  1. Models of computation

Recommendations

Cache-Oblivious Algorithms

This article presents asymptotically optimal algorithms for rectangular matrix transpose, fast Fourier transform (FFT), and sorting on computers with multiple levels of caching. Unlike previous optimal algorithms, these algorithms are cache oblivious: ...
On the limits of cache-oblivious rational permutations

Permuting a vector is a fundamental primitive which arises in many applications. In particular, rational permutations, which are defined by permutations of the bits of the binary representations of the vector indices, are widely used. Matrix ...
Location cache: a low-power L2 cache system
ISLPED '04: Proceedings of the 2004 international symposium on Low power electronics and design

While set-associative caches incur fewer misses than direct-mapped caches, they typically have slower hit times and higher power consumption, when multiple tag and data banks are probed in parallel. This paper presents the location cache structure which ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

June 2003

740 pages

ISBN:1581136749

DOI:10.1145/780542

Conference Chair:
Lawrence L. Larmore
University of Nevada Las Vegas, Las Vegas, NV
,
Program Chair:
Michel X. Goemans
Massachusetts Institute of Technology, Cambridge, MA

Copyright © 2003 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 June 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

STOC03

Sponsor:

STOC03: The 35th Annual ACM Symposium on Theory of Computing

June 9 - 11, 2003

CA, San Diego, USA

Acceptance Rates

STOC '03 Paper Acceptance Rate 80 of 270 submissions, 30%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

37
Total Citations
View Citations
752
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 31 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Brodal GRysgaard CSvenning RSaha BServedio R(2023)External Memory Fully Persistent Search TreesProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585140(1410-1423)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585140
Bender MChowdhury RDas RJohnson RKuszmaul WLincoln ALiu QLynch JXu HScheideler CSpear M(2020)Closing the Gap Between Cache-oblivious and Cache-adaptive AnalysisProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400274(63-73)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400274
Bender MBerry JHammond SScott Hemmert KMcCauley SMoore BMoseley BPhillips CResnick DRodrigues A(2017)Two-level main memory co-designJournal of Parallel and Distributed Computing10.1016/j.jpdc.2016.12.009102:C(213-228)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.jpdc.2016.12.009
Geissmann BGianinazzi L(2017)Cache Oblivious Minimum CutAlgorithms and Complexity10.1007/978-3-319-57586-5_24(285-296)Online publication date: 14-Apr-2017
https://doi.org/10.1007/978-3-319-57586-5_24
Bilardi GPietracaprina APucci GScquizzato MSilvestri F(2016)Network-Oblivious AlgorithmsJournal of the ACM10.1145/281280463:1(1-36)Online publication date: 30-Mar-2016
https://dl.acm.org/doi/10.1145/2812804
Fagerberg R(2016)Cache-Oblivious ModelEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_62(264-269)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_62
Liu YLu JYang HXiao XWei Z(2015)Towards maximum independent sets on massive graphsProceedings of the VLDB Endowment10.14778/2831360.28313668:13(2122-2133)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.14778/2831360.2831366
Bender MBerry JHammond SMoore BMoseley BPhillips C(2015)k-Means Clustering on Two-Level Memory SystemsProceedings of the 2015 International Symposium on Memory Systems10.1145/2818950.2818977(197-205)Online publication date: 5-Oct-2015
https://dl.acm.org/doi/10.1145/2818950.2818977
Bender MBerry JHammond SHemmert KMcCauley SMoore BMoseley BPhillips CResnick DRodrigues A(2015)Two-Level Main Memory Co-DesignProceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2015.94(835-846)Online publication date: 25-May-2015
https://dl.acm.org/doi/10.1109/IPDPS.2015.94
Stølting G(2015)Cache-Oblivious SortingEncyclopedia of Algorithms10.1007/978-3-642-27848-8_63-2(1-5)Online publication date: 25-Jun-2015
https://doi.org/10.1007/978-3-642-27848-8_63-2
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents