index - Systèmes Parallèles

Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

115

Publications récentes

 

 

Cartographie des collaborations du LISN