Optimal contiguous expression DAG evaluations

DOI10.1007/3-540-60249-6_61MaRDI QIDQ5055901zbMATH OpenOpenAlexFDO

Authors Christoph W. Keßler, Thomas Rauber

Publication date 9 December 2022

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60249-6_61

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 512911
• Scheduling expression DAGs for minimal register need
• Minimizing space usage in evaluation of expression trees
• scientific article; zbMATH DE number 549953
• Optimal chaining in expression trees

Cites work

• Complete Register Allocation Problems
• scientific article; zbMATH DE number 3887060 (Why is no real title available?)
• scientific article; zbMATH DE number 549953 (Why is no real title available?)
• Optimal Code Generation for Expression Trees
• The Generation of Optimal Code for Arithmetic Expressions
• Unrolling loops in fortran

Cited in

(6)

• On sparse evaluation representations
• Memory-optimal evaluation of expression trees involving large objects
• Minimizing space usage in evaluation of expression trees
• Optimal chaining in expression trees
• Balancing Expression Dags for More Efficient Lazy Adaptive Evaluation
• Deferring Dag Construction by Storing Sums of Floats Speeds-Up Exact Decision Computations Based on Expression Dags

This page was built for publication: Optimal contiguous expression DAG evaluations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055901)