Graphs and algorithms
Array processor with multiple broadcasting
Journal of Parallel and Distributed Computing
Minimum-cost spanning tree as a path-finding problem
Information Processing Letters
Image understanding architecture and applications
Advances in Machine Vision
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Polymorphic-Torus Architecture for Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Connection autonomy in SIMD computers: a VLSI implementation
Journal of Parallel and Distributed Computing
Meshes with reconfigurable buses
Proceedings of the fifth MIT conference on Advanced research in VLSI
Parallel Graph Algorithms Based Upon Broadcast Communications
IEEE Transactions on Computers
Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses
IEEE Transactions on Parallel and Distributed Systems
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
On the Parallel Computation of the Algebraic Path Problem
IEEE Transactions on Parallel and Distributed Systems
Finding an extremum in a network
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
A Scalable Interconnection Network Architecture for Petaflops Computing
The Journal of Supercomputing
| Hi-index | 0.04 |
The parallel computation model upon which the proposed algorithms are based is the hyper-bus broadcast network. The hyper-bus broadcast network consists of processors which are connected by global buses only. Based on such an improved architecture, we first design two O(1) time basic operations for finding the maximum and minimum of N numbers each of size O(log N)-bit and computing the matrix multiplication operation of two N脳N matrices, respectively. Then, based on these two basic operations, three of the most important instances in the algebraic path problem, the connectivity problem, and several related problems are all solved in O(log N) time. These include the all-pair shortest paths, the minimum-weight spanning tree, the transitive closure, the connected component, the biconnected component, the articulation point, and the bridge problems, either in an undirected or a directed graph, respectively.