An optimal cache-oblivious priority queue and its application to graph algorithms

SIAM Journal on Computing

Volumn 36, Issue 6, 2007, Pages 1672-1695

  Arge, Lars ^a   Bender, Michael A ^b   Demaine, Erik D ^c   Holland Minkley, Bryan ^d   Munro, J Ian ^e  

^a AARHUS UNIVERSITY   (Denmark)

^b Stony Brook University   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d Duke University   (United States)

^e UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Cache oblivious algorithms; Priority queue

Indexed keywords

CACHE-OBLIVIOUS ALGORITHMS; MEMORY GRAPH ALGORITHMS; PRIORITY QUEUE;

ALGORITHMS; DATA STRUCTURES; GRAPH THEORY; HIERARCHICAL SYSTEMS;

QUEUEING NETWORKS;

EID: 38049076480     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703428324     Document Type: Article

References (61)

1. J. ABELLO, A. L. BUCHSBAUM, AND J. R. WESTBROOK, A functional approach to external graph algorithms, Algorithmica, 32 (2002), pp. 437-458.
2. P. K. AGARWAL, L. ARGE, A. DANNER, AND B. HOLLAND-MINKLEY, Cache-oblivious data structures for orthogonal range searching, in Proceedings of the ACM Symposium on Computational Geometry, 2003, pp. 237-245.
3. A. AGGARWAL, B. ALPERN, A. K. CHANDRA, AND M. SNIR, A model for hierarchical memory, in Proceedings of the ACM Symposium on Theory of Computation, 1987, pp. 305-314.
4. A. AGGARWAL AND A. K. CHANDRA, Virtual memory algorithms, in Proceedings of the ACM Symposium on Theory of Computation, 1988, pp. 173-185.
5. A. AGGARWAL, A. K. CHANDRA, AND M. SNIR, Hierarchical memory with block transfer, in Proceedings of the IEEE Symposium on Foundations of Computer Science, 1987, pp. 204-216.
6. A. AGGARWAL AND J. S. VITTER, The input/output complexity of sorting and related problems, Commun. ACM, 31 (1988), pp. 1116-1127.
7. B. ALPERN, L. CARTER, E. FEIG, AND T. SELKER, The uniform memory hierarchy model of computation, Algorithmica, 12 (1994), pp. 72-109.
8. R. J. ANDERSON AND G. L. MILLER, A simple randomized parallel algorithm for list-ranking, Inform. Process. Lett., 33 (1990), pp. 269-273.
9. L. ARGE, The I/O-complexity of ordered binary-decision diagram manipulation, in Algorithms and Computations, Lecture Notes in Comput. Sci. 1004, Springer, Berlin, 1995, pp. 82-91. A complete version appears as BRICS Technical Report RS-96-29, University of Aarhus, Denmark.
10. L. ARGE, External memory data structures, in Handbook of Massive Data Sets, J. Abello, P. M. Pardalos, and M. G. C. Resende, eds., Kluwer Academic Publishers, Norwell, MA, 2002, pp. 313-358.
11. L. ARGE, The buffer tree: A technique for designing batched external data structures, Algorithmica, 37 (2003), pp. 1-24.
12. L. ARGE, M. BENDER, E. DEMAINE, B. HOLLAND-MINKLEY, AND J. I. MUNRO, Cache-oblivious priority queue and graph algorithm applications, in Proceedings of the ACM Symposium on Theory of Computation, 2002, pp. 268-276.
13. L. ARGE, G. S. BRODAL, AND R. FAGERBERG, Cache-oblivious data structures, in Handbook on Data Structures and Applications, D. Mehta and S. Sahni, eds., CRC Press, Boca Raton, FL, 2005.
14. L. ARGE, G. S. BRODAL, R. FAGERBERG, AND M. LAUSTSEN, Cache-oblivious planar orthogonal range searching and counting, in Proceedings of the ACM Symposium on Computational Geometry, 2005, pp. 160-169.
15. L. ARGE, G. S. BRODAL, AND L. TOMA, On external memory MST, SSSP and multi-way planar graph separation, J. Algorithms, 53 (2004), pp. 186-206.
16. L. ARGE, M. DE BERG, AND H. HAVERKORT, Cache-oblivious R-trees, in Proceedings of the ACM Symposium on Computational Geometry, 2005, pp. 170-179.
17. R. BAYER AND E. MCCREIGHT, Organization and maintenance of large ordered indexes, Acta Inform., 1 (1972), pp. 173-189.
18. M. BENDER, R. COLE, E. DEMAINE, AND M. FARACH-COLTON, Scanning and traversing: Maintaining data for traversais in memory hierarchy, in Proceedings of the European Symposium on Algorithms, 2002, Lecture Notes in Comput. Sci. 2461, Springer, Berlin, 2002, pp. 152-164.
19. M. A. BENDER, G. S. BRODAL, R. FAGERBERG, D. GE, S. HE, H. HU, J. IACONO, AND A. LÓPEZORTIZ, The cost of cache-oblivious searching, in Proceedings of the IEEE Symposium on Foundations of Computer Science, 2003, pp. 271-282.
20. M. A. BENDER, R. COLE, AND R. RAMAN, Exponential structures for cache-oblivious algorithms, in Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, Malaga, Spain, 2002, Lecture Notes in Comput. Sci. 2380, Springer, Berlin, pp. 195-207.
21. M. A. BENDER, E. D. DEMAINE, AND M. FARACH-COLTON, Cache-oblivious B-trees, in Proceedings of the IEEE Symposium on Foundations of Computer Science, 2000, pp. 339-409.
22. M. A. BENDER, Z. DUAN, J. IACONO, AND J. WU, A locality-preserving cache-oblivious dynamic dictionary, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2002, pp. 29-38.
23. 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 Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1996, pp. 297-308.
24. G. S. BRODAL AND R. FAGERBERG, Cache oblivious distribution sweeping, in Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, Malaga, Spain, 2002, Lecture Notes in Comput. Sci. 2380, Springer, Berlin, pp. 426-438.
25. G. S. BRODAL AND R. FAGERBERG, Funnel heap-A cache oblivious priority queue, in Algorithms and Computation, Lecture Notes in Comput. Sci. 2518, Springer, Berlin, 2002, pp. 219-228.
26. G. S. BRODAL AND R. FAGERBERG, On the limits of cache-obliviousness, in Proceedings of the ACM Symposium on Theory of Computation, 2003, pp. 307-315.
27. G. S. BRODAL, R. FAGERBERG, AND R. JACOB, Cache oblivious search trees via binary trees of small height, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2002, pp. 39-48.
28. 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 Algorithm Theory-SWAT 2004, Lecture Notes in Comput. Sci. 3111, Springer, Berlin, 2004, pp. 480-492.
29. G. S. BRODAL AND J. KATAJAINEN, Worst-case efficient external-memory priority queues, in Algorithm Theory-SWAT '98, Lecture Notes in Comput. Sci. 1432, Springer, Berlin, 1998, pp. 107-118.
30. A. L. BUCHSBAUM, M. GOLDWASSER, S. VENKATASUBRAMANIAN, AND J. R. WESTBROOK, On external memory graph traversal, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2000, pp. 859-860.
31. Y.-J. CHIANG, M. T. GOODRICH, E. F. GROVE, R. TAMASSIA, D. E. VENGROFF, AND J. S. VITTER, External-memory graph algorithms, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1995, pp. 139-149.
32. F. CHIN, J. LAM, AND I. CHEN, Efficient parallel algorithms for some graph problems, Commun. ACM, 25 (1982), pp. 659-665.
33. R. A. CHOWDHURY AND V. RAMACHANDRAN, Cache-oblivious shortest paths in graphs using buffer heap, in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, ACM Press, New York, 2004, pp. 245-254.
34. R. COLE AND U. VISHKIN, Deterministic coin tossing with applications to optimal parallel list-ranking, Inform. and Control, 70 (1986), pp. 32-53.
35. R. COLE AND U. VISHKIN, Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms, Inform, and Comput., 92 (1991), pp. 1-47.
36. D. COMER, The ubiquitous B-tree, ACM Computing Surveys, 11 (1979), pp. 121-137.
37. R. FADEL, K. V. JAKOBSEN, J. KATAJAINEN, AND J. TEUHOLA, Heaps and heapsort on secondary storage, Theoret. Comput. Sci., 220 (1999), pp. 345-362.
38. M. FRIGO, C. E. LEISERSON, H. PROKOP, AND S. RAMACHANDRAN, Cache-oblivious algorithms, in Proceedings of the IEEE Symposium on Foundations of Computer Science, 1999, pp. 285-298.
39. S. HUDDLESTON AND K. MEHLHORN, A new data structure for representing sorted lists, Acta Inform., 17 (1982), pp. 157-184.
40. D. E. KNUTH, Sorting and Searching, The Art of Computer Programming, Vol. 3, 2nd ed., Addison-Wesley, Reading, MA, 1998.
41. V. KUMAR AND E. SCHWABE, Improved algorithms and data structures for solving graph problems in external memory, in Proceedings of the IEEE Symposium on Parallel and Distributed Processing, 1996, pp. 169-177.
42. R. LADNER, J. FIX, AND A. LAMARCA, Cache performance analysis of traversais and random accesses, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1999, pp. 613-622.
43. A. LAMARCA AND R. LADNER, The influence of cache on the performance of sorting, J. of Algorithms, 31 (1999), pp. 66-104.
44. A. LAMARCA AND R. E. LADNER, The influence of caches on the performance of heaps, ACM J. Exp. Algorithmics, 1 (1996) (electronic).
45. K. MEHLHORN AND U. MEYER, External-memory breadth-first search with sublinear I/O, in Algorithms-ESA 2002, Lecture Notes in Comput. Sci. 2461, Springer, New York, 2002, pp. 723-735.
46. K. MUNAGALA AND A. RANADE, I/O-complexity of graph algorithms, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1999, pp. 687-694.
47. M. H. OVERMARS, The Design of Dynamic Data Structures, Lecture Notes in Comput. Sci. 156, Springer-Verlag, New York, 1983.
48. R. C. PRIM, Shortest connection networks and some generalizations, Bell Syst. Tech. J., 36 (1957), pp. 1389-1401.
49. N. RAHMAN, R. COLE, AND R. RAMAN, Optimised predecessor data structures for internal memory, in Algorithm Engineering, Lecture Notes in Comput. Sci. 2141, Springer, New York, 2001, pp. 67-78.
50. N. RAHMAN AND R. RAMAN, Analysing cache effects in distribution sorting, in Algorithm Engineering, Lecture Notes in Comput. Sc. 1668, Springer-Verlag, Berlin, 1999, pp. 183-197.
51. J. H. REIF, ED., Synthesis of Parallel Algorithms, Morgan Kaufmann, San Francisco, 1993, pp. 61-114.
52. P. SANDERS, Fast priority queues for cached memory, in Algorithm Engineering and Experimentation, Lecture Notes in Comput. Sci. 1619, Springer, Berlin, 1999, pp. 312-327.
53. J. E. SAVAGE, Extending the Hong-Kung model to memory hierarchies, in Computing and Combinatorics, Lecture Notes in Comput. Sci. 959, Springer, New York, 1995, pp. 270-281.
54. S. SEN, S. CHATTERJEE, AND N. DUMIR, Towards a theory of cache-efficient algorithms, J. ACM, 49 (2002), pp. 828-858.
55. D. D. SLEATOR AND R. E. TARJAN, Amortized efficiency of list update and paging rules, Commun. ACM, 28 (1985), pp. 202-208.
56. R. E. TARJAN AND U. VISHKIN, An efficient parallel biconnectivity algorithm, SIAM J. Comput., 14 (1985), pp. 862-874.
57. S. TOLEDO, Locality of reference in LU decomposition with partial pivoting, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 1065-1081.
58. U. VISHKIN, On efficient parallel strong orientation, Inform. Processing Lett., 20 (1985), pp. 235-240.
59. J. S. VLTTER, External memory algorithms and data structures: Dealing with MASSIVE data, ACM Computing Surveys, 33 (2001), pp. 209-271.
60. R. WICKREMESINGHE, L. ARGE, J. S. CHASE, AND J. S. VITTER, Efficient sorting using registers and caches, ACM J. Exp. Algorithmics, 7 (2002) (electronic).
61. N. ZEH, I/O-Efficient Algorithms for Shortest Path Related Problems, Ph.D. thesis, Carleton University, Ottawa, ON, 2002.