Abstract
Asynchronous Backtracking (ABT) is a reference algorithm for Distributed CSP (DisCSP). In ABT, agents assign values to their variables and exchange messages asynchronously and concurrently. When an ABT agent sends a backtracking message, it continues working without waiting for an answer. In this paper, we describe a case showing that this strategy may cause some inefficiency. To overcome this, we propose ABT hyb , a new algorithm that results from adding synchronization points to ABT. We prove that ABT hyb is correct, complete and terminates. We also provide an empirical evaluation of the new algorithm on several benchmarks. Experimental results show that ABT hyb outperforms ABT.
Supported by the Spanish project TIN2006-15387-C03-01.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, A.B.: The hazards of fancy backtracking. In: Proc. of AAAI 1994, pp. 288–293 (1994)
Bessiere, C., Brito, I., Maestre, A., Meseguer, P.: The Asynchronous Backtracking without adding links: a new member in the ABT family. Artifical Intelligence 161, 7–24 (2005)
Dechter, R., Pearl, J.: Network-Based Heuristics for Constraint-Satisfaction Problems. Artificial Intelligence 34, 1–38 (1988)
Fernández, C., Béjar, R., Krishnamachari, B., Gomes, C.: Communication and Computation in Distributed CSP algorithms. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 664–679. Springer, Heidelberg (2002)
Meisels, A., Kaplansky, E., Razgon, I., Zivan, R.: Comparing Performance of Distributed Constraint Processing Algorithms. In: AAMAS Workshop on Distributed Constr. Reas., pp. 86–93 (2002)
Silaghi, M.C., Sam-Haroud, D., Faltings, B.: Asynchronous Search with Aggregations. In: Proc. of the 17th AAAI, pp. 917–922 (2000)
Yokoo, M., Durfee, E., Ishida, T., Kuwabara, K.: Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving. In: Proc. of the 12th. DCS, pp. 614–621 (1992)
Yokoo, M.: Asynchronous Weak-Commitment Search for Solving distributed Constraint Satisfaction Problems. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 88–102. Springer, Heidelberg (1995)
Yokoo, M., Durfee, E., Ishida, T., Kuwabara, K.: The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Trans. Know. and Data Engin. 10, 673–685 (1998)
Yokoo, M., Katsutoshi, H.: Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems 3, 185–207 (2000)
Zivan, R., Meisels, A.: Synchronous and Asynchronous Search on DisCSPs. In: Proceedings of EUMAS 2003 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brito, I., Meseguer, P. (2008). Improving ABT Performance by Adding Synchronization Points. In: Fages, F., Rossi, F., Soliman, S. (eds) Recent Advances in Constraints. CSCLP 2007. Lecture Notes in Computer Science(), vol 5129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89812-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-89812-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89811-5
Online ISBN: 978-3-540-89812-2
eBook Packages: Computer ScienceComputer Science (R0)