Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting

Authors:
Y. C. Chen;W. T. Chen;G. H. Chen;J. P. Sheu
Affiliations:
-;-;-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1990

Citing 4
Cited 17

Array processor with multiple broadcasting

Journal of Parallel and Distributed 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
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing

Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses

IEEE Transactions on Parallel and Distributed Systems
Fast Gossiping on Mesh-Bus Computers

IEEE Transactions on Computers
Time-Optimal Domain-Specific Querying on Enhanced Meshes

IEEE Transactions on Parallel and Distributed Systems
Efficient Parallel Manipulations of IBB Coded Imageson Meshes with Multiple Broadcasting

Journal of Mathematical Imaging and Vision
Podality-Based Time-Optimal Computations on Enhanced Meshes

IEEE Transactions on Parallel and Distributed Systems
Time- and VLSI-Optimal Sorting on Enhanced Meshes

IEEE Transactions on Parallel and Distributed Systems
The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry

IEEE Transactions on Parallel and Distributed Systems
On the Dynamic Initialization of Parallel Computers

The Journal of Supercomputing
An Improved Generalization of Mesh-Connected Computers with Multiple Buses

IEEE Transactions on Parallel and Distributed Systems
Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses

IEEE Transactions on Parallel and Distributed Systems
Embedding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses

IEEE Transactions on Parallel and Distributed Systems
A Fast Selection Algorithm for Meshes with Multiple Broadcasting

IEEE Transactions on Parallel and Distributed Systems
Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting

IEEE Transactions on Parallel and Distributed Systems
Square Meshes Are Not Optimal for Convex Hull Computation

IEEE Transactions on Parallel and Distributed Systems
Coping with Sparse Inputs on Enhanced Meshes - Semigroup Computation with COMMON CRCW Buses

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
On the Dynamic Initialization of Parallel Computers

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

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Semigroup and prefix computations on two-dimensional mesh-connected computers with multiple broadcasting (2-MCCMBs) are studied. Previously, only square 2-MCCMBs with N processing elements were considered for semigroup computations of N data items, andO(N/sup 1/6/) time was required. It is found that square machines are not the best form for semigroup computations, and an O(N/sup 1/8/)-time algorithm is derived on an N/sup 5/8/*N/sup 3/8/ rectangular 2-MCCMB. This time complexity can be further reduced toO(N/sup 1/9/) if fewer processing elements are used. Parallel algorithms for prefix computations with the same time complexities are derived.