Optimal Distributed Arc-Consistency | Constraints Skip to main content
Springer Nature Link
Log in

Optimal Distributed Arc-Consistency

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of message passing operations. This algorithm can firstly, give speed-up over the fastest central arc-consistency algorithms; secondly, achieve the fast processing of distributed constraint satisfaction problems (DCSP). Experimental results include classical benchmark and large hard randoms problems. These results allow us to show that the phase transition phenomenon of distributed arc-consistency is closely related to the granularity of the distributed system. The consequences of this analysis are showed to be very important for the future of distributed constraint satisfaction.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Bessière, C. (1994). Arc-consistency and arc-consistency again. Artificial Intelligence, 65(1): 179–190.

    Google Scholar 

  2. Chandy, K. M., & Lamport, L. (1985). Distributed snapshots: determining global states of distributed systems. TOCS, 3(1): 63–75.

    Google Scholar 

  3. Clearwater, S. H., & Hogg, T. (1994). Exploiting problem structure in genetic algorithms. In Proceedings of AAAI, pages 1310–1315.

  4. Cooper, P. R., & Swain, M. J. (1992). Arc consistency: parallelism and domain dependence. AI, 58(1–3): 207–235.

    Google Scholar 

  5. Culler, D. E., Liu, L. T., Martin, R. P., & Yoshikawa, C. (1996). LogP performance assessment of fast network interfaces. IEEE Micro.

  6. Gent, I., Intyre, E. M., Prosser, P., & Walsh, T. (1997). The constrainedness of arc consistency. In Principles and Practice of Constraint Programming, pages 327–340.

  7. Hamadi, Y. (1999). Traitement des problèmes de satisfaction de contraintes distribués. Ph.D. thesis, Université Montpellier II (in french).

  8. Hamadi, Y. (2001a). Conflicting agents in distributed search. Technical Report HPL-2001-222, HP Labs.

  9. Hamadi, Y. (2001b). Interleaved backtracking in distributed constraint networks. In IEEE, ed., 13th International Conference on Tools with Artificial Intelligence, to appear.

  10. Hamadi, Y., Bessière, C., & Quinqueton, J. (1998). Backtracking in distributed constraint networks. In ECAI, pages 219–223.

  11. Hamadi, Y., & Merceron, D. (1997). Reconfigurable architectures: a new vision for optimization problems. In Smolka, G., ed., Proceedings of the 3rd International Conference on Principle and Practice of Constraint Programming CP97, Vol. 1330 of LNCS, Linz, Austria, pages 209–221.

    Google Scholar 

  12. Hogg, T. (1995). Exploiting problem structure as a search heuristic. Unpublished.

  13. Kasif, S. (1990). On the parallel complexity of discrete relaxation in constraint satisfaction networks. AI, 45(3): 275–286.

    Google Scholar 

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

    Google Scholar 

  15. MPIF. (1994). MPI: a message-passing interface standard. International Journal of Supercomputer Applications, 8(3/4).

  16. Naor, M., & Stockmeyer, L. (1995). What can be computed locally? SIAM Journal of Computing, 24(6): 1259–1277.

    Google Scholar 

  17. Nguyen, T., & Deville, Y. (1995). A distributed arc-consistency algorithm. In First International Workshop on Concurrent Constraint Satisfaction.

  18. Prosser, P., Conway, C., & Muller, C. (1992). A distributed constraint maintenance system. In Proceedings of the 12th International Conference on AI, pages 221–231.

  19. Sabin, D., & Freuder, E. C. (1994). Contradicting conventional wisdom in constraint satisfaction. In ECAI, pages 125–129.

  20. Samal, A., & Henderson, T. (1987). Parallel consistent labeling algorithms. International Journal of Parallel Program, 16: 341–364.

    Google Scholar 

  21. Simonis, H. (1996). A problem classification scheme for finite domain constraint solving. In Proceedings of the CP'96 Workshop on Constraint Programming Applications: An Inventory and Taxonomy, pages 1–26.

  22. Yokoo, M., & Hirayama, K. (1996). Distributed breakout algorithm for solving distributed constraint satisfaction problems. In ICMAS, pages 401–408.

Download references

Author information

Authors and Affiliations

  1. Thales Research & Technology, Domaine de Corbeville, 91404, Orsay, Cedex, France

    Youssef Hamadi

Authors
  1. Youssef Hamadi
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hamadi, Y. Optimal Distributed Arc-Consistency. Constraints 7, 367–385 (2002). https://doi.org/10.1023/A:1020594125144

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020594125144