On Thu, 16 Dec 2021 21:48:14 GMT, kabutz <d...@openjdk.java.net> wrote:
> > embarrassingly parallelizable > > Having looked at [embarrassingly > parallel](https://en.wikipedia.org/wiki/Embarrassingly_parallel), I'm not > certain that this particular problem would qualify. The algorithm is easy to > parallelize, but in the end we still have some rather large numbers, so > memory will be our primary dominator. I'd expect to see a linear speedup if > it was "perfectly parallel", but this does not come close to that. Ok, fair point, to avoid possible confusion I have removed "embarrassingly". I don't think we need to refer to other algorithms. ------------- PR: https://git.openjdk.java.net/jdk/pull/6409
