Exploiting Fine-grain Parallelism in Concurrent Constraint Languages

Montelius, J., 1997. Exploiting Fine-grain Parallelism in Concurrent Constraint Languages, 220 pp. Uppsala Thesis in Computing Science 28, ISSN 0283-359X, ISBN 91-506-1215-8. SICS Dissertation Series 25, ISSN 1101-1335, ISRN SICS/D-- 25--SE T his dissertation presents the design, implementation, and evaluation of a system that exploits fine-grain implicit parallelism in concurrent constraint programming language. The system is able to outperform a C implementation of an algorithm with complex dependencies without any user annotations. The concurrent constraint programming language AKL is used as a source programming language. A program is divided during runtime into tasks that are distributed over available processors. The system is unique in that it handles both and-parallel execution of goals as well as or-parallel execution of encapsulated search. A parallel binding scheme for a hierarchical constraint store is presented. The binding scheme allows encapsulated search to be performe..