Efficient CRCW PRAM algorithm for finding maximum of N numbers
- Suggest an O(log(log n)) CRCW PRAM algorithm to compute the maximum
of N numbers using no more than O(N) processors.
- What is the best EREW PRAM algorithm you can come up with to
compute the maximum of N numbers using no more than O(N) processors?
Hint: First, think about an efficient algorithm to find the
maximum of n numbers using no more than O(n^2) processors, and then
reduce the original problem to that one.
[Solution]
This document has been prepared by Professor Azer Bestavros
<best@cs.bu.edu> as the WWW Home Page for
CS-551, which is
part of the NSF-funded
undergraduate curriculum on parallel
computing at BU.
This page has been created on October 3, 1994 and has been
updated last on October 4, 1994.