Parallel Execution Models for Constraint Programming over Finite Domains

1999 ◽  
pp. 134-151 ◽  
Author(s):  
Alvaro Ruiz-Andino ◽  
Lourdes Araujo ◽  
Fernando Sáenz ◽  
José Ruz
Keyword(s):  
Constraint Programming ◽  
Parallel Execution ◽  
Finite Domains ◽  
Execution Models ◽  
Parallel Execution Models

A HYBRID SHARED MEMORY EXECUTION MODEL FOR A DATA PARALLEL LANGUAGE WITH I/O

2008 ◽  
Vol 18 (01) ◽  
pp. 23-37 ◽  
Author(s):  
CLEMENS GRELCK ◽  
STEFFEN KUTHE ◽  
SVEN-BODO SCHOLZ
Keyword(s):  
Program Analysis ◽  
Flow Characteristics ◽  
Parallel Execution ◽  
Parallel Language ◽  
Data Parallel ◽  
Execution Model ◽  
Execution Mode ◽  
Parallel Code ◽  
Execution Models ◽  
Compilation Techniques

We propose a novel execution model for the implicitly parallel execution of data parallel programs in the presence of general I/O operations. This model is called hybrid because it combines the advantages of the standard execution models fork/join and SPMD. Based on program analysis the hybrid model adapts itself to one or the other on the granularity of individual instructions. We outline compilation techniques that systematically derive the organization of parallel code from data flow characteristics aiming at the reduction of execution mode switches in general and synchronization/communication requirements in particular. Experiments based on a prototype implementation show the effectiveness of the hybrid execution model for reducing parallel overhead.

scholarly journals Improved Filtering for the Euclidean Traveling Salesperson Problem in CLP(FD)

2020 ◽  
Vol 34 (02) ◽  
pp. 1412-1419
Author(s):  
Alessandro Bertagnon ◽  
Marco Gavanelli
Keyword(s):  
Cost Function ◽  
Computer Science ◽  
Constraint Programming ◽  
Euclidean Distance ◽  
Distance Matrix ◽  
Constraint Propagation ◽  
Geometric Information ◽  
Traveling Salesperson Problem ◽  
Finite Domains ◽  
Special Case

The Traveling Salesperson Problem (TSP) is one of the best-known problems in computer science. The Euclidean TSP is a special case in which each node is identified by its coordinates on the plane and the Euclidean distance is used as cost function. Many works in the Constraint Programming (CP) literature addressed the TSP, and use as benchmark Euclidean instances; however the usual approach is to build a distance matrix from the points coordinates, and then address the problem as a TSP, disregarding the information carried by the points coordinates for constraint propagation. In this work, we propose to use geometric information, present in Euclidean TSP instances, to improve the filtering power. In order to have a declarative approach, we implemented the filtering algorithms in Constraint Logic Programming on Finite Domains (CLP(FD)).

Sign in / Sign up

Export Citation Format

Share Document