Abstract
We present a parallel solver for numerical constraint satisfaction problems (NCSPs) that can scale on a number of cores. Our proposed method runs worker solvers on the available cores and simultaneously the workers cooperate for the search space distribution and balancing. In the experiments, we attained up to 119-fold speedup using 256 cores of a parallel computer. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Ishii, D., Yoshizoe, K., & Suzumura, T. (2014). Scalable parallel numerical CSP solver. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8656 LNCS, pp. 398–406). Springer Verlag. https://doi.org/10.1007/978-3-319-10428-7_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
