Abstract
A detailed model is presented for the speedup of parallel linear iterative solvers. The mapping of a topologically rectangular discrete grid onto a processor array of N×M transputers leads to step-like behaviour in the local communication and calculation time. This results in a typical oscillatory behaviour of ‘speedup’ when problem sizes are increased monotonously. The theory is compared with experimental results obtained on a Parsytec Super Cluster Model 64 using a black-red SOR algorithm coded in 3L Parallel Fortran.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
