Exact bounds on running ASCEND/DESCEND and FAN-IN algorithms on synchronous multiple bus networks
Arshad Ali, Ramachandran Vaidyanathan · IEEE Transactions on Parallel and Distributed Systems · 1996
We consider the problem of running ASCEND/DESCEND and FAN-IN algorithms on synchronous multiple bus networks with a restricted number of buses. Exact 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.