Solving linear recurrence systems on mesh-connected computers with multiple global buses
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Bus-based networks for fan-in and uniform hypercube algorithms
Parallel Computing
The bus-connected ringed tree: a versatile interconnection network
Journal of Parallel and Distributed Computing
Exact Bounds on Running ASCEND/DESCEND and FAN-IN Algorithms on Synchronous Multiple Bus Networks
IEEE Transactions on Parallel and Distributed Systems
Fast Gossiping on Mesh-Bus Computers
IEEE Transactions on Computers
HMESH: A VLSI Architecture for Parallel Processing
CONPAR '86 Conference on Algorithms and Hardware for Parallel Processing
Self-Simulation for the Passive Optical Star Model
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms
IEEE Transactions on Computers
| Hi-index | 0.00 |
We consider a class of algorithms called Fan-in algorithms, with numerous applications in problems involving semigroup operations. We present a multiple bus network (MBN) that runs any Fan-in algorithm in optimal number of steps. The degree and loading of this MBN are each 3. We prove that the product of the degree and loading of any MBN that runs a Fan-in algorithm in optimal time is at least 9. This establishes the proposed MBN to be optimal.