On communication latency in PRAM computations
Alok Aggarwal, Ashok K. Chandra, et al.
SPAA 1989
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. Copyright 1986 by The Institute of Electrical and Electronics Engineers, Inc.
Alok Aggarwal, Ashok K. Chandra, et al.
SPAA 1989
Alok Aggarwal, Subhash Suri
Information Processing Letters
Alok Aggarwal, Prabhakar Raghavan
Information Processing Letters
Alok Aggarwal, Don Coppersmith, et al.
SIAM Journal on Computing