Abstract
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.
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
Bessiere, C., Brito, I., Maestre, A., Meseguer, P.: Asynchronous Backtracking without Adding Links: A New Member in the ABT Family. A.I. 161, 7–24 (2005)
Hirayama, K., Yokoo, M.: The Effect of Nogood Learning in Distributed Constraint Satisfaction. In: Proceedings of the 20th IEEE International Conference on Distributed Computing Systems, pp. 169–177 (2000)
Muscalagiu, I., Jiang, H., Popa, H.E.: Implementation and evaluation model for the asynchronous techniques: from a synchronously distributed system to a asynchronous distributed system. In: Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2006), Timisoara, Romania, pp. 209–216. IEEE Computer Society Press, Los Alamitos (2006)
Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: The distributed constraint satisfaction problem: formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering 10(5), 673–685 (1980)
Wilensky, U.: NetLogo itself:NetLogo. Center for Connected Learning and Computer-Based Modeling, Evanston (1999), Available: http://ccl.northwestern.edu/netlogo/
MAS Netlogo Models-a. Available: http://jmvidal.cse.sc.edu/netlogomas/
MAS Netlogo Models-b. Available: http://ccl.northwestern.edu/netlogo/models/community
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muscalagiu, I., Vidal, J.M., Cretu, V., Emil, P.H., Panoiu, M. (2007). The Effects of Agent Synchronization in Asynchronous Search Algorithms. In: Nguyen, N.T., Grzech, A., Howlett, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2007. Lecture Notes in Computer Science(), vol 4496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72830-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-72830-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72829-0
Online ISBN: 978-3-540-72830-6
eBook Packages: Computer ScienceComputer Science (R0)