Serveur d'exploration sur Mozart

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Parallelizing Constraint Programs Transparently

Identifieur interne : 001457 ( Main/Exploration ); précédent : 001456; suivant : 001458

Parallelizing Constraint Programs Transparently

Auteurs : Laurent Michel [États-Unis] ; Andrew See [États-Unis] ; Pascal Van Hentenryck [États-Unis]

Source :

RBID : ISTEX:678D7D74E22E7F8E37928384CA8AFF5445C7918E

Abstract

Abstract: The availability of commodity multi-core and multi-processor machines and the inherent parallelism in constraint programming search offer significant opportunities for constraint programming. They also present a fundamental challenge: how to exploit parallelism transparently to speed up constraint programs. This paper shows how to parallelize constraint programs transparently without changes to the code. The main technical idea consists of automatically lifting a sequential exploration strategy into its parallel counterpart, allowing workers to share and steal subproblems. Experimental results show that the parallel implementation may produces significant speedups on multi-core machines.


Url:
DOI: 10.1007/978-3-540-74970-7_37


Affiliations:


Links toward previous steps (curation, corpus...)


Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Parallelizing Constraint Programs Transparently</title>
<author>
<name sortKey="Michel, Laurent" sort="Michel, Laurent" uniqKey="Michel L" first="Laurent" last="Michel">Laurent Michel</name>
</author>
<author>
<name sortKey="See, Andrew" sort="See, Andrew" uniqKey="See A" first="Andrew" last="See">Andrew See</name>
</author>
<author>
<name sortKey="Van Hentenryck, Pascal" sort="Van Hentenryck, Pascal" uniqKey="Van Hentenryck P" first="Pascal" last="Van Hentenryck">Pascal Van Hentenryck</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:678D7D74E22E7F8E37928384CA8AFF5445C7918E</idno>
<date when="2007" year="2007">2007</date>
<idno type="doi">10.1007/978-3-540-74970-7_37</idno>
<idno type="url">https://api.istex.fr/document/678D7D74E22E7F8E37928384CA8AFF5445C7918E/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000B60</idno>
<idno type="wicri:Area/Istex/Curation">000945</idno>
<idno type="wicri:Area/Istex/Checkpoint">000E57</idno>
<idno type="wicri:doubleKey">0302-9743:2007:Michel L:parallelizing:constraint:programs</idno>
<idno type="wicri:Area/Main/Merge">001474</idno>
<idno type="wicri:Area/Main/Curation">001457</idno>
<idno type="wicri:Area/Main/Exploration">001457</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">Parallelizing Constraint Programs Transparently</title>
<author>
<name sortKey="Michel, Laurent" sort="Michel, Laurent" uniqKey="Michel L" first="Laurent" last="Michel">Laurent Michel</name>
<affiliation wicri:level="2">
<country xml:lang="fr">États-Unis</country>
<placeName>
<region type="state">Connecticut</region>
</placeName>
<wicri:cityArea>University of Connecticut, Storrs</wicri:cityArea>
</affiliation>
</author>
<author>
<name sortKey="See, Andrew" sort="See, Andrew" uniqKey="See A" first="Andrew" last="See">Andrew See</name>
<affiliation wicri:level="2">
<country xml:lang="fr">États-Unis</country>
<placeName>
<region type="state">Connecticut</region>
</placeName>
<wicri:cityArea>University of Connecticut, Storrs</wicri:cityArea>
</affiliation>
</author>
<author>
<name sortKey="Van Hentenryck, Pascal" sort="Van Hentenryck, Pascal" uniqKey="Van Hentenryck P" first="Pascal" last="Van Hentenryck">Pascal Van Hentenryck</name>
<affiliation wicri:level="2">
<country xml:lang="fr">États-Unis</country>
<placeName>
<region type="state">Rhode Island</region>
</placeName>
<wicri:cityArea>Brown University, Box 1910, Providence</wicri:cityArea>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="s">Lecture Notes in Computer Science</title>
<imprint>
<date>2007</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
</series>
<idno type="istex">678D7D74E22E7F8E37928384CA8AFF5445C7918E</idno>
<idno type="DOI">10.1007/978-3-540-74970-7_37</idno>
<idno type="ChapterID">Chap37</idno>
<idno type="ChapterID">37</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass></textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Abstract: The availability of commodity multi-core and multi-processor machines and the inherent parallelism in constraint programming search offer significant opportunities for constraint programming. They also present a fundamental challenge: how to exploit parallelism transparently to speed up constraint programs. This paper shows how to parallelize constraint programs transparently without changes to the code. The main technical idea consists of automatically lifting a sequential exploration strategy into its parallel counterpart, allowing workers to share and steal subproblems. Experimental results show that the parallel implementation may produces significant speedups on multi-core machines.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>États-Unis</li>
</country>
<region>
<li>Connecticut</li>
<li>Rhode Island</li>
</region>
</list>
<tree>
<country name="États-Unis">
<region name="Connecticut">
<name sortKey="Michel, Laurent" sort="Michel, Laurent" uniqKey="Michel L" first="Laurent" last="Michel">Laurent Michel</name>
</region>
<name sortKey="See, Andrew" sort="See, Andrew" uniqKey="See A" first="Andrew" last="See">Andrew See</name>
<name sortKey="Van Hentenryck, Pascal" sort="Van Hentenryck, Pascal" uniqKey="Van Hentenryck P" first="Pascal" last="Van Hentenryck">Pascal Van Hentenryck</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/corpus/MozartV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001457 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Musique
   |area=    MozartV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:678D7D74E22E7F8E37928384CA8AFF5445C7918E
   |texte=   Parallelizing Constraint Programs Transparently
}}

Wicri

This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Sun Jul 30 12:17:35 2017