Efficient cache use for stencil operations on structured discretization grids
暂无分享,去创建一个
[1] H. T. Kung,et al. I/O complexity: The red-blue pebble game , 1981, STOC '81.
[2] Chau-Wen Tseng,et al. Eliminating conflict misses for high performance architectures , 1998, ICS '98.
[3] Monica S. Lam,et al. A data locality optimizing algorithm , 1991, PLDI '91.
[4] Sharad Malik,et al. Automated cache optimizations using CME driven diagnosis , 2000, ICS '00.
[5] S. Lang,et al. Introduction to Diophantine Approximations , 1995 .
[6] Sharad Malik,et al. Cache miss equations: an analytical representation of cache misses , 1997, ICS '97.
[7] Kathryn S. McKinley,et al. Tile size selection using cache organization and data layout , 1995, PLDI '95.
[8] J. Cassels,et al. An Introduction to Diophantine Approximation , 1957 .
[9] David H. Bailey. Unfavorable strides in cache memory systems , 1992 .
[10] Chau-Wen Tseng,et al. Data transformations for eliminating conflict misses , 1998, PLDI.
[11] Da-Lun Wang,et al. Discrete Isoperimetric Problems , 1977 .
[12] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.