<?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-01095213</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-20T03:22:36+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Work Stealing Strategies For Multi-Core Parallel Branch-and-Bound Algorithm Using Factorial Number System.</title>
            <author role="aut">
              <persName>
                <forename type="first">Rudi</forename>
                <surname>Leroy</surname>
              </persName>
              <email type="md5">a1af8395d5e220d4afc7971f01f02609</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="numeric">951417</idno>
              <idno type="halauthorid" notation="string">797141-951417</idno>
              <orgName ref="#struct-432029"/>
              <affiliation ref="#struct-56013"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Mohand</forename>
                <surname>Mezmaz</surname>
              </persName>
              <email type="md5">e6922b15592524fe22f9f991fb9f1669</email>
              <email type="domain">umons.ac.be</email>
              <idno type="idhal" notation="numeric">951416</idno>
              <idno type="halauthorid" notation="string">152529-951416</idno>
              <orgName ref="#struct-160918"/>
              <affiliation ref="#struct-102923"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Nouredine</forename>
                <surname>Melab</surname>
              </persName>
              <idno type="halauthorid">111785-0</idno>
              <affiliation ref="#struct-56013"/>
            </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>
              <affiliation ref="#struct-102923"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Nouredine</forename>
                <surname>Melab</surname>
              </persName>
              <email type="md5">fd91b9083d25d2bc83d218b7d6b36890</email>
              <email type="domain">univ-lille.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2014-12-15 11:51:12</date>
              <date type="whenWritten">2014</date>
              <date type="whenModified">2025-09-01 11:40:02</date>
              <date type="whenReleased">2014-12-15 11:51:12</date>
              <date type="whenProduced">2014-02-15</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="111878">
                <persName>
                  <forename>Nouredine</forename>
                  <surname>Melab</surname>
                </persName>
                <email type="md5">fd91b9083d25d2bc83d218b7d6b36890</email>
                <email type="domain">univ-lille.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01095213</idno>
            <idno type="halUri">https://inria.hal.science/hal-01095213</idno>
            <idno type="halBibtex">leroy:hal-01095213</idno>
            <idno type="halRefHtml">&lt;i&gt;ACM PPOPP/PMAM-2014&lt;/i&gt;, Feb 2014, Orlando, Florioda, France</idno>
            <idno type="halRef">ACM PPOPP/PMAM-2014, Feb 2014, Orlando, Florioda, France</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="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Work Stealing Strategies For Multi-Core Parallel Branch-and-Bound Algorithm Using Factorial Number System.</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Rudi</forename>
                    <surname>Leroy</surname>
                  </persName>
                  <email type="md5">a1af8395d5e220d4afc7971f01f02609</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="numeric">951417</idno>
                  <idno type="halauthorid" notation="string">797141-951417</idno>
                  <orgName ref="#struct-432029"/>
                  <affiliation ref="#struct-56013"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Mohand</forename>
                    <surname>Mezmaz</surname>
                  </persName>
                  <email type="md5">e6922b15592524fe22f9f991fb9f1669</email>
                  <email type="domain">umons.ac.be</email>
                  <idno type="idhal" notation="numeric">951416</idno>
                  <idno type="halauthorid" notation="string">152529-951416</idno>
                  <orgName ref="#struct-160918"/>
                  <affiliation ref="#struct-102923"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Nouredine</forename>
                    <surname>Melab</surname>
                  </persName>
                  <idno type="halauthorid">111785-0</idno>
                  <affiliation ref="#struct-56013"/>
                </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>
                  <affiliation ref="#struct-102923"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>ACM PPOPP/PMAM-2014</title>
                  <date type="start">2014-02-15</date>
                  <date type="end">2014-02-19</date>
                  <settlement>Orlando, Florioda</settlement>
                  <country key="FR">France</country>
                </meeting>
                <imprint>
                  <date type="datePub">2014</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">trees</term>
                <term xml:lang="en">Graph theory</term>
                <term xml:lang="en">Permutation</term>
                <term xml:lang="en">Combinatorial algorithms</term>
                <term xml:lang="en">Concurrent programming</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Many real-world problems in different industrial and economic fields are permutation combinatorial optimization problems. Solving to optimality large instances of these problems, such as the flowshop problem, is a challenge for multi-core computing. This paper proposes four work stealing strategies for the multi-threaded factoradic-based branch-and-bound (B\&amp;B) algorithm to solve permutation combinatorial problems on multi-core processors. The factoradic, called also factorial number system, is a mixed radix numeral system adapted to numbering permutations. In our new parallel strategies, the B\&amp;B is based on a matrix of integers instead of a pool of permutations, and work units exchanged between threads are intervals of factoradics instead of sets of nodes. The experiments show that the strategy based on selecting the largest interval is better than the three other strategies in terms of the number of interval sharing events. Furthermore, the worst factoradic-based strategy spends on average $7.2$ times less time managing the pool of subproblems than a conventional pool-based parallel B\&amp;B algorithm.</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-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="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="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>