Efficient CRCW PRAM algorithm for finding maximum of N numbers

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.


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.