The effect of synchronization of agents' execution in randomly generated networks of constraints

Authors:
Ionel Muscalagiu;Anca Iordan;Diana Maria Muscalagiu;Manuela Panoiu
Affiliations:
The "Politehnica" University of Timisoara, The Faculty of Engineering of Hunedoara, Hunedoara, Romania;The "Politehnica" University of Timisoara, The Faculty of Engineering of Hunedoara, Hunedoara, Romania;The "Politehnica" University of Timisoara, The Faculty of Engineering of Hunedoara, Hunedoara, Romania;The "Politehnica" University of Timisoara, The Faculty of Engineering of Hunedoara, Hunedoara, Romania
Venue:
ECC'11 Proceedings of the 5th European conference on European computing conference
Year:
2011

Citing 5
Cited 0

The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

IEEE Transactions on Knowledge and Data Engineering
The Effect of Nogood Learning in Distributed Constraint Satisfaction

ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Implementation and Evaluation Model for the Asynchronous Search Techniques: From a Synchronously Distributed System to an Asynchronous Distributed System

SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
The Effects of Agent Synchronization in Asynchronous Search Algorithms

KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Asynchronous backtracking without adding links: a new member in the ABT family

Artificial Intelligence - Special issue: Distributed constraint satisfaction

Quantified Score

Hi-index	0.00

Visualization

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. This article presents the opportunity for synchronizing the execution of agents in case of asynchronous search techniques. It investigates and compares the behaviors of several asynchronous techniques in two cases: agents process the received messages asynchronously (the real situation) and the synchronous case, when a synchronization of the execution of agents is done. In this paper we examine the effect of synchronization of agents' execution in random binary problem. Experiments with asynchronous search techniques are standardly conducted on randomly generated networks of constraints. Experimental results illustrate that the synchronization is more effective for several families of asynchronous techniques.