<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-00935890</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-24T03:48:05+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Combining multi-core and GPU computing for solving combinatorial optimization problems.</title>
            <author role="aut">
              <persName>
                <forename type="first">Imen</forename>
                <surname>Chakroun</surname>
              </persName>
              <email type="md5">646761ec8324f25de55e786815c19a97</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="numeric">913842</idno>
              <idno type="halauthorid" notation="string">596348-913842</idno>
              <affiliation ref="#struct-56013"/>
              <affiliation ref="#struct-2546"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">N.</forename>
                <surname>Melab</surname>
              </persName>
              <idno type="halauthorid">252404-0</idno>
              <orgName ref="#struct-0"/>
              <affiliation ref="#struct-2546"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Mohand-Said</forename>
                <surname>Mezmaz</surname>
              </persName>
              <idno type="halauthorid">723361-0</idno>
              <orgName ref="#struct-160918"/>
              <affiliation ref="#struct-102923"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Daniel</forename>
                <surname>Tuyttens</surname>
              </persName>
              <email type="md5">f776785256d91e89b4309e94258b7192</email>
              <email type="domain">umons.ac.be</email>
              <idno type="idhal" notation="numeric">913609</idno>
              <idno type="halauthorid" notation="string">594156-913609</idno>
              <orgName ref="#struct-160918"/>
              <affiliation ref="#struct-102923"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Imen</forename>
                <surname>Chakroun</surname>
              </persName>
              <email type="md5">646761ec8324f25de55e786815c19a97</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2014-01-24 11:37:04</date>
              <date type="whenModified">2025-09-01 11:40:02</date>
              <date type="whenReleased">2014-01-24 11:37:04</date>
              <date type="whenProduced">2013-12</date>
              <ref type="externalLink" target="https://api.istex.fr/ark:/67375/6H6-V6T2ZSQ2-M/fulltext.pdf?sid=hal"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="166536">
                <persName>
                  <forename>Imen</forename>
                  <surname>Chakroun</surname>
                </persName>
                <email type="md5">646761ec8324f25de55e786815c19a97</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00935890</idno>
            <idno type="halUri">https://inria.hal.science/hal-00935890</idno>
            <idno type="halBibtex">chakroun:hal-00935890</idno>
            <idno type="halRefHtml">&lt;i&gt;Journal of Parallel and Distributed Computing&lt;/i&gt;, 2013, 73 (12), pp.1563-1577. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.jpdc.2013.07.023"&gt;&amp;#x27E8;10.1016/j.jpdc.2013.07.023&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Journal of Parallel and Distributed Computing, 2013, 73 (12), pp.1563-1577. &amp;#x27E8;10.1016/j.jpdc.2013.07.023&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-LILLE3">Université de Lille Sciences humaines et sociales</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-LILLE">INRIA Lille - Nord Europe</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="CRISTAL">Centre de Recherche en Informatique, Signal et Automatique de Lille (CRISTAL)</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="CRISTAL-DOLPHIN" corresp="CRISTAL">CRISTAL-DOLPHIN</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Combining multi-core and GPU computing for solving combinatorial optimization problems.</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Imen</forename>
                    <surname>Chakroun</surname>
                  </persName>
                  <email type="md5">646761ec8324f25de55e786815c19a97</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="numeric">913842</idno>
                  <idno type="halauthorid" notation="string">596348-913842</idno>
                  <affiliation ref="#struct-56013"/>
                  <affiliation ref="#struct-2546"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">N.</forename>
                    <surname>Melab</surname>
                  </persName>
                  <idno type="halauthorid">252404-0</idno>
                  <orgName ref="#struct-0"/>
                  <affiliation ref="#struct-2546"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Mohand-Said</forename>
                    <surname>Mezmaz</surname>
                  </persName>
                  <idno type="halauthorid">723361-0</idno>
                  <orgName ref="#struct-160918"/>
                  <affiliation ref="#struct-102923"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Daniel</forename>
                    <surname>Tuyttens</surname>
                  </persName>
                  <email type="md5">f776785256d91e89b4309e94258b7192</email>
                  <email type="domain">umons.ac.be</email>
                  <idno type="idhal" notation="numeric">913609</idno>
                  <idno type="halauthorid" notation="string">594156-913609</idno>
                  <orgName ref="#struct-160918"/>
                  <affiliation ref="#struct-102923"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">15958</idno>
                <idno type="issn">0743-7315</idno>
                <idno type="eissn">1096-0848</idno>
                <title level="j">Journal of Parallel and Distributed Computing</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">73</biblScope>
                  <biblScope unit="issue">12</biblScope>
                  <biblScope unit="pp">1563-1577</biblScope>
                  <date type="datePub">2013-12</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/j.jpdc.2013.07.023</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Flowshop Scheduling Problem.</term>
                <term xml:lang="en">Parallel branch-and-bound</term>
                <term xml:lang="en">GPU accelerators</term>
                <term xml:lang="en">Multi-core computing</term>
                <term xml:lang="en">Flowshop Scheduling Problem</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In this paper, we revisit the design and implementation of Branch-and-Bound (B&amp;B) algorithms for solving large combinatorial optimization problems on GPU-enhanced multi-core machines. B&amp;B is a tree-based optimization method that uses four operators (selection, branching, bounding and pruning) to build and explore a highly irregular tree representing the solution space. In our previous works, we have proposed a GPU-accelerated approach in which only a single CPU core is used and only the bounding operator is performed on the GPU device. Here, we extend the approach (LL-GB&amp;B) in order to minimize the CPU–GPU communication latency and thread divergence. Such an objective is achieved through a GPU-based fine-grained parallelization of the branching and pruning operators in addition to the bounding one. The second contribution consists in investigating the combination of a GPU with multi-core processing. Two scenarios have been explored leading to two approaches: a concurrent (RLL-GB&amp;B) and a cooperative one (PLL-GB&amp;B). In the first one, the exploration process is performed concurrently by the GPU and the CPU cores. In the cooperative approach, the CPU cores prepare and off-load to GPU pools of tree nodes using data streaming while the GPU performs the exploration. The different approaches have been extensively experimented on the Flowshop scheduling problem. Compared to a single CPU-based execution, LL-GB&amp;B allows accelerations up to (×160) for large problem instances. Moreover, when combining multi-core and GPU, we figure out that using RLL-GB&amp;B is not beneficial while PLL-GB&amp;B enables an improvement up to 36% compared to LL-GB&amp;B.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-56013" status="OLD">
          <idno type="RNSR">200518286J</idno>
          <orgName>Parallel Cooperative Multi-criteria Optimization</orgName>
          <orgName type="acronym">DOLPHIN</orgName>
          <date type="start">2017-06-01</date>
          <date type="end">2017-06-30</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/dolphin</ref>
          </desc>
          <listRelation>
            <relation active="#struct-2546" type="direct"/>
            <relation active="#struct-92973" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-301700" type="indirect"/>
            <relation name="UMR8022" active="#struct-441569" type="indirect"/>
            <relation active="#struct-104752" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-2546" status="OLD">
          <orgName>Laboratoire d'Informatique Fondamentale de Lille</orgName>
          <orgName type="acronym">LIFL</orgName>
          <desc>
            <address>
              <addrLine>Bâtiment M3 59655 Villeneuve d'Ascq Cédex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lifl.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-92973" type="direct"/>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-301700" type="direct"/>
            <relation name="UMR8022" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-102923" status="VALID">
          <orgName>Institut de Mathématiques [Mons]</orgName>
          <desc>
            <address>
              <addrLine>Université de Mons Place du parc 20 7000 Mons Belgique</addrLine>
              <country key="BE"/>
            </address>
            <ref type="url">http://math.umons.ac.be/institut/fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-160918" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-92973" status="OLD">
          <idno type="IdRef">026404184</idno>
          <idno type="ROR">https://ror.org/0546v5182</idno>
          <orgName>Université de Lille, Sciences et Technologies</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>Cité Scientifique - 59655 Villeneuve d'Ascq Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lille1.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-301700" status="OLD">
          <idno type="IdRef">026404524</idno>
          <idno type="ISNI">0000000121517701</idno>
          <idno type="ROR">https://ror.org/025b4c754</idno>
          <orgName>Université de Lille, Sciences Humaines et Sociales</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>Domaine universitaire du "Pont de Bois"Rue du Barreau BP 60149 59653 Villeneuve d'Ascq Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lille3.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-104752" status="VALID">
          <idno type="RNSR">200818245B</idno>
          <idno type="ROR">https://ror.org/04eej9726</idno>
          <orgName>Centre Inria de l'Université de Lille</orgName>
          <desc>
            <address>
              <addrLine>Parc Scientifique de la Haute Borne 40, avenue Halley Bât.A, Park Plaza 59650 Villeneuve d'Ascq</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/lille/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-160918" status="VALID">
          <idno type="IdRef">190187433</idno>
          <idno type="ROR">https://ror.org/02qnnz951</idno>
          <orgName>Université de Mons = University of Mons</orgName>
          <orgName type="acronym">UMONS</orgName>
          <date type="start">2009-01-01</date>
          <desc>
            <address>
              <addrLine>20, place du Parc, B7000 Mons</addrLine>
              <country key="BE"/>
            </address>
            <ref type="url">http://portail.umons.ac.be/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>