High cache performance implementation of a numerical simulation method

Abstract

Explicit Implicit Domain Decomposition (EIDD) is a class of globally non-iterative, non-overlapping domain decomposition methods for the numerical solution of parabolic problems.

In this thesis we investigate the cache performance of an alternating EIDD method (AEIDD). The AEIDD method is implemented on uni-processor machines with consideration mainly to reduce one type of cache misses and theoretical analysis conducted for the cache performance of the cache efficient implementation.