Tom Kelliher, CS 315
Mar. 31, 1999
Reading from last time.
Began special cases.
Carry save, multiplication, convolution.
Recall idea: each vertex of the network simulates a leaf and an internal vertex of the tree.
Consider this example:
A sequence of prefix computations that use the same associative operator , but on disjoint sets of data.
Example: Addition on .
|as a barrier symbol at the start of each set of data.
|1, 7, 2,
|1, 3, 6.
Redefine our operator:
``Forget about everything to the left of the barrier.''