Embedding trees into hypercubes Using the embedding of the eight-leaf complete binary tree into the 3-cube depicted in Fig. 13.7: a. Draw a sequence of snapshots showing how the hypercube would...

Embedding trees into hypercubes

Using the embedding of the eight-leaf complete binary tree into the 3-cube depicted in Fig. 13.7:

a. Draw a sequence of snapshots showing how the hypercube would emulate the tree algorithm for semigroup computation with data items stored at the leaves (see Section 2.4).

 b. Compare the emulation of part (a) with the direct hypercube algorithm given in Section 13.4.

c. Repeat part (a) for the parallel prefix computation.

d. Repeat part (b) for the parallel prefix computation.