An asynchronous multiprocessor design for branch-and-bound algorithms

Abstract

A fast asynchronous multiprocessor system designed to implement branch-and-bound algorithms is described. Cooperating processors are only responsible for performing computation essential to the problem. Dynamic sharing of work and coordinate among processors are provided by several servers, all of which are capable of handling multiple accesses simultaneously. It is shown how to coordinate the use of these designs and prove the correctness of the authors' solution in reactivating idle processors and detecting the termination of the computation. The loss of computation power due to the uneven work-load distribution, coordination, and synchronization of processors has been reduced significantly compared with other hardware designs.<>