Cache-oblivious dynamic programming

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 591-600

  Chowdhury, Rezaul Alam ^a   Ramachandran, Vijaya ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE-OBLIVIOUS FRAMEWORKS; GAUSSIAN ELIMINATION PARADIGM (GEP); LONGEST COMMON SUBSEQUENCE (LCS);

ALGORITHMS; CACHE MEMORY; GRAPH THEORY; PROBLEM SOLVING;

DYNAMIC PROGRAMMING;

EID: 33244497406     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109622     Document Type: Conference Paper

References (27)

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. A. Apostolico, S. Browne, and C. Guerra. Fast linear-space computations of longest common subsequences. Theoretical Computer Science, pp. 3-17, 1992.
3. R. Bellman. Dynamic Programming. The Princeton University Press, Princeton, New Jersey, 1957.
4. 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 Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 297-308, 1996.
5. R. A. Chowdhury. Experimental Evaluation of a Cache-Oblivious LOS Algorithm. Tech. Rep. TR-05-43, Dept. of Comp. Sci., University of Texas at Austin, Oct. 2005.
6. C. Cherng and R.E. Ladner. Cache efficient simple dynamic programming. In Proc. of the International Conf. on the Analysis of Algorithms, pp. 49-58, 2005.
7. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2nd ed., 2001.
8. R.W. Floyd. Algorithm 97 (SHORTEST PATH). Communications of the ACM, 5(6):345, 1962.
9. M. Frigo, C.E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proc. of the 40th Annual Symposium on Foundations of Computer Science, pages 285-297, 1999.
10. M. Frigo and V. Strumpen. Cache-oblivious stencil computations. In Proc. of the 19th ACM International Conference on Super computing, Cambridge, Massachusetts, USA, June 2005.
11. Z. Galil, and R. Giancarlo. Speeding up dynamic programming with applications to molecular biology. Theoretical Computer Science, 64:107-118, 1989.
12. Z. Galil, and K. Park. Parallel algorithms for dynamic programming recurrences with more than Ο(1) dependency. Journal of Parallel and Distributed Computing, vol. 21, pp. 213-222, 1994.
13. D.S. Hirschberg. A linear space algorithm for computing maximal common subsequences. Communications of the ACM, 18(6):341-343, 1975.
14. D. S. Hirschberg. Algorithms for the longest common subsequence problem. JACM, 40(4):664-675, 1977.
15. D.S. Hirschberg, and L.L. Larmore. The least weight subsequence problem. SIAM Journal on Computing, vol. 16(4), pp. 628-638, 1987.
16. J.-W. Hong and H.T. Rung. I/O complexity: the red-blue pebble game. In Proc. of the 13th Annual ACM Symp. on Theory of Computing, pp. 326-333, 1981.
17. E. Horowitz, S. Sahni, and S. Rajasekaran. Computer Algorithms. W. H. Freeman & Co., NY, USA, 1998.
18. S.K. Kumar and C.P. Rangan. A linear-space algorithm for the LCS problem. Acta Informatica, 24:353-362, 1987.
19. J. Kleinberg and E. Tardos. Algorithm Design. Addison-Wesely Publishing Co., Reading, MA, 2005.
20. J.-S. Park, M. Penner and V.K. Prasanna. Optimizing graph algorithms for improved cache performance. IEEE Transactions on Parallel and Distributed Systems, vol. 15(9), pp. 769-782, 2004.
21. M. Sniedovich. Dynamic Programming. The Marcel Dekker, Inc., New York, NY, USA, 1992.
22. J.W. Thomas, J.W. Touchman, R.W. Blakesley, G.G. Bouffard, S.M. Beckstrom-Sternberg, E.H. Margulies, M. Blanchette, A.C. Siepel, P.J. Thomas, J.C. McDowell, B. Maskeri, N.F. Hansen, M.S. Schwartz, R.J. Weber, W.J. Kent, D. Karolchik, T.C. Bruen, R. Bevan, D.J. Cutler, S. Schwartz, L. Elnitski, J.R. Idol, A.B. Prasad, S.-Q. Lee-Lin, V.V.B. Maduro, T.J. Summers, M.E. Portnoy, N.L. Dietrich, N. Akhter, K. Ayele, B. Benjamin, K. Cariaga, C.P. Brinkley, S.Y. Brooks, S. Granite, X. Guan, J. Gupta, P. Haghihi, S.-L. Ho, M.C. Huang, E. Karlins, P.L. Laric, R. Legaspi, M.J. Lim, Q.L. Maduro, C.A. Masiello, S.D. Mastrian, J.C. McCloskey, R. Pearson, S. Stantripop, E.E. Tiongson, J.T. Tran, C. Tsurgeon, J.L. Vogt, M.A. Walker, K.D. Wetherby, L.S. Wiggins, A.C. Young, L.-H. Zhang, K. Osoegawa, B. Zhu, B. Zhao, C.L. Shu, P.J. De Jong, C.E. Lawrence, A.F. Smit, A. Chakravarti, D. Haussier, P. Green, W. Miller, and E.D. Green. Comparative analyses of multi-species sequences from targeted genomic regions. Nature, vol. 424, pp. 788-793, 2003.
23. S. Toledo. Locality of reference in LU decomposition with partial pivoting. SIAM Journal on Matrix Analysis and Applications, vol. 18(4), pp. 1065-1081, 1997.
24. L.G. Valiant. General context-free recognition in less than cubic time. Journal of Compute and System Sciences, vol. 10, pp. 308-315, 1975.
25. S. Warshall. A theorem on boolean matrices. Journal of the ACM, 9(1):11-12, 1962.
26. M.S. Waterman. Introduction to Computational Biology. Chapman & Hall, London, UK, 1995.
27. D. Womble, D. Greenberg, S. Wheat, and R. Riesen. Beyond core: making parallel computer I/O practical. In Proc. of the DAGS/PC Symposium, pp. 56-63, 1993.