Computer
Polymorphic-Torus Architecture for Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optical bus control for distributed multiprocessors
Journal of Parallel and Distributed Computing
The Organization of Permutation Architectures with Bused Interconnections
IEEE Transactions on Computers
Analysis of Packet-Switched Multiple-Bus Multiprocessor Systems
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
PPMB: A Partial-Multiple-Bus Multiprocessor Architecture with Improved Cost-Effectiveness
IEEE Transactions on Computers
An introduction to parallel algorithms
An introduction to parallel algorithms
Sorting on PRAMs with reconfigurable buses
Information Processing Letters
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
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
On the power of segmenting and fusing buses
Journal of Parallel and Distributed Computing
Optimal Realization of Sets of Interconnection Functions on Synchronous Multiple Bus Systems
IEEE Transactions on Computers
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
IEEE Transactions on Parallel and Distributed Systems
An Optimal Multiple Bus Network for Fan-in Algorithms
ICPP '97 Proceedings of the international Conference on Parallel Processing
Fault-Tolerant Multiple Bus Networks for Fan-In Algorithms
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms
IEEE Transactions on Computers
Routing Algorithms on the Bus-Based Hypercube Network
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
We consider the problem of running ASCEND/DESCEND and FAN-IN algorithms on synchronous multiple bus networks with a restricted number of buses. Exact1 lower bounds on the time are derived. We present a method that runs FAN-IN algorithms optimally and ASCEND/DESCEND algorithms in one step beyond the lower bound.