diff options
Diffstat (limited to 'content/zettel/2e1d.md')
| -rw-r--r-- | content/zettel/2e1d.md | 35 |
1 files changed, 35 insertions, 0 deletions
diff --git a/content/zettel/2e1d.md b/content/zettel/2e1d.md new file mode 100644 index 0000000..f8107b0 --- /dev/null +++ b/content/zettel/2e1d.md @@ -0,0 +1,35 @@ ++++ +title = "Equality saturation" +author = "Yann Herklotz" +tags = [] +categories = [] +backlinks = ["2e1c"] +forwardlinks = ["2e1e", "2e1d1"] +zettelid = "2e1d" ++++ + +Often, ordering of optimisations is difficult, as they can produce +different results, and one sometimes doesn't know beforehand which order +will produce better results. Equality saturation \[1\] instead enriches +the program with equivalent versions of it, which can then be later used +to optimise different areas of it with different equal representations. +This is performed for each optimisation, thereby enriching the tree and +saturating it with equalities. + +<div id="refs" class="references csl-bib-body" markdown="1"> + +<div id="ref-tate09_equal_satur" class="csl-entry" markdown="1"> + +<span class="csl-left-margin">\[1\] +</span><span class="csl-right-inline">R. Tate, M. Stepp, Z. Tatlock, and +S. Lerner, “Equality saturation: A new approach to optimization,” in +*Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on +principles of programming languages*, in POPL ’09. Savannah, GA, USA: +Association for Computing Machinery, 2009, pp. 264–276. doi: +[10.1145/1480881.1480915].</span> + +</div> + +</div> + + [10.1145/1480881.1480915]: https://doi.org/10.1145/1480881.1480915 |