BIP! Finder - Parallel Programming Constructs For Divide-And Conquer, And Branch-And-Bound Paradigms

Clear all

1985 • Parallel Programming Constructs For Divide-And Conquer, And Branch-And-Bound Paradigms

Authors: Jaroslav Opatrny

Abstract: AbstractParallel 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.

External links: OpenAIRE

Works in BIP! associated with the specified OpenAIRE research product

Parallel Programming Constructs For Divide-And Conquer, And Branch-And-Bound Paradigms

Jaroslav Opatrny

INFOR: Information Systems and Operational Research · 1985

Parallel computing | Programming language | Theoretical computer science |

Restricted/Closed Access

Article