On Multidimensional Arrays of Processors

Authors:
M. J. Atallah
Affiliations:
Purdue Univ., West Lafayette, IN
Venue:
IEEE Transactions on Computers
Year:
1988

Citing 6
Cited 4

Solving tree problems on a Mesh-connected processor Array

Information and Control
Optimal simulations between mesh-connected arrays of processors

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Graph Problems on a Mesh-Connected Processor Array

Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer

Communications of the ACM
Fast parallel processing array algorithms for some graph problems(Preliminary Version)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Computational Aspects of VLSI

Computational Aspects of VLSI

Embedding meshes on the star graph

Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Embedding Complete Binary Trees Into Butterfly Networks

IEEE Transactions on Computers
Work-preserving emulations of fixed-connection networks

Journal of the ACM (JACM)
Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	14.98

Visualization

Abstract

An investigation is conducted of the relationship between a rectangular mesh and a square one. Asymptotically optimal algorithms are given for simulating one type by the other. The simulation results are useful since they permit designing algorithms on one network (e.g. the square mesh) in spite of the fact that the actual machine on which these algorithms will run is different (e.g. a rectangular mesh).