Sketching stencils

ACM SIGPLAN Notices

Volumn 42, Issue 6, 2007, Pages 167-178

  Solar Lezama, Armando ^a   Arnold, Gilad ^a   Tancau, Liviu ^a   Bodik, Rastislav ^a   Saraswat, Vijay ^a   Seshia, Sanjit ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

SAT; Sketching; Stencil

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE;

COMPUTATION REUSE; EFFICIENT IMPLEMENTATION; PARTIAL IMPLEMENTATION; REDUCTION ALGORITHMS; SKETCHING; SOFTWARE SYNTHESIS; STENCIL; STENCIL COMPUTATIONS;

SPECIFICATIONS;

EID: 67650085813     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1273442.1250754     Document Type: Article

References (23)

1. W. Ackermann. Solvable cases of the decision problem. Studies in Logic and the Foundations. of Mathematics. NorthUHolland, 1954.
2. D. H. Bailey, E. Barszcz, J. T. Barton, D. S. Browning, R. L. Carter, D. Dagum, R. A. Fatoohi, P. O. Frederickson, T. A. Lasinski, R. S. Schreiber, H. D. Simon, V. Venkatakrishnan, and S. K. Weeratunga. The nas parallel benchmarks. The International Journal of Supercomputer Applications, 5(3):63-73, Fall 1991.
3. W. L. Briggs, V. E. Henson, and S. F. McCormick. A Multigrid Tutorial. SIAM, 2000.
4. R. E. Bryant, S. German, and M. N. Velev. Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic. ACM Transactions on Computational Logic, 2(1):1-41, January 2001.
5. R. E. Bryant, D. Kroening, J. Ouaknine, S. A. Seshia, O. Strichman, and B. Brady. Deciding bit-vector arithmetic with abstraction. In Proc. TACAS 2007, March 2007.
6. D. Currie, X. Feng, M. Fujita, A. J. Hu, M. Kwan, and S. Rajan. Embedded software verification using symbolic execution and uninterpreted functions. Int. J. Parallel Program., 34(1):61-91, 2006.
7. J. Demmel, J. Dongarra, V. Eijkhout, E. Fuentes, A. Petitet, R. Vuduc, C. Whaley, and K. Yelick. Self adapting linear algebra algorithms and software. Proceedings of the IEEE, 93(2), 2005.
8. C. C. Douglas, J. Hu, M. Kowarschik, U. Rüde, and C. Weiss. Cache optimization for structured and unstructured grid multigrid. Elect. Trans. Numer. Anal., 10:21-40, 2000.
9. M. Frigo and S. Johnson. Fftw: An adaptive software architecture for the fft. In ICASSP conference proceedings, volume 3, pages 1381-1384, 1998.
10. M. Frigo and V. Strumpen. The memory behavior of cache oblivious stencil computations. The Journal of Supercomputing, 39(2):93-112, 2007.
11. S. Kamil, K. Datta, S. Williams, L. Oliker, J. Shalf, and K. Yelick. Implicit and explicit optimizations for stencil computations. In MSPC '06: Proceedings of the 2006 workshop on Memory system performance and correctness, pages 51-60, New York, NY, USA, 2006. ACM Press.
12. S. Kamil, P. Husbands, L. Oliker, J. Shalf, and K. A. Yelick. Impact of modern memory subsystems on cache optimizations for stencil computations. In B. Calder and B. G. Zorn, editors, Memory System Performance, pages 36-43. ACM, 2005.
13. K. McMillan. Verification of infinite state systems by compositional model checking. In Correct Hardware Design and Verification Methods: 10th IFIP WG 10.5 Advanced Research Working Conference, CHARME '99, Bad Herrenalb, Germany, September 1999., pages 219-237, 1999.
14. A. Mishchenko, S. Chatterjee, and R. Brayton. Dag-aware AIG rewriting: A fresh look at combinational logic synthesis. In DAC '06: Proceedings of the 43rd annual conference on Design automation, pages 532-535, New York, NY, USA, 2006. ACM Press.
15. A. Pnueli, O. Shtrichman, and M. Siegel. The code validation tool (cvt). International Journal on Software Tools for Technology Transfer (STTT), 2, December 1998.
16. W. Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. In Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing, pages 4-13, New York, NY, USA, 1991. ACM Press.
17. M. Püschel, B. Singer, J. Xiong, J. Moura, J. Johnson, D. Padua, M. Veloso, and R. Johnson. Spiral: A generator for platform-adapted libraries of signal processing algorithms. Journal of High Performance Computing and Applications, accepted for publication.
18. G. Roth, J. Mellor-Crummey, K. Kennedy, and R. G. Brickner. Compiling stencils in high performance fortran. In Supercomputing '97: Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM), pages 1-20, New York, NY, USA, 1997. ACM Press.
19. S. Sellappa and S. Chatterjee. Cache-efficient multigrid algorithms. Int. J. High Perform. Comput. Appl., 18(1):115-133, 2004.
20. L. Snyder. Programming Guide to ZPL. MIT Press, Cambridge, MA, 1999.
21. A. Solar-Lezama, L. Tancau, R. Bodik, V. Saraswat, and S. Seshia. Combinatorial sketching for finite programs. In 12th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2006), pages 404-415, New York, NY, USA, 2006. ACM Press.
22. A. Solar-Lezama, L. Tancau, R. Bodik, V. Saraswat, and S. Seshia. Combinatorial sketching for finite programs. In ASPLOS '06, San Jose, CA, USA, 2006. ACM Press.
23. D. Wonnacott. Achieving scalable locality with time skewing. International Journal of Parallel Programming, 30(3):1-221, 2002.