Work

Task parallelism in constraint programming: parallel consistency

Year: 2009

Type: conference-paper

Abstract: Most research in parallel constraint solving has focused on data-parallelism (DP), in which the search space is split between solvers. However, this type of parallelism is highly unsuitable for some problems. Furthermore, few search spaces can be split indefinitely. In this paper we look at task-parallelism (TP), where consistency is enforced in parallel. Our results show that TP can give a speed-up where DP gives a slow-down. Our research aim is to combine DP and TP to increase scalability.

Source: Lund University Publications (Lund University)

Authors: Carl Christian Rolf, Krzysztof Kuchciński

Language: English

Topic: Constraint Satisfaction and Optimization

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1771108514

FWCI:

Cites:

Cited by: 1

Related to: 10