The Community for Technology Leaders
Green Image
Issue No. 01 - January (1986 vol. 35)
ISSN: 0018-9340
pp: 62-64
A. Aggarwal , IBM T. J. Watson Research Center
The problem of finding the maximum of a set of values stored one per processor on a two-dimensional array of processors with a time-shared global bus is considered. The algorithm given by Bokhari is shown to be optimal, within a multiplicative constant, for this network and for other d-dimensional arrays. We generalize this model and demonstrate optimal bounds for finding the maximum of a set of values stored in a d-dimensional array with k time-shared global buses.
sorting, Computing maximum, global bus, matrix multiplication, processor array
A. Aggarwal, "Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses", IEEE Transactions on Computers, vol. 35, no. , pp. 62-64, January 1986, doi:10.1109/TC.1986.1676658
96 ms
(Ver 3.3 (11022016))