On 13/07/18 17:26, druck wrote:
> To take your example, the code on each machine might take twice a many
> individual cycles as it could do, but if it avoids even a small amoint
> of inter machine data transfer, it may run many hundreds of times faster
> on a massively parallel system.

Yup. A specific instance of the general maxim that a chain is only as
strong as its weakest link

Parallel computing is only of use where the output of one parrallel task
is not used as the input of another

Hugely good in e.g massive matrix calculation like video rescaling.

Not so good elsewhere.



--
I would rather have questions that cannot be answered...
...than to have answers that cannot be questioned

Richard Feynman

--- SoupGate-Win32 v1.05