DocumentCode :
1152501
Title :
Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses
Author :
Aggarwal, Alok
Author_Institution :
IBM T. J. Watson Research Center
Issue :
1
fYear :
1986
Firstpage :
62
Lastpage :
64
Abstract :
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.
Keywords :
Computing maximum; global bus; matrix multiplication; processor array; sorting; Broadcasting; Computer networks; Concurrent computing; Parallel algorithms; Partitioning algorithms; Phased arrays; Propagation delay; Sorting; Computing maximum; global bus; matrix multiplication; processor array; sorting;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1986.1676658
Filename :
1676658
Link To Document :
بازگشت