The pochoir stencil compiler

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2011, Pages 117-128

  Tang, Yuan ^a,b   Chowdhury, Rezaul Alam ^b,e   Kuszmaul, Bradley C ^b,c   Luk, Chi Keung ^b,d   Leiserson, Charles E ^b  

^a FUDAN UNIVERSITY   (China)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Tokutek Inc   (United States)

^d INTEL CORPORATION   (United States)

^e BOSTON UNIVERSITY   (United States)

Author keywords

C++; cache oblivious algorithm; cilk; compiler; embedded domain specific language; multicore; parallel computation; stencil computation; trapezoidal decomposition

Indexed keywords

C++; CACHE-OBLIVIOUS ALGORITHMS; CILK; COMPILER; DOMAIN SPECIFIC LANGUAGES; MULTI CORE; PARALLEL COMPUTATION; STENCIL COMPUTATIONS; TRAPEZOIDAL DECOMPOSITION;

ALGORITHMS; CACHE MEMORY; COMPUTATIONAL EFFICIENCY; PROBLEM ORIENTED LANGUAGES; PROGRAM DEBUGGING; SPECIFICATIONS;

PROGRAM COMPILERS;

EID: 79959673844     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989493.1989508     Document Type: Conference Paper

References (41)

1. T. Akutsu. Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots. Discrete Applied Mathematics, 104:45-62, 2000.
2. R. Bleck, C. Rooth, D. Hu, and L. T. Smith. Salinity-driven thermocline transients in a wind- and thermohaline-forced isopycnic coordinate model of the North Atlantic. Journal of Physical Oceanography, 22(12):1486-1505, 1992.
3. R. G. Brickner, W. George, S. L. Johnsson, and A. Ruttenberg. A stencil compiler for the Connection Machine models CM-2/200. In Workshop on Compilers for Parallel Computers, 1993.
4. M. Bromley, S. Heller, T. McNerney, and G. L. Steele Jr. Fortran at ten Gigaflops: The Connection Machine convolution compiler. In PLDI, pages 145-156, Toronto, Ontario, Canada, June 26-28 1991.
5. C++ Standards Committee. Working draft, standard for programming language C++. available from http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2011/ n3242.pdf, 2011. ISO/IEC Document Number N3242=11-0012.
6. R. A. Chowdhury, H.-S. Le, and V. Ramachandran. Cache-oblivious dynamic programming for bioinformatics. TCBB, 7(3):495-510, July-Sept. 2010.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, third edition, 2009.
8. K. Datta. Auto-tuning Stencil Codes for Cache-Based Multicore Platforms. PhD thesis, EECS Department, University of California, Berkeley, Dec 2009.
9. K. Datta, M. Murphy, V. Volkov, S. Williams, J. Carter, L. Oliker, D. Patterson, J. Shalf, and K. Yelick. Stencil computation optimization and auto-tuning on state-of-the-art multicore architectures. In SC, pages 4:1-4:12, Austin, TX, Nov. 15-18 2008.
10. A. van Deursen, P. Klint, and J. Visser. Domain-specific languages: An annotated bibliography. SIGPLAN Not., 35(6):26-36, June 2000.
11. H. Dursun, K.-i. Nomura, L. Peng, R. Seymour, W. Wang, R. K. Kalia, A. Nakano, and P. Vashishta. A multilevel parallelization framework for high-order stencil computations. In Euro-Par, pages 642-653, Delft, The Netherlands, Aug. 25-28 2009.
12. H. Dursun, K.-i. Nomura, W. Wang, M. Kunaseth, L. Peng, R. Seymour, R. K. Kalia, A. Nakano, and P. Vashishta. In-core optimization of high-order stencil computations. In PDPTA, pages 533-538, Las Vegas, NV, July13-16 2009.
13. J. F. Epperson. An Introduction to Numerical Methods and Analysis. Wiley-Interscience, 2007.
14. H. Feshbach and P. Morse. Methods of Theoretical Physics. Feshbach Publishing, 1981.
15. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In FOCS, pages 285-297, New York, NY, Oct. 17-19 1999.
16. M. Frigo and V. Strumpen. Cache oblivious stencil computations. In ICS, pages 361-366, Cambridge, MA, June 20-22 2005.
17. M. Frigo and V. Strumpen. The cache complexity of multithreaded cache oblivious algorithms. Theory of Computing Systems, 45(2):203-233, 2009.
18. M. Gardner. Mathematical Games. Scientific American, 223(4):120-123, 1970.
19. O. Gotoh. An improved algorithm for matching biological sequences. Journal of Molecular Biology, 162:705-708, 1982.
20. Y. He, C. E. Leiserson, and W. M. Leiserson. The Cilkview scalability analyzer. In SPAA, pages 145-156, Santorini, Greece, June 13-15 2010.
21. P. Hudak. Building domain-specific embedded languages. ACM Computing Surveys, 28(4), December 1996.
22. Intel software autotuning tool. http://software.intel.com/en-us/articles/ intel-software-autotuning-tool/, 2010.
23. Intel Corporation. Intel Cilk Plus Language Specification, 2010. Document Number: 324396-001US. Available from http://software.intel.com/sites/products/ cilk-plus/cilk-plus-language-specification.pdf.
24. C. John. Options, Futures, and Other Derivatives. Prentice Hall, 2006.
25. S. Kamil, C. Chan, L. Oliker, J. Shalf, and S. Williams. An auto-tuning framework for parallel multicore stencil computations. In IPDPS, pages 1-12, 2010.
26. S. Kamil, K. Datta, S. Williams, L. Oliker, J. Shalf, and K. Yelick. Implicit and explicit optimizations for stencil computations. In MSPC, pages 51-60, San Jose, CA, 2006.
27. S. Kamil, P. Husbands, L. Oliker, J. Shalf, and K. Yelick. Impact of modern memory subsystems on cache optimizations for stencil computations. In MSP, pages 36-43, Chicago, IL, June 12 2005.
28. S. Krishnamoorthy, M. Baskaran, U. Bondhugula, J. Ramanujam, A. Rountev, and P. Sadayappan. Effective automatic parallelization of stencil computations. In PLDI, San Diego, CA, June 10-13 2007.
29. https://perf.wiki.kernel.org/index.php/Main-Page.
30. R. Mei, W. Shyy, D. Yu, and L. Luo. Lattice Boltzmann method for 3-D flows with curved boundary. J. of Comput. Phys, 161(2):680-699, 2000.
31. M. Mernik, J. Heering, and A. M. Sloane. When and how to develop domain-specific languages. ACM Computing Surveys, 37:316-344, December 2005.
32. P. Micikevicius. 3D finite difference computation on GPUs using CUDA. In GPPGPU, pages 79-84, Washington, DC, Mar. 8 2009.
33. A. Nakano, R. Kalia, and P. Vashishta. Multiresolution molecular dynamics algorithm for realistic materials modeling on parallel computers. Computer Physics Communications, 83(2-3):197-214, 1994.
34. A. Nitsure. Implementation and optimization of a cache oblivious lattice Boltzmann algorithm. Master's thesis, Institut für Informatic, Friedrich-Alexander-Universität Erlangen-Nürnberg, July 2006.
35. OpenMP application program interface, version 2.5. OpenMP specification, May 2005.
36. L. Peng, R. Seymour, K.-i. Nomura, R. K. Kalia, A. Nakano, P. Vashishta, A. Loddoch, M. Netzband, W. R. Volz, and C. C. Wong. High-order stencil computations on multicore clusters. In IPDPS, pages 1-11, Rome, Italy, May 23-29 2009.
37. S. Peyton Jones. Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, 1998.
38. H. Prokop. Cache-oblivious algorithms. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1999.
39. G. Roth, J. Mellor-Crummey, K. Kennedy, and R. G. Brickner. Compiling stencils in High Performance Fortran. In SC, pages 1-20, San Jose, CA, Nov. 16-20 1997. ACM.
40. A. Taflove and S. Hagness. Computational Electrodynamics: The Finite-Difference Time-Domain Method. Artech House, Norwood, MA, 2000.
41. S. Williams, J. Carter, L. Oliker, J. Shalf, and K. Yelick. Lattice Boltzmann simulation optimization on leading multicore platforms. In IPDPS, pages 1-14, Miami, FL, Apr. 2008.