From 90edc4711106e53598a008f1866d811fca40f48d Mon Sep 17 00:00:00 2001 From: Luke Kenneth Casson Leighton Date: Sat, 16 May 2020 23:56:21 +0100 Subject: [PATCH] add context on article --- .../architecture/tomasulo_transformation.mdwn | 17 ++++++++++++++++- 1 file changed, 16 insertions(+), 1 deletion(-) diff --git a/3d_gpu/architecture/tomasulo_transformation.mdwn b/3d_gpu/architecture/tomasulo_transformation.mdwn index a93113bcb..d2ead6838 100644 --- a/3d_gpu/architecture/tomasulo_transformation.mdwn +++ b/3d_gpu/architecture/tomasulo_transformation.mdwn @@ -1,6 +1,21 @@ # Conversion from Tomasulo to Scoreboards -See [discussion](http://lists.libre-riscv.org/pipermail/libre-riscv-dev/2020-May/006747.html) +See [discussion](http://lists.libre-riscv.org/pipermail/libre-riscv-dev/2020-May/006747.html). +This page aids and assists in understanding the full functional equivalence +of a Scoreboard-based design when compared to a Tomasulo algorithm. However +it is extremely important to note that the Academic literature, by focussing +exclusively on the published patent covering Q-Tables, is hopelessly inaccurate, +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. + +This article helps readers to understand that Q-Tables != Scoreboards, +by describing a series of functionally-equivalent transformations that, +when followed, *turn* the Tomasulo algorithm *into* a Scoreboard-based +design. On Saturday, May 16, 2020, Yehowshua wrote: > This is a very intricate and complicated subject matter for sure. -- 2.30.2