R-Kleene: A high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks

Algorithmica (New York)

Volumn 47, Issue 2, 2007, Pages 203-213

  D'Alberto, Paolo ^a   Nicolau, Alexandru ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Algorithm engineering; Optimizations; Performance evolution

Indexed keywords

ALGORITHM ENGINEERING; INTEGER VALUES; KLEENE'S ALGORITHMS; PERFORMANCE EVOLUTION;

GRAPH THEORY; MATRIX ALGEBRA; PROBLEM SOLVING; RANDOM PROCESSES;

ALGORITHMS;

EID: 33846864717     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-1224-z     Document Type: Article

References (27)

1. Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
2. Ullman, J., Yannakakis, M.: The input/output complexity of transitive closure. In: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Volume 19, 1990.
3. V. Strassen: Gaussian elimination is not optimal. Numerische. Mathematik 14 (1969), 354-356.
4. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: Proceedings of the 19th Annual ACM Conference on Theory of Computing, pp. 1-6, 1987.
5. Zwick, U.: All pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM 49 (2002), 289-317.
6. Floyd, R.: Algorithm 97: Shortest path. Communications of the ACM 5 (1962).
7. Warshall, S.: A theorem on boolean matrices. Journal of the ACM 9 (1962).
8. Whaley, R. C., Dongarra, J. J.: Automatically tuned linear algebra software. In: Proceedings of the 1998 ACM/IEEE Conference on Supercomputing (CDROM), pp. 1-27. IEEE Computer Society, Los Alamitos, CA, 1998.
9. Blumofe, R., Frigo, M., Joerg, C., Leiserson, C., Randall, K.: Dag-consistent distributed shared memory. In: IPPS '96: Proceedings of the 10th International Parallel Processing Symposium, pp. 132-141. IEEE Computer Society, Los Alamitos, CA, 1996.
10. Chatterjee, S., Lebeck, A., Patnala, P., Thottethodi, M.: Recursive array layout and fast parallel matrix multiplication. In: Proceedings of 11th ACM SIGPLAN, 1999.
11. Zwick, U.: Exact and approximate distances in graphs - a survey. In: Proceedings of the 9th Annual European Symposium on Algorithms, pp. 33-48. Springer-Verlag, Berlin, 2001.
12. Dijkstra, E.: A note on two problems in connection with graphs. Numerische Mathematik (1959), 269-271.
13. Park, J., Penner, M., Prasanna, V.: Optimizing graph algorithms for improved cache performance. In: Proceedings of the International Parallel and Distributed Processing Symposium, 2002.
14. Penner, M., Prasanna, V.: Cache-friendly implementations of transitive closure. In: Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, 2001.
15. Sibeyn, S.: External matrix multiplication and all-pairs shortest path. Information Processing Letters 91 (2004), 99-106.
16. Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 516-525. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1994.
17. Demetrescu, C., Italiano, G.F.: A new approach to dynamic all pairs shortest paths. In: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing, pp. 159-166. ACM Press, New York, 2003.
18. Demetrescu, C., Emiliozzi, S., Italiano, G.F.: Experimental analysis of dynamic all pairs shortest path algorithms. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 369-378. Society for Industrial and Applied Mathematics, Philadelphia, PA, 2004.
19. Frens, J., Wise, D.: Auto-blocking matrix-multiplication or tracking BLAS3 performance from source code. In: Proceedings of the 1997 ACM Symposium on Principles and Practice of Parallel Programming, pp. 206-216, Volume 32, 1997.
20. Gustavson, F.: Recursion leads to automatic variable blocking for dense linear algebra algorithms. Journal of Research and Development 41 (1997).
21. Gustavson, F., Henriksson, A., Jonsson, I., Ling, P., Kagstrom, B.: Recursive blocked data formats and BLASs for dense linear algebra algorithms. In Verlag, S., ed.: PARA '98 Proceedings, pp. 195-206. Lecture Notes in Computing Science, No. 1541. Springer-Verlag, Berlin, 1998.
22. Hong, J., Kung, T.: I/o complexity, the red-blue pebble game. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pp. 326-333, 1981.
23. Jalby, E.G.W., Teman, O.: To copy or not to copy: a compile-time technique for assessing when data copying should be used to eliminate cache conflicts. In: Proceedings of Supercomputing, pp. 410-4-19, 1993.
24. Rothberg, M.L.E., Wolfe, M.: The cache performance and optimizations of blocked algorithms. In: Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating System, pp. 63-74, 1991.
25. Dayde, M., Duff, I.: A blocked implementation of level 3 BLAS for RISC processors. Technical Report TR_PA_96_062, CERFACS, 1996. http://www.cerfacs.fr/ algoi-/reports/TR_PA_96_06.ps.gz.
26. Bilardi, G., D'Alberto, P., Nicolau, A.: Fractal matrix multiplication: a case study on portability of cache performance. In: Workshop on Algorithm Engineering 2001, Aarhus, Denmark, 2001.
27. Chatterjee, S., Jain, V., Lebeck, A., Mundhra, S.: Nonlinear array layouts for hierarchical memory systems. In: Proceedings of ACM International Conference on Supercomputing, Rhodes, Greece, 1999.