Logo des Repositoriums
 
Textdokument

Using Hypertree Decomposition for Parallel Constraint Solving

Lade...
Vorschaubild

Volltext URI

Dokumententyp

Zusatzinformation

Datum

2017

Zeitschriftentitel

ISSN der Zeitschrift

Bandtitel

Verlag

Gesellschaft für Informatik, Bonn

Zusammenfassung

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.

Beschreibung

Liu, Ke; Loeffler, Sven; Hofstedt, Petra (2017): Using Hypertree Decomposition for Parallel Constraint Solving. INFORMATIK 2017. DOI: 10.18420/in2017_58. Gesellschaft für Informatik, Bonn. PISSN: 1617-5468. ISBN: 978-3-88579-669-5. pp. 615-622. MOC 2017 – 9. Workshop zur Deklarativen Modellierung und effizienten Optimierung komplexer Probleme. Chemnitz. 25.-29. September 2017

Zitierform

Tags