November 2018
Intermediate to advanced
310 pages
7h 54m
English
The naive parallel prefix algorithm is the original version of this algorithm; this algorithm is "naive" because it makes an assumption that given n input elements,
, with the further assumption that n is dyadic (that is,
for some positive integer, k), and we can run the algorithm in parallel over n processors (or n threads). Obviously, this will impose strong limits on the cardinality n of sets that we may process. However, given these conditions are satisfied, we have a nice result in that its computational ...
Read now
Unlock full access