Cache oblivious stencil computations

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2005, Pages 361-366

  Frigo, Matteo ^a   Strumpen, Volker ^a  

^a IBM AUSTIN RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY HIERARCHY; N-DIMENSIONAL SPACES; STENCIL COMPUTATIONS; TEMPORAL LOCALITY;

ALGORITHMS; CACHE MEMORY; DATA STORAGE EQUIPMENT; FINITE DIFFERENCE METHOD; HIERARCHICAL SYSTEMS;

COMPUTATION THEORY;

EID: 32844463802     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1088149.1088197     Document Type: Conference Paper

References (5)

1. Gianfranco Bilardi and Franco P. Preparata. Upper bounds to processor-time tradeoffs under bounded-speed message propagation. In SPAA '95: Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, pages 185-194. ACM Press, 1995.
2. Matteo Frigo, Charles E. Leiserson, Harald Prokop, and Sridhar Ramachandran. Cache-oblivious algorithms. In Proc. 40th Ann. Symp. Foundations of Computer Science (FOCS '99), New York, USA, October 1999.
3. Jia-Wei Hong and H. T. Kung. I/O complexity: the red-blue pebbling game. In Proc. Thirteenth Ann. ACM Symp. Theory of Computing, pages 326-333, Milwaukee, 1981.
4. Harald Prokop. Cache-oblivious algorithms. Master's thesis, Massachusetts Inst. of Technology, June 1999.
5. G. D. Smith. Numerical Solution of Partial Differential Equations: Finite Difference Methods. Oxford University Press, 3rd edition, 1985.