Department of Computer and Information Science

Permanent URI for this community

https://hdl.handle.net/1794/122

For information about the department, please see the department's web site.

Browse

Browsing Department of Computer and Information Science by Author "Keldsen, D."

Now showing 1 - 1 of 1
  • Thumbnail Image
    ItemOpen Access
    Mapping Divide-and-Conquer Algorithms to Parallel Architectures
    (University of Oregon, 1990-01-19) Lo, V.; Rajopadhye, S. V.; Gupta, S.; Keldsen, D.; Mohamed, M.; Telle, Jan
    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 efficiency. We also present elegant and efficient algorithms for mapping the binomial tree to two interconnection networks commonly used in multicomputers, namely the hypercube and the two-dimensional mesh. Our mappings are optimal with respect to both average dilation and link contention. We discuss the practical implications of these results for message-passing architectures using store-and-forward routing vs. those using wormhole routing.