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

DOI10.1109/12.16495zbMath0666.68043OpenAlexW1984162151MaRDI QIDQ3817609

Xiao-bo Li, Zhixi Fang, Lionel M. Ni

Publication date: 1989

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.16495

zbMATH Keywords

parallel algorithmtime complexitymeshcommunication complexityhypercube networkarray processorsshuffle-exchangetwo- dimensional convolution

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Theory of software (68N99)

Related Items (3)

Derivation and Analysis of Fast Bilinear Algorithms for Convolution ⋮ SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES ⋮ Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory

This page was built for publication: On the communication complexity of generalized 2-D convolution on array processors