Multicore-aware parallel temporal blocking of stencil codes for shared and distributed memory

Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010

Volumn , Issue , 2010, Pages

  Wittmann, Markus ^a   Hager, Georg ^a   Wellein, Gerhard ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

Multi core; Multi halo exchange; Shared caches; Temporal blocking

Indexed keywords

DISTRIBUTED MEMORY; MEMORY INTERFACE; MULTI CORE; MULTICORE CHIPS; MULTICORE ENVIRONMENTS; OPTIMIZATION TECHNIQUES; SHARED CACHE; SHARED MEMORIES;

DISTRIBUTED PARAMETER NETWORKS;

EID: 77954056084     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPSW.2010.5470813     Document Type: Conference Paper

References (12)

1. 10 Unknowns the Largest Finite Element System that Can Be Solved Today? In: ACM/IEEE (Ed.): Proceedings of the ACM/IEEE SC 2005 Conference (Supercomputing Conference '05, Seattle, Nov 12-18, 2005).
2. K. Datta et al.: Stencil Computation Optimization and Autotuning on State-of-the-art Multicore Architectures. Proc. SC2008. DOI:10.1145/1413370. 1413375.
3. G. Wellein, G. Hager, T. Zeiser, M. Wittmann and H. Fehske: Efficient temporal blocking for stencil computations by multicoreaware wavefront parallelization. Proc. COMPSAC 2009. DOI:10.1109/COMPSAC.2009.82.
4. D. Wonnacott: Using Time Skewing to Eliminate Idle Time due to Memory Bandwidth and Network Limitations. Proc. IPDPS 2000. DOI:10.1109/IPDPS.2000. 845979.
5. G. Jin, J. Mellor-Crummey, and R. Fowler: Increasing temporal locality with skewing and recursive blocking. Proc. SC2001. DOI:10.1145/582034.582077.
6. M. Kowarschik: Data Locality Optimizations for Iterative Numerical Algorithms and Cellular Automata on Hierarchical Memory Architectures. Dissertation, SCS Publishing House, Erlangen (2004). http://www10.informatik. uni-erlangen.de/Publications/Dissertations/Diss-Kowarschik-2004.pdf.
7. M. Frigo and V. Strumpen: Cache oblivious stencil computations. Proc. ICS 2005. DOI:10.1145/1088149.1088197.
8. S. Kamil, K. Datta, S. Williams, L. Oliker, J. Shalf, and K. Yelick: Implicit and explicit optimizations for stencil computations. Proc. MSPC 2006. DOI:10.1145/1178597.1178605.
9. T. Zeiser, G. Wellein, A. Nitsure, K. Iglberger, U. Rüde, G. Hager: Introducing a parallel cache oblivious blocking approach for the lattice Boltzmann method. Progress in CFD, vol. 8, No. 1-4, pp. 179-188, 2008.
10. J. Treibig, G. Hager and G. Wellein: Multi-core architectures: Complexities of performance prediction and the impact of cache topology. Under review. http://arxiv.org/abs/0910.4865.
11. C. Ding and Y. He: A ghost cell expansion method for reducing communications in solving PDE problems. Proc. SC2001. DOI:10.1145/582034.582084.
12. M. Wittmann: Potentials of temporal blocking for stencil-based computations on multi-core systems. Master's Thesis, University of Applied Sciences Nuremberg, March 2009. http://www.hpc.rrze.uni-erlangen.de/Projekte/ stencil.shtml.