Parallel consistency in constraint programming

Carl Christian Rolf; Krzysztof Kuchcinski

Parallel consistency in constraint programming

Carl Christian Rolf, Krzysztof Kuchcinski

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

Abstract

Program parallelization becomes increasingly important when new multi-core architectures provide ways to improve performance. One of the greatest challenges of this development lies in programming parallel applications. Using declarative languages, such as constraint programming, can make the transition to parallelism easier by hiding the parallelization details in a framework.

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.

Original language	English
Title of host publication	Proceedings of the 2009 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2009
Subtitle of host publication	[at] WORLDCOMP'09, July 13 - 16, 2009, Las Vegas Nevada, USA
Editors	Hamid R Arabnia
Publisher	CSREA Press
Pages	638-644
Number of pages	7
ISBN (Print)	1601321236
Publication status	Published - 2009
Event	Third International Workshop on Scalable Distributed and Multi/Many-core Applications and Systems (SDMAS'09) within PDPTA'09 - Las Vegas, United States Duration: 2009 Jul 13 → 2009 Jul 16

Conference

Conference	Third International Workshop on Scalable Distributed and Multi/Many-core Applications and Systems (SDMAS'09) within PDPTA'09
Country/Territory	United States
City	Las Vegas
Period	2009/07/13 → 2009/07/16

Subject classification (UKÄ)

Computer Sciences

Cite this

@inproceedings{af0ea1937b5e477e8d0bb4b63e93098c,

title = "Parallel consistency in constraint programming",

abstract = "Program parallelization becomes increasingly important when new multi-core architectures provide ways to improve performance. One of the greatest challenges of this development lies in programming parallel applications. Using declarative languages, such as constraint programming, can make the transition to parallelism easier by hiding the parallelization details in a framework. 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.",

author = "Rolf, {Carl Christian} and Krzysztof Kuchcinski",

year = "2009",

language = "English",

isbn = "1601321236",

pages = "638--644",

editor = "Arabnia, {Hamid R}",

booktitle = "Proceedings of the 2009 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2009",

publisher = "CSREA Press",

address = "United States",

note = "Third International Workshop on Scalable Distributed and Multi/Many-core Applications and Systems (SDMAS'09) within PDPTA'09 ; Conference date: 13-07-2009 Through 16-07-2009",

}

Rolf, CC & Kuchcinski, K 2009, Parallel consistency in constraint programming. in HR Arabnia (ed.), 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. CSREA Press, pp. 638-644, Third International Workshop on Scalable Distributed and Multi/Many-core Applications and Systems (SDMAS'09) within PDPTA'09, Las Vegas, United States, 2009/07/13.

Parallel consistency in constraint programming. / Rolf, Carl Christian; Kuchcinski, Krzysztof.
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. ed. / Hamid R Arabnia. CSREA Press, 2009. p. 638-644.

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

TY - GEN

T1 - Parallel consistency in constraint programming

AU - Rolf, Carl Christian

AU - Kuchcinski, Krzysztof

PY - 2009

Y1 - 2009

N2 - Program parallelization becomes increasingly important when new multi-core architectures provide ways to improve performance. One of the greatest challenges of this development lies in programming parallel applications. Using declarative languages, such as constraint programming, can make the transition to parallelism easier by hiding the parallelization details in a framework. 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.

AB - Program parallelization becomes increasingly important when new multi-core architectures provide ways to improve performance. One of the greatest challenges of this development lies in programming parallel applications. Using declarative languages, such as constraint programming, can make the transition to parallelism easier by hiding the parallelization details in a framework. 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.

M3 - Paper in conference proceeding

SN - 1601321236

SP - 638

EP - 644

BT - Proceedings of the 2009 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2009

A2 - Arabnia, Hamid R

PB - CSREA Press

T2 - Third International Workshop on Scalable Distributed and Multi/Many-core Applications and Systems (SDMAS'09) within PDPTA'09

Y2 - 13 July 2009 through 16 July 2009

ER -

Parallel consistency in constraint programming

Abstract

Conference

Subject classification (UKÄ)

Fingerprint

Cite this