Concurrent constraint logic programming on massively parallel SIMD computers
Bo-Ming Tong, Ho-fung Leung · 1993
With the advent of cost-effective massively parallel computers, researchers conjecture that the future constraint logic programming system is composed of a massively parallel constraint solver as the back-end with a concurrent inference engine as the front-end [7]. This paper represents an attempt to build a constraint logic programming system on a massively parallel SIMD computer. A concurrent constraint logic programming language called Firebird is presented in this paper. Firebird can handle finite domain constraints and supports both concurrency and data-parallelism. As a result, it is suitable for both multiprocessors and SIMD computers. Concurrency arises from the stream and-parallelism of committed-choice logic programming languages. In a nondeterministic derivation step, one of the domain variables is selected to create a choice point. All possible alternatives are attempted in parallel. Data-parallelism is exploited in the resulting or-parallel execution. Firebird is currently...