Parallel Programming Constructs For Divide-And Conquer, And Branch-And-Bound Paradigms
Jaroslav Opatrný · INFOR Information Systems and Operational Research · 1985
Parallel programming language constructs suitable for Divide-and-Conquer, and Branch-and- Bound algorithms are proposed. These constructs allow a simple specification of the parallelism in the Divide and-Conquer and Branch-and-Bound algorithms and their efficient execution on a bus-connected multi-processor system with a common memory.