@InProceedings{C:LaBRI::hrr99a,
  author =    {H\'enon, P. and Ramet, P. and Roman, J.},
  title =     {{A} {M}apping and {S}cheduling {A}lgorithm for {P}arallel {S}parse {F}an-{I}n {N}umerical {F}actorization},
  booktitle = {Proceedings of Euro-Par'99},
  address =   {Toulouse, France},
  pages =     {1059-1067},
  year =      1999,
  month =     sep,
  volume =    1685,
  series =    {LNCS},
  publisher = {Springer Verlag},
  URL =       {http://www.labri.fr/~ramet/restricted/europar99.ps},
  KEYWORDS =  "Sparse",
  ABSTRACT =
{We present and analyze a general algorithm which computes efficient static schedulings of block computations for parallel sparse linear factorization. Our solver, based on a supernodal fan-in approach, is fully driven by this scheduling. We give an overview of the algorithms and present performance results on a 16-node IBM-SP2 with 66 MHz Power2 thin nodes for a collection of grid and irregular problems.}
}

@InProceedings{C:LaBRI::hrr2k,
  author =       {H\'enon, P. and Ramet, P. and Roman, J.},
  title =        {{PaStiX}: {A} {P}arallel {S}parse {D}irect {S}olver {B}ased on a {S}tatic {S}cheduling for {M}ixed {1D/2D} {B}lock {D}istributions},
  booktitle =    {Proceedings of {I}rregular'2000 workshop of IPDPS},
  OPTcrossref =  {},
  OPTkey =       {},
  pages =        {519-525},
  year =         2000,
  OPTeditor =    {},
  OPTnumber =    {},
  volume =       1800,
  series =       {LNCS},
  address =      {Cancun, Mexico},
  month =        may,
  OPTorganization = {},
  publisher =    {Springer Verlag},
  OPTnote =      {},
  OPTannote =    {},
  URL =          {http://www.labri.fr/~ramet/restricted/irregular2K.ps},
  KEYWORDS =     "Sparse",
  ABSTRACT =
{We present and analyze a general algorithm which computes an efficient static scheduling of block computations for a parallel $L.D.L^{t}$ factorization of sparse symmetric positive definite systems based on a combination of 1D and 2D block distributions. Our solver uses a supernodal fan-in approach and is fully driven by this scheduling. We give an overview of the algorithm and present performance results and comparisons with PSPASES on an IBM-SP2 with 120 MHz Power2SC nodes for a collection of irregular problems.}
}

@InProceedings{c:LaBRI::GHPRRP1,
  author =       "Goudin, D. and H\'enon, P. and Pellegrini, F. and Ramet, P. and Roman, J. and Pesqu\'e, J.-J.",
  title =        "{A}lg\`ebre Lin\'eaire Creuse Parall\`ele pour les M\'ethodes Directes : Application \`a la Parall\'elisation d'un Code de M\'ecanique des Structures",
  booktitle =    "{J}ourn\'ees sur l'{A}lg\`ebre {L}in\'eaire {C}reuse et ses {A}pplications {I}ndustrielles",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  year =         "1999",
  OPTorganization = {},
  OPTpublisher = {},
  address =      {Rennes, France},
  OPTmonth =     {},
  OPTpages =     {},
  note =         {},
  OPTannote =    {},
  URL =          {http://www.labri.fr/~ramet/restricted/irisa99.ps},
  KEYWORDS =     "Sparse"
}

@InProceedings{c:LaBRI::jsft,
  author =       "Goudin, D. and H\'enon, P. and Pellegrini, F. and Ramet, P. and Roman, J.",
  title =        "R\'esolution parall\`ele de grands syst\`emes lin\'eaires creux",
  booktitle =    "Proceedings of {JSFT'2000}",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  year =         "2000",
  OPTorganization = {},
  OPTpublisher = {},
  address =      {Monastir, Tunisia},
  month =        oct,
  OPTpages =     {},
  OPTnote =      {},
  OPTannote =    {},
  URL =          {http://www.labri.fr/~ramet/restricted/jsft2k.ps},
  KEYWORDS =     "Sparse",
  ABSTRACT =
{Cet article pr\'esente un tour d'horizon concernant les principes et techniques pouvant \^etre utilis\'ees pour la r\'esolution de grands syst\`emes lin\'eaires creux. Il pr\'esente en particulier les travaux r\'ealis\'es au LaBRI au sein du th\`eme ALiENor consacr\'es \`a la r\'esolution parall\`ele haute performance par m\'ethodes directes.}
}

@Article{A:LaBRI::GHPRRP3,
  author =       "Goudin, D. and H\'enon, P. and Pellegrini, F. and Ramet, P. and Roman, J. and Pesqu\'e, J.-J.",
  title =        "{P}arallel Sparse Linear Algebra and Application to Structural Mechanics",
  journal =      "{N}umerical {A}lgorithms",
  year =         "2000",
  OPTkey =       {},
  volume =       {24},
  OPTnumber =    {},
  pages =        {371--391},
  OPTmonth =     {},
  OPTannote =    {},
  OPTURL =       {http://www.labri.fr/~ramet/restricted/baltzer99.ps},
  KEYWORDS =     "Sparse",
  ABSTRACT =
{The framework of this paper is the parallelization of a plasticity algorithm that uses an implicit method and an incremental approach. More precisely, we will focus on some specific parallel sparse linear algebra algorithms which are the most time-consuming steps to solve efficiently such an engineering application. First, we present a general algorithm which computes an efficient static scheduling of block computations for parallel sparse linear factorization. The associated solver, based on a supernodal fan-in approach, is fully driven by this scheduling. Second we describe a scalable parallel assembly algorithm based on a distribution of elements induced by the previous distribution for the blocks of the sparse matrix. We give an overview of these algorithms and present performance results on an IBM SP2 for a collection of grid and irregular problems.}
}

@Article{A:LaBRI::HRR01a,
  author = 	 {H\'enon, P. and Ramet, P. and Roman, J.},
  title = 	 {{PaStiX}: {A} {H}igh-{P}erformance {P}arallel {D}irect {S}olver for {S}parse {S}ymmetric {D}efinite {S}ystems},
  journal = 	 {{P}arallel {C}omputing},
  year = 	 {2002},
  OPTkey = 	 {},
  volume = 	 {28},
  number = 	 {2},
  pages = 	 {301--321},
  month = 	 jan,
  OPTnote = 	 {},
  OPTannote = 	 {},
  KEYWORDS =     "Sparse",
  ABSTRACT =
{Solving large sparse symmetric positive definite systems of linear equations is a crucial and time-consuming step, arising in many scientific and engineering applications. This paper considers the block partitioning and scheduling problem for sparse parallel factorization without pivoting. There are two major aims to this study: the scalability of the parallel solver, and the compromise between memory overhead and efficiency. Parallel experiments on a large collection of irregular industrial problems validate our approach.}
}

@InProceedings{C:LaBRI::gopara,
  author =       "Goudin, D. and Roman, J.",
  title =        "A scalable parallel assembly for irregular meshes based on a block distribution for a parallel block direct solver",
  year =         "2000",
  booktitle =    "Proceedings of {PARA'2000}",
  series =       "LNCS",
  volume =       "1947",
  address =      "Bergen, Norway",
  publisher =    "Springer Verlag",
  URL =          {http://www.labri.fr/~ramet/restricted/para2k.ps},
  KEYWORDS =     "Sparse",
  ABSTRACT =
{This paper describes a distribution of elements for irregular finite element meshes as well as the associated parallel assembly algorithm, in the context of parallel solving of the resulting sparse linear system using a direct block solver. These algorithms are integrated in the software processing chain EMILIO being developped at LaBRI for structural mechanics applications. Some illustrative numerical experiments on IBM SP2 validate this study.}
}

@InProceedings{C:LaBRI::spworld,
  author =       "Goudin, D. and H\'enon, P. and Pellegrini, F. and Ramet, P. and Roman, J. and Pesqu\'e, J.-J.",
  title =        "Parallel Sparse Linear Algebra and Application to Structural Mechanics",
  booktitle =    "{SPWorld}'99",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  year =         {1999},
  OPTorganization = {},
  OPTpublisher = {},
  address =      {Montpellier, France},
  OPTmonth =     {},
  OPTpages =     {},
  OPTnote =      {},
  OPTannote =    {},
  URL =          {http://www.labri.fr/~ramet/restricted/spworld99.ps},
  KEYWORDS =     "Sparse"
}

@InProceedings{C:LaBRI::actc,
  author =       "Goudin, D. and H\'enon, P. and Pellegrini, F. and Ramet, P. and Roman, J. and Pesqu\'e, J.-J.",
  title =        "Parallel Sparse Linear Algebra and Application to Structural Mechanics",
  booktitle =    "{European ACTC Workshop}",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  year =         {2000},
  OPTorganization = {},
  OPTpublisher = {},
  address =      {Paris, France},
  month =        may,
  OPTpages =     {},
  OPTnote =      {},
  OPTannote =    {},
  KEYWORDS =     "Sparse"
}

@InProceedings{c:LaBRI::HR01,
  author = 	 {P. H\'enon and P. Ramet},
  title = 	 {{PaStiX}: Un solveur parall\`ele direct pour des matrices creuses sym\'etriques d\'efinies positives bas\'e sur un ordonnancement statique performant et sur une gestion m\'emoire efficace},
  booktitle = 	 "ACTES RenPar'2001",
  OPTcrossref =  {},
  OPTkey = 	 {},
  OPTpages = 	 {},
  year = 	 {2001},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  address = 	 {Paris, France},
  month = 	 apr,
  OPTorganization = {},
  OPTpublisher = {},
  OPTnote = 	 {},
  OPTannote = 	 {},
  URL =          {http://www.labri.fr/~ramet/restricted/renpar01.ps},
  KEYWORDS =     "Sparse",
  ABSTRACT =
{La r\'esolution de grands syst\`emes lin\'eaires creux est un point crucial dans de nombreuses applications industrielles et scientifiques. Notre travail porte sur le partionnement et la distribution de grandes matrices creuses pour la factorisation $LDL^t$ en parall\`ele sur machine de type MIMD. Nous pr\'esentons dans cet article notre technique de factorisation parall\`ele bas\'ee sur un ordonnancement statique des calculs et des communications, et nous la validons sur des syst\`emes de plus d'un million d'inconnues pour des probl\`emes d'\'el\'ements finis 3D.}
}

@InProceedings{c:LaBRI::HR02,
  author = 	 {P. H\'enon and P. Ramet},
  title = 	 {Optimisation de l'occupation m\'emoire pour un solveur parall\`ele creux direct hautes performances de type supernodal},
  booktitle = 	 "ACTES RenPar'2002",
  OPTcrossref =  {},
  OPTkey = 	 {},
  OPTpages = 	 {},
  year = 	 {2002},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  address = 	 {Hamamet, Tunisia},
  month = 	 apr,
  OPTorganization = {},
  OPTpublisher = {},
  OPTnote = 	 {},
  OPTannote = 	 {},
  URL =          {http://www.labri.fr/~ramet/restricted/renpar02.ps},
  KEYWORDS =     "Sparse",
  ABSTRACT =
{Cet article d\'ecrit une partie de nos travaux sur la r\'esolution directe parall\`ele de grands syst\`emes lin\'eaires creux. Il pr\'esente sa mise en \oe uvre sur des architectures \`a base de n\oe uds SMP, et plus particuli\`erement  des techniques de gestion efficace de la m\'emoire.}
}

@PhdThesis{t:LaBRI::PR2k,
  author = 	 "Ramet, P.",
  title = 	 "{O}ptimisation de la {C}ommunication et de la {D}istribution des {D}onnées pour des {S}olveurs Parallèles {D}irects en {A}lgèbre {L}inéaire {D}ense et {C}reuse",
  school = 	 "LaBRI, Université Bordeaux I",
  year = 	 "2000",
  OPTkey = 	 {},
  address = 	 {Talence, France},
  OPTtype = 	 {},
  month = 	 jan,
  OPTnote = 	 {},
  OPTannote = 	 {},
  URL =          {http://www.labri.fr/~ramet/publications/these_ramet.pdf},
  KEYWORDS =     "Overlap, Sparse",
  ABSTRACT =
{This thesis deals with the high performance computation problems and more specifically with those of scientific parallel computation for irregular real-world applications.

In the first part, we describe a method for overlapping communications on parallel computers with distributed memory. This method has resulted in  a generic computation scheme for the optimal packet size. We also tackle the problem of finding the optimal computation grain for the Cholesky factorization algorithm for dense matrices. The goal of this study is to exploit the irregularity induced by the matrix symmetry. Based on this work we have developped a portable software library providing an efficient application context for these techniques.

The second part of this thesis presents and analyses a general algorithm for the computation of an efficient static scheduling of block computations, developped especially for a parallel direct sparse linear factorization based on a combination of 1D and 2D block distributions. Our solver uses a supernodal Fan-In approach and is fully driven by our static scheduling algorithm. Compared to the existing parallel direct solvers our solver shows very favorable performance results.}
}

@PhdThesis{t:LaBRI::DG2k,
  author = 	 "Goudin, D.",
  title = 	 "{M}ise en \oe uvre d'une {B}iblioth\`eque d'{O}utils pour la {R}\'esolution {P}arall\`ele {H}autes {P}erformances par {M}\'ethode {D}irecte de {G}rands {S}yst\`emes {L}in\'eaires {C}reux et application \`a un {C}ode de {M}\'ecanique des {S}tructures",
  school = 	 "LaBRI, Université Bordeaux I",
  year = 	 "2000",
  OPTkey = 	 {},
  address = 	 {Talence, France},
  OPTtype = 	 {},
  month = 	 nov,
  OPTnote = 	 {},
  OPTannote = 	 {},
  URL =          {http://www.labri.fr/~ramet/restricted/these_goudin.ps},
  KEYWORDS =     "Sparse",
  ABSTRACT =
{This thesis initially concerned the parallelization of the OSSAU software code from CEA/CESTA. The application domain of this software is the vectorized structural mechanics; the code itself is non linear in time and in two or three dimensions. This investigation leads to the conception and the implementation of a parallel high performance software processing chain for the assembly and the resolution of sparse linear systems by direct methods. The final objective is a validation of the OSSAU code for three dimension problems with several millions of unknowns.}
}

@PhdThesis{t:LaBRI::PH01,
  author = 	 "H\'enon, P.",
  title = 	 "{D}istribution des {D}onn\'ees et {R}\'egulation {S}tatique des {C}alculs et des {C}ommunications pour la {R}\'esolution de {G}rands {S}yst\`emes {L}in\'eaires {C}reux par {M}\'ethode {D}irecte",
  school = 	 "LaBRI, Université Bordeaux I, Talence",
  year = 	 "2001",
  OPTkey = 	 {},
  address = 	 {Talence, France},
  OPTtype = 	 {},
  month = 	 nov,
  OPTnote = 	 {},
  OPTannote = 	 {},
  URL =          {http://www.labri.fr/~ramet/restricted/these_henon.ps},
  KEYWORDS =     "Sparse",
  ABSTRACT =
{Solving large sparse symmetric positive definite systems of linear equations is a crucial and time-consuming step, arising in many scientific and engineering applications. In this work, we consider the block partitioning and scheduling problem for sparse parallel factorization without pivoting. We focus on the scalability of the parallel solver, and on the compromise between memory overhead and efficiency. We validate this study with parallel experiments on a large collection of irregular industrial problems.}
}

@PhdThesis{t:LaBRI::MF09,
  author = 	 "Faverge, M.",
  title = 	 "{O}rdonnancement hybride statique-dynamique en algèbre linéaire creuse pour de grands clusters de machines {NUMA} et multi-coeurs",
  school = 	 "LaBRI, Université Bordeaux I, Talence",
  year = 	 "2009",
  OPTkey = 	 {},
  address = 	 {Talence, France},
  OPTtype = 	 {},
  month = 	 dec,
  OPTnote = 	 {},
  OPTannote = 	 {},
  URL =          {http://www.labri.fr/~ramet/restricted/these_faverge.pdf},
  KEYWORDS =     "Sparse",
  ABSTRACT =
{New supercomputers incorporate many microprocessors which include themselves one or many computational cores. These new architectures induce strongly hierarchical topologies. These are called NUMA architectures. Sparse direct solvers are a basic building block of many numerical simulation algorithms. They need to be adapted to these new architectures with Non Uniform Memory Accesses. We propose to introduce a dynamic scheduling designed for NUMA architectures in the PaStiX, solver. The data structures of the solver, as well as the patterns of communication have been modified to meet the needs of these architectures and dynamic scheduling. We are also interested in the dynamic adaptation of the computation grain to use efficiently multi-core architectures and shared memory. Experiments on several numerical test cases will be presented to prove the efficiency of the approach on different architectures.}
}

@PhdThesis{t:LaBRI::MC09,
  author = 	 "Chanaud, M.",
  title = 	 "Conception d'un solveur haute performance de systèmes linéaires creux couplant des méthodes multigrilles et directes pour la résolution des équations de Maxwell 3D en régime harmonique discrétisées par éléments finis",
  school = 	 "LaBRI, Université Bordeaux I, Talence",
  year = 	 "2009",
  OPTkey = 	 {},
  address = 	 {Talence, France},
  OPTtype = 	 {},
  month = 	 dec,
  OPTnote = 	 {},
  OPTannote = 	 {},
  URL =          {http://www.labri.fr/~ramet/restricted/these_chanaud.pdf},
  KEYWORDS =     "Sparse"
}

@InProceedings{C:LaBRI::siam2012,
  author = 	 {Faverge, M. and Ramet, P.},
  title = 	 {Fine Grain Scheduling for Sparse Solver on Manycore Architectures},
  OPTcrossref =  {},
  OPTkey = 	 {},
  booktitle = {15th {SIAM} Conference on Parallel Processing for Scientific Computing},
  OPTpages = 	 {},
  year = 	 {2012},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  address = 	 {Savannah, USA},
  month = 	 feb,
  OPTorganization = {},
  OPTpublisher = {},
  OPTnote = 	 {},
  OPTannote = 	 {},
  KEYWORDS =     "Sparse",
  ABSTRACT = {The emergence of many-cores architectures introduces variations in computation costs, which makes precise cost models hard to realize. Static schedulers based on cost models, like the one used in the sparse direct solver \textsc{PaStiX}, are no longer adapted. We describe the dynamic scheduler developed for the super-nodal method of \textsc{PaStiX} to correct the imperfections of the static model. The solution presented exploit the elimination tree of the problem to keep the data locality during the execution.}
}

@InProceedings{C:LaBRI::siam2001,
  author = 	 {H\'enon, P. and Ramet, P. and Roman, J.},
  title = 	 {{PaStiX}: {A} {P}arallel {D}irect {S}olver for {S}parse {SPD} {M}atrices based on {E}fficient {S}tatic {S}cheduling and {M}emory {M}anagment},
  booktitle = {Tenth {SIAM} Conference on Parallel Processing for Scientific Computing},
  OPTcrossref =  {},
  OPTkey = 	 {},
  OPTpages = 	 {},
  year = 	 {2001},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  address = 	 {Portsmouth, USA},
  month = 	 mar,
  OPTorganization = {},
  OPTpublisher = {},
  OPTnote = 	 {},
  OPTannote = 	 {},
  URL =          {http://www.labri.fr/~ramet/restricted/ppsc01.ps},
  KEYWORDS =     "Sparse",
  ABSTRACT =
{Solving large sparse symmetric positive definite systems of linear equations is a crucial and time-consuming step, arising in many scientific and engineering applications. In this work, we consider the block partitioning and scheduling problem for sparse parallel factorization without pivoting. We focus on the scalability of the parallel solver, and on the compromise between memory overhead and efficiency. We validate this study with parallel experiments on a large collection of irregular industrial problems.}
}

@InProceedings{C:LaBRI::PMAA_2K1,
  author =       "H\'enon, P. and Ramet, P. and Roman, J.",
  title =        "PaStiX: A High-Performance Parallel Direct Solver for Sparse Symmetric Definite Systems",
  booktitle =    "Proceedings of {PMAA}'2K",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  year =         "2000",
  OPTorganization = {},
  OPTpublisher = {},
  address =      {Neuchatel, Swiss},
  month =        aug,
  OPTpages =     {},
  OPTnote =      {},
  OPTannote =    {},
  URL =          {http://www.labri.fr/~ramet/restricted/pmaa2.ps},
  KEYWORDS =     "Sparse"
}

@InProceedings{C:LaBRI::PMAA_2K2,
  author =       "Goudin, D. and H\'enon, P. and Pellegrini, F. and Ramet, P. and Roman, J. and Pesqu\'e, J.-J.",
  title =        "Description of the EMILIO Software Processing Chain and Application to Structural Mechanics",
  booktitle =    "Proceedings of {PMAA}'2K",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  year =         "2000",
  OPTorganization = {},
  OPTpublisher = {},
  address =      {Neuchatel, Swiss},
  month =        aug,
  OPTpages =     {},
  OPTnote =      {},
  OPTannote =    {},
  URL =          {http://www.labri.fr/~ramet/restricted/pmaa1.ps},
  KEYWORDS =     "Sparse"
}

@InProceedings{c:LaBRI::ihperf_2k,
  author =       "Goudin, D. and H\'enon, P. and Pellegrini, F. and Ramet, P. and Roman, J. and Pesqu\'e, J-J.",
  title =        "{A}lg\`ebre {L}in\'eaire {C}reuse {H}autes {P}erformances : {A}pplication \`a la {M}\'ecanique des {S}tructures",
  booktitle =    "{iHPerf'2000}",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  year =         "2000",
  OPTorganization = {},
  OPTpublisher = {},
  address =      {Aussois, France},
  month =        dec,
  OPTpages =     {},
  OPTnote =      {},
  OPTannote =    {},
  URL =          {http://www.labri.fr/~ramet/restricted/ihperf2k.ps},
  KEYWORDS =     "Sparse"
}

%% RAPPORTS DE FIN DE CONTRAT

@TechReport{f:LaBRI::go98a,
  author       = "Goudin, D.",
  title        = "Mise en oeuvre d'une Biblioth\`eque d'Outils pour la R\'esolution par M\'ethode Directe de Grands Syst\`emes Lin\'eaires Creux Sym\'etriques D\'efinis Positifs sur Machine Parall\`ele",
  institution  = "C.E.A. / C.E.S.T.A",
  year         = "1998",
  note         = "Premier Rapport Semestriel",
  KEYWORDS =     "Sparse"
}

@TechReport{f:LaBRI::go99a,
  author       = "Goudin, D.",
  title        = "Mise en oeuvre d'une Biblioth\`eque d'Outils pour la R\'esolution par M\'ethode Directe de Grands Syst\`emes Lin\'eaires Creux Sym\'etriques D\'efinis Positifs sur Machine Parall\`ele",
  institution  = "C.E.A. / C.E.S.T.A",
  year         = "1999",
  note         = "Rapport Final de la Premi\`ere Partie",
  KEYWORDS =     "Sparse"
}

@TechReport{f:LaBRI::go99b,
  author       = "Goudin, D.",
  title        = "Mise en oeuvre d'une Biblioth\`eque d'Outils pour la R\'esolution par M\'ethode Directe de Grands Syst\`emes Lin\'eaires Creux Sym\'etriques D\'efinis Positifs sur Machine Parall\`ele",
  institution  = "C.E.A. / C.E.S.T.A",
  year         = "1999",
  note         = "Rapport Semestriel de la Deuxi\`eme Partie",
  KEYWORDS =     "Sparse"
}

@TechReport{f:LaBRI::go2ka,
  author       = "Goudin, D.",
  title        = "Mise en oeuvre d'une Biblioth\`eque d'Outils pour la R\'esolution par M\'ethode Directe de Grands Syst\`emes Lin\'eaires Creux Sym\'etriques D\'efinis Positifs sur Machine Parall\`ele",
  institution  = "C.E.A. / C.E.S.T.A",
  year         = "2000",
  note         = "Rapport Final de la Deuxi\`eme Partie",
  KEYWORDS =     "Sparse"
}

@TechReport{f:LaBRI::rr01,
  author       = "Ramet, P. and Roman, J.",
  title        = "Analyse et \'Etude de Faisabilit\'e de la R\'esolution par M\'ethode Directe sur Machine Parall\`ele de Grands Syst\`emes Lin\'eaires Sym\'etriques D\'efinis positifs pour des Probl\`emes d'\'Electromagn\'etisme avec Couplage \'El\'ements Finis -- \'Equations Int\'egrales",
  institution  = "C.E.A. / C.E.S.T.A",
  year         = "2001",
  note         = "Rapport Final",
  KEYWORDS =     "Sparse"
}

@TechReport{n:LaBRI::all01,
  author       = "Goudin, D. and H\'enon, P. and Pellegrini, F. and Ramet, P. and Roman, J.",
  title        = "Mise en oeuvre d'une Biblioth\`eque d'Outils pour la R\'esolution par M\'ethode Directe de Grands Syst\`emes Lin\'eaires Creux Sym\'etriques D\'efinis Positifs sur Machine Parall\`ele",
  institution  = "C.E.A. / C.E.S.T.A",
  year         = "2001",
  note         = "Manuel utilisateur de la cha\^{\i}ne EMILIO",
  URL =          {http://www.labri.fr/~ramet/restricted/ug.ps},
  KEYWORDS =     "Sparse"
}

@TechReport{f:LaBRI::hlrr03,
  author       = "H\'enon, P. and Lecas, D. and Ramet, P. and Roman, J.",
  title        = "Am\'elioration et Extension du Solveur Direct Parall\`ele pour Grandes Matrices Creuses du CESTA",
  institution  = "C.E.A. / C.E.S.T.A",
  year         = "2003",
  note         = "Rapport Final",
  KEYWORDS =     "Sparse"
}

@TechReport{f:LaBRI::crr03b,
  author       = "Christy, S. and Ramet, P. and Roman, J.",
  title        = "Développement de la phase d'assemblage de la chaîne EMILIO pour un solveur parallèle 2D",
  institution  = "C.E.A. / C.E.S.T.A",
  year         = "2003",
  note         = "Rapport Final",
  KEYWORDS =     "Sparse"
}

@TechReport{f:LaBRI::grr04b,
  author       = "Goureman, A. and Ramet, P. and Roman, J.",
  title        = "Développement de la phase d'assemblage de la chaîne EMILIO (distribution du maillage et multi-threading)",
  institution  = "C.E.A. / C.E.S.T.A",
  year         = "2004",
  note         = "Rapport Final",
  KEYWORDS =     "Sparse"
}

@TechReport{f:LaBRI::hr05b,
  author       = "Caramel, G. and H\'enon, P. and Ramet, P.",
  title        = "Etude de faisabilit\'e pour la parall\'elisation d'un code de m\'ecanique des fluides en version non structur\'ee",
  institution  = "C.E.A. / C.E.S.T.A",
  year         = "2005",
  note         = "Rapport Final",
  KEYWORDS =     "Sparse"
}

@TechReport{f:LaBRI::hr05d,
  author       = "Huard, F. and H\'enon, P. and Ramet, P.",
  title        = "Int\'egration dans ODYSSEE de la chaine logicielle EMILIO",
  institution  = "C.E.A. / C.E.S.T.A",
  year         = "2005",
  note         = "Rapport Final",
  KEYWORDS =     "Sparse"
}

@TechReport{f:LaBRI::hrr05,
  author       = "H\'enon, P. and Ramet, P. and Roman, J.",
  title        = "Evaluation des performances de la version SMP du solveur PaStiX de la chaine logicielle EMILIO dans l'environnement du code ODYSSEE",
  institution  = "C.E.A. / C.E.S.T.A",
  year         = "2005",
  note         = "Rapport Final",
  KEYWORDS =     "Sparse"
}

@TechReport{f:LaBRI::cr07b,
  author       = "Caramel, G. and Ramet, P.",
  title        = "Optimisation des performances des outils de calcul de neutronique des coeurs",
  institution  = "E.D.F. / SINETICS",
  year         = "2007",
  note         = "Rapport Final",
  KEYWORDS =     "Sparse"
}

@InProceedings{c:LaBRI::dg2ka,
  author =       "Goudin, D.",
  title =        "Assemblage parall\`ele d'une matrice et/ou d'un second membre: Application \`a la Parall\'elisation d'un Code de M\'ecanique des Structures",
  OPTcrossref =  "",
  OPTkey =       "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =        "",
  booktitle =    "ACTES RenPar'2000",
  year =         "2000",
  OPTorganization = "",
  OPTpublisher = "",
  address =      "Besancon, France",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  URL =          {http://www.labri.fr/~ramet/restricted/renpar2k.ps},
  KEYWORDS =     "Sparse",
  ABSTRACT =
{Cet article d\'ecrit un algorithme d'assemblage parall\`ele pouvant \^etre utilis\'e lors de la phase de r\'esolution de grands syst\'emes lin\'eaires creux. La premi\`ere partie traite des probl\'emes pos\`es par un code de m\'ecanique des structures nomm\'e OSSAU d\'evelopp\'e au CEA. La deuxi\'eme partie est consacr\'ee \`a la description de notre algorithme et \`a son int\'egration dans la cha\^ine logicielle EMILIO, d\'evelopp\'ee au LaBRI sein du th\'eme ALiENor.}
}

@InProceedings{C:LaBRI::PMAA2002a,
  author =       "H\'enon, P. and Ramet, P. and Roman, J.",
  title =        "{P}arallel factorization of very large sparse {SPD} systems on a network of {SMP} nodes",
  booktitle =    "Proceedings of {PMAA}'2002",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  year =         "2002",
  OPTorganization = {},
  OPTpublisher = {},
  address =      {Neuchatel, Swiss},
  month =        nov,
  OPTpages =     {},
  OPTnote =      {},
  OPTannote =    {},
  URL =          {http://www.labri.fr/~ramet/restricted/pmaa2002.ps},
  KEYWORDS =     "Sparse"
}

@InProceedings{C:LaBRI::PMAA2004b,
  author =       "H\'enon, P. and Nkonga, B. and Ramet, P. and Roman, J.",
  title =        "Using of the High Performance Sparse Solver PaStiX for the Complex Multiscale 3D Simulations performed by the FluidBox Fluid Mechanics Software",
  booktitle =    "Proceedings of {PMAA}'2004",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  year =         "2004",
  OPTorganization = {},
  OPTpublisher = {},
  address =      {Marseille, France},
  month =        oct,
  OPTpages =     {},
  OPTnote =      {},
  OPTannote =    {},
  KEYWORDS =     "Sparse",
  ABSTRACT = {
In this paper, we consider a hyperbolic system with multiple time step characteristics. Such a situation arises for example in combustion problems when the acoustic time is small compared to the characteristic time associated to the flame propagation. The problems investigated in this paper are characterized by a small Mach number. 
At the asymptotic limit, the initial hyperbolic system degenerates to an elliptic problem. Therefore, numerical methods proposed with the assumption of hyperbolicity of the system becomes hill conditioned at this limit. As a consequence, the iterative methods used in the numerical algorithm implemented in the software FluidBox, have a worse convergence behavior. 
Some physical preconditioning has been proposed to overcome this difficulty. However, in the context of parallel computing, a global preconditioning is unavoidable for performance efficiency. 

The parallelization of FluidBox relies on a domain decomposition. 
A first version of FluidBox was using a block Jacobi or a block Gauss-Seidel preconditioner that are easily implementable in this framework.
But to solve  3D problems up to several millions of unknowns on numerous processors, this kind of preconditioner becomes inefficient du to their lack of scalability and robustness. 
Hence, a collaboration inside the INRIA ScAlApplix project has been setup to use the high performance solver library PaStiX that provides both complete and incomplete factorizations on clusters of SMP nodes to solve large scale
computations. 

The aim of this work is then to investigate the performance of the combination of FluidBox and PaStiX (both developped in the INRIA ScAlApplix project) and also present the parallel assembly algorithm that allows a good load balance in this context. 
}
}

@InProceedings{C:LaBRI::PMAA2006b,
  author =       "Braconnier, B. and Nkonga, B. and Papin, M. and Ramet, P. and Ricchiuto M. and Roman, J. and Abgrall, R.",
  title =        "Efficient solution technique for low Mach number  compressible multiphase problems",
  booktitle =    "Proceedings of {PMAA}'2006",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  year =         "2006",
  OPTorganization = {},
  OPTpublisher = {},
  address =      {Rennes, France},
  month =        sep,
  OPTpages =     {},
  OPTnote =      {},
  OPTannote =    {},
  URL = {http://www.labri.fr/~ramet/restricted/pmaa06b.pdf},
  OPTABSTRACT = {}
}

@InProceedings{C:LaBRI::la12a,
  author = 	 {Casadei, A. and Ramet, P.},
  title = 	 {Memory Optimization to Build a Schur Complement},
  OPTcrossref =  {},
  OPTkey = 	 {},
  booktitle =    {SIAM Conference on Applied Linear Algebra},
  OPTpages = 	 {},
  year = 	 {2012},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  address = 	 {Valence, Spain},
  month = 	 jun,
  OPTorganization = {},
  OPTpublisher = {},
  OPTnote = 	 {},
  OPTannote = 	 {},
  KEYWORDS =     "Sparse",
  URL =          {http://www.labri.fr/~ramet/restricted/la12a.pdf},
}

@InProceedings{C:LaBRI::la12b,
  author = 	 {Lacoste, X. and Ramet, P.},
  title = 	 {Sparse direct solver on top of large-scale multicore systems with GPU accelerators},
  OPTcrossref =  {},
  OPTkey = 	 {},
  booktitle =    {SIAM Conference on Applied Linear Algebra},
  OPTpages = 	 {},
  year = 	 {2012},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  address = 	 {Valence, Spain},
  month = 	 jun,
  OPTorganization = {},
  OPTpublisher = {},
  OPTnote = 	 {},
  OPTannote = 	 {},
  KEYWORDS =     "Sparse",
  URL =          {http://www.labri.fr/~ramet/restricted/la12b.pdf},
}

@InProceedings{C:LaBRI::siam2003,
  author = 	 {H\'enon, P. and Ramet, P. and Roman, J.},
  title = 	 {Efficient algorithms for direct resolution of large sparse system on clusters of {SMP} nodes},
  booktitle = {{SIAM} Conference on Applied Linear Algebra},
  OPTcrossref =  {},
  OPTkey = 	 {},
  OPTpages = 	 {},
  year = 	 {2003},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  address = 	 {Williamsburg, USA},
  month = 	 jul,
  OPTorganization = {},
  OPTpublisher = {},
  OPTnote = 	 {},
  OPTannote = 	 {},
  KEYWORDS =     "Sparse",
  URL =          {http://www.labri.fr/~ramet/restricted/RAMETP.PDF},
  ABSTRACT =    
{In previous works, we have described an efficient static scheduling based on a mixed 1D/2D block distribution with local aggregation for a parallel supernodal version of sparse $LL^{T}$ factorization.
In this paper, we present new algorithms suitable for overcoming architectures based on clusters of SMP nodes and also technics to keep a good memory scalability.
This algorithms are implemented in the PaStiX library that achieved high performances (resolution of a $26.10^6$ unknown system on 192 ES45 quadriprocessors with 35 percent of peak performance).
}
}

@InProceedings{c:LaBRI::GHMMPRRP03,
  author =       "Goudin, D. and H\'enon, P. and Mandallena, M. and Mer, K. and Pellegrini, F. and Ramet, P. and Roman, J. and Pesqu\'e, J.-J.",
  title =        "Outils num\'eriques parall\`eles pour la r\'esolution de tr\`es grands probl\`emes d'\'electromagn\'etisme",
  booktitle =    "{S}\'eminaire sur l'{A}lgorithmique {N}um\'erique {A}ppliqu\'ee aux {P}robl\`emes {I}ndustriels",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  year =         "2003",
  OPTorganization = {},
  OPTpublisher = {},
  address =      {Calais, France},
  month =        may,
  OPTpages =     {},
  OPTnote =      {},
  OPTannote =    {},
  KEYWORDS =     "Sparse",
  ABSTRACT = 
{
L'émergence des machines parallèles téraflopiques permet maintenant de traiter des problèmes de diffraction de très grande taille liés à des calculs hautes fréquences par des méthodes exactes.
Une première étape de ce travail a constisté à paralléliser des codes séquentiels existants qui utilisaient des méthodes numériques classiques.
Ces codes étaient basés sur un couplage fort par complément de Schur entre une formulation intégrale (éléments-finis surfaciques pour traiter la condition de radiation à l'infini) et une formulation éléments-finis volumiques (pour calculer les champs à l'intérieur de l'objet).
L'adapation au parallélisme a consisté à paralléliser la factorisation du système linéaire creux (à l'aide de la bibliothèque EMILIO/PaStiX, la résolution du système intégral plein (symétrique, complexe) et le couplage par complément de Schur (consistant en des descentes-remontées sur le système creux associé).
Les deux premières étapes citées ont donné pleinement satisfaction, mais le complément de Schur, à cause du très grand nombre descentes-remontées liées aux inconnues surfaciques, limite l'efficacité globale de cette approche à des problèmes de taille intermédiaire.
Par exemple, pour le cas test du ``Sphere-Cone'' comportant $3.10^6$ d'inconnues volumiques et $23.10^3$ inconnues surfaciques, sur 32 n\oe uds ES45 (quadri-processeurs), l'assemblage volumique repr\'esente 6s, la factorisation du syst\`eme creux est obtenue en 376s et le compl\'ement de Schur en 21500s (en complexe double pr\'ecision).
Pour dépasser ces limites, une évolution globale de l'algorithme a été nécessaire~:
- un couplage itératif entre les résolutions surfacique et volumique a été mis en place;
- pour augmenter le nombre d'inconnues surfaciques une méthode multipôle multi-niveaux parallèle a été développée;
- enfin, pour atteindre des tailles de problème de plusieurs dizaines de millions d'inconnues volumiques, des évolutions ont été apportées dans la bibliothèque EMILIO/PaStiX. En particulier, une algorithmique sp\'ecifique a \'et\'e mise en place pour utiliser au mieux les clusters de n\oe uds SMP et pour pr\'eserver une scalabilit\'e m\'emoire raisonnable.
Enfin, le schéma actuel présente un couplage direct-itératif à plusieurs niveaux. L'évolution envisagée sera un couplage itératif-itératif, puis sera bas\'ee sur des méthodes hybrides globales (intermédiaire entre le direct et l'itératif)~: une version de PaStiX évoluée permettra de calculer un précondition\-neur par bloc ILU(k) parallèle.
}
}

@InProceedings{C:LaBRI::SC2002,
  author = "H\'enon, P. and Ramet, P. and Roman, J.",
  title = "{A} {P}arallel {D}irect {S}olver for {V}ery {L}arge {S}parse {SPD} {S}ystems",
  booktitle = "{SuperComputing}'2002",
  OPTcrossref = {},
  OPTkey = {},
  OPTeditor = {},
  OPTvolume = {},
  OPTnumber = {},
  OPTseries = {},
  year = "2002",
  OPTorganization = {},
  OPTpublisher = {},
  address = {Baltimore, USA},
  month = nov,
  OPTpages = {},
  OPTnote = {},
  OPTannote = {},
  URL = {http://www.labri.fr/~ramet/restricted/poster_sc2002.ppt},
  KEYWORDS = "Sparse" 
}

@InProceedings{C:LaBRI::ipdps2003,
  author =       "H\'enon, P. and Ramet, P. and Roman, J.",
  title =        "{A} {P}arallel {D}irect {S}olver for {V}ery {L}arge {S}parse {SPD} {S}ystems",
  booktitle =    "{IPDPS}'2003",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  year =         "2003",
  OPTorganization = {},
  OPTpublisher = {},
  address =      {Nice, France},
  month =        apr,
  OPTpages =     {},
  OPTnote =      {},
  OPTannote =    {},
  URL =          {http://www.labri.fr/~ramet/restricted/PaStiX_flyer_ipdps2003.ppt},
  KEYWORDS =     "Sparse"
}

@InProceedings{C:LaBRI::ppam05,
  author =       "H\'enon, P. and Ramet, P. and Roman, J.",
  title =        "On using an hybrid MPI-Thread programming for the implementation of a parallel sparse direct solver on a network of SMP nodes",
  booktitle =    "Proceedings of Sixth International Conference on Parallel Processing and Applied Mathematics, Workshop HPC Linear Algebra",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  volume =       {3911},
  OPTnumber =    {},
  series =       {LNCS},
  year =         "2005",
  OPTorganization = {},
  publisher =    {Springer Verlag},
  address =      {Poznan, Poland},
  month =        sep,
  pages =        {1050--1057},
  OPTnote =      {},
  OPTannote =    {},
  URL =          {http://www.labri.fr/~ramet/restricted/ppam05.ps},
  KEYWORDS =     "Sparse",
  ABSTRACT =
{
Since the last decade, most of the supercomputer architectures are based on cluster of SMP nodes.
In those architectures the exchanges between processors are made through shared memory when the processor are located on a same SMP node and through the network otherwise.
Generally, the MPI implementations provided by the constructor on those machines are adapted to this situation and take advantage of the share memory to treat messages between processors in a same SMP node. Nevertheless, this transparent approach to exploit shared memory do not avoid the storage of buffers needed in asynchronous communications. 
In the parallel direct solvers the storage of these buffers can become a bottleneck. In this paper, we propose an hybrid thread-MPI implementation of a direct solver and analyse the benefits of this approach in term of memory and run-time performances.
}
}

@InProceedings{C:LaBRI::vecpar08-diet,
  author = 	 {Caniou, Y. and Gay, J.-S. and Ramet, P.},
  title = 	 {Tunable parallel experiments in a GridRPC framework: application to linear solvers},
  OPTcrossref =  {},
  OPTkey = 	 {},
  booktitle = {VECPAR'08, 8th International Meeting
High Performance Computing for Computational Science},
  pages = 	 {430--436},
  year = 	 {2008},
  OPTeditor = 	 {},
  volume = 	 {5336},
  OPTnumber = 	 {},
  series = 	 {LNCS},
  address = 	 {Toulouse, France},
  month = 	 jun,
  OPTorganization = {},
  publisher =    {Springer Verlag},
  OPTannote = 	 {},
  URL =       {http://www.labri.fr/~ramet/restricted/vecpar08-diet.pdf},
  ABSTRACT = {The use of scientific computing centers becomes more and more difficult on modern parallel architectures. Users must face a large variety of batch systems (with their own specific syntax) and have to set many parameters to tune their applications (e.g., processors and/or threads mapping, memory resource constraints). Moreover, finding the optimal performance is not the only criteria when a pool of jobs is submitted on the Grid (for numerical parametric analysis for instance) and one must focus on the wall-time completion. In this work we tackle the problem by using the D IET Grid middleware that integrates an adaptable PaStiX service to solve a set of experiments issued from the simulations of the ASTER project.}
}

@InProceedings{C:LaBRI::vecpar08-redimps,
  author = 	 {Kushida, N. and Suzuki, Y. and Teshima, N. and Nakajima, N. and Caniou, Y. and Dayde, M. and Ramet, P.},
  title = 	 {Toward an International Sparse Linear Algebra Expert System by
Interconnecting the ITBL Computational Grid with the Grid-TLSE Platform},
  OPTcrossref =  {},
  OPTkey = 	 {},
  booktitle = {VECPAR'08, 8th International Meeting
High Performance Computing for Computational Science},
  pages = 	 {424--429},
  year = 	 {2008},
  OPTeditor = 	 {},
  volume = 	 {5336},
  OPTnumber = 	 {},
  series = 	 {LNCS},
  address = 	 {Toulouse, France},
  month = 	 jun,
  OPTorganization = {},
  publisher =    {Springer Verlag},
  OPTannote = 	 {},
  URL =       {http://www.labri.fr/~ramet/restricted/vecpar08-redimps.pdf},
}

@inproceedings{C:LaBRI::sna-mc-2010,
  Address = {Tokyo, Japan},
  Author = {Suzuki, Y. and Kushida, N. and Tatekawa, T. and Teshima, N. and Caniou, Y. and Guivarch, R. and Dayde, M. and Ramet, P.},
  Booktitle = {Joint International Conference on Supercomputing in Nuclear 
Applications and Monte Carlo 2010 (SNA + MC2010)},
  Month = {October},
  Title = {{Development of an International Matrix-Solver Prediction System on 
a French-Japanese International Grid Computing Environment}},
  Year = {2010}
}

@InProceedings{C:LaBRI::para08,
  author = 	 {Faverge, M. and Ramet, P.},
  title = 	 {Dynamic Scheduling for sparse direct Solver on NUMA architectures},
  OPTcrossref =  {},
  OPTkey = 	 {},
  booktitle = {Proceedings of PARA'2008},
  OPTpages = 	 {},
  year = 	 {2008},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  address = 	 {Trondheim, Norway},
  month = 	 may,
  OPTorganization = {},
  OPTpublisher = {},
  OPTannote = 	 {},
  KEYWORDS =     "Sparse",
  ABSTRACT = {Over the past few years, parallel sparse direct solvers made significant progress and are now able to efficiently work on problems with several millions of equations. This paper presents some improvements on our sparse direct solver PaStiX1 for distributed Non-Uniform Memory Access architectures. We show results on two preliminary works: a memory allocation scheme more adapted to these architectures and a better overlap of communication by computation. We also present a dynamic scheduler that takes care of memory affinity and data locality.},
  URL =       {http://www.labri.fr/~ramet/restricted/para08.pdf},
}

@InProceedings{C:LaBRI::PMAA2012,
  author =       "Bosilca, G. and Faverge, M. and Lacoste, X. and Yamazaki, I. and Ramet, P.",
  title =        "Toward a supernodal sparse direct solver over {DAG} runtimes",
  booktitle =    "Proceedings of {PMAA}'2012",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  year =         "2012",
  OPTorganization = {},
  OPTpublisher = {},
  address =      {Londres, UK},
  month =        jun,
  OPTpages =     {},
  OPTnote =      {},
  OPTannote =    {},
  OPTURL =       {},
  KEYWORDS =     "Sparse",
  ABSTRACT = {
The current trend in the high performance computing shows a dramatic increase in the number of cores on the shared memory compute nodes. Algorithms, especially those related to linear algebra, need to be adapted to these new computer architectures in order to be efficient. PaStiX is a sparse parallel direct solver, that incorporates a dynamic  scheduler for strongly hierarchical modern architectures.  In this work, we study the replacement of this internal highly integrated scheduling strategy by two generic runtime frameworks: DAGuE and StarPU. Those runtimes will give the opportunity to execute the factorization tasks graph on emerging computers equipped with accelerators. As for previous work done in dense linear algebra, we will present the kernels used for GPU computations inspired by the MAGMA library and the DAG algorithm used with those two runtimes. A comparative study of the performances of the supernodal solver with the three different schedulers is performed on ma
nycore architectures and the improvements obtained with accelerators will be presented with the StarPU runtime. These results demonstrate that these DAG runtimes provide uniform programming interfaces to obtain high performance on different architectures on irregular problems as sparse direct factorizations.}
}

@InProceedings{C:LaBRI::PMAA2008b,
  author =       "Faverge, M. and Lacoste, X. and Ramet, P.",
  title =        "A NUMA Aware Scheduler for a Parallel Sparse Direct Solver",
  booktitle =    "Proceedings of {PMAA}'2008",
  OPTcrossref =  {},
  OPTkey =       {},
  OPTeditor =    {},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  year =         "2008",
  OPTorganization = {},
  OPTpublisher = {},
  address =      {Neuchatel, Swiss},
  month =        jun,
  OPTpages =     {},
  OPTnote =      {},
  OPTannote =    {},
  OPTURL =       {},
  KEYWORDS =     "Sparse",
  ABSTRACT = {Over the past few years, parallel sparse direct solvers made significant progress and are now able to solve efficiently industrial three-dimensional problems with several millions of unknowns. An hybrid MPI-thread implementation of our direct solver PaStiX is already well suited for SMP nodes or new multi-core architectures and drastically reduced the memory overhead and improved scalability. In the context of distributed NUMA architectures, a dynamic scheduler based on a work-stealing algorithm has been developed to fill in communication idle times.  On these architectures, it is important to take care of NUMA effects and to preserve memory affinity during the work-stealing. The scheduling of communications also needs to be adapted, especially to ensure the overlap by computations. Experiments on numerical test cases will be presented to prove the efficiency of the approach on NUMA architectures. If memory is not large enough to treat a given problem, disks must be used to store data that cannot fit in memory (out-of-core storage). The idle-times due to disk access have to be managed by our dynamic scheduler to prefetch and save datasets. Thus, we design and study specific scheduling algorithms in this particular context.}
}

@InProceedings{c:LaBRI::renpar09,
  author = 	 {Faverge, M.},
  title = 	 {Vers un solveur de systèmes linéaires creux adapté aux machines {NUMA}},
  booktitle = 	 "ACTES RenPar'2009",
  OPTcrossref =  {},
  OPTkey = 	 {},
  OPTpages = 	 {},
  year = 	 {2009},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  address = 	 {Toulouse, France},
  month = 	 sep,
  OPTorganization = {},
  OPTpublisher = {},
  OPTnote = 	 {},
  OPTannote = 	 {},
  URL =          {http://www.labri.fr/~ramet/restricted/renpar09.ps},
  KEYWORDS =     "Sparse",
}

@InProceedings{c:LaBRI::i3m,
  author = 	 {Faverge, M.},
  title = 	 {A NUMA Aware Scheduler for a Parallel Sparse Direct Solver},
  booktitle = 	 "Journées Informatique Massivement Multiprocesseur et Multicoeur",
  OPTcrossref =  {},
  OPTkey = 	 {},
  OPTpages = 	 {},
  year = 	 {2009},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  address = 	 {Rocquencourt, France},
  month = 	 feb,
  OPTorganization = {},
  OPTpublisher = {},
  OPTannote = 	 {},
  URL =          {http://www.labri.fr/~ramet/restricted/i3m.pdf},
  KEYWORDS =     "Sparse",
}

@InProceedings{C:LaBRI::sparsedays2009,
  author = 	 {Faverge, M.},
  title = 	 {Dynamic Scheduling for Sparse Direct Solver on NUMA and Multicore Architectures},
  booktitle = 	 "Sparse Days",
  OPTcrossref =  {},
  OPTkey = 	 {},
  OPTpages = 	 {},
  year = 	 {2009},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  address = 	 {Toulouse, France},
  month = 	 jun,
  OPTorganization = {},
  OPTpublisher = {},
  OPTannote = 	 {},
  KEYWORDS =     "Sparse",
}

@InProceedings{C:LaBRI::COST2009,
  author = 	 {Ramet, P.},
  title = 	 {Dynamic Scheduling for Sparse Direct Solver on NUMA and Multicore Architectures},
  booktitle = 	 "ComplexHPC meeting",
  OPTcrossref =  {},
  OPTkey = 	 {},
  OPTpages = 	 {},
  year = 	 {2009},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  address = 	 {Lisbon, Portugal},
  month = 	 oct,
  OPTorganization = {},
  OPTpublisher = {},
  OPTannote = 	 {},
  KEYWORDS =     "Sparse",
}

@InProceedings{C:LaBRI::HOSCAR2012a,
  author = 	 {Lacoste, X. and Faverge, M. and Ramet, P.},
  title = 	 {Sparse direct solvers with accelerators over {DAG} runtimes},
  booktitle = 	 "Workshop INRIA-CNPq, HOSCAR meeting",
  OPTcrossref =  {},
  OPTkey = 	 {},
  OPTpages = 	 {},
  year = 	 {2012},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  address = 	 {Sophia-Antipolis, France},
  month = 	 jul,
  OPTorganization = {},
  OPTpublisher = {},
  OPTannote = 	 {},
  KEYWORDS =     "Sparse",
  ABSTRACT = {
The current trend in the high performance computing shows a dramatic increase in the number of cores on the shared memory compute nodes. Algorithms, especially those related to linear algebra, need to be adapted to these new computer architectures in order to be efficient. PaStiX is a sparse parallel direct solver, that incorporates a dynamic  scheduler for strongly hierarchical modern architectures.  In this work, we study the replacement of this internal highly integrated scheduling strategy by two generic runtime frameworks: DAGuE and StarPU. Those runtimes will give the opportunity to execute the factorization tasks graph on emerging computers equipped with accelerators. As for previous work done in dense linear algebra, we will present the kernels used for GPU computations inspired by the MAGMA library and the DAG algorithm used with those two runtimes. A comparative study of the performances of the supernodal solver with the three different schedulers is performed on manycore architectures and the improvements obtained with accelerators will be presented with the StarPU runtime. These results demonstrate that these DAG runtimes provide uniform programming interfaces to obtain high performance on different architectures on irregular problems as sparse direct factorizations.}
}

@InProceedings{C:LaBRI::HOSCAR2012b,
  author = 	 {Lacoste, X. and Faverge, M. and Ramet, P.},
  title = 	 {Scheduling for Sparse Solver on Manycore Architectures},
  booktitle = 	 "Workshop INRIA-CNPq, HOSCAR meeting",
  OPTcrossref =  {},
  OPTkey = 	 {},
  OPTpages = 	 {},
  year = 	 {2012},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  address = 	 {Petropolis, Brazil},
  month = 	 sep,
  OPTorganization = {},
  OPTpublisher = {},
  OPTannote = 	 {},
  KEYWORDS =     "Sparse",
  ABSTRACT = {
The emergence of many-cores architectures introduces variations in computation costs, which makes precise cost models hard to realize. Static schedulers based on cost models, like the one used in the sparse direct solver PaStiX, are no longer adapted. We describe the dynamic scheduler developed for the super-nodal method of PaStiX to correct the imperfections of the static model. The solution presented exploit the elimination tree of the problem to keep the data locality during the execution.}
}

%% inria-00549827, version 1
%% http://hal.archives-ouvertes.fr/inria-00549827/en/
@techreport{FAVERGE:2010:INRIA-00549827:1,
    HAL_ID = {inria-00549827},
    URL = {http://hal.archives-ouvertes.fr/inria-00549827/en/},
    title = { {A} {NUMA} {A}ware {S}cheduler for a {P}arallel {S}parse {D}irect {S}olver},
    author = {{F}averge, {M}athieu and {L}acoste, {X}avier and {R}amet, {P}ierre},
    abstract = {{O}ver the past few years, parallel sparse direct solvers made significant progress and are now able to solve efficiently industrial three-dimensional problems with several millions of unknowns. {T}o solve efficiently these problems, {P}a{S}ti{X} and {WSMP} solvers for example, provide an hybrid {MPI}-thread implementation well suited for {SMP} nodes or multi-core architectures. {I}t enables to drastically reduce the memory overhead of the factorization and improve the scalability of the algorithms. {H}owever, today's modern architectures introduce new hierarchical memory accesses that are not handle in these solvers. {W}e present in this paper three improvements on {P}a{S}ti{X} solver to improve the performance on modern architectures : memory allocation, communication overlap and dynamic scheduling and some results on numerical test cases will be presented to prove the efficiency of the approach on {NUMA} architectures.},
    year = 2010,
    keywords = {Sparse},
    language = {{A}nglais},
    affiliation = {{I}nnovative {C}omputing {L}aboratory - {ICL} - {U}niversity of {T}ennessee - {BACCHUS} - {INRIA} {B}ordeaux - {S}ud-{O}uest - {INRIA} - {U}niversit{\'e} de {B}ordeaux - {CNRS} : {UMR}5251 - {CNRS} : {UMR}5800 - {L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux - {U}niversit{\'e} {V}ictor {S}egalen - {B}ordeaux {II} },
    URL = {http://hal.archives-ouvertes.fr/inria-00549827/PDF/RR-7498.pdf},
}

%% hal-00700066, version 2
%% http://hal.inria.fr/hal-00700066
%%

@techreport{lacoste:hal-00700066,
  AUTHOR = {Lacoste, Xavier and Ramet, Pierre and Faverge, Mathieu and Ichitaro, Yamazaki and Dongarra, Jack},
  TITLE = {{Sparse direct solvers with accelerators over DAG runtimes}},
  TYPE = {Research Report},
  PAGES = {11},
  YEAR = {2012},
  INSTITUTION = {INRIA},
  NUMBER = {RR-7972},
  URL = {http://hal.inria.fr/hal-00700066}
}

%% hal-00700053, version 2
%% http://hal.inria.fr/hal-00700053
%%

@techreport{astrid:hal-00700053,
  AUTHOR = {Astrid, Casadei and Ramet, Pierre},
  TITLE = {{Memory Optimization to Build a Schur Complement in an Hybrid Solver}},
  TYPE = {Research Report},
  PAGES = {11},
  YEAR = {2012},
  INSTITUTION = {INRIA},
  NUMBER = {RR-7971},
  URL = {http://hal.inria.fr/hal-00700053}
}