(no commit message)

diff --git a/3d_gpu/architecture/tomasulo_transformation.mdwn b/3d_gpu/architecture/tomasulo_transformation.mdwn
index d66f381f113544ab3342dbe7d65f8243f38bd1d2..3600ae6e79ccc1a672e7c3af276bc2f3aafdb0b9 100644 (file)
--- a/3d_gpu/architecture/tomasulo_transformation.mdwn
+++ b/3d_gpu/architecture/tomasulo_transformation.mdwn
@@ -12,7 +12,8 @@ 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 useful high-performance out-of-order execution.
+ROB and therefore the entire Tomasulo algorithm itself 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,