Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Asynchronous Search with Aggregations
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Optimal Distributed Arc-Consistency
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
SSDPOP: improving the privacy of DCOP with secret sharing
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Low-knowledge algorithm control
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A portfolio approach to algorithm select
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Asynchronous backtracking without adding links: a new member in the ABT family
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Asynchronous aggregation and consistency in distributed constraint satisfaction
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Concurrent search for distributed CSPs
Artificial Intelligence
SATzilla-07: the design and analysis of an algorithm portfolio for SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Algorithm portfolio design: theory vs. practice
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Randomization in constraint programming for airline planning
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
An overview of parallel SAT solving
Constraints
| Hi-index | 0.00 |
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.