Parallel branch and bound and anomalies
In this paper we present a classification of parallel branch and bound algorithms and investigate the anomalies which can occur during the execution of such algorithms. We develop sufficient conditions to prevent deceleration anomalies from degrading the performance. Such conditions were already known for some synchronous cases. It turns out that these conditions can be generalized to arbitrary cases. Finally we develop necessary conditions for acceleration anomalies to improve upon the performance.
|Keywords||anomalies, asynchronicity, branch and bound, nondeterminism, parallel computer|
Trienekens, H.W.J.M.. (1989). Parallel branch and bound and anomalies. Retrieved from http://hdl.handle.net/1765/1509