Parallel consistency in constraint programming
Författare
Redaktör
- Hamid R Arabnia
Summary, in English
Automatic parallelization in constraint programming has previously focused on data parallelism. In this paper, we look at task parallelism, specifically the case of parallel consistency. We have developed two models of parallel consistency, one that shares intermediate results and one that does not. We evaluate which model is better in our experiments. Our results show that parallelizing consistency can provide the programmer with a robust scalability for regular problems with global constraints.
Avdelning/ar
Publiceringsår
2009
Språk
Engelska
Sidor
638-644
Publikation/Tidskrift/Serie
Proceedings of the 2009 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2009 : [at] WORLDCOMP'09, July 13 - 16, 2009, Las Vegas Nevada, USA
Dokumenttyp
Konferensbidrag
Förlag
CSREA Press
Ämne
- Computer Science
Conference name
Third International Workshop on Scalable Distributed and Multi/Many-core Applications and Systems (SDMAS'09) within PDPTA'09
Conference date
2009-07-13 - 2009-07-16
Conference place
Las Vegas, United States
Status
Published
Forskningsgrupp
- ESDLAB
ISBN/ISSN/Övrigt
- ISBN: 1601321236