Pierre Ramet
  • About
  • Experience
  • Research
  • Teaching
  • Publications
  • HAL
  • BibTeX
  • Projects
  • News
  • Contact
ESC

Searching...

No results found

↑↓ Navigate ↵ Select
Powered by Hugo Blox
  • News
    • Participation au projet européen EuroHPC DARE
    • Soutenance de thèse : Clément Richefort
    • Initiative HybQuant : Maison du quantique en Nouvelle-Aquitaine
    • Build PaStiX with Guix-HPC
  • Publications
    • Scalable and Portable LU Factorization with Partial Pivoting on top of Runtime Systems
    • Toward an algebraic multigrid method for the indefinite Helmholtz equation
    • Comparative Study of Mixed-Precision and Low-Rank Compression Techniques in Sparse Direct Solvers
    • Toward an algebraic multigrid method for the indefinite Helmholtz equation
    • Enhancing sparse direct solver scalability through runtime system automatic data partition
    • New parallel features in the sparse solver PaStiX
    • Toward a multilevel method for the Helmholtz equation
    • Toward a Multigrid Method for the Indefinite Helmholtz Equation
    • Improving the memory and time overhead of low-rank parallel linear sparse direct solvers
    • Reaching the Quality of SVD for Low-Rank Compression Through QR Variants
    • Deciding Non-Compressible Blocks in Sparse Direct Solvers using Incomplete Factorization
    • Study of the recent developments around the PaStiX solver for the EoCoE project: distributed mem- ory, runtime systems, and low-rank
    • The JOREK non-linear extended MHD code and applications to large-scale instabilities and their control in magnetically confined fusion plasmas
    • Deciding Non-Compressible Blocks in Sparse Direct Solvers using Incomplete Factorization
    • Improving mapping for sparse direct solvers: A trade-off between data locality and load balancing
    • Improving mapping for sparse direct solvers: A trade-off between data locality and load balancing
    • Recent Developments Around the Block Low-Rank PaStiX Solver
    • Sparse supernodal solver using block low-rank compression: Design, performance and analysis
    • A hierarchical fast direct solver for distributed memory machines with manycore nodes
    • Rank Revealing QR Methods for Sparse Block Low Rank Solvers
    • Rank Revealing QR Methods for Sparse Block Low Rank Solvers
    • Efficient Parallel Solution of the 3D Stationary Boltzmann Transport Equation for Diffusive Problems
    • Utilisation de techniques de compression low-rank pour un solveur parallèle direct creux
    • Block Low-rank Algebraic Clustering for Sparse Direct Solvers
    • Exploiting Parameterized Task-graph in Sparse Direct Solvers
    • Supernodes ordering to enhance Block Low-Rank compression in sparse direct solvers
    • On the use of low-rank arithmetic to reduce the complexity of parallel sparse linear solvers based on direct factorization techniques
    • Utilisation de la compression low-rank pour réduire la complexité du solveur PaStiX
    • Sparse supernodal solver using block low-rank compression: Design, performance and analysis
    • Utilisation de la compression Block Low-Rank pour accélérer un solveur direct creux supernodal
    • Supernodes ordering to enhance Block Low-Rank compression in sparse direct solvers
    • Heterogeneous architectures, Hybrid methods, Hierarchical matrices for Sparse Linear Solvers
    • Sparse Supernodal Solver Using Block Low-Rank Compression: design, performance and analysis
    • Heterogeneous architectures, Hybrid methods, Hierarchical matrices for Sparse Linear Solvers
    • Sparse supernodal solver with low-rank compression for solving the frequency-domain Maxwell equations discretized by a high order HDG method
    • Efficient Parallel Solution of the 3D Stationary Boltzmann Transport Equation for Diffusive Problems
    • Sparse Supernodal Solver exploiting Low-Rankness Property
    • Sparse Supernodal Solver Using Block Low-Rank Compression
    • Utilisation de la compression Block Low-Rank pour accélérer un solveur direct creux supernodal
    • Exploiting Modern Manycore Architecture in Sparse Direct Solver with Runtime Systems
    • Impact of Blocking Strategies for Sparse Direct Solvers on Top of Generic Runtimes
    • Sparse Supernodal Solver Using Hierarchical Compression over Runtime System
    • Reordering Strategy for Blocking Optimization in Sparse Linear Solvers
    • Sparse Supernodal Solver Using Block Low-Rank Compression
    • Sparse Supernodal Solver Using Hierarchical Compression
    • Exploiting Kepler architecture in sparse direct solver with runtime systems
    • On the use of low rank approximations for sparse direct solvers
    • Overview of Task-based Sparse and Data-sparse Solvers on Top of Runtime Systems
    • Exploiting H-Matrices in Sparse Direct Solvers
    • Impact of Blocking Strategies for Sparse Direct Solvers on Top of Generic Runtimes
    • Reordering strategy for blocking optimization in sparse linear solvers
    • Optimizations of hybrid sparse linear solvers relying on Schur complement and domain decomposition approaches
    • Blocking strategy optimizations for sparse direct linear solver on heterogeneous architectures
    • On the design of parallel linear solvers for large scale problems
    • Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition
    • PaStiX: Parallel Sparse Matrix Package
    • Blocking strategy optimization for sparse direct linear solvers on heterogeneous architectures
    • Blocking strategy optimizations for sparse direct linear solver on heterogeneous architectures
    • On the use of H-Matrix Arithmetic in PaStiX: a Preliminary Study
    • 3D Cartesian Transport Sweep for Massively Parallel Architectures with PARSEC
    • Divide and Conquer Symmetric Tridiagonal Eigensolver for Multicore Architectures
    • Simul'Elec and PASTIX interface specifications
    • Solveurs Directs
    • A task-based sparse direct solver suited for large scale hierarchical/heterogeneous architectures
    • Benchmarking of the linear solver PaStiX for integration in LESCAPE
    • Biodiversiton : application du HPC à l'étude de la biodiversit
    • Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition
    • Scheduling and memory optimizations for sparse direct solver on multi-core/multi-gpu duster systems
    • Etude de la factorisation directe hétŕogène et de la factorisation incomplt̀e sur solveur PaStiX appliqu'ś `d̀es syst`es̀ issus de probl`em ̀du CEA/CESTA
    • On the design of parallel linear solvers for large scale problems
    • An improved recursive graph bipartitioning algorithm for well balanced domain decomposition
    • Adaptive mesh refinement for numerical simulation of MHD instabilities in tokamaks: JOREK code
    • Distributed sparse matrix factorization on top of tasks based runtime systems
    • Toward parallel scalable linear solvers suited for large scale hierarchical parallel platforms
    • An improved recursive graph bipartitioning algorithm for well balanced domain decomposition
    • Parallel 3D Sweep Kernel with PARSEC
    • Task-based linear solvers for modern architectures
    • 3D Cartesian Transport Sweep for Massively Parallel Architectures on top of PaRSEC
    • Fast Algorithms for Dense Linear Algebra
    • Fast Algorithms for Dense Linear Algebra
    • Fast direct linear solvers for the boundary element method
    • From hybrid architectures to hybrid solvers
    • Nested Dissection with Balanced Halo
    • Toward parallel scalable linear solvers suited for large scale hierarchical parallel platforms
    • 3D Cartesian Transport Sweep for Massively Parallel Architectures on top of PaRSEC
    • Taking advantage of hybrid systems for sparse direct solvers via task-based runtimes
    • Solveurs Directs
    • Hybrid methods, Hybrid architectures, Hybrid compressions for sparse direct solvers
    • Taking advantage of hybrid systems for sparse direct solvers via task-based runtimes
    • Hybrid methods, Hybrid architectures, Hybrid compressions for sparse direct solvers
    • Parallel Numerical Solvers on top of Runtime Systems
    • Sparse Linear Algebra over DAG Runtimes
    • Shared Memory Parallelism for 3D Cartesian Discrete Ordinates Solver
    • From hybrid architectures to hybrid solvers
    • From hybrid architectures to hybrid solvers
    • Méthodes directes et hybrides pour des solveurs creux adapatś aux machines multiCPUs/multiGPUs
    • Towards Domain Decomposition with Balanced Halo
    • Work stealing and granularity optimizations for a sparse solver on manycores
    • Augmentation and Deflation in Krylov subspace methods
    • Solveurs Directs
    • Deflation and augmentation techniques in Krylov lienar solvers
    • Sparse Linear Algebra over DAG Runtimes
    • Developments in Parallel, Distributed, Grid and Cloud Computing for Engineering
    • Matrices over Runtime Systems at Exascale
    • Scheduling for Sparse Solver on Manycore Architectures
    • Sparse direct solver on top of large-scale multicore systems with GPU accelerators
    • Sparse direct solvers with accelerators over DAG runtimes
    • Memory Optimization to Build a Schur Complement
    • Sparse direct solver on top of large-scale multicore systems with GPU accelerators
    • Toward a supernodal sparse direct solver over DAG runtimes
    • Fine Grain Scheduling for Sparse Solver on Manycore Architectures
    • Memory Optimization to Build a Schur Complement in an Hybrid Solver
    • Résolution des systèmes lináires sur calculateurs p'áflopiques
    • Sparse direct solvers with accelerators over DAG runtimes
    • Conception d'un solveur haute performance de systèmes linéaires creux couplant des mt́hodes multigrilles et directes pour la r'ólution des 'eátions de Maxwell 3D en r'egé harmonique discr'eti'́ees ŕ 'el'eńtsínis
    • PaStiX: sparse direct/hybrid solver on many CPU/GPU clusters
    • Solveurs Directs
    • Linear algebra and sparse direct methods
    • Efficient parallel resolution of the simplified transport equations in mixed-dual formulation
    • Ordonnancement dynamique dans le solveur PaStiX pour des machines NUMA et multicoeurs
    • Scalable direct and iterative solvers
    • Development of an International Matrix-Solver Prediction System on a French-Japanese International Grid Computing Environment
    • Formation Parallélisme
    • Scalable direct and iterative solvers
    • Domain decomposition method for the Simplified Transport Equation in neutronic
    • A NUMA Aware Scheduler for a Parallel Sparse Direct Solver
    • Design of a parallel hybrid direct/iterative sparse linear solver
    • Static-Dynamic Hybrid Scheduling in sparse linear algebra for large clusters of NUMA and multi-cores architectures
    • Dynamic Scheduling for Sparse Direct Solver on NUMA and Multicore Architectures
    • Vers un solveur de systèmes linéaires creux adapt ́aux machines NUMA
    • Dynamic Scheduling for Sparse Direct Solver on NUMA and Multicore Architectures
    • Non-Linear MHD simulations of Edge Localised Modes
    • A Non Overlapping Parallel Domain Decomposition Method Applied to The Simplified Transport Equations
    • A NUMA Aware Scheduler for a Parallel Sparse Direct Solver
    • Non-linear MHD simulations of edge localized modes (ELMs)
    • Numerical simulation of unsteady MHD flows and applications
    • Résolution de Systèmes Lináires, Algorithmes et Parall'ísme
    • Numerical simulation of tokamak plasmas
    • A domain decomposition method applied to the simplified transport equations
    • A supernode amalgamation algorithm for an efficient block incomplete factorization
    • A Domain Decomposition Method Applied to Large Eigenvalue Problems in Neutron Physics
    • A NUMA Aware Scheduler for a Parallel Sparse Direct Solver
    • Non-Linear MHD code developement for ELM simulations
    • Toward an International Sparse Linear Algebra Expert System by Interconnecting the ITBL Computational Grid with the Grid-TLSE Platform
    • Tunable parallel experiments in a GridRPC framework: application to linear solvers
    • Dynamic Scheduling for sparse direct Solver on NUMA architectures
    • On finding approximate supernodes for an efficient ILU(k) factorization
    • A supernode amalgamation algorithm for an efficient block incomplete factorization
    • High performances methods for solving large sparse linear systems - Direct and Incomplete Factorization
    • Improvement of existing solvers for the simulation of MHD instabilities
    • Optimisation des performances des outils de calcul de neutronique des coeurs
    • Méthodes directes hautes performances de rśolution en algèbre lin'íre creuse
    • Efficient solution technique for low Mach number compressible multiphase problems
    • On finding approximate supernodes for an efficient ILU(k) factorization
    • Partitioning and Blocking Issues for a Parallel Incomplete Factorization
    • A Parallel Multilevel ILU Factorization based on a Hierarchical Graph Decomposition
    • On using an hybrid MPI-Thread programming for the implementation of a parallel sparse direct solver on a network of SMP nodes
    • Blocking Issues for an Efficient Parallel Block ILU Preconditioner
    • Etude de faisabilité pour la parallĺisation d'un code de m'ánique des fluides en version non structur'e
    • Evaluation des performances de la version SMP du solveur PaStiX de la chaine logicielle EMILIO dans l'environnement du code ODYSSEE
    • Intégration dans ODYSSEE de la chaine logicielle EMILIO
    • Parallel Complete and Incomplete Blockwise Factorisations for Very Large Sparse Systems
    • A Blockwise Algorithm for Parallel Incomplete Cholesky Factorization
    • Using of the High Performance Sparse Solver PaStiX for the Complex Multiscale 3D Simulations performed by the FluidBox Fluid Mechanics Software
    • Applying parallel direct solver skills to build robust and highly performant preconditioners
    • High Performance Complete and Incomplete Factorizations for Very Large Sparse Systems by using Scotch and PaStiX softwares
    • Développement de la phase d'assemblage de la chaîne EMILIO (distribution du maillage et multi-threading)
    • Etude sur l'applicabilité de mt́hodes it'átives nouvelles aux problèmes du CESTA
    • A Parallel ILU factorization based on a Hierarchical Interface Decomposition algorithm
    • Towards High Performance Hybrid Direct-Iterative Solvers for Large Sparse Systems
    • Asymptotically optimal algorithm for Laplace task graphs on heterogeneous platforms
    • Efficient algorithms for direct resolution of large sparse system on clusters of SMP nodes
    • An efficient hybrid MPI/Thread implementation on a network of SMP nodes for the parallel sparse direct solver PaStix: ordering / scheduling / memory managment / out-of-core issues, and application to preconditioning
    • PHIDAL: A Parallel Hierarchical Interface Decomposition Algorithm for solving sparse linear systems
    • Outils numériques parallèles pour la rśolution de trs̀ grands probl`ès d''éctromagn'eśme
    • A Parallel Direct Solver for Very Large Sparse SPD Systems
    • Amélioration et Extension du Solveur Direct Parallèle pour Grandes Matrices Creuses du CESTA
    • Développement de la phase d'assemblage de la chaîne EMILIO pour un solveur parallèle 2D
    • Optimization of a kinetic laser-plasma interaction code for large parallel systems
    • Modélisation de pipelines ht́'ógènes
    • A Parallel Direct Solver for Very Large Sparse SPD Systems
    • Optimisation of a kinetic laser-plasma interaction code for massively parallel systems
    • Parallel factorization of very large sparse SPD systems on a network of SMP nodes
    • Optimisation de l'occupation mémoire pour un solveur parallèle creux direct hautes performances de type supernodal
    • PaStiX: A High-Performance Parallel Direct Solver for Sparse Symmetric Definite Systems
    • Distribution des Données et Rǵulation Statique des Calculs et des Communications pour la R'ólution de Grands Systèmes Lin'eŕes Creux par M'etd́e Directe
    • Scilab to Scilab//, the OURAGAN Project
    • PaStiX: Un solveur parallèle direct pour des matrices creuses symétriques df́inies positives bas'śur un ordonnancement statique performant et sur une gestion m'eíre efficace
    • PaStiX: A Parallel Direct Solver for Sparse SPD Matrices based on Efficient Static Scheduling and Memory Managment
    • Analyse et Etude de Faisabilité de la Rśolution par M'h́ode Directe sur Machine Parallèle de Grands Systm̀es Lin'eŕes Sym'etq́ues D'efiś positifs pour des Probl`ès d''Elecómagn'etismávec Couplage 'El'emt́s ńis -- 'EquationÍnt'egrales
    • Mise en oeuvre d'une Bibliothèque d'Outils pour la Résolution par Mt́hode Directe de Grands Systm̀es Lin'íres Creux Sym'eíques D'efís Positifs sur Machine Parall`è
    • Algèbre Linéaire Creuse Hautes Performances : Application ̀la Ḿ̧anique des Structures
    • Mise en øe uvre d'une Bibliothèque d'Outils pour la Résolution Paralll̀e Hautes Performances par Mt́hode Directe de Grands Syst`ès Lin'íres Creux et application `aǹ Code de M'eńique des Structures
    • Résolution parallèle de grands systm̀es lináires creux
    • Description of the EMILIO Software Processing Chain and Application to Structural Mechanics
    • PaStiX: A High-Performance Parallel Direct Solver for Sparse Symmetric Definite Systems
    • Parallel Sparse Linear Algebra and Application to Structural Mechanics
    • PaStiX: A Parallel Sparse Direct Solver Based on a Static Scheduling for Mixed 1D/2D Block Distributions
    • A scalable parallel assembly for irregular meshes based on a block distribution for a parallel block direct solver
    • Assemblage parallèle d'une matrice et/ou d'un second membre: Application ̀la Parallélisation d'un Code de Ḿ̧anique des Structures
    • Mise en oeuvre d'une Bibliothèque d'Outils pour la Résolution par Mt́hode Directe de Grands Systm̀es Lin'íres Creux Sym'eíques D'efís Positifs sur Machine Parall`è
    • Optimisation de la Communication et de la Distribution des Données pour des Solveurs Parallèles Directs en Algb̀re Lináire Dense et Creuse
    • Parallel Sparse Linear Algebra and Application to Structural Mechanics
    • A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization
    • Algèbre Linéaire Creuse Paralll̀e pour les Mt́hodes Directes : Application `l̀a Parall'ísation d'un Code de M'eńique des Structures
    • Mise en oeuvre d'une Bibliothèque d'Outils pour la Résolution par Mt́hode Directe de Grands Systm̀es Lin'íres Creux Sym'eíques D'efís Positifs sur Machine Parall`è
    • Mise en oeuvre d'une Bibliothèque d'Outils pour la Résolution par Mt́hode Directe de Grands Systm̀es Lin'íres Creux Sym'eíques D'efís Positifs sur Machine Parall`è
    • Parallel Sparse Linear Algebra and Application to Structural Mechanics
    • Mise en oeuvre d'une Bibliothèque d'Outils pour la Résolution par Mt́hode Directe de Grands Systm̀es Lin'íres Creux Sym'eíques D'efís Positifs sur Machine Parall`è
    • Calcul de la suite optimale de taille de paquets pour la factorisation de Cholesky
    • Optimisation des Communications et Régulation de Charge pour la Rśolution par M'h́ode Directe de Grands Systèmes Lin'eŕes Creux
    • Calcul de la taille optimale des paquets pour les algorithmes macro-pipelines
    • Optimal Grain Size Computation for Pipelined Algorithms
  • Projects
    • Chameleon
    • SolverStack
    • PaStiX
    • SPM
  • Experience
  • Publications HAL

Memory Optimization to Build a Schur Complement

Jun 1, 2012·
A. Casadei
,
P. Ramet
· 1 min read
PDF
Type
Conference paper
Publication
SIAM Conference on Applied Linear Algebra
publications

Add the full text or supplementary notes for the publication here using Markdown formatting.

Last updated on Jun 1, 2012
Sparse
← Sparse direct solvers with accelerators over DAG runtimes Jul 1, 2012
Sparse direct solver on top of large-scale multicore systems with GPU accelerators Jun 1, 2012 →

© 2026 Bordeaux University - Inria.

Made with Hugo Blox — Open Source. Build yours →