From: lkcl <lkcl@web>
Date: Mon, 18 May 2020 11:51:10 +0000 (+0100)
Subject: (no commit message)
X-Git-Tag: convert-csv-opcode-to-binary~2637
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=c47ceac32e641d2733878fd7669a3ea7c751cd87;p=libreriscv.git

---

diff --git a/3d_gpu/architecture/tomasulo_transformation.mdwn b/3d_gpu/architecture/tomasulo_transformation.mdwn
index e180b7027..026eef8dd 100644
--- a/3d_gpu/architecture/tomasulo_transformation.mdwn
+++ b/3d_gpu/architecture/tomasulo_transformation.mdwn
@@ -10,7 +10,7 @@ factually incorrect and completely misleading.
 By only comparing Q-Tables against the entirety of the Tomasulo algorithm,
 this is equivalent to narrowly focussing on the Reorder Buffer of
 Tomasulo, excluding all else, and concluding that a design that uses a
-ROB is incapable of out-of-order execution.
+ROB is incapable of useful high-performance out-of-order execution.
 
 This article helps readers to understand that Q-Tables != Scoreboards,
 by describing a series of functionally-equivalent transformations that,