Experiments with Massively Parallel Constraint Solving
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 443-447.
Abstract
The computing industry is currently facing a major architectural shift. Extra computing power is not coming anymore from higher processor frequencies, but from a growing number of computing cores and processors. For AI, and constraint solving in particular, this raises the question of how to scale current solving techniques to massively parallel architectures. While prior work focusses mostly on small scale parallel constraint solving, we conduct the first study on scalability of constraint solving on 100 processors and beyond in this paper. We propose techniques that are simple to apply and show empirically that they scale surprisingly well. These techniques establish a performance baseline for parallel constraint solving technologies against which more sophisticated parallel algorithms need to compete in the future.Lucas Bordeaux, Youssef Hamadi, Horst Samulowitz
@inproceedings{ijcai2009p81,
title = {Experiments with Massively Parallel Constraint Solving},
author = {Bordeaux, Lucas and Hamadi, Youssef and Samulowitz, Horst},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {443--447},
year = {2009},
url = {https://ijcai.org/proceedings/2009/81},
}
TY - CPAPER TI - Experiments with Massively Parallel Constraint Solving AU - Bordeaux, Lucas AU - Hamadi, Youssef AU - Samulowitz, Horst T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 443 EP - 447 UR - https://ijcai.org/proceedings/2009/81 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: