Lo, V.; Rajopadhye, S. V.; Gupta, S.; Keldsen, D.; Mohamed, M.; Telle, Jan
(University of Oregon, 1990-01-19)
In this paper, we identify the binomial tree as an ideal computation
structure for parallel divide-and-conquer algorithms. We show its superiority
to the classic full binary tree structure with respect to speedup
and ...
