The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1996 vol.7)
pp: 783-790
ABSTRACT
<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>
INDEX TERMS
ASCEND/DESCEND algorithms, FAN-IN algorithms, multiple bus networks, parallel algorithms, scheduling, synchronous parallelism.
CITATION
Arshad Ali, Ramachandran Vaidyanathan, "Exact Bounds on Running ASCEND/DESCEND and FAN-IN Algorithms on Synchronous Multiple Bus Networks", IEEE Transactions on Parallel & Distributed Systems, vol.7, no. 8, pp. 783-790, August 1996, doi:10.1109/71.532110
50 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool