The ParSys team is specialized in high performance computing and the theoretical and implementation aspects of distributed algorithms.
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.
Communication dans un congrès, Communication dans un congrès
Julien Rauch, Damien Rontani, Stéphane Vialle. Towards a Quantum Generative Graph-Based Clustering for Molecule Discovery. Quest-IS, Dec 2025, Palaiseau, France. pp.243-251, ⟨10.1007/978-3-032-13855-2_22⟩. ⟨hal-05549507⟩
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⟩
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⟩
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⟩
Pierre Jehel, Stéphane Vialle. Collaborative Platform for Railway Projects – Business Needs Analysis and Their Formalization as Functional Requirements. 2023. ⟨hal-05371720⟩