Memory-optimal evaluation of expression trees involving large objects

DOI10.1016/j.cl.2010.09.003zbMath1218.68072OpenAlexW2018225658MaRDI QIDQ2275530

Gerald Baumgartner, Thomas Rauber, Daniel Cociorva, Chi Chung Lam, Ponnuswamy Sadayappan

Publication date: 9 August 2011

Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cl.2010.09.003

zbMATH Keywords

register allocationevaluation orderexpression treememory minimization

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Data structures (68P05)

Related Items (3)

TSFC: A Structure-Preserving Form Compiler ⋮ Scheduling series-parallel task graphs to minimize peak memory ⋮ Minimizing I/Os in Out-of-Core Task Tree Scheduling

Cites Work

• Unnamed Item
• Complete Register Allocation Problems
• Modern Compiler Implementation in Java
• Generalizations of the sethi‐ullman algorithm for register allocation
• On compiling algorithms for arithmetic expressions
• The Generation of Optimal Code for Arithmetic Expressions
• Computational Science – ICCS 2005
• Languages and Compilers for Parallel Computing

This page was built for publication: Memory-optimal evaluation of expression trees involving large objects