index - Systèmes Parallèles

Mots-clés

Parallel computing Generic programming GPU computing B0 Asymptotic consensus Iterative refinement Navier-Stokes equations Search FOS Computer and information sciences C++ Condition number Distributed graph algorithms Graphics processing units Dynamic networks Benchmark Parallel code optimization Hardware Architecture csAR Interference control Topology Deterministic algorithms Generative programming Fault tolerance Exact space complexity Système complexe Quantum Computing Applications Theory of computation → Distributed algorithms HPC Machine learning Graph algorithms Linear systems Programmation générique SIMD extension MAGMA library Approximate consensus Oblivious message adversaries Mixed precision algorithms Compiler Optimization Wireless networks Register Allocation High-performance computing Approximation Deterministic naming Domain-specific language Optimization Networks Deep Learning Scheduling Quantum computing Parallel skeletons CP decomposition Gathering Clock synchronization Performance Calcul haute performance FMI standard Crash failures Spectral clustering Tight lower bounds Costs Time complexity Tucker decomposition Programmation générative SIMD GPU Interval analysis Evaporation Exploration Statistical condition estimation Mobile agents Population protocols Self-stabilization Distributed algorithms Low-rank approximations Lower bounds Localization Consensus Connected component analysis LSCR Partial diagonalization B7 Pheromone Leader election Linear reversible circuits Mobile Agents Distributed Algorithms Linear least squares LU factorization Beeping model Combinatorial topology Randomization Qubit Quantum computation Randomized algorithms Wait-free computing Treasure Hunt Networks of passively mobile agents Compilation Emerging Technologies csET Wireless sensor network Global and weak fairness

 

Références bibliographiques

75

Dépôts avec texte intégral

115

Publications récentes

 

 

Cartographie des collaborations du LISN