This Article 
 Bibliographic References 
 Add to: 
D.B. Gannon, Department of Computer Sciences, Purdue University
This paper describes two models of the cost of data movement in parallel numerical algorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In this second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm-independent upper bounds on system performance are derived for several problems that are important to scientific computation.
Index Terms:
VLSI complexity, Interconnection networks, numerical software, parallel algorithms, parallel architectures
D.B. Gannon, J. Van Rosendale, "On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms," IEEE Transactions on Computers, vol. 33, no. 12, pp. 1180-1194, Dec. 1984, doi:10.1109/TC.1984.1676393
Usage of this product signifies your acceptance of the Terms of Use.