Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses

Authors:
M. J. Serrano;B. Parhami
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1993

Citing 14
Cited 9

Array processor with multiple broadcasting

Journal of Parallel and Distributed Computing
On Multidimensional Arrays of Processors

IEEE Transactions on Computers
Modified-Mesh Connected Parallel Computers

IEEE Transactions on Computers
Size-time complexity of Boolean networks for prefix computations

Journal of the ACM (JACM)
Image Computations on Meshes with Multiple Broadcast

IEEE Transactions on Pattern Analysis and Machine Intelligence
Solving linear recurrence systems on mesh-connected computers with multiple global buses

Journal of Parallel and Distributed Computing
Solving nonuniform problems on SIMD computers: case study on region growing

Journal of Parallel and Distributed Computing - Massively parallel computation
Square Meshes are Not Always Optimal

IEEE Transactions on Computers
Express Cubes: Improving the Performance of k-ary n-cube Interconnection Networks

IEEE Transactions on Computers
Graph Problems on a Mesh-Connected Processor Array

Journal of the ACM (JACM)
Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting

IEEE Transactions on Parallel and Distributed Systems
Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems

IEEE Transactions on Parallel and Distributed Systems
HMESH: A VLSI Architecture for Parallel Processing

CONPAR '86 Conference on Algorithms and Hardware for Parallel Processing
The complexity of computations by networks

IBM Journal of Research and Development - Mathematics and computing

Exact Bounds on Running ASCEND/DESCEND and FAN-IN Algorithms on Synchronous Multiple Bus Networks

IEEE Transactions on Parallel and Distributed Systems
An efficient self-simulation algorithm for reconfigurable meshes

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
An Improved Generalization of Mesh-Connected Computers with Multiple Buses

IEEE Transactions on Parallel and Distributed Systems
On Dependability Evaluation of Mesh-Connected Processors

IEEE Transactions on Computers
Fault-Tolerant Multiple Bus Networks for Fan-In Algorithms

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Routing Algorithms on the Bus-Based Hypercube Network

IEEE Transactions on Parallel and Distributed Systems
Performance, Algorithmic, and Robustness Attributes of Perfect Difference Networks

IEEE Transactions on Parallel and Distributed Systems
Tight bounds on the simulation of meshes with dynamically reconfigurable row/column buses by meshes with statically partitioned buses

Journal of Parallel and Distributed Computing
Efficient partitioning of static buses for processor arrays of small size

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I

Quantified Score

Hi-index	0.01

Visualization

Abstract

A two-dimensional mesh of processing elements (PE's) with separable row and columnbuses (i.e., broadcast mechanisms for rows and columns that can be logically divided intoa number of local buses through the use of PE-controlled switches) has been shown to bequite effective for semigroup computation, prefix computation, and a wide class of othercomputations that do not require excessive communication or data routing. For mesheswith separable row/column buses, the authors show how semigroup and prefixcomputations can be performed with the same asymptotic time complexity without theprovision of buses for every row and every column and discuss the VLSI implications ofthis new architecture.