henry@aplcen.apl.jhu.edu (Gary Henry ) (12/14/88)
I was reading a paper in Algorithmica, and it requires that the maximum of n numbers on an n processor CREW machine be done in constant time. (Note that I said *E*xclusive Writes.) It seems perfectly reasonable to be able to do this because the maximum of n numbers can be done in O(n) = O(1)xO(n) time sequentially. Did I miss a trick somewhere? Forgive me if this is a silly question. Thanks in advance. Gary Henry Johns Hopkins UUCP: henry@aplcen.UUCP (<-- soon to expire) ARPA/Internet: henry@crabcake.cs.jhu.edu (128.220.13.4)