Software Engineering Aspects of Cache Oblivious Stencil Computations

We discuss the design of cache oblivious stencil computations for finite-difference methods in
1-dimensional space and time. We employ our cache oblivious spacetime traversal to obtain
several fully cache oblivious algorithms. We focus on the practical aspects of the software engineering
chores that today's superscalar architectures impose on high performance programming.

By: Volker Strumpen; Matteo Frigo

Published in: RC24035 in 2006


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .