Cache-oblivious shortest paths in graphs using Buffer Heap

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 245-254

  Chowdhury, Rezaul Alam ^a   Ramachandran, Vijaya ^a  

^a University of Texas at Austin   (United States)

Author keywords

Buffer heap; Cache aware model; Cache oblivious model; Decrease key; Priority queue; Shortest paths; Tournament tree

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL MODELS; SET THEORY;

BUFFER HEAP; CACHE-AWARE MODEL; CACHE-OBLIVIOUS MODEL; PRIORITY QUEUEING (PQ); SHORTEST PATH ALGORITHMS; TOURNAMENT TREE;

CACHE MEMORY;

EID: 8344257223     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007949     Document Type: Conference Paper

References (15)

1. A. Aggarwal and J.S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31:1116-1127, 1988.
2. L. Arge, M. A. Bender, E. D. Demaine, B. Holland-Minkley, and J. I. Munro. Cache-oblivious priority queue and graph algorithm applications. In Proceedings of ACM Symposium on Theory of Computing, pp. 268-276, May 2002.
3. G.S. Brodal and R. Fagerberg. Funnel heap - a cache oblivious priority queue. In Proceedings of the 13th Annual International Symposium on Algorithms and Computation, LNCS 8518, pp. 219-228, Nov. 2002.
4. G.S. Brodal, R. Fagerberg, U. Meyer, and N. Zeh. Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. To appear in Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, July 2004.
5. 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, pp. 859-860, 2000.
6. 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, pp. 139-149, 1995.
7. E.W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
8. M.L. Fredman and R.E. Tarjan. Fibonacci heaps and their use in improved network optimization algorithms. Journal of the ACM, 34:596-615, 1987.
9. M. Frigo, C.E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 285-297, 1999.
10. I. Katriel and U. Meyer. Elementary graph algorithms in external memory. In U. Meyer, P. Sanders, and J.F. Sibeyn, editors, Algorithms for Memory Hierarchies, LNCS 2625. Springer, 2003.
11. 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, pp. 169-177, 1996.
12. U. Meyer and N. Zeh. I/O-efficient undirected shortest paths. In Proceedings of the European Symposium on Algorithms, LNCS 2832, pp. 434-445, Sep. 2003.
13. S. Pettie and V. Ramachandran. Computing shortest paths with comparisons and additions. In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 713-722, San Francisco, CA, 2002.
14. H. Prokop. Cache-oblivious algorithms. Master's thesis, Department of Electrical Engineering and Computer Science, MIT, June 1999.
15. J.S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33(2):209-271, 2001.