index - Systèmes Parallèles

Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

107

Publications récentes

 

 

Cartographie des collaborations du LISN