summaryrefslogtreecommitdiffstats
path: root/content/zettel/2e1b.md
diff options
context:
space:
mode:
Diffstat (limited to 'content/zettel/2e1b.md')
-rw-r--r--content/zettel/2e1b.md36
1 files changed, 36 insertions, 0 deletions
diff --git a/content/zettel/2e1b.md b/content/zettel/2e1b.md
new file mode 100644
index 0000000..394a564
--- /dev/null
+++ b/content/zettel/2e1b.md
@@ -0,0 +1,36 @@
++++
+title = "Gated-SSA"
+author = "Yann Herklotz"
+tags = []
+categories = []
+backlinks = ["3a8g", "3a8f", "3a7d", "2f1", "2e1a", "1c6d", "1c3b"]
+forwardlinks = ["2e1c", "2e1b1"]
+zettelid = "2e1b"
++++
+
+Gated-SSA (GSA) \[1\] is an extension to SSA. Whereby in SSA we only
+have φ-functions to choose between expressions after a join from two
+different expressions, gated-SSA extends it with μ, γ and η functions,
+which include the predicate that chooses the expressions, which the
+φ-functions does not include.
+
+This allows for better symbolic analysis of code that contains loops, as
+the function predicates can be compared to each other as well.
+
+<div id="refs" class="references csl-bib-body" markdown="1">
+
+<div id="ref-tu95_gated_ssa_based_deman_driven" class="csl-entry"
+markdown="1">
+
+<span class="csl-left-margin">\[1\]
+</span><span class="csl-right-inline">P. Tu and D. Padua, “Gated
+SSA-based demand-driven symbolic analysis for parallelizing compilers,”
+in *Proceedings of the 9th international conference on supercomputing*,
+in ICS ’95. Barcelona, Spain: Association for Computing Machinery, 1995,
+pp. 414–423. doi: [10.1145/224538.224648].</span>
+
+</div>
+
+</div>
+
+ [10.1145/224538.224648]: https://doi.org/10.1145/224538.224648