The cost of cache-oblivious searching

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 271-282

  Bender, Michael A ^a   Brodal, Gerth Stølting ^b   Fagerberg, Rolf ^b   Ge, Dongdong ^a   He, Simai ^a   Hu, Haodong ^a   Iacono, John ^c   López Ortiz, Alejandro ^d  

^a Stony Brook University   (United States)

^b AARHUS UNIVERSITY   (Denmark)

^c POLYTECHNIC UNIVERSITY   (United States)

^d UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CACHE MEMORY; DATA STORAGE EQUIPMENT; DATA STRUCTURES;

CACHE-OBLIVIOUS SEARCHING; DISK ACCESS MODEL; MEMORY HIERARCHY MODELS;

COMPUTATION THEORY;

EID: 0344118881     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (40)

1. P. Agarwal, L. Arge, A. Danner, and B. Holland-Minkley. On cache-oblivious multidimensional range searching. In Proc. 19th ACM Symp. on Comp. Geom. (SOCG), pages 237-245, 2003.
2. A. Aggarwal, B. Alpern, A. K. Chandra, and M. Snir. A model for hierarchical memory. In Proc. of the 19th Ann. ACM Symp. on Theory of Computing (STOC), pages 305-314, 1987.
3. A. Aggarwal, A. K. Chandra, and M. Snir. Hierarchical memory with block transfer. In Proc. of the 28th Annual IEEE Symp. on Foundations of Computer Science (FOCS), pages 204-216, 1987.
4. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988.
5. B. Alpern, L. Carter, E. Feig, and T. Selker. The uniform memory hierarchy model of computation. Algorithmica, 12(2-3):72-109, 1994.
6. S. Alstrup, M. A. Bender, E. D. Demaine, M. Farach-Colton, J. I. Munro, T. Rauhe, and M. Thorup. Efficient tree layout in a multilevel memory hierarchy, 2002, http://www.arXiv.org/abs/cs.DS/0211010.
7. M. Andrews, M. A. Bender, and L. Zhang. New algorithms for the disk scheduling problem. In Proc. of the 37th Ann. Symp. on Foundations of Computer Science (FOCS), pages 580-589, 1996.
8. M. Andrews, M. A. Bender, and L. Zhang. New algorithms for the disk scheduling problem. Algorithmica, 32(2):277-301, 2002.
9. 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 (STOC), pages 268-276, 2002.
10. R. D. Barve and J. S. Vitter. A theoretical framework for memory-adaptive algorithms. In Proc. of the 40th Ann. Symp. on Foundations of Computer Science (FOCS), pages 273-284, 1999.
11. M. Bender, R. Cole, E. Demaine, and M. Farach-Colton. Scanning and traversing: Maintaining data for traversals in a memory hierarchy. In Proc. 10th Ann. European Symp. on Algorithms (ESA), volume 2461 of LNCS, pages 139-151, 2002.
12. 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, 2002.
13. M. Bender, E. Demaine, and M. Farach-Colton. Efficient tree layout in a multilevel memory hierarchy. In Proc. 10th Annual European Symp. on Algorithms (ESA), volume 2461 of LNCS, pages 165-173, 2002.
14. M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In Proc. 41st Ann. Symp. on Foundations of Computer Science (FOCS), pages 399-409, 2000.
15. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 29-39, 2002.
16. R. D. Blumofe, M. Frigo, C. F. Joerg, C. E. Leiserson, and K. H. Randall. An analysis of dag-consistent distributed shared-memory algorithms. In Proc. of the 8th Ann. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 297-308, 1996.
17. 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, 2002.
18. G. S. Brodal and R. Fagerberg. Funnel heap - a cache oblivious priority queue. In Proc. 13th Ann. International Symp. on Algorithms and Computation (ISAAC), volume 2518 of LNCS, pages 219-228, 2002.
19. 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 (SODA), pages 39-48, 2002.
20. E. D. Demaine. Cache-oblivious algorithms and data structures. Unpublished manuscript, June 2002.
21. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In 40th Ann. Symp. on Foundations of Computer Science (FOCS), pages 285-297, 1999.
22. J.-W. Hong and H. T. Kung. I/O complexity: The red-blue pebble game. In Proc. of the 13th Ann. ACM Symp. on Theory of Computation (STOC), pages 326-333, 1981.
23. D. E. Knuth. The Art of Computer Programming: Fundamental Algorithms, volume 1. 3rd edition, 1997.
24. P. Kumar. Cache oblivious algorithms. In U. Meyer, P. Sanders, and J. Sibeyn, editors, Algorithms for Memory Hierarchies, LNCS 2625, pages 193-212, 2003.
25. P. Kumar and E. Ramos. I/O efficient construction of Voronoi diagrams. Unpublished manuscript, July 2002.
26. R. Ladner, R. Fortna, and B.-H. Nguyen. A comparison of cache aware and cache oblivious static search trees using program instrumentation. In Algorithm Design to Robust and Efficient Software, volume 2547 of LNCS, pages 78-92, 2002.
27. R. E. Ladner, J. D. Fix, and A. LaMarca. Cache performance analysis of traversals and random accesses. In Proc. of the Tenth Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 613-622, 1999.
28. A. LaMarca and R. E. Ladner. The influence of caches on the performance of sorting. Journal of Algorithms, 31(1):66-104, 1999. an earlir version appear in SODA 97.
29. H. Prokop. Cache oblivious algorithms. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1999.
30. 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, 2001.
31. C. Ruemmler and J. Wilkes. An introduction to disk drive modeling. IEEE Computer, 27(3):17-29, 1994.
32. J. E. Savage. Extending the Hong-Kong model to memory hierachies. In Proc. of the 1st Ann. International Conference on Computing and Combinatorics, volume 959 of Lecture Notes in Computer Science, pages 270-281, 1995.
33. S. Sen and S. Chatterjee. Towards a theory of cache-efficient algorithms. In Proc. of the 11th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 829-838, 2000.
34. R. C. Singleton. An algorithm for computing the mixed radix fast fourier transform. IEEE Transactions on Audio and Electroacoustics, AU-17(2):93-103, 1969.
35. S. Toledo. Locality of reference in LU decomposition with partial pivoting. SIAM Journal on Matrix Analysis and Applications, 18(4):1065-1081, 1997.
36. P. van Emde Boas. Preserving order in a forest in less than logarithmic time. In Proc. of the 16th Ann. Symp. on Foundations of Computer Science (FOCS), pages 75-84, 1975.
37. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6(3):80-82, 1977.
38. J. S. Vitter. External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys, 33(2), 2001.
39. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2-3):110-147, 1994.
40. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory II: Hierarchical multilevel memories. Algorithmica, 12(2-3):148-169, 1994.