This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses
January 1986 (vol. 35 no. 1)
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.
Index Terms:
sorting, Computing maximum, global bus, matrix multiplication, processor array
Citation:
A. Aggarwal, "Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses," IEEE Transactions on Computers, vol. 35, no. 1, pp. 62-64, Jan. 1986, doi:10.1109/TC.1986.1676658
Usage of this product signifies your acceptance of the Terms of Use.