Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Finding Maximum on an Array Processor with a Global Bus
By: Bokhari, S.H.;
1984 / IEEE
This item was taken from the IEEE Periodical ' Finding Maximum on an Array Processor with a Global Bus ' 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.