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 speedup over the fastest central arc-consistency algorithms. Secondly, achieve the fast processing of distributed constraint satisfaction problems (DCSP). Experimental results use classical benchmarks and large hard randoms problems. These results allow us to give the first characterization of the hardest instances of this distributed computation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Simonis, H.: A problem classification scheme for finite domain constraint solving. In: Proc. of the CP 1996 workshop on Constraint Programming Applications: An Inventory and Taxonomy, pp. 1–26 (1996)
Sabin, D., Freuder, E.C.: Contradicting conventional wisdom in constraint satis-faction. In: ECAI 1994, pp. 125–129 (1994)
Yokoo, M., Hirayama, K.: Distributed breakout algorithm for solving distributed constraint satisfaction problems. In: ICMAS, pp. 401–408 (1996)
Hamadi, Y., Bessière, C., Quinqueton, J.: Backtracking in distributed constraint networks. In: ECAI 1998, pp. 219–223 (1998)
Cooper, P.R., Swain, M.J.: Arc consistency: Parallelism and domain dependence. AI 58, 207–235 (1992)
Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artificial Intelli-gence 28, 225–233 (1986)
Nguyen, T., Deville, Y.: A distributed arc-consistency algorithm. In: First Int. Workshop on concurrent Constraint Satisfaction (1995)
Kasif, S.: On the parallel complexity of discrete relaxation in constraint satisfaction networks. AI 45, 275–286 (1990)
Culler, D.E., Liu, L.T., Martin, R.P., Yoshikawa, C.: LogP performance assessment of fast network interfaces. IEEE Micro (1996)
Samal, A., Henderson, T.: Parallel consistent labeling algorithms. Int. J. Parallel Program. 16, 341–364 (1987)
Prosser, P., Conway, C., Muller, C.: A distributed constraint maintenance system. In: Proc. of the 12th Int. Conf. on AI., pp. 221–231 (1992)
Naor, M., Stockmeyer, L.: What can be computed locally? SIAM J. Comput. 24, 1259–1277 (1995)
Bessière, C.: Arc-consistency and arc-consistency again. Artificial Intelligence 65, 179–190 (1994)
Chandy, K.M., Lamport, L.: Distributed snapshots: Determining global states of distributed systems. In: TOCS vol. 3, pp. 63–75 (1985)
Hamadi, Y.: Traitement des problèmes de satisfaction de contraintes distribués. PhD thesis, Université Montpellier II (1999) (in french)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hamadi, Y. (1999). Optimal Distributed Arc-Consistency. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive