This Article 
 Bibliographic References 
 Add to: 
Finding Maximum on an Array Processor with a Global Bus
February 1984 (vol. 33 no. 2)
pp. 133-139
S.H. Bokhari, Department of Electrical Engineering, University of Engineering and Technology
The problem of finding the maximum of a set of values stored one per processor on an n X n array of processors is analyzed. The array has a time-shared global bus in addition to conventional processor-processor links. A two-phase algorithm for finding the maximum is presented that uses conventional links during the first phase and the global bus during the second. This algorithm is faster than algorithms that use either only the global bus or only the conventional links.
Index Terms:
two-phase algorithm, Array processors, global bus, interconnection structures, maximum, networks, parallel processing
S.H. Bokhari, "Finding Maximum on an Array Processor with a Global Bus," IEEE Transactions on Computers, vol. 33, no. 2, pp. 133-139, Feb. 1984, doi:10.1109/TC.1984.1676405
Usage of this product signifies your acceptance of the Terms of Use.