Improving ABT Performance by Adding Synchronization Points

  • Ismel Brito
  • Pedro Meseguer
Conference paper

DOI: 10.1007/978-3-540-89812-2_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5129)
Cite this paper as:
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

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 ABThyb, a new algorithm that results from adding synchronization points to ABT. We prove that ABThyb is correct, complete and terminates. We also provide an empirical evaluation of the new algorithm on several benchmarks. Experimental results show that ABThyb outperforms ABT.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Ismel Brito
    • 1
  • Pedro Meseguer
    • 1
  1. 1.IIIA, Institut d’Investigació en Intel.ligència ArtificialCSIC, Consejo Superior de Investigaciones CientíficasBellaterraSpain

Personalised recommendations