Andorra-I compilation

Andorra-I is an experimental parallel Prolog system which transparently exploits both dependent and-parallelism and or-parallelism. One of the main components of Andorra-I is its preprocessor. In order to obtain efficient execution of programs in Andorra-I, the preprocessor includes a compiler for Andorra-I. The compiler includes a determinacy analyser and a clause compiler, and generates code for a specialised abstract machine. In this paper we discuss the main issues in the Andorra-I compiler, presenting its abstract instruction set and describing the algorithms used in its implementation.

[1]  Rong Yang,et al.  Performance of the Compiler-Based Andorra-I System , 1993, ICLP.

[2]  Rong Yang,et al.  Andorra I: a parallel Prolog system that transparently exploits both And-and or-parallelism , 1991, PPOPP '91.

[3]  Seif Haridi,et al.  The Aurora or-parallel Prolog system , 1990, New Generation Computing.

[4]  James Alexander Crammond,et al.  Implementation of committed choice logic languages on shared memory multiprocessors , 1988 .

[5]  Saumya K. Debray,et al.  A Simple Code Improvement Scheme for Prolog , 1992, J. Log. Program..

[6]  Evan Tick,et al.  Compilation Techniques for Nondeterminate Flat Concurrent Logic Programming Languages , 1991, ICLP.

[7]  Lee Naish,et al.  NUA-Prolog: An Extension to the WAM for Parallel Andorra , 1991, ICLP.

[8]  Rong Yang,et al.  Parallel Constraint Solving in Andorra-I , 1992, FGCS.

[9]  David H. D. Warren,et al.  Flexible scheduling of or-parallelism is Aurora: the Bristol scheduler , 1991 .

[10]  Rong Yang,et al.  The Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model , 1991, ICLP.

[11]  Reem Bahgat.  Non-Deterministic Concurrent Logic Programming in Pandora , 1993, World Scientific Series in Computer Science.

[12]  Inẽs de Castro Dutra,et al.  Strategies for scheduling and- and or- work in parallel logic programming systems , 1994, ICLP 1994.

[13]  Mats Carlsson,et al.  Interfacing Engines and Schedulers in OR-Parallel Prolog Systems , 1991, PARLE.

[14]  Seif Haridi,et al.  Programming Paradigms of the Andorra Kernel Language , 1991, ISLP.

[15]  Vítor Manuel de Morais Santos Costa.  Compile-time analysis for the parallel execution of logic programs in Andorra-1 , 1993 .

[16]  Rong Yang,et al.  The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model , 1991, ICLP.

[17]  Ehud Shapiro,et al.  A Decision Tree Compilation Algorithm for FCP(!, : , ?) , 1988, ICLP/SLP.

[18]  Peter Van Roy,et al.  1983-1993: The Wonder Years of Sequential Prolog Implementation , 1994, J. Log. Program..