<?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-00836778</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-25T00:56:45+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Peer to peer computing for large tree exploration-based exact optimization</title>
            <author role="aut">
              <persName>
                <forename type="first">Malika</forename>
                <surname>Mehdi</surname>
              </persName>
              <idno type="halauthorid">496150-0</idno>
              <affiliation ref="#struct-139441"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Mohand</forename>
                <surname>Mezmaz</surname>
              </persName>
              <email type="md5">37522a1811aac8cdd8baedc5afae287f</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="numeric">860394</idno>
              <idno type="halauthorid" notation="string">152529-860394</idno>
              <affiliation ref="#struct-102923"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Pascal</forename>
                <surname>Bouvry</surname>
              </persName>
              <email type="md5">1f17e85397484d445be8d18b87350ee6</email>
              <email type="domain">uni.lu</email>
              <idno type="idhal" notation="numeric">866914</idno>
              <idno type="halauthorid" notation="string">119602-866914</idno>
              <idno type="IDREF">https://www.idref.fr/130593109</idno>
              <idno type="VIAF">https://viaf.org/viaf/11840514</idno>
              <idno type="ISNI">http://isni.org/isni/0000000356684117</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-9338-2834</idno>
              <affiliation ref="#struct-366875"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Nouredine</forename>
                <surname>Melab</surname>
              </persName>
              <email type="md5">c291cf380bd266ad84e98d59341c69cd</email>
              <email type="domain">lifl.fr</email>
              <idno type="idhal" notation="numeric">834175</idno>
              <idno type="halauthorid" notation="string">111785-834175</idno>
              <orgName ref="#struct-92973"/>
              <affiliation ref="#struct-56013"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">El-Ghazali</forename>
                <surname>Talbi</surname>
              </persName>
              <email type="md5">2dc127747aac5b2147f152ac70dea2e5</email>
              <email type="domain">univ-lille.fr</email>
              <idno type="idhal" notation="string">talbi-el-ghazali</idno>
              <idno type="idhal" notation="numeric">11350</idno>
              <idno type="halauthorid" notation="string">24310-11350</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4549-1010</idno>
              <idno type="IDREF">https://www.idref.fr/070160082</idno>
              <affiliation ref="#struct-56013"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>TALBI</forename>
                <surname>El-Ghazali</surname>
              </persName>
              <email type="md5">2dc127747aac5b2147f152ac70dea2e5</email>
              <email type="domain">univ-lille.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2013-06-21 14:55:44</date>
              <date type="whenModified">2025-09-01 11:40:02</date>
              <date type="whenReleased">2013-06-21 14:55:44</date>
              <date type="whenProduced">2009</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="45267">
                <persName>
                  <forename>TALBI</forename>
                  <surname>El-Ghazali</surname>
                </persName>
                <email type="md5">2dc127747aac5b2147f152ac70dea2e5</email>
                <email type="domain">univ-lille.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00836778</idno>
            <idno type="halUri">https://inria.hal.science/hal-00836778</idno>
            <idno type="halBibtex">mehdi:hal-00836778</idno>
            <idno type="halRefHtml">&lt;i&gt;International Journal of Grid and Utility Computing&lt;/i&gt;, 2009, 1 (3), pp.252-260. &lt;a target="_blank" href="https://dx.doi.org/10.1504/IJGUC.2009.027652"&gt;&amp;#x27E8;10.1504/IJGUC.2009.027652&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">International Journal of Grid and Utility Computing, 2009, 1 (3), pp.252-260. &amp;#x27E8;10.1504/IJGUC.2009.027652&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>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</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">Peer to peer computing for large tree exploration-based exact optimization</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Malika</forename>
                    <surname>Mehdi</surname>
                  </persName>
                  <idno type="halauthorid">496150-0</idno>
                  <affiliation ref="#struct-139441"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Mohand</forename>
                    <surname>Mezmaz</surname>
                  </persName>
                  <email type="md5">37522a1811aac8cdd8baedc5afae287f</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="numeric">860394</idno>
                  <idno type="halauthorid" notation="string">152529-860394</idno>
                  <affiliation ref="#struct-102923"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Pascal</forename>
                    <surname>Bouvry</surname>
                  </persName>
                  <email type="md5">1f17e85397484d445be8d18b87350ee6</email>
                  <email type="domain">uni.lu</email>
                  <idno type="idhal" notation="numeric">866914</idno>
                  <idno type="halauthorid" notation="string">119602-866914</idno>
                  <idno type="IDREF">https://www.idref.fr/130593109</idno>
                  <idno type="VIAF">https://viaf.org/viaf/11840514</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000356684117</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-9338-2834</idno>
                  <affiliation ref="#struct-366875"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Nouredine</forename>
                    <surname>Melab</surname>
                  </persName>
                  <email type="md5">c291cf380bd266ad84e98d59341c69cd</email>
                  <email type="domain">lifl.fr</email>
                  <idno type="idhal" notation="numeric">834175</idno>
                  <idno type="halauthorid" notation="string">111785-834175</idno>
                  <orgName ref="#struct-92973"/>
                  <affiliation ref="#struct-56013"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">El-Ghazali</forename>
                    <surname>Talbi</surname>
                  </persName>
                  <email type="md5">2dc127747aac5b2147f152ac70dea2e5</email>
                  <email type="domain">univ-lille.fr</email>
                  <idno type="idhal" notation="string">talbi-el-ghazali</idno>
                  <idno type="idhal" notation="numeric">11350</idno>
                  <idno type="halauthorid" notation="string">24310-11350</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4549-1010</idno>
                  <idno type="IDREF">https://www.idref.fr/070160082</idno>
                  <affiliation ref="#struct-56013"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">14449</idno>
                <idno type="issn">1741-847X</idno>
                <idno type="eissn">1741-8488</idno>
                <title level="j">International Journal of Grid and Utility Computing</title>
                <imprint>
                  <publisher>Inderscience</publisher>
                  <biblScope unit="volume">1</biblScope>
                  <biblScope unit="issue">3</biblScope>
                  <biblScope unit="pp">252-260</biblScope>
                  <date type="datePub">2009</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1504/IJGUC.2009.027652</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</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>The Branch and Bound (B&amp;amp;B) algorithm is one of the most used methods to solve in an exact way combinatorial optimisation problems. In a previous article, we proposed a new approach of the parallel B&amp;amp;B algorithm for distributed systems using the farmer-worker paradigm. However, the new farmer-worker approach has a disadvantage: some nodes of the B&amp;amp;B tree can be explored by several B&amp;amp;B processes. To prevent this redundant work and speed up, we propose a new P2P approach inspired from the strategies of existing P2P systems like Napster and JXTA. Validation is performed by experimenting the two approaches on mono-objective flow-shop problem benchmarks using 500 processors belonging to the French national grid, Grid'5000. The obtained results prove the efficiency of the proposed P2P approach. Indeed, the execution time obtained with the P2P version, even if more communicative, is better than the farmer-worker's one.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-139441" status="VALID">
          <orgName>Centre de recherche sur l'Information Scientifique et Technique</orgName>
          <orgName type="acronym">CERIST</orgName>
          <desc>
            <address>
              <addrLine>5 rue des trois frères Aissou Ben Aknoun Alger</addrLine>
              <country key="DZ"/>
            </address>
            <ref type="url">http://www.cerist.dz/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301855" 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-366875" status="VALID">
          <idno type="IdRef">124635016</idno>
          <idno type="ISNI">0000000122959843</idno>
          <idno type="ROR">https://ror.org/036x5ad56</idno>
          <idno type="Wikidata">Q59668</idno>
          <orgName>Université du Luxembourg = University of Luxembourg = Universität Luxemburg</orgName>
          <orgName type="acronym">uni.lu</orgName>
          <date type="start">2003-01-01</date>
          <desc>
            <address>
              <addrLine>Université du Luxembourg [Siège] – 2, place de l’Université – L-4365 Esch-sur-Alzette – Luxembourg</addrLine>
              <country key="LU"/>
            </address>
            <ref type="url">http://wwwfr.uni.lu/</ref>
          </desc>
        </org>
        <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="institution" xml:id="struct-301855" status="VALID">
          <orgName>Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche</orgName>
          <orgName type="acronym">M.E.N.E.S.R.</orgName>
          <desc>
            <address>
              <addrLine>1 rue Descartes - 75231 Paris cedex 05</addrLine>
              <country key="FR"/>
            </address>
          </desc>
        </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>
        <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>
      </listOrg>
    </back>
  </text>
</TEI>