Memory-Optimal Evaluation of Expression Trees Involving Large Objects

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 On2  time for an n-node expression tree.

• Type: Conference
• Year: 1999
• Where: HIPC
• Authors: Chi-Chung Lam, Daniel Cociorva, Gerald Baumgartner, P. Sadayappan
• Keywords: Distributed And Parallel Computing, Expression Tree, HIPC 1999, Large Objects Arises, Tree Node Objects