From: lkcl <lkcl@web>
Date: Sun, 30 Apr 2023 01:55:24 +0000 (+0100)
Subject: (no commit message)
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=76a6f268194d68fc2d64e37e4189b3e9860f33a6;p=libreriscv.git

---

diff --git a/openpower/sv/rfc/ls012.mdwn b/openpower/sv/rfc/ls012.mdwn
index 693e2dcec..2dbde3444 100644
--- a/openpower/sv/rfc/ls012.mdwn
+++ b/openpower/sv/rfc/ls012.mdwn
@@ -577,6 +577,13 @@ assistance on, to make the evaluation easier.
 an FP64 Multiply typically takes between 12 to 15,000.  Not counting
 the cost in hardware terms is just asking for trouble.
 
+If the number of gates gets too large it has an unintended side-effect:
+power consumption goes up but so does the distance between functions
+on-chip. A good illustration here is the CDC6600 and Cray Supercomputers
+where speed was limited by the size of the *room*.  In other words larger
+functions cause communication delays, and communication delays reduce
+top speed.
+
 **How long will it take to complete?**
 
 In the case of divide or Transcendentals the algorithms needed are so