Title :
Finding Maximum on an Array Processor with a Global Bus
Author :
Bokhari, Shahid H.
Author_Institution :
Department of Electrical Engineering, University of Engineering and Technology
Abstract :
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.
Keywords :
Array processors; global bus; interconnection structures; maximum; networks; parallel processing; two-phase algorithm; Application software; Broadcast technology; Broadcasting; Computer networks; Finite element methods; LAN interconnection; NASA; Nearest neighbor searches; Parallel processing; Pattern analysis; Array processors; global bus; interconnection structures; maximum; networks; parallel processing; two-phase algorithm;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1984.1676405
