By Topic

Optimal implementation of parallel divide-and-conquer algorithms on de Bruijn networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaoxiong Zhong ; Oregon Univ., Eugene, OR, USA ; V. Lo ; S. Rajopadhye

Studies the problem of optimal implementation of parallel divide-and-conquer algorithms on binary de Bruijn networks. A divide-and-conquer algorithm is modeled as a temporal complete binary tree computation structure. An important contraction property between two successive binary de Bruijn networks is revealed. A twice-size complete binary tree is mapped to a de Bruijn network. Two nodes in the complete binary tree are mapped to a single node. The mapping is of dilation one, communication contention free and of good load balance

Published in:

Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the

Date of Conference:

19-21 Oct 1992