summaryrefslogtreecommitdiffstats
path: root/content/zettel/2e1f1.md
diff options
context:
space:
mode:
Diffstat (limited to 'content/zettel/2e1f1.md')
-rw-r--r--content/zettel/2e1f1.md16
1 files changed, 16 insertions, 0 deletions
diff --git a/content/zettel/2e1f1.md b/content/zettel/2e1f1.md
new file mode 100644
index 0000000..c09ca89
--- /dev/null
+++ b/content/zettel/2e1f1.md
@@ -0,0 +1,16 @@
++++
+title = "Idempotency of loop pipelining"
+date = "2022-05-03"
+author = "Yann Herklotz"
+tags = []
+categories = []
+backlinks = ["2e1f"]
+forwardlinks = []
+zettelid = "2e1f1"
++++
+
+It is interesting to think about if loop pipelining is idempotent. My
+first guess would be no, as in most cases the pipelining algorithm will
+try and transform the loop into something more efficient. However, maybe
+it does reach a steady state where it will not apply any more
+optimisations.