From: lkcl Date: Wed, 20 May 2020 14:42:17 +0000 (+0100) Subject: (no commit message) X-Git-Tag: convert-csv-opcode-to-binary~2620 X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=b06af8ebbd340487165f830cd0b0480b76fd254a;p=libreriscv.git --- diff --git a/3d_gpu/architecture/tomasulo_transformation.mdwn b/3d_gpu/architecture/tomasulo_transformation.mdwn index d66f381f1..3600ae6e7 100644 --- 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,