Skip to main content

On Materializations of Array-Valued Temporaries

  • Conference paper
  • First Online:
  • 241 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2017))

Abstract

We present results demonstrating the usefulness of monolithic program analysis and optimization prior to scalarization. In particular, models are developed for studying nonmaterialization in basic blocks consisting ofa sequence of assignment statements involving array- valued variables. We use these models to analyze the problem ofmi nimizing the number ofmat erializations in a basic block, and to develop an efficient algorithm for minimizing the number of materializations in certain cases.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. S. Abrams. An APL Machine. PhD thesis, Stanford University, 1970.

    Google Scholar 

  2. T. A. Budd. An APL compiler for a vector processor. ACM Transactions on Programming Languages and Systems, 6(3):297–313, July 1984.

    Article  MATH  MathSciNet  Google Scholar 

  3. L. J. Guibas and D. K. Wyatt. Compilation and delayed evaluation in APL. In Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, pages 1–8, Jan. 1978.

    Google Scholar 

  4. A. Hassitt and L. E. Lyon. Efficient evaluation of array subscripts of arrays. IBM Journal of Research and Development, 16(1):45–57, Jan. 1972.

    Article  Google Scholar 

  5. W. Humphrey, S. Karmesin, F. Bassetti, and J. Reynders. Optimization of data-parallel field expressions in the POOMA framework. In Y. Ishikawa, R. R. Oldehoeft, J. Reynders, and M. Tholburn, editors, Proc. First International Conference on Scientific Computing in Object-Oriented Parallel Environments (ISCOPE’ 97), volume 1343 of Lecture Notes in Computer Science, pages 185–194, Marina del Rey, CA, Dec. 1997. Springer-Verlag.

    Google Scholar 

  6. K. Kennedy, J. Mellor-Crummey, and G. Roth. Optimizing Fortran 90 shift operations on distributed-memory multicomputers. In Proceedings Eighth International Workshop on Languages and Compilers for Parallel Computing, volume 1033 of Lecture Notes in Computer Science, Columbus, OH, Aug. 1995. Springer-Verlag.

    Google Scholar 

  7. C. Lin and L. Snyder. ZPL: An array sublanguage. In U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing, volume 768 of Lecture Notes in Computer Science, pages 96–114, Portland, OR, Aug. 1993. Springer-Verlag.

    Google Scholar 

  8. A. Lumsdaine. The matrix template library: A generic programming approach to high performance numerical linear algebra. In Proceedings of International Symposium on Computing in Object-Oriented Parallel Environments, 1998.

    Google Scholar 

  9. L. Mullin. The Psi compiler project. In Workshop on Compilers for Parallel Computers. TU Delft, Holland, 1993.

    Google Scholar 

  10. L. M. R. Mullin. A Mathematics of Arrays. PhD thesis, Syracuse University, Dec. 1988.

    Google Scholar 

  11. G. Roth. Optimizing Fortran90D/HPF for Distributed-Memory Computers. PhD thesis, Dept. of Computer Science, Rice University, Apr. 1997.

    Google Scholar 

  12. G. Roth, J. Mellor-Crummey, K. Kennedy, and R. G. Brickner. Compiling stencils in High Performance Fortran. In Proceedings of SC’97: High Performance Networking and Computing, San Jose, CA, Nov. 1997.

    Google Scholar 

  13. J. T. Schwartz. Optimization of very high level languages-I. Value transmission and its corollaries. Computer Languages, 1(2):161–194, June 1975.

    Article  MATH  Google Scholar 

  14. T. Veldhuizen. Using C++ template metaprograms. C++ Report, 7(4):36–43, May 1995. Reprinted in C++ Gems, ed. Stanley Lippman.

    Google Scholar 

  15. T. L. Veldhuizen. Expression templates. C++ Report, 7(5):26–31, June 1995. Reprinted in C++ Gems, ed. Stanley Lippman.

    Google Scholar 

  16. T. L. Veldhuizen and D. Gannon. Active libraries: Rethinking the roles ofcompilers and libraries. In Proceedings of the SIAM Workshop on Object Oriented Methods for Inter-operable Scientific and Engineering Computing (OO’98), Yorktown Heights, NY, 1998. SIAM.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rosenkrantz, D.J., Mullin, L.R., Hunt, H.B. (2001). On Materializations of Array-Valued Temporaries. In: Midkiff, S.P., et al. Languages and Compilers for Parallel Computing. LCPC 2000. Lecture Notes in Computer Science, vol 2017. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45574-4_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45574-4_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42862-6

  • Online ISBN: 978-3-540-45574-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics