Levelization

• Want to insure nearest neighbor comm.

• If p is # processors and n is # nodes.

• Let ri be the sum of the number of nodes in contiguous levels i and i + 1

• Let r = max{r1, r2, … , rn}

• Nearest neighbor communication is assured if n/p > r

Previous slide

Next slide

Back to first slide

View graphic version