summaryrefslogtreecommitdiffstats
path: root/content/zettel/2e1f1.md
blob: c09ca890cd74b505c9fe5810efea5488758ac1e5 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
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.