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

DOI10.1109/12.16495MaRDI QIDQ3817609zbMATH OpenOpenAlexFDO

Authors Zhixi Fang, Xiaobo Li, 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

array processorscommunication complexityhypercube networkmeshparallel algorithmshuffle-exchangetime complexitytwo- dimensional convolution

Mathematics Subject Classification ID

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

Recommendations

• 2D processor array structures for convolution
• scientific article; zbMATH DE number 3980375
• Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
• scientific article; zbMATH DE number 179269
• Two-dimensional FFT algorithms on hypercube and mesh machines

Cited in

(8)

• Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory
• 2D processor array structures for convolution
• Study on the overlapping addition method to compute two-dimensional convolution
• Serial/Parallel Convolvers
• Approximating large convolutions in digital images
• Derivation and analysis of fast bilinear algorithms for convolution
• An efficient partitioning-based scheme for 2-D convolution and signal processing applications
• SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3817609)