International Parallel and Distributed Processing Symposium (IPDPS'03) Program-Based Locality Measures for Scientific Computing Nice, France April 22-April 26 ISBN: 0-7695-1926-1
Numerical software for sequential or parallel machines with memory hierarchies can benefit from locality optimizations which are usually achieved by program restructuring or program transformations. In this paper we introduce and discuss program-based locality measures which can be used to guide the restructuring and transformation process at the program level. As example we consider a popular solution method to solve ordinary differential equations provided in many scientific libraries.
Index Terms:
locality improvement, memory references, cost measure, storage hierarchy
Citation:
Thomas Rauber, Gudula Rünger, "Program-Based Locality Measures for Scientific Computing," ipdps, pp.164b, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||