(no commit message)

diff --git a/openpower/sv/biginteger/analysis.mdwn b/openpower/sv/biginteger/analysis.mdwn
index c2c2956ec1f6f5031af55839533c00b397f82f5e..0ea804a53e6c76d1cd55454f4bdb6434d281ec97 100644 (file)
--- a/openpower/sv/biginteger/analysis.mdwn
+++ b/openpower/sv/biginteger/analysis.mdwn
@@ -556,7 +556,11 @@ The very fact that programmers even have to consider multiple
 implementations and compare their performance is an unavoidable nuisance.
 SVP64 is supposed to be designed such that only one implementation of
 any given algorithm is needed. In some ways it is reassuring that
-some algorithms just don't fit.
+some algorithms just don't fit.  Slightly more reassuring is that
+Goldschmidt Divide, which uses two multiplications that can be
+performed in parallel, would be a much better fit with SVP64 (and
+Vector Processing in general), the only downside being that it is
+regarded as worthwhile for much larger integers.
 
 # Conclusion