Cache-oblivious algorithms and data structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3111, Issue , 2004, Pages 3-13

  Brodal, Gerth Stølting ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER ARCHITECTURE; DATA STRUCTURES; RANDOM ACCESS STORAGE;

BLOCK SIZES; CACHE MODELING; CACHE REPLACEMENT; CACHE-OBLIVIOUS ALGORITHMS; FORMAL MODEL OF COMPUTATIONS; MEMORY HIERARCHY; MULTI-LEVEL MEMORY HIERARCHY; MULTIPLE LEVELS;

CACHE MEMORY;

EID: 33244496122     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27810-8_2     Document Type: Article

References (73)

1. J. Abello, A. L. Buchsbaum, and J. R. Westbrook. A functional approach to external graph algorithms. Algorithmic, 32(3):437-458, 2002.
2. P. Agarwal, L. Arge, A. Danner, and B. Holland-Minkley. Cache-oblivious data structures for orthogonal range searching. In Proc. 19th ACM Symposium on Computational Geometry, pages 237-245. ACM Press, 2003.
3. A. Aggarwal, B. Alpern, A. K. Chandra, and M. Snir. A model for hierarchical memory. In Proc. 19th Annual ACM Symposium on Theory of Computing, pages 305-314. AMC Press, 1987.
4. A. Aggarwal and A. Chandra. Virtual memory algorithms. In Proc. 20th Annual ACM symposium on Theory of computing, pages 173-185. ACM Press, 1988.
5. A. Aggarwal, A. K. Chandra, and M. Snir. Hierarchical memory with block transfer. In Proc. 28th Annual IEEE Symposium on Foundations of Computer Science, pages 204-216. IEEE Computer Society Press, 1987.
6. 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.
7. B. Alpern, L. Carter, E. Feig, and T. Selker. The uniform memory hierarchy model of computation. Algorithmica, 12(2-3):72-109, 1994.
8. A. Andersson and T. W. Lai. Fast updating of well-balanced trees. In Proc. 2nd Scandinavian Workshop on Algorithm Theory, volume 447 of Lecture Notes in Computer Science, pages 111-121. Springer, 1990.
9. L. Arge. External memory data structures. In J. Abello, P. M. Pardalos, and M. G. C. Resende, editors, Handbook of Massive Data Sets, pages 313-358. Kluwer Academic Publishers, 2002.
10. L. Arge. The buffer tree: A technique for designing batched external data structures. Algorithmica, 37(1):1-24, 2003.
11. 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 Annual ACM Symposium on Theory of Computing, pages 268-276. ACM Press, 2002.
12. L. Arge, G. Brodal, and L. Toma. On external-memory MST, SSSP and multi-way planar graph separation. In Proc. 8th Scandinavian Workshop on Algorithm Theory, volume 1851 of Lecture Notes in Computer Science, pages 433-447. Springer, 2000.
13. L. Arge, G. S. Brodal, and R. Fagerberg. Cache-oblivious data structures. In D. Mehta and S. Sahni, editors, Handbook of Data Structures and Applications, page 27. CRC Press, 2004.
14. L. Arge, J. Chase, J. Vitter, and R. Wickremesinghe. Efficient sorting using registers and caches. ACM Journal of Experimental Algorithmics, 7(9), 2002.
15. L. Arge, M. Knudsen, and K. Larsen. A general lower bound on the I/O-complexity of comparison-based algorithms. In Proc. 3rd Workshop on Algorithms and Data Structures, volume 709 of Lecture Notes in Computer Science, pages 83-94. Springer, 1993.
16. R. D. Barve and J. S. Vitter. A theoretical framework for memory-adaptive algorithms. In Proc. 40th Annual IEEE Symposium on Foundations of Computer Science, pages 273-284. IEEE Computer Society Press, 1999.
17. R. Bayer and E. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1:173-189, 1972.
18. 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, volume 2461 of Lecture Notes in Computer Science, pages 139-151. Springer, 2002.
19. M. Bender, R. Cole, and R. Raman. Exponential structures for cache-oblivious algorithms. In Proc. 29th International Colloquium on Automata, Languages, and Programming, volume 2380 of Lecture Notes in Computer Science, pages 195-207. Springer, 2002.
20. ∼{}bender/pub/treelayout-full.ps.
21. M. A. Bender, G. S. Brodal, R. Fagerberg, D. Ge, S. He, H. Hu, J. Iacono, and A. López-Ortiz. The cost of cache-oblivious searching. In Proc. 44th Annual IEEE Symposium on Foundations of Computer Science, pages 271-282. IEEE Computer Society Press, 2003.
22. M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In Proc. 41st Annual IEEE Symposium on Foundations of Computer Science, pages 399-409. IEEE Computer Society Press, 2000.
23. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 29-38. ACM-SIAM, 2002.
24. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communication of the ACM, 18:509-517, 1975.
25. J. L. Bentley. Decomposable searching problems. Information Processing Letters, 8(5):244-251, 1979.
26. G. Bilardi and E. Peserico. A characterization of temporal locality and its portability across memory hierarchies. In Proc. 28th Annual International Colloquium on Automata, Languages and Programming, volume 2076, pages 128-139. Springer, 2001.
27. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448-461, 1973.
28. G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. 29th International Colloquium on Automata, Languages, and Programming, volume 2380 of Lecture Notes in Computer Science, pages 426-438. Springer, 2002.
29. 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 Lecture Notes in Computer Science, pages 219-228. Springer, 2002.
30. G. S. Brodal and R. Fagerberg. On the limits of cache-obliviousness. In Proc. 35th ACM Symposium on Theory of Computing, pages 307-315. ACM Press, 2003.
31. G. S. Brodal, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 39-48. ACM-SIAM, 2002.
32. G. S. Brodal, R. Fagerberg, U. Meyer, and N. Zeh. Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. In Proc. 9th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science. Springer, 2004.
33. G. S. Brodal, R. Fagerberg, and K. Vinther. Engineering a cache-oblivious sorting algorithm. In Proc. 6th Workshop on Algorithm Engineering and Experiments, page 14, 2004.
34. A. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. Westbrook. On external memory graph traversal. In Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 859-860. ACM Press, 2000.
35. S. Chatterjee, V. V. Jain, A. R. Lebeck, S. Mundhra, and M. Thottethodi. Nonlinear array layouts for hierarchical memory systems. In Proc. 1999 Conference on Supercomputing, ACM SIGARCH, pages 444-453. ACM Press, 1999.
36. Y. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 139-149. ACM-SIAM, 1995.
37. R. A. Chowdhury and V. Ramachandran. Cache-oblivious shortest paths in graphs using buffer heap. In Proc. 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM Press, 2004.
38. E. D. Demaine. Cache-oblivious data structures and algorithms. In Proc. EFF summer school on massive data sets, Lecture Notes in Computer Science. Springer, 2004, to appear.
39. P. F. Dietz and J. Zhang. Lower bounds for monotonic list labeling. In J. R. Gilbert and R. G. Karlsson, editors, Proc. 2nd Scandinavian Workshop on Algorithm Theory, volume 447 of Lecture Notes in Computer Science, pages 173-180. Springer, 1990.
40. A. Farzan and J. I. Munro. Cache-oblivious sorting and searching in multisets. Manuscript, 2004.
41. G. Franceschini. Proximity mergesort: optimal in-place sorting in the cache-oblivious model. In Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 291-299. ACM-SIAM, 2004.
42. G. Franceschini and R. Grossi. Optimal cache-oblivious implicit dictionaries. In Proc. 30th International Colloquium on Automata, Languages and Programming, volume 2719 of Lecture Notes in Computer Science, pages 316-331. Springer, 2003.
43. G. Franceschini and R. Grossi. Optimal worst-case operations for implicit cache-oblivious search trees. In Proc. 8th International Workshop on Algorithms and Data Structures, volume 2748 of Lecture Notes in Computer Science, pages 114-126. Springer, 2003.
44. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In 40th Annual IEEE Symposium on Foundations of Computer Science, pages 285-297. IEEE Computer Society Press, 1999.
45. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. 34th Annual IEEE Symposium on Foundations of Computer Science, pages 714-723. IEEE Computer Society Press, 1993.
46. J. L. Hennessy and D. A. Patterson, editors. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, 3 edition, 2002.
47. J.-W. Hong and H. T. Kung. I/O complexity: The red-blue pebble game. In Proc. 13th Annual ACM Symposium on Theory of Computation, pages 326-333. AMC Press, 1981.
48. A. Itai, A. G. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In Automata, Languages and Programming, 8th Colloquium, volume 115 of Lecture Notes in Computer Science, pages 417-431. Springer, 1981.
49. K. V. R. Kanth and A. K. Singh. Optimal dynamic range searching in non-replicating index structures. In Proc. 7th International Conference on Database Theory, volume 1540 of Lecture Notes in Computer Science, pages 257-276. Springer, 1999.
50. P. Kumar. Cache oblivious algorithms. In U. Meyer, P. Sanders, and J. Sibeyn, editors, Algorithms for Memory Hierarchies, volume 2625 of Lecture Notes in Computer Science, pages 193-212. Springer, 2003.
51. V. Kumar and E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In Proc. 8th SPDP, pages 169-177. IEEE Computer Society Press, 1996.
52. R. E. Ladner, J. D. Fix, and A. LaMarca. Cache performance analysis of traversais and random accesses. In Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 613-622. ACM-SIAM, 1999.
53. R. E. Ladner, R. Fortna, and B.-H. Nguyen. A comparison of cache aware and cache oblivious static search trees using program instrumentation. In Experimental Algorithmics, volume 2547 of Lecture Notes in Computer Science, pages 78-92. Springer, 2002.
54. A. LaMarca and R. E. Ladner. The influence of caches on the performance of heaps. ACM Journal of Experimental Algorithms, 1:4, 1996.
55. A. LaMarca and R. E. Ladner. The influence of caches on the performance of sorting. Journal of Algorithms, 31:66-104, 1999.
56. K. Mehlhorn and U. Meyer. External-memory breadth-first search with sublinear I/O. In Proc. 10th ESA, volume 2461 of Lecture Notes in Computer Science, pages 723-735. Springer, 2002.
57. U. Meyer, P. Sanders, and J. F. Sibeyn, editors. Algorithms for Memory Hierarchies, volume 2625 of Lecture Notes in Computer Science. Springer, 2003.
58. K. Munagala and A. Ranade. I/O-complexity of graph algorithms. In Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 687-694. ACM-SIAM, 1999.
59. D. Ohashi. Cache oblivious data structures. Master's thesis, Department of Computer Science, University of Waterloo, Waterloo, Canada, 2000.
60. H. Prokop. Cache-oblivious algorithms. Master's thesis, Massachusetts Institute of Technology, June 1999.
61. N. Rahman, R. Cole, and R. Raman. Optimised predecessor data structures for internal memory. In Proc. 5th International Workshop on Algorithm Engineering, volume 2141, pages 67-78. Springer, 2001.
62. J. E. Savage. Extending the Hong-Kung model to memory hierachies. In Proc. 1st Annual International Conference on Computing and Combinatorics, volume 959 of Lecture Notes in Computer Science, pages 270-281. Springer, 1995.
63. S. Sen and S. Chatterjee. Towards a theory of cache-efficient algorithms. In Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 829-838. ACM-SIAM, 2000.
64. D. D. Sleator and R. E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of the ACM, 28:202-208, 1985.
65. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.
66. S. Toledo. Locality of reference in LU decomposition with partial pivoting. SIAM Journal on Matrix Analysis and Applications, 18(4):1065-1081, 1997.
67. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6:80-82, 1977.
68. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10:99-127, 1977.
69. J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33(2):209-271, June 2001.
70. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2-3):110-147, 1994.
71. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory II: Hierarchical multilevel memories. Algorithmica, 12(2-3):148-169, 1994.
72. D. E. Willard. A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Information and Computation, 97(2):150-204, 1992.
73. L. Xiao, X. Zhang, and S. A. Kubricht. Improving memory performance of sorting algorithms. ACM Journal of Experimental Algorithmics, 5(3), 2000.