COMPILATION OF CONSTRAINT PROGRAMS WITH NONCYCLIC AND CYCLIC DEPENDENCIES TO PROCEDURAL PARALLEL PROGRAMS

This paper reports on a compiler for translation of constraint specifi cations into procedural parallel programs. A constraint program in our system our consists of a set of constraints and an input set containi ng a subset of the variables appearing in the constraints. The compile r described in this paper successfully compiles a substantially larger class of constraint specifications to deficient programs than did its predecessors. In particular the compiler has been extended to generat e processor and memory efficient programs for cyclic constraints which can be resolved by computational relaxation methods. The paper first details the basic compilation process for noncyclic constraints. It th en describes the additional steps in the compilation process which ena ble resolution of cyclic constraints to iterative computational proces ses and illustrates the process using derivation of a parallel program for solution of the Laplace equation as the example.