1. P. Hénon, F. Pellegrini, P. Ramet, and J. Roman. Blocking Issues for an Efficient Parallel Block ILU Preconditioner. In International SIAM Conference On Preconditioning Techniques For Large Sparse Matrix Problems In Scientific And Industrial Applications, Atlanta, USA, May 2005. Keyword(s): Sparse.
   

   @InProceedings{C:LaBRI::pre05,
   author = {H\'enon, P. and Pellegrini, F. and Ramet, P. and Roman, J.},
   title = {Blocking Issues for an Efficient Parallel Block ILU Preconditioner},
   booktitle = {International SIAM Conference On Preconditioning Techniques For Large Sparse Matrix Problems In Scientific And Industrial Applications},
   OPTcrossref = {},
   OPTkey = {},
   OPTpages = {},
   year = {2005},
   OPTeditor = {},
   OPTvolume = {},
   OPTnumber = {},
   OPTseries = {},
   address = {Atlanta, USA},
   month = may,
   OPTorganization = {},
   OPTpublisher = {},
   OPTnote = {},
   OPTannote = {},
   URL = {http://www.labri.fr/~ramet/restricted/pred2005.ps},
   KEYWORDS = "Sparse" 
   }
   




2. P. Hénon, P. Ramet, and J. Roman. On using an hybrid MPI-Thread programming for the implementation of a parallel sparse direct solver on a network of SMP nodes. In Proceedings of Sixth International Conference on Parallel Processing and Applied Mathematics, Workshop HPC Linear Algebra, volume 3911 of LNCS, Poznan, Poland, pages 1050-1057, September 2005. Springer Verlag. Keyword(s): 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::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. } 
   }
   

1. G. Caramel, P. Hénon, and P. Ramet. Etude de faisabilité pour la parallélisation d'un code de mécanique des fluides en version non structurée. Technical report, C.E.A. / C.E.S.T.A, 2005. Note: Rapport Final. Keyword(s): 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" 
   }
   




2. F. Huard, P. Hénon, and P. Ramet. Intégration dans ODYSSEE de la chaine logicielle EMILIO. Technical report, C.E.A. / C.E.S.T.A, 2005. Note: Rapport Final. Keyword(s): 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" 
   }
   




3. P. Hénon, P. Ramet, and J. Roman. Evaluation des performances de la version SMP du solveur PaStiX de la chaine logicielle EMILIO dans l'environnement du code ODYSSEE. Technical report, C.E.A. / C.E.S.T.A, 2005. Note: Rapport Final. Keyword(s): 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" 
   }
   

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html