The asynchronous searching techniques are characterized by the fact that each agent instantiates its variables in a concurrent way. Then, it sends the values of its variables to other agents directly connected to it by using messages. These asynchronous techniques have different behaviors in case of delays in sending messages. This article depicts the opportunity for synchronizing agents' execution in case of asynchronous techniques. It investigates and compares the behaviors of several asynchronous techniques in two cases: agents process the received messages asynchronously (the real situation from practice) and the synchronous case, when a synchronization of the agents' execution is done i.e. the agents perform a computing cycle in which they process a message from a message queue. After that, the synchronization is done by waiting for the other agents to finalize the processing of their messages. The experiments show that the synchronization of the agents' execution leads to lower costs in searching for solution. A solution for synchronizing the agents' execution is proposed for the analyzed asynchronous techniques.
[1]
Hong Jiang,et al.
Implementation and Evaluation Model for the Asynchronous Search Techniques: From a Synchronously Distributed System to an Asynchronous Distributed System
,
2006,
2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.
[2]
Makoto Yokoo,et al.
The effect of nogood learning in distributed constraint satisfaction
,
2000,
Proceedings 20th IEEE International Conference on Distributed Computing Systems.
[3]
Makoto Yokoo,et al.
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
,
1998,
IEEE Trans. Knowl. Data Eng..
[4]
Christian Bessiere,et al.
Asynchronous backtracking without adding links: a new member in the ABT family
,
2005,
Artif. Intell..