Odd Even Shifts in SIMD Hypercubes

Authors:
S. Ranka;S. Sahni
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1990

Citing 5
Cited 1

Communication effect basic linear algebra computations on hypercube architectures

Journal of Parallel and Distributed Computing
Data communication in hypercubes

Journal of Parallel and Distributed Computing
Parallel permutation and sorting algorithms and a new generalized connection network

Journal of the ACM (JACM)
Digital Picture Processing

Digital Picture Processing
Computer Vision

Computer Vision

Parallel Computer Vision on a Reconfigurable Multiprocessor Network

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A linear-time algorithm is developed to perform all odd (even) length circular shifts of data in an SIMD (single-instruction-stream, multiple-data-stream) hypercube. As an application, the algorithm is used to obtain an O(M/sup 2/+log N) time and O(1) memory per processor algorithm to compute the two-dimensional convolution of an N*N image and an M*M template on an N/sup 2/ processor SIMD hypercube. This improves the previous best complexity of O(M/sup 2/ log M+log N).