Boosting distributed constraint satisfaction

被引:3
|
作者
Hamadi, Youssef [1 ,2 ]
Ringwelski, Georg [3 ]
机构
[1] Microsoft Res, Cambridge CB3 0FB, England
[2] LIX Ecole Polytech, F-91128 Palaiseau, France
[3] Hsch Zittau Gorlitz, Fachbereich Informat, D-02826 Gorlitz, Germany
关键词
Search; Distributed search; Heavy-tail phenomenon;
D O I
10.1007/s10732-010-9134-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give hints to each other and compete for being the first to finish and deliver the solution. In this paper we present a new generic framework for the application of algorithms for distributed constraint satisfaction that makes use of both cooperation and competition. This framework improves the performance of two different standard algorithms by one order of magnitude. Furthermore, it can reduce the risk of poor performance by up to three orders of magnitude diminishing the heavy-tailed behaviour of complete distributed search. Moreover it greatly reduces the classical idleness flaw usually observed in distributed tree-based searches. We expect our new methods to be similarly beneficial for any tree-based distributed search and describe ways on how to incorporate them. Remarkably, our ideas while applied to a parallel SAT setting were able to beat divide-and-conquers approaches, and win the gold medal of the parallel track of the 2008 SAT-Race.
引用
收藏
页码:251 / 279
页数:29
相关论文
共 50 条
  • [21] Asynchronous aggregation and consistency in distributed constraint satisfaction
    Silaghi, MC
    Faltings, B
    ARTIFICIAL INTELLIGENCE, 2005, 161 (1-2) : 25 - 53
  • [22] Constraint satisfaction in distributed concurrent logic programming
    Leung, HF
    Clark, KL
    JOURNAL OF SYMBOLIC COMPUTATION, 1996, 21 (4-6) : 699 - 714
  • [23] Distributed constraint satisfaction and optimization with privacy enforcement
    Silaghi, MC
    Mitra, D
    IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON INTELLIGENT AGENT TECHNOLOGY, PROCEEDINGS, 2004, : 531 - 535
  • [24] Distributed constraint satisfaction with partially known constraints
    Ismel Brito
    Amnon Meisels
    Pedro Meseguer
    Roie Zivan
    Constraints, 2009, 14 : 199 - 234
  • [25] The distributed constraint satisfaction problem: Formalization and algorithms
    Yokoo, M
    Durfee, EH
    Ishida, T
    Kuwabara, K
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1998, 10 (05) : 673 - 685
  • [26] Introduction: Special issue on distributed constraint satisfaction
    Faltings, B
    Yokoo, M
    ARTIFICIAL INTELLIGENCE, 2005, 161 (1-2) : 1 - 5
  • [27] Distributed constraint satisfaction with partially known constraints
    Brito, Ismel
    Meisels, Amnon
    Meseguer, Pedro
    Zivan, Roie
    CONSTRAINTS, 2009, 14 (02) : 199 - 234
  • [28] Self-stabilizing distributed constraint satisfaction
    Collin, Z
    Dechter, R
    Katz, S
    CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE, 1999, (10): : 1 - 38
  • [29] On communication in solving Distributed Constraint Satisfaction Problems
    Jung, H
    Tambe, M
    MULTI-AGENT SYSTEMS AND APPLICATIONS IV, PROCEEDINGS, 2005, 3690 : 418 - 429
  • [30] Distributed constraint satisfaction for urban traffic signal control
    Mizuno, Kazunori
    Nishihara, Seiichi
    KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, 2007, 4798 : 73 - +