The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation

Theory of Computing Systems

Volumn 47, Issue 4, 2010, Pages 878-919

  Chowdhury, Rezaul Alam ^a   Ramachandran, Vijaya ^a  

^a University of Texas at Austin   (United States)

Author keywords

All pairs shortest path; Cache oblivious; Gaussian elimination; Matrix multiplication; Parallel; Tiling

Indexed keywords

ALL-PAIRS SHORTEST PATHS; CACHE-OBLIVIOUS; GAUSSIAN ELIMINATION; MATRIX MULTIPLICATION; PARALLEL; TILING;

GRAPH THEORY; MATRIX ALGEBRA;

CACHE MEMORY;

EID: 77956615160     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-010-9273-8     Document Type: Article

References (34)

1. Acar, U. A., Blelloch, G. E., Blumofe, R. D.: The data locality of work stealing. In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 1-12. ACM, New York (2000).
2. Aggarwal, A., Vitter, J.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116-1127 (1988).
3. Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974).
4. Blelloch, G., Chowdhury, R., Gibbons, P., Ramachandran, V., Chen, S., Kozuch, M.: Provably good multicore cache performance for divide-and-conquer algorithms. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, pp. 501-510 (2008).
5. Blelloch, G., Gibbons, P.: Effectively sharing a cache among threads. In: Proceedings of the 16th ACM Symposium on Parallelism in Algorithms and Architectures, Barcelona, Spain, pp. 235-244 (2004).
6. Blumofe, R., Frigo, M., Joerg, C., Leiserson, C., Randall, K.: An analysis of DAG-consistent distributed shared-memory algorithms. In: Proceedings of the 8th ACM Symposium on Parallel Algorithms and Architectures, pp. 297-308 (1996).
7. Chatterjee, S., Lebeck, A., Patnala, P., Thotethodi, M.: Recursive array layouts and fast parallel matrix multiplication. In: Proceedings of the 11th ACM Symposium on Parallel Algorithms and Architectures, pp. 222-231 (1999).
8. Chowdhury, R., Ramachandran, V.: Cache-oblivious dynamic programming. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, Miami, Florida, pp. 591-600 (2006).
9. Chowdhury, R., Ramachandran, V.: The cache-oblivious Gaussian Elimination Paradigm: Theoretical framework, parallelization and experimental evaluation. In: Proceedings of the 19th ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, pp. 71-80 (2007).
10. Chowdhury, R., Ramachandran, V.: Cache-efficient dynamic programming algorithms for multicores. In: Proceedings of the 20th ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, pp. 207-216 (2008).
11. Chowdhury, R., Silvestri, F., Blakeley, B., Ramachandran, V.: Oblivious algorithms for multicores and network of processors. In: Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium, Atlanta, Georgia, April 2010.
12. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001).
13. D'Alberto, P., Nicolau, A.: R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks. Algorithmica 47(2), 203-213 (2007).
14. Dementiev, R., Kettner, L., Sanders, P.: STXXL: Standard template library for XXL data sets. In: Proceedings of the 13th Annual European Symposium on Algorithms. LNCS, vol. 1004, pp. 640-651. Springer, Berlin (2005).
15. Floyd, R.: Algorithm 97 (SHORTEST PATH). Commun. ACM 5(6), 345 (1962).
16. Frigo, M., Leiserson, C., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 285-297 (1999).
17. Frigo, M., Leiserson, C., Randall, K.: The implementation of the Cilk-5 multithreaded language. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, Montreal, Canada, pp. 212-223 (1998).
18. Frigo, M., Strumpen, V.: The cache complexity of multithreaded cache oblivious algorithms. In: Proceedings of the 18th ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, pp. 271-280 (2006).
19. Fujitsu MAP3147NC/NP MAP3735NC/NP MAP3367NC/NP disk drives product/maintenance manual.
20. Goto, K.: GotoBLAS (2005). http://www. tacc. utexas. edu/resources/software.
21. Gunnels, J., Gustavson, F., Henry, G., van de Geijn, R.: FLAME: Formal linear algebra methods environment. ACM Trans. Math. Softw. 27(4), 422-455 (2001).
22. Hong, J., Kung, H.: 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. Iversion, K.: A Programming Language. Wiley, New York (1962).
24. Knuth, D.: Two notes on notation. Am. Math. Mon. 99, 403-422 (1992).
25. Muchnick, S.: Advanced Compiler Design & Implementation. Morgan Kaufmann, San Mateo (1997).
26. Pan, S., Cherng, C., Dick, K., Ladner, R.: Algorithms to take advantage of hardware prefetching. In: Proceedings of the 9th Workshop on Algorithm Engineering and Experiments, pp. 91-98 (2007).
27. Park, J., Penner, M., Prasanna, V.: Optimizing graph algorithms for improved cache performance. IEEE Trans. Parallel Distrib. Syst. 15(9), 769-782 (2004).
28. Powell, D., Allison, L., Dix, T.: Automated empirical optimization of software and the ATLAS project. Parallel Comput. 27(1-2), 3-35 (2001). http://math-atlas. sourceforge. net.
29. Seward, J., Nethercote, N.: Valgrind (debugging and profiling tool for x86-Linux programs). http://valgrind. kde. org/index. html.
30. Toledo, S.: Locality of reference in LU decomposition with partial pivoting. SIAM J. Matrix Anal. Appl. 18(4), 1065-1081 (1997).
31. Warshall, S.: A theorem on boolean matrices. J. ACM 9(1), 11-12 (1962).
32. Wolf, M., Lam, M.: A data locality optimizing algorithm. In: Proceedings of the ACM SIGPLAN 1991 Conference on Programming Language Design and Implementation, pp. 30-44 (1991).
33. Womble, D., Greenberg, D., Wheat, S., Riesen, R.: Beyond core: Making parallel computer I/O practical. In: Proceedings of the 1993 DAGS/PC Symposium, pp. 56-63 (1993).
34. Yotov, K., Roeder, T., Pingali, K., Gunnels, J., Gustavson, F.: An experimental comparison of cache-oblivious and cache-aware programs. In: Proceedings of the 19th ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, pp. 93-104 (2007).