Finding Maximum on an Array Processor with a Global Bus
- 1 February 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-33 (2) , 133-139
- https://doi.org/10.1109/tc.1984.1676405
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
This publication has 4 references indexed in Scilit:
- On an improved algorithm for decentralized extrema finding in circular configurations of processorsCommunications of the ACM, 1982
- Lookahead networksPublished by Association for Computing Machinery (ACM) ,1982
- Decentralized extrema-finding in circular configurations of processorsCommunications of the ACM, 1980
- EthernetCommunications of the ACM, 1976