On the communication complexity of generalized 2-D convolution on array processors

Author

Fang, Zhixi ; Li, Xiaobo ; Ni, Lionel M.

Author_Institution

Dept. of Comput. Sci., Wichita State Univ., KS, USA

Volume

38

Issue

2

fYear

1989

Firstpage

184

Lastpage

194

Abstract

Several parallel convolution algorithms for array processors with N/sup 2/ processing elements (PEs) connected by mesh, hypercube, and shuffle-exchange topologies, respectively, are presented. The computation time complexity is the same for array processors with different interconnection networks. The communication time complexity, however, varies from network to network, and is the main focus. It is shown that by using inter-PE communication networks efficiently, each PE requires only a small local memory, many unnecessary data transmissions are eliminated, and the overall time complexity (including computation and communication) of algorithms is reduced to O(M/sup 2/).<>

Keywords

computational complexity; parallel algorithms; array processors; communication complexity; computation time complexity; generalized 2-D convolution; hypercube; mesh; parallel convolution algorithms; shuffle-exchange; Communication networks; Complexity theory; Computer networks; Convolution; Data communication; Hypercubes; Multiprocessor interconnection networks; Network topology;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.16495

Filename

16495