Tight bounds on cache use for stencil operations on rectangular grids

Journal of the ACM

Volumn 49, Issue 3, 2002, Pages 434-453

  Frumkin, Michael A ^a   Van Der Wijngaart, Rob F ^a  

^a NASA AMES RESEARCH CENTER   (United States)

Author keywords

Cache memory; Cache misses; Fundamental parallelepiped; Lattice; Lower and upper bounds; Reduced basis; Scientific computing; Structured grids

Indexed keywords

CACHE MISSES; RECTANGULAR GRIDS; STENCIL OPERATIONS; TIGHT BOUNDS;

ALGORITHMS; COMPUTER SYSTEMS; DATA TRANSFER; DATABASE SYSTEMS; LATTICE CONSTANTS; PERFORMANCE; PROGRAM PROCESSORS; THEOREM PROVING;

CACHE MEMORY;

EID: 4243166952     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/567112.567115     Document Type: Article

References (13)

1. BAILEY, D. H. 1995. Unfavorable strides in cache memory systems. Sci. Prog. 4, 53-58.
2. CASSELS, J. W. S. 1957. Introduction to Diophantine Approximations (Ch. I Theorem VIII). Cambridge Univ. Press. Cambridge, Mass.
3. COLEMAN, S., AND MCKINLEY, K. S. 1995. Tile size selection using cache organization and data layout. In Proceedings of SIGPLAN '95, Conference on Programming Language Design and Implementation (June), ACM, New York, pp. 279-289.
4. GHOSH, S., MARTONOSI, M., AND MALIK, S. 1997. Cache miss equations: An analytical representation of cache misses. ACM ICS 317-324.
5. GHOSH, S., MARTONOSI, M., AND MALIK, S. 1999. Cache miss equations: A compiler framework for analyzing and tuning memory behavior. ACM Trans. Program. Lang. Syst. 21, 4, 703-746.
6. GRAHAM, R., KNUTH, D., AND PATASHNIK, O. 1989. Concrete Mathematics. Addison-Wesley. Reading, Mass.
7. HENNESSY, J. L., AND PATTERSON, D. A. 1994. Computer Organization and Design. Morgan-Kaufmann, San Mateo, Calif.
8. HONG, J. W., AND KUNG, H. T. 1981. I/O complexity: The red-blue pebble game. In Proceedings of the IEEE Symposium on Theoretical Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 326-333.
9. RIVERA, G., AND TSENG, C. W. 1998. Data transformations for eliminating conflict misses. Conference on Programming Language Design and Implementation. 38-49.
10. RIVERA, G., AND TSENG, C. W. 1998. Eliminating conflict misses for high performance architectures. ACM ICS, 353-360.
11. SCHRIJVER, A. 1986. Theory of Linear and Integer Programming. Wiley, New York.
12. WANG, D. L., AND WANG, P. 1977. Discrete isoperimetric problems. SIAM J. Appl. Math. 32, 860-870.
13. WOLF, M. E., AND LAM, M. 1991. A data locality optimizing algorithm. In Proceedings of SIGPLAN '91, Conference on Programming Language Design and Implementation (June). ACM, New York, pp. 30-44.