Research Themes
The team’s activity also involves the use of state-of-the-art parallel architectures to achieve optimal performance of codes developed for future exascale platforms. In addition, drawing inspiration from natural, efficient and robust phenomena, the team studies natural distributed algorithms to design efficient solutions for emerging networks, and even to develop robust distributed circuits in bacterial cell consortia, for computational or medical purposes (biological computers, smart drugs, etc.).
The main challenges concerning the algorithms studied in the ParSys team are: performance optimization, scaling and load balancing, fault tolerance and energy saving.
The applications (ranging from scientific computing, quantum computing and data analysis to network protocols and microbiological circuits) meet essential industrial or scientific needs and are the subject of industrial cooperation with ATOS-Bull, Total, and EdF, among others.
-
Algorithmes, apprentissage et calcul
ParSys
Professor
Head of ParSys team
-
Article dans une revue
Hugo Gabrielidis, Filippo Gatti, Stéphane Vialle. Physics-based super-resolved simulation of 3D elastic wave propagation adopting scalable diffusion transformer. Computer Physics Communications, 2026, 320, pp.109930. ⟨10.1016/j.cpc.2025.109930⟩. ⟨hal-05485963⟩
-
Communication dans un congrès
Joseph Touzet, Oguz Kaya, Pablo Arrighi, Amélia Durbec. QUIDS: A Large-Scale Distributed Framework for Quantum Irregular Dynamics Simulations. Q-CASA 2025 – IPDPS Workshop on Quantum Computing Algorithms, Systems, and Applications, Jun 2025, Milan, Italy. pp.491-500, ⟨10.1109/IPDPSW66978.2025.00080⟩. ⟨hal-05472605⟩
-
Communication dans un congrès
Brice Chichereau, Stéphane Vialle, Miwako Tsuji, Patrick Carribault, Mitsuhisa Sato. HPCQCMark: a new modular HPC-QC benchmarking framework. 2025 IEEE International Conference on Quantum Computing and Engineering (QCE), Aug 2025, Albuquerque, United States. pp.8-14, ⟨10.1109/QCE65121.2025.10285⟩. ⟨hal-05426530⟩
-
Communication dans un congrès
Pierre Fraigniaud, Minh Hang Nguyen, AmiArchitectures et modèles pour l'Interaction Paz. A Simple Lower Bound for Set Agreement in Dynamic Networks. 2025 Symposium on Simplicity in Algorithms (SOSA), Jan 2025, New Orleans, United States. pp.253-262, ⟨10.1137/1.9781611978315.20⟩. ⟨hal-05403931⟩
-
Traduction
Pierre Jehel, Stéphane Vialle. Collaborative Platform for Railway Projects – Business Needs Analysis and Their Formalization as Functional Requirements. 2023. ⟨hal-05371720⟩
-
Thèse
Sylvain Joube. Portable Performance for High Throughput Computing. Other [cs.OH]. Université Paris-Saclay, 2025. English. ⟨NNT : 2025UPASG063⟩. ⟨tel-05418502⟩
-
Pré-publication, Document de travail
-
Communication dans un congrès
Hagit Attiya, Pierre Fraigniaud, AmiArchitectures et modèles pour l'Interaction Paz, Sergio Rajsbaum. On the Existence of Extension-Based Proofs of Impossibility for Set-Agreement. SIROCCO 2025 – Structural Information and Communication Complexity, Jun 2025, Delphi, Greece. pp.56-73, ⟨10.1007/978-3-031-91736-3_4⟩. ⟨hal-05403686⟩
-
Communication dans un congrès
Hagit Attiya, Pierre Fraigniaud, AmiArchitectures et modèles pour l'Interaction Paz, Sergio Rajsbaum. Solvability Characterization for General Three-Process Tasks. PODC ’25: ACM Symposium on Principles of Distributed Computing, Jun 2025, Huatulco, Mexico. pp.488-498, ⟨10.1145/3732772.3733548⟩. ⟨hal-05403672⟩
-
Pré-publication, Document de travail
Joffroy Beauquier, Aijia Guan. Pool Games. 2025. ⟨hal-05372921⟩