Skip to main content
SpringerLink
Log in

Parallel Execution Models for Constraint Programming over Finite Domains

  • Conference paper
Principles and Practice of Declarative Programming (PPDP 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1702))

Abstract

Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value from a finite domain to each problem variable such that a set of constraints is satisfied. Arc-consistency algorithms remove inconsistent values from the set of values that can be assigned to a variable (its domain), thus reducing the search space. We have developed two parallelisation models of arc-consistency to be run on MIMD multiprocessors. Two different policies, static and dynamic, to schedule the execution of constraints have been tested. In the static scheduling policy, the set of constraints is divided into N partitions, which are executed in parallel on N processors. We discuss an important factor affecting performance, the criterion to establish the partition in order to balance the run-time workload. In the dynamic scheduling policy, any processor can execute any constraint, improving the workload balance. However, a coordination mechanism is required to ensure a sound order in the execution of constraints. Both parallelisation models have been implemented on a CRAY T3E multiprocessor with up to thirty four processors. Empirical results on speedup and behaviour of both models are reported and discussed.

Supported by project TIC98-0445-C03-02.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bessiere, D.: Arc-consistency and arc-consistency again. Artificial Intelligence Journal 65, 179–190 (1994)

    Article  Google Scholar 

  2. Baudot, B., Deville, Y.: Analysis of Distributed Arc-Consistency Algorithms. Tech. Rep. 97-07. Uni. of Louvain, Belgium (1997)

    Google Scholar 

  3. Carlson, B.: Compiling and Executing Finite Domain Constraints. PhD Thesis, Computer Science Department, Uppsala Univ. (1995)

    Google Scholar 

  4. Codognet, P., Diaz, D.: A Simple and Efficient Boolean Constraint Solver for Constraint Logic Programming. Journal of Automated Reasoning 17(1), 97–128 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dincbas, M., Van Henteryck, P., Simmons, H., Aggoun, A.: The Constraint Programming Language CHIP. In: Proceedings of the 2nd International Conference on Fifth Generation Computer Systems, pp. 249–264 (1988)

    Google Scholar 

  6. Dincbas, M., Simonis, H., Van Hentenryck, P.: Solving Large Combinatorial Problems in Logic Programming. Journal of Logic Programming 8 (1990)

    Google Scholar 

  7. ILOG: ILOG Solver 3.2 User’s Manual (1996)

    Google Scholar 

  8. Kasif, S.: On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence 45, 275–286 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kasif, S., Delcher, A.L.: Local Consistency in Parallel Constraint-Satisfaction Networks. Artificial Intelligence 69, 307–327 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  10. Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 28, 225–233 (1977)

    Google Scholar 

  11. Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artificial Intelligence 28, 225–233 (1996)

    Article  Google Scholar 

  12. Nguyen, T., Deville, Y.: A Distributed Arc-Consistency Algorithm. Science of Computer Programming 30, 227–250 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ruiz-Andino, A., Araujo, L., Ruz, J.: Parallel constraint satisfaction and optimisation. The PCSO system. Technical Report 71.98. Department of Computer Science Universidad Complutense de Madrid (1998)

    Google Scholar 

  14. Saraswat, V.A.: Concurrent Constraint Programming Languages. MIT Press, Cambridge (1993)

    Google Scholar 

  15. Van Hentenryck, P., Deville, Y., Teng, C.M.: A generic Arc-consistency Algorithm and its Specialisations. Artificial Intelligence 57, 291–321 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  16. Hentenryck, P.V., Saraswat, V.A., Deville, Y.: Constraint Logic Programming over Finite Domains: the Design, Implementation and Applications of cc(FD). Tech. Rep., Computer Science Dept., Brown University (1992)

    Google Scholar 

  17. Wallace, M.: Constraints in Planing, Scheduling and Placement Problems. Constraint Programming. Springer, Heidelberg (1994)

    Google Scholar 

  18. Waltz, D.: Generating semantic descriptions for drawings of scenes with shadows. Technical Report AI271, MIT, Cambridge, MA (1972)

    Google Scholar 

  19. Yokoo, M.: Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. Principles and Practice of Constraint Programming, 88–102 (1995)

    Google Scholar 

  20. Zhang, Y., Mackworth, A.K.: Parallel and Distributed Finite Constraint Satisfaction: Complexity, Algorithms and Experiments. Parallel Processing for Artificial Intelligence. Elsevier, Amsterdam (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University Complutense of Madrid,  

    Alvaro Ruiz-Andino, Lourdes Araujo, Fernando Sáenz & José Ruz

Authors
  1. Alvaro Ruiz-Andino
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lourdes Araujo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fernando Sáenz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. José Ruz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Digital Technology Center and Dept of CS, University of Minnesota,  

    Gopalan Nadathur

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ruiz-Andino, A., Araujo, L., Sáenz, F., Ruz, J. (1999). Parallel Execution Models for Constraint Programming over Finite Domains. In: Nadathur, G. (eds) Principles and Practice of Declarative Programming. PPDP 1999. Lecture Notes in Computer Science, vol 1702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10704567_8

Download citation

  • DOI: https://doi.org/10.1007/10704567_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66540-3

  • Online ISBN: 978-3-540-48164-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation