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

Abstract

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.<>