HMESH: a VLSI architecture for parallel processing
Proc. of the conference on algorithms and hardware for parallel processing on CONPAR 86
Array processor with multiple broadcasting
Journal of Parallel and Distributed Computing
Some Complexity Results for Matrix Computations on Parallel Processors
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
Vector prefix addition on sub-bus mesh computers
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
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
An Improved Generalization of Mesh-Connected Computers with Multiple Buses
IEEE Transactions on Parallel and Distributed Systems
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
Fast median-finding on mesh-connected computers with segmented buses
Nordic Journal of Computing
Coping with Sparse Inputs on Enhanced Meshes - Semigroup Computation with COMMON CRCW Buses
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Some results on the computation of Voronoi diagrams on a mesh with multiple broadcasting
Journal of Parallel and Distributed Computing
| Hi-index | 14.98 |
Mesh-connected computers with multiple buses providing broadcast facilities along rows and columns are discussed. A tight bound of Theta (n/sup 1/8/) is established for the number of rounds required for semigroup computations on n values distributed on a two-dimensional rectangular mesh of size n with a bus on every row and column. The upper bound is obtained for a skewed rectangular mesh of dimensions n/sup 3/8/*n/sup 5/8/. This result is compared to the tight bound of Theta (n/sup 1/6/) for the same problem on the square (n/sup 1/2/*n/sup 1/2/) mesh. It is shown that in the presence of multiple buses, a skewed configuration may perform better than a square configuration for certain computational tasks. The result can be extended to the d-dimensional mesh, giving a lower bound of Omega (n/sup 1/d alpha /) and an upper bound of O(d2/sup d+1/ n/sup 1/d alpha /), where alpha =2/sup d/; these bounds are optimal within constant factors for any constant d. It is noted that for d