index - Systèmes Parallèles Accéder directement au contenu

Mots-clés

Parallel code optimization 65Y10 GPU computing Graphics processing units Système complexe Distributed Algorithms Connected component analysis Tight lower bounds B0 FMI standard Approximation Consensus Spectral clustering Tucker decomposition Lower bounds Oblivious message adversaries Mobile agents Condition number MAGMA library Scheduling Low-rank approximations Leader election 65F55 Hardware Architecture csAR Costs Algorithme des k-Moyennes Linear least squares Global and weak fairness Wireless sensor network Quantum computation Pheromone Parallel skeletons Qubit Networks Navier-Stokes equations Wireless networks Self-stabilization Accelerator Calcul haute performance GPU Mixed precision algorithms Clock synchronization Quantum computing Interval analysis Linear reversible circuits SIMD Theory of computation → Distributed algorithms Machine learning Mobile Agents HPC 65F45 Performance Statistical condition estimation Treasure Hunt Generic programming Randomization High-performance computing Analyse d'erreur inverse Generative programming Agile research and development Interference control Access pattern detection Population protocols 65Y05 ARMS Iterative refinement Deterministic naming SIMD extension Emerging Technologies csET Time complexity FOS Computer and information sciences Benchmark Randomized algorithms Search C++ Parallel computing Algorithmique distribuée Dynamic networks ADI Algorithmes randomisés Graph algorithms Localization B7 Asymptotic consensus Partial diagonalization LSCR Deterministic algorithms Beeping model LU factorization Algorithmes distribués CP decomposition Networks of passively mobile agents Evaporation Gathering Approximate consensus Distributed algorithms Exact space complexity ADI method Exploration Linear systems

 

Références bibliographiques

75

Dépôts avec texte intégral

103

Publications récentes

 

 

Cartographie des collaborations du LISN