The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—We consider the problem of running ASCEND/DESCEND and FAN-IN algorithms on synchronous multiple bus networks with a restricted number of buses. Exact<ref fid="fl07831" type="fn">1</ref> 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.</p>
ASCEND/DESCEND algorithms, FAN-IN algorithms, multiple bus networks, parallel algorithms, scheduling, synchronous parallelism.
Ramachandran Vaidyanathan, Arshad Ali, "Exact Bounds on Running ASCEND/DESCEND and FAN-IN Algorithms on Synchronous Multiple Bus Networks", IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 783-790, August 1996, doi:10.1109/71.532110
86 ms
(Ver 3.3 (11022016))