Abstract
The author describes a constraint-based language, Consul, that can exploit implicit parallelism. The results are reported of the first stage of the Consul project, which was designed to produce empirical evidence for or against Consul as a parallel language. To produce the evidence, a parallel-execution model is developed that is based on local propagation and uses some important generalizations of earlier work on local propagation. A set of tools was developed to measure the execution of several Consul programs. The results suggest that considerable parallelism is available in Consul programs and that local propagation is a viable mechanism for solving most real-world constraints. The Consul programs demonstrate that programmers can control performance through the proper choice of algorithms, despite Consul's declarative nature.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
