Memory-constrained data locality optimization for tensor contractions

7Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions over large multi-dimensional arrays. Efficient computation of these contractions usually requires the generation of temporary intermediate arrays. These intermediates could be extremely large, requiring their storage on disk. However, the intermediates can often be generated and used in batches through appropriate loop fusion transformations. To optimize the performance of such computations a combination of loop fusion and loop tiling is required, so that the cost of disk I/O is minimized. In this paper, we address the memory-constrained data-locality optimization problem in the context of this class of computations. We develop an optimization framework to search among a space of fusion and tiling choices to minimize the data movement overhead. The effectiveness of the developed optimization approach is demonstrated on a computation representative of a component used in quantum chemistry suites. © Springer-Verlag; 2004.

Cite

CITATION STYLE

APA

Bibireata, A., Krishnan, S., Baumgartner, G., Cociorva, D., Lam, C. C., Sadayappan, P., … Choppella, V. (2004). Memory-constrained data locality optimization for tensor contractions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2958, 93–108. https://doi.org/10.1007/978-3-540-24644-2_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free