Array processor with multiple broadcasting
Journal of Parallel and Distributed Computing
Connection autonomy in SIMD computers: a VLSI implementation
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
The processor identity problem
Information Processing Letters
Optimal initializing algorithms for a reconfigurable mesh
Journal of Parallel and Distributed Computing
Leader Election in the Presence of Link Failures
IEEE Transactions on Parallel and Distributed Systems
Optimal elections in labeled hypercubes
Journal of Parallel and Distributed Computing
Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
IEEE Transactions on Computers
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to be contended with at power-up time. The problem -- henceforth called the initialization problem -- is fundamental, for virtually all parallel algorithms known to the authors assume that the processors know their global coordinates within the newly created entity.Rather surprisingly, the initialization problem has not received the attention it deserves. Our main contribution is to present parallel algorithms for the initialization problem on a number of network topologies, including complete binary trees, meshes of trees, pyramids, linear arrays, rings, meshes, tori, higher dimensional meshes and tori, hypercubes, butterflies, linear arrays with a global bus, rings with a global bus and meshes with multiple broadcasting, under various assumptions about edge labels, leader existence, and a priori knowledge of the number of nodes in the network.