Loading...
Derniers dépôts
Répartition par type de publications
widget_cloud
Fast multipole method
BEM
Memory footprint
Adaptation de maillage
Discontinuous Galerkin method
Automatic recognition
Multicore Processing
Bandwidth
Turbulence
Parallelism
Discrete velocity model
Uncertainty Quantification
Deep learning
Fault tolerance
Runtime system
DAG based runtime
Fast multipole methods
FMM
Scheduling
Load balancing
Sparse linear solver
Dense linear algebra
Algorithmic
Level-set
Gradient Conjugué
Distributed computing
Routing
Mesh adaptation
Simulation
Accelerators
High performance computing
Task-based programming
Sparse direct solver
Optical mapping
Pipeline
High order scheme
Accelerator
Starpu-simgrid
Numerical detection
Sensibilité
Memory Contention
Runtime
Sensitivity
Collision model
AVX-512
Pénalisation
Penalization method
Robust optimization
ALE Arbitrtary Lagrangian Eulerian
Penalization
Heterogeneous architecture
Détection numérique
Asymptotic analysis
Integer programming
Multicore
Column Generation
Inverse problem
Placement
Cutting and Packing
Absorbing Boundary Conditions
HPC
Multicore architectures
Robustness
Modeling
Exascale
Fluid mechanics
Locality
Topology
Analyse numérique
Task graph
Task-based
Cholesky factorization
Bit-flip
Domain decomposition
Programming model
MPI
Soft-erreur
Conjugate Gradient method
Aetiological lithiasis
Fish-like swimming
StarPU
Cholesky Factorization
NUMA
Algorithms
Sparse direct solvers
Predictive Models
Hybrid parallelization
Multicore architecture
Heterogeneous architectures
OpenMP
Data locality
Robustesse
LU factorization
Optimal transportation
Branch-cut-and-price
BGK model
Low-rank compression
GPU
Block low-rank compression
Heterogeneous computing