Using Hypertree Decomposition for Parallel Constraint Solving
| dc.contributor.author | Liu, Ke | |
| dc.contributor.author | Loeffler, Sven | |
| dc.contributor.author | Hofstedt, Petra | |
| dc.contributor.editor | Eibl, Maximilian | |
| dc.contributor.editor | Gaedke, Martin | |
| dc.date.accessioned | 2017-08-28T23:48:48Z | |
| dc.date.available | 2017-08-28T23:48:48Z | |
| dc.date.issued | 2017 | |
| dc.description.abstract | Multi-core processors or many-core processors have become the standard configuration for computers nowadays. Yet, the mainstream constraint solvers have not fully utilized these available computation resources due to the intrinsic difficulty on decomposing constraint satisfaction problems (CSPs). This paper reviews the previous research in parallel constraint solving and proposes a new approach for mapping constraint networks on multi-core or many-core processors by means of hypertree decomposition. We give theoretical considerations and our plans for future research. | en |
| dc.identifier.doi | 10.18420/in2017_58 | |
| dc.identifier.isbn | 978-3-88579-669-5 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik, Bonn | |
| dc.relation.ispartof | INFORMATIK 2017 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-275 | |
| dc.subject | CSP | |
| dc.subject | constraint networks | |
| dc.subject | parallel constraint solving | |
| dc.subject | hypertree decomposition | |
| dc.title | Using Hypertree Decomposition for Parallel Constraint Solving | en |
| gi.citation.endPage | 622 | |
| gi.citation.startPage | 615 | |
| gi.conference.date | 25.-29. September 2017 | |
| gi.conference.location | Chemnitz | |
| gi.conference.sessiontitle | MOC 2017 – 9. Workshop zur Deklarativen Modellierung und effizienten Optimierung komplexer Probleme |
Dateien
Originalbündel
1 - 1 von 1