Near-optimal instruction selection on dags

  title={Near-optimal instruction selection on dags},
  author={David Ryan Koes and Seth Copen Goldstein},
Instruction selection is a key component of code generation. High quality instruction selection is of particular importance in the embedded space where complex instruction sets are common and code size is a prime concern. Although instruction selection on tree expressions is a well understood and easily solved problem, instruction selection on directed acyclic graphs is NP-complete. In this paper we present NOLTIS, a near-optimal, linear time instruction selection algorithm for DAG expressions… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 15 extracted citations

Automated Synthesis of Target-Dependent Programs for Polynomial Evaluation in Fixed-Point Arithmetic

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing • 2014
View 16 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-3 of 3 references

Similar Papers

Loading similar papers…