Abstract
The need to evaluate expression trees involving large objects arises in scientific computing applications such as electronic structure calculations. Often, the tree node objects are very large that only a subset of them can fit in memory at a time. This paper addresses the problem of finding an evaluation order of nodes in a given expression tree that uses the least memory. We develop an efficient algorithm that finds an optimal evaluation order in O(n 2) time for an n-node expression tree.
Supported in part by the National Science Foundation under grant DMR-9520319.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Appel, A.W., Supowit, K.J.: Generalizations of the Sethi-Ullman algorithm for register allocation. Software—Practice and Experience 17(6), 417–421 (1987)
Aulbur, W.: Parallel implementation of quasiparticle calculations of semiconductors and insulators, Ph.D. Dissertation, Ohio State University, Columbus (October 1996)
Hybertsen, M.S., Louie, S.G.: Electronic correlation in semiconductors and insulators: band gaps and quasiparticle energies. Phys. Rev. B(34), 53–90 (1986)
Lam, C., Sadayappan, P., Wenger, R.: On optimizing a class of multi-dimensional loops with reductions for parallel execution. Parallel Processing Letters 7(2), 157–168 (1997)
Lam, C., Sadayappan, P., Wenger, R.: Optimization of a class of multi-dimensional integrals on parallel machines. In: Eighth SIAM Conference on Parallel Processing for Scientific Computing (March 1997)
Lam, C., Sadayappan, P., Cociorva, D., Alouani, M., Wilkins, J.: Performance optimization of a class of loops involving sums of products of sparse arrays. In: Ninth SIAM Conference on Parallel Processing for Scientific Computing (March 1999)
Lam, C.: Performance optimization of a class of loops implementing multi-dimensional integrals, Technical report no. OSU-CISRC-8/99-TR22, Dept. of Computer and Information Science, The Ohio State University, Columbus (August. 1999)
Nakata, I.: On compiling algorithms for arithmetic expressions. Comm. ACM 10, 492–494 (1967)
Rojas, H.N., Godby, R.W., Needs, R.J.: Space-time method for Ab-initio calculations of self-energies and dielectric response functions of solids. Phys. Rev. Lett. 74, 18–27 (1995)
Sethi, R., Ullman, J.D.: The generation of optimal code for arithmetic expressions. J. ACM 17(1), 715–728 (1970)
Sethi, R.: Complete register allocation problems. SIAM J. Computing 4(3), 226–248 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lam, CC., Cociorva, D., Baumgartner, G., Sadayappan, P. (1999). Memory-Optimal Evaluation of Expression Trees Involving Large Objects. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds) High Performance Computing – HiPC’99. HiPC 1999. Lecture Notes in Computer Science, vol 1745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46642-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-46642-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66907-4
Online ISBN: 978-3-540-46642-0
eBook Packages: Springer Book Archive