Parallel implementations of a branch-and-bound algorithm for the optimization of distributed database computer networks

Abstract

The arrival of parallel processing architectures has generated considerable interest in mapping conventional sequential jobs onto the new machines (multiprocessor arrays). The problem is in finding and exploiting the parallelism in a given task. The authors outline some important findings on a branch-and-bound algorithm and how it was modified to run on a multiprocessor network of Transputers.<>