Implementation of a Data-Parallel Concurrent Constraint Programming System
Bo-Ming Tong, H.K.N. Leung · 1994
: In [12], we proposed Firebird, a new concurrent constraint programming language [9] which supports both concurrency and data-parallelism. Committed-choice indeterminism and don't know nondeterminism are integrated, but in a manner different from the Andorra Model [16]. Instead of nondeterminate clauses, finite domain variables form the basis of don't know nondeterminism in Firebird. After a domain variable is labeled, all possible values in its domain are attempted in an or-parallel manner. A data-parallel implementation of Firebird has been built. The aim of this paper is to present: 1, the scheduler and 2, the parallel backtracking scheme of Firebird, which are not described in [12]. Our concurrent process scheduler uses simple data-parallel algorithms for process resumption and deadlock detection. On the other hand, when the number of processor elements is not enough for exploiting or-parallelism, the system resorts to parallel backtracking automatically. We present the data struc...