Implicit and explicit optimizations for stencil computations
暂无分享,去创建一个
[1] David G. Wonnacott,et al. Using time skewing to eliminate idle time due to memory bandwidth and network limitations , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.
[2] Zhiyuan Li,et al. New tiling techniques to improve cache temporal locality , 1999, PLDI '99.
[3] Samuel Williams,et al. The potential of the cell processor for scientific computing , 2005, CF '06.
[4] Michael E. Wolf,et al. Improving locality and parallelism in nested loops , 1992 .
[5] John D. McCalpin,et al. Time Skewing: A Value-Based Approach to Optimizing for Memory Locality , 1999 .
[6] Leonid Oliker,et al. Impact of modern memory subsystems on cache optimizations for stencil computations , 2005, MSP '05.
[7] Siddhartha Chatterjee,et al. Cache-Efficient Multigrid Algorithms , 2001, Int. J. High Perform. Comput. Appl..
[8] J. Shalf,et al. Evaluation of Cache-based Superscalar and Cacheless Vector Architectures for Scientific Computations , 2003, ACM/IEEE SC 2003 Conference (SC'03).
[9] M. Berger,et al. Adaptive mesh refinement for hyperbolic partial differential equations , 1982 .
[10] Charles E. Leiserson,et al. Cache-Oblivious Algorithms , 2003, CIAC.