Compilation of Constraint Programs with Noncyclic and Cyclic Dependencies to Procedural Parallel Programs

  • Authors:
  • Ajita John;James C. Browne

  • Affiliations:
  • -;-

  • Venue:
  • International Journal of Parallel Programming
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper reports on a compiler for translation of constraint specifications into procedural parallel programs. A constraint program in our system consists of a set of constraints and an input set containing a subset of the variables appearing in the constraints. The compiler described in this paper successfully compiles a substantially larger class of constraint specifications to efficient programs than did its predecessors. In particular the compiler has been extended to generate 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 then describes the additional steps in the compilation process which enable resolution of cyclic constraints to iterative computational processes and illustrates the process using derivation of a parallel program for solution of the Laplace equation as the example.