Skip to main content

Memory-Constrained Data Locality Optimization for Tensor Contractions

  • Conference paper
Languages and Compilers for Parallel Computing (LCPC 2003)

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baumgartner, G., Bernholdt, D.E., Cociorva, D., Harrison, R., Hirata, S., Lam, C., Nooijen, M., Pitzer, R., Ramanujam, J., Sadayappan, P.: A High-Level Approach to Synthesis of High-Performance Codes for Quantum Chemistry. In: Proc. Supercomputing 2002 (November 2002)

    Google Scholar 

  2. Cociorva, D., Baumgartner, G., Lam, C., Sadayappan, P., Ramanujam, J., Nooijen, M., Bernholdt, D., Harrison, R.: Space-Time Trade-Off Optimization for a Class of Electronic Structure Calculations. In: Proc. of ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation (PLDI), June 2002, pp. 177–186 (2002)

    Google Scholar 

  3. Cociorva, D., Gao, X., Krishnan, S., Baumgartner, G., Lam, C., Sadayappan, P., Ramanujam, J.: Global Communication Optimization for Tensor Contraction Expressions under Memory Constraints. In: Proc. of 17th International Parallel & Distributed Processing Symposium (IPDPS) (April 2003)

    Google Scholar 

  4. Cociorva, D., Wilkins, J., Lam, C.-C., Baumgartner, G., Sadayappan, P., Ramanujam, J.: Loop optimization for a class of memory-constrained computations. In: Proc. 15th ACM International Conference on Supercomputing(ICS 2001), Sorrento, Italy, June 2001, pp. 500–509 (2001)

    Google Scholar 

  5. Cociorva, D., Wilkins, J., Baumgartner, G., Sadayappan, P., Ramanujam, J., Nooijen, M., Bernholdt, D.E., Harrison, R.: Towards Automatic Synthesis of High-Performance Codes for Electronic Structure Calculations: Data Locality Optimization. In: Monien, B., Prasanna, V.K., Vajapeyam, S. (eds.) HiPC 2001. LNCS, vol. 2228, pp. 237–248. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Krishnan, S., Krishnamoorthy, S., Baumgartner, G., Cociorva, D., Lam, C., Sadayappan, P., Ramanujam, J., Bernholdt, D.E., Choppella, V.: Data Locality Optimization for Synthesis of Efficient Out-of-Core Algorithms. In: Pinkston, T.M., Prasanna, V.K. (eds.) HiPC 2003. LNCS (LNAI), vol. 2913, pp. 406–417. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Lam, C.: Performance Optimization of a Class of Loops Implementing Multi- Dimensional Integrals, Ph.D. Dissertation, The Ohio State University, Columbus, OH (August 1999)

    Google Scholar 

  8. Lam, C., Cociorva, D., Baumgartner, G., Sadayappan, P.: Optimization of Memory Usage and Communication Requirements for a Class of Loops Implementing Multi-Dimensional Integrals. In: Carter, L., Ferrante, J. (eds.) LCPC 1999. LNCS, vol. 1863, p. 350. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Lam, C., Cociorva, D., Baumgartner, G., Sadayappan, P.: Memory-optimal evaluation of expression trees involving large objects. In: Proc. Intl. Conf. on High Perf. Comp. (December 1999)

    Google Scholar 

  10. Lam, C., Sadayappan, P., Wenger, R.: On Optimizing a Class of Multi- Dimensional Loops with Reductions for Parallel Execution. Par. Proc. Lett. 2(7), 157–168 (1997)

    MathSciNet  Google Scholar 

  11. Lam, C., Sadayappan, P., Wenger, R.: Optimization of a Class of Multi-Dimensional Integrals on Parallel Machines. In: Proc. of Eighth SIAM Conf. on Parallel Processing for Scientific Computing, Minneapolis, MN (March 1997)

    Google Scholar 

  12. Lee, T.J., Scuseria, G.E.: Achieving chemical accuracy with coupled cluster theory. In: Langhoff, S.R. (ed.) Quantum Mechanical Electronic Structure Calculations with Chemical Accuracy, pp. 47–109. Kluwer Academic, Dordrecht (1997)

    Google Scholar 

  13. Martin, J.M.L.: Encyclopedia of Computational Chemistry. In: Schleyer, P.v.R., Schreiner, P.R., Allinger, N.L., Clark, T., Gasteiger, J., Kollman, P., Schaefer III, H.F. (eds.), vol. 1, pp. 115–128. Wiley & Sons, Berne (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bibireata, A. et al. (2004). Memory-Constrained Data Locality Optimization for Tensor Contractions. In: Rauchwerger, L. (eds) Languages and Compilers for Parallel Computing. LCPC 2003. Lecture Notes in Computer Science, vol 2958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24644-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24644-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21199-0

  • Online ISBN: 978-3-540-24644-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics