No abstract

No abstract

The prefix computation problem is to compute all η initial products «ι ° · · · ° α" ι = 1, · · ·, n, of a set of η elements, where ° is an associative operation. We present an 0(((log n)/\og(2n/p)) · (n/p)) time deterministic parallel algorithm using ρ < η processors to solve the prefix computation problem, when the order of the elements is specified by a linked list. For ρ ^ 0(n l~€ ) (c > 0 any constant), this algorithm achieves linear speedup. Such optimal speedup was previously achieved only by probabilistic algorithms. Our algorithms assume the weakest PRAM model, where shared memory locations can only be exclusively read or written (the EREW model).Index Terms-Algorithms, parallel algorithms, parallel prefix.

No abstract

No abstract