article · 2004

Program-based locality measures for scientific computing

Cited by 2Abstract and details only

Abstract

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 an example we consider a popular solution method to solve ordinary differential equations provided in many scientific libraries.

Cite this paper

APA 7

Rauber, T., & Rünger, G. (2004). Program-based locality measures for scientific computing. https://doi.org/10.1109/ipdps.2003.1213306

MLA 9

Rauber, Thomas, and Gudula Rünger. “Program-based locality measures for scientific computing.” 2004, p. 8, https://doi.org/10.1109/ipdps.2003.1213306.

Chicago

Rauber, Thomas, and Gudula Rünger. 2004. “Program-based locality measures for scientific computing.” https://doi.org/10.1109/ipdps.2003.1213306.

Harvard

Rauber, T. and Rünger, G. (2004) ‘Program-based locality measures for scientific computing’. Available at: https://doi.org/10.1109/ipdps.2003.1213306.

BibTeX

@article{rauber2004program,
  title = {{Program-based locality measures for scientific computing}},
  author = {Rauber, Thomas and Rünger, Gudula},
  pages = {8},
  year = {2004},
  doi = {10.1109/ipdps.2003.1213306}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.