index - Systèmes Parallèles

Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

115

Publications récentes

 

 

Cartographie des collaborations du LISN