<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0 plus SVG 1.1//EN" "http://www.w3.org/2002/04/xhtml-math-svg/xhtml-math-svg.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
  <head>
    <meta http-equiv="Content-Type" content="application/xhtml+xml; charset=utf-8"/>
    <title>Team:ROMA</title>
    <link rel="stylesheet" href="../static/css/raweb.css" type="text/css"/>
    <meta name="description" content="Optimisation des ressources : modèles, algorithmes et ordonnancement"/>
    <meta name="dc.title" content="Optimisation des ressources : modèles, algorithmes et ordonnancement"/>
    <meta name="dc.subject" content=""/>
    <meta name="dc.publisher" content="INRIA"/>
    <meta name="dc.date" content="(SCHEME=ISO8601) 2014-01"/>
    <meta name="dc.type" content="Report"/>
    <meta name="dc.language" content="(SCHEME=ISO639-1) en"/>
    <meta name="projet" content="ROMA"/>
    <!-- Piwik -->
    <script type="text/javascript" src="/rapportsactivite/piwik.js"></script>
    <noscript><p><img src="//piwik.inria.fr/piwik.php?idsite=49" style="border:0;" alt="" /></p></noscript>
    <!-- End Piwik Code -->
  </head>
  <body>
    <div class="tdmdiv">
      <div class="logo">
        <a href="http://www.inria.fr">
          <img style="align:bottom; border:none" src="../static/img/icons/logo_INRIA-coul.jpg" alt="Inria"/>
        </a>
      </div>
      <div class="TdmEntry">
        <div class="tdmentete">
          <a href="uid0.html">Team Roma</a>
        </div>
        <span>
          <a href="uid1.html">Members</a>
        </span>
      </div>
      <div class="TdmEntry">
        <a href="./uid3.html">Overall Objectives</a>
      </div>
      <div class="TdmEntry">Research Program<ul><li><a href="uid12.html&#10;&#9;&#9;  ">Algorithms for probabilistic environments</a></li><li><a href="uid15.html&#10;&#9;&#9;  ">Platform-aware scheduling strategies</a></li><li><a href="uid18.html&#10;&#9;&#9;  ">High-performance computing and linear algebra</a></li></ul></div>
      <div class="TdmEntry">Application Domains<ul><li><a href="uid26.html&#10;&#9;&#9;  ">Application of sparse direct solvers</a></li></ul></div>
      <div class="TdmEntry">New Software and Platforms<ul><li><a href="uid28.html&#10;&#9;&#9;  ">MUMPS</a></li></ul></div>
      <div class="TdmEntry">New Results<ul><li><a href="uid30.html&#10;&#9;&#9;  ">Highlights of the Year</a></li><li><a href="uid31.html&#10;&#9;&#9;  ">Cost-Optimal Execution of Boolean DNF Trees with Shared Streams </a></li><li><a href="uid32.html&#10;&#9;&#9;  ">Efficient checkpoint/verification patterns for silent error detection</a></li><li><a href="uid33.html&#10;&#9;&#9;  ">Assessing general-purpose algorithms to cope with fail-stop and silent errors</a></li><li><a href="uid34.html&#10;&#9;&#9;  ">Scheduling the I/O of HPC applications under congestion</a></li><li><a href="uid35.html&#10;&#9;&#9;  ">Power-aware replica placement in tree networks
with multiple servers per client</a></li><li><a href="uid36.html&#10;&#9;&#9;  ">Parallel scheduling of task trees with limited memory</a></li><li><a href="uid37.html&#10;&#9;&#9;  ">Scheduling Trees of Malleable Tasks for Sparse Linear Algebra</a></li><li><a href="uid38.html&#10;&#9;&#9;  ">Non-clairvoyant reduction algorithms for heterogeneous platforms</a></li><li><a href="uid39.html&#10;&#9;&#9;  ">Memory-aware tree traversals with pre-assigned tasks</a></li><li><a href="uid40.html&#10;&#9;&#9;  ">Analysis of Dynamic Scheduling Strategies for Matrix Multiplication on Heterogeneous Platforms</a></li><li><a href="uid41.html&#10;&#9;&#9;  ">Determining the optimal redistribution</a></li><li><a href="uid42.html&#10;&#9;&#9;  ">On the hierarchically structured bin packing problem</a></li><li><a href="uid43.html&#10;&#9;&#9;  ">Heuristics for the bipartite matching problem</a></li><li><a href="uid44.html&#10;&#9;&#9;  ">Fill-in reduction in sparse matrix factorizations using hypergraphs</a></li><li><a href="uid45.html&#10;&#9;&#9;  ">On partitioning two dimensional finite difference meshes for distributed memory parallel computers</a></li><li><a href="uid46.html&#10;&#9;&#9;  ">A symmetry preserving algorithm for matrix scaling</a></li><li><a href="uid47.html&#10;&#9;&#9;  ">Direct solvers for sparse linear systems</a></li></ul></div>
      <div class="TdmEntry">Bilateral Contracts and Grants with Industry<ul><li><a href="uid49.html&#10;&#9;&#9;  ">Bilateral Contracts with Industry</a></li></ul></div>
      <div class="TdmEntry">Partnerships and Cooperations<ul><li><a href="uid53.html&#10;&#9;&#9;  ">National Initiatives</a></li><li><a href="uid58.html&#10;&#9;&#9;  ">European Initiatives</a></li><li><a href="uid70.html&#10;&#9;&#9;  ">International Initiatives</a></li><li><a href="uid85.html&#10;&#9;&#9;  ">International Research Visitors</a></li></ul></div>
      <div class="TdmEntry">Dissemination<ul><li><a href="uid89.html&#10;&#9;&#9;  ">Promoting Scientific Activities</a></li><li><a href="uid112.html&#10;&#9;&#9;  ">Teaching - Supervision - Juries</a></li></ul></div>
      <div class="TdmEntry">
        <div>Bibliography</div>
      </div>
      <div class="TdmEntry">
        <ul>
          <li>
            <a id="tdmbibentyear" href="bibliography.html">Publications of the year</a>
          </li>
          <li>
            <a id="tdmbibentfoot" href="bibliography.html#References">References in notes</a>
          </li>
        </ul>
      </div>
    </div>
    <div id="main">
      <div class="mainentete">
        <div id="head_agauche">
          <small><a href="http://www.inria.fr">
	    
	    Inria
	  </a> | <a href="../index.html">
	    
	    Raweb 
	    2014</a> | <a href="http://www.inria.fr/en/teams/roma">Presentation of the Team ROMA</a> | <a href="http://www.ens-lyon.fr/LIP/ROMA/">ROMA Web Site
	  </a></small>
        </div>
        <div id="head_adroite">
          <table class="qrcode">
            <tr>
              <td>
                <a href="roma.xml">
                  <img style="align:bottom; border:none" alt="XML" src="../static/img/icons/xml_motif.png"/>
                </a>
              </td>
              <td>
                <a href="roma.pdf">
                  <img style="align:bottom; border:none" alt="PDF" src="IMG/qrcode-roma-pdf.png"/>
                </a>
              </td>
              <td>
                <a href="../roma/roma.epub">
                  <img style="align:bottom; border:none" alt="e-pub" src="IMG/qrcode-roma-epub.png"/>
                </a>
              </td>
            </tr>
            <tr>
              <td/>
              <td>PDF
</td>
              <td>e-Pub
</td>
            </tr>
          </table>
        </div>
      </div>
      <!--FIN du corps du module-->
      <br/>
      <div class="bottomNavigation">
        <div class="tail_aucentre">
          <a href="./uid0.html" accesskey="U"><img style="align:bottom; border:none" alt="up" src="../static/img/icons/up_motif.jpg"/>  Home</a>
          <a href="./uid1.html" accesskey="N"> | Next <img style="align:bottom; border:none" alt="next" src="../static/img/icons/next_motif.jpg"/></a>
        </div>
        <br/>
      </div>
      <!--DEBUT1 du corps du module-->
      <div class="mainpage1">
        <div class="Titrepage1">2014 Team Activity Report
	</div>
        <div class="Projetpage1">
          <div class="ProjetCourtpage1">ROMA</div>
          <div class="ProjetLongpage1">Optimisation des ressources : modèles, algorithmes et ordonnancement</div>
        </div>
        <div class="CRpage1">
          <span class="definition">Research centre: </span>
          <a href="http://www.inria.fr/centre/grenoble">Grenoble - Rhône-Alpes</a>
        </div>
        <div class="partner"><span class="definition">In partnership with: </span>CNRS, Université Claude Bernard (Lyon 1), Ecole normale supérieure de Lyon<br/><span class="definition">In collaboration with: </span>Laboratoire de l'Informatique du Parallélisme (LIP)<br/><br/></div>
        <div class="domainepage1"><span class="definition">Field: </span><a href="&#10;&#9;      http://www.inria.fr/en/domains/Networks-Systems-and-Services-Distributed-Computing">Networks, Systems and Services, Distributed Computing</a><br/><span class="definition">Theme: </span>Distributed and High Performance Computing</div>
        <div class="Keywordspage1"><span class="definition">Keywords: </span>Scheduling, Parallel And Distributed Algorithms, Combinatorial Optimization, Exascale Systems, Fault Tolerance</div>
      </div>
    </div>
  </body>
</html>
