Parallel algorithms for the orthogonal multiprocessor

Authors:
Khaled M. F. Elsayed
Affiliations:
North Carolina State University, Raleigh, NC
Venue:
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Year:
1992

Citing 5
Cited 0

Multiple Bus Architectures

Computer
Parallel Sorting in Two-Dimensional VLSI Models of Computation

IEEE Transactions on Computers
An Orthogonal Multiprocessor for Parallel Scientific Computations

IEEE Transactions on Computers
Analysis and applications of the orthogonal access multiprocessor

Journal of Parallel and Distributed Computing
On shrinking binary picture patterns

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

The orthogonal multiprocessor is a partially shared memory architecture. The architecture exhibits attractive characteristics specially with regards to the simplicity of the interconnection network. This architecture proves to be a powerful platform for a large class of scientific problems. A large set of algorithms have been mapped into this architecture including matrix multiplication, fast Fourier transform, sorting, and partial differential equations.The major contribution of this paper is the mapping of two popular algorithms into the orthogonal multiprocessor architecture. The first algorithm is the Jacobi method for evaluating eigenvalues of a symmetric matrix. The second algorithm is image component labeling based on image shrinking operation. Also a discussion of areas of further study for the orthogonal multiprocessor is included.