Title :
Exact bounds on running ASCEND/DESCEND and FAN-IN algorithms on synchronous multiple bus networks
Author :
Ali, Arshad ; Vaidyanathan, Ramachandran
Author_Institution :
Cirrus Logic Inc., Fremont, CA, USA
fDate :
8/1/1996 12:00:00 AM
Abstract :
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
Keywords :
computational complexity; multiprocessor interconnection networks; parallel algorithms; processor scheduling; ASCEND/DESCEND; FAN-IN; lower bound; multiple bus networks; parallel algorithms; scheduling; synchronous multiple bus networks; synchronous parallelism; Algorithm design and analysis; Communications technology; Delay; Hypercubes; Optical fiber communication; Parallel algorithms; Parallel processing; Processor scheduling; Scheduling algorithm; Very large scale integration;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
