From 39d8741ae7cd10d6f46685faa0c211707dfc194f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Th=C3=A9ophile=20Bastian?= <contact@tobast.fr>
Date: Tue, 23 Jan 2024 18:40:13 +0100
Subject: [PATCH] Foundations: small amends
---
manuscrit/20_foundations/20_code_analyzers.tex | 9 +++++----
1 file changed, 5 insertions(+), 4 deletions(-)
diff --git a/manuscrit/20_foundations/20_code_analyzers.tex b/manuscrit/20_foundations/20_code_analyzers.tex
index 1e9ecea..03d34a8 100644
--- a/manuscrit/20_foundations/20_code_analyzers.tex
+++ b/manuscrit/20_foundations/20_code_analyzers.tex
@@ -341,14 +341,12 @@ $\cyc{\kerK} = 1.5$.
This last right-hand expression is independent of $n$, which we note $M$.
Dividing by $n$, we obtain
\[
- \abs{\dfrac{\ckn{n}}{n} - \cyc{\kerK}} &\leq \dfrac{M}{n} \\
+ \abs{\dfrac{\ckn{n}}{n} - \cyc{\kerK}} \leq \dfrac{M}{n} \\
\]
from which both results follow.
\end{proof}
-\todo{}
-
\medskip
Throughout this manuscript, we mostly use reciprocal throughput as a metric, as
@@ -362,7 +360,10 @@ stead.
\begin{definition}[Throughput of a kernel]
The \emph{throughput} of a kernel $\kerK$, measured in \emph{instructions
per cycle}, or IPC, is defined as the number of instructions in $\kerK$, divided
- by the steady-state execution time of $\kerK$.
+ by the steady-state execution time of $\kerK$:
+ \[
+ \operatorname{IPC}(\kerK) = \dfrac{\card{\kerK}}{\cyc{\kerK}}
+ \]
\end{definition}
In the literature or in analyzers' reports, the throughput of a kernel is often