ParSys

Parallel Systems- ParSys

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.

Coordination

Last publications

  • Pré-publication, Document de travail

    Gabrielidis Hugo, Filippo Gatti, Vialle Stephane. Physics-Based Super-Resolved Simulation of 3D Elastic Wave Propagation Adopting Scalable Diffusion Transformer. 2025. ⟨hal-05044913⟩

    ParSys

    Year of publication

    Available in free access

  • N°spécial de revue/special issue

    Julien Rauch, Damien Rontani, Stéphane Vialle. Data clustering on hybrid classical-quantum NISQ architecture with generative-based variational and parallel algorithms. Journal of Systems Architecture, 2025. ⟨hal-05040633⟩

    ParSys

    Year of publication

  • N°spécial de revue/special issue

    Guanlin He, Marc Baboulin, Stéphane Vialle. Generating Sparse Matrices for Large-scale Spectral Clustering on a Single GPU. International Journal of Parallel Programming, 2025. ⟨hal-05040711⟩

    ParSys

    Year of publication

  • Pré-publication, Document de travail

    Niccolò Perrone, Fanny Lehmann, Hugo Gabrielidis, Stefania Fresca, Filippo Gatti. Integrating Fourier Neural Operators with Diffusion Models to improve Spectral Representation of Synthetic Earthquake Ground Motion Response. 2025. ⟨hal-05016980⟩

    ParSys

    Year of publication

    Available in free access

  • Thèse

    Fabricio Cravo. Design of Distributed Biological Circuits. Bioinformatics [q-bio.QM]. Université Paris-Saclay, 2024. English. ⟨NNT : 2024UPASG059⟩. ⟨tel-05007253⟩

    ParSys

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Marc Baboulin, Oguz Kaya, Theo Mary, Matthieu Robeyns. Numerical stability of tree tensor network operations, and a stable rounding algorithm. 2025. ⟨hal-04996127⟩

    ParSys

    Year of publication

    Available in free access

  • Thèse

    Matthieu Robeyns. Mixed precision algorithms for low-rank matrix and tensor approximations. Computer Science [cs]. Université Paris-Saclay, 2024. English. ⟨NNT : 2024UPASG095⟩. ⟨tel-04885863⟩

    ParSys, ParSys

    Year of publication

    Available in free access

  • Communication dans un congrès

    Brice Chichereau, Stéphane Vialle, Patrick Carribault. Fully integrated quantum method for classical register allocation in LLVM. WIHPQC 2024 – International Workshop on Integrating High-Performance and Quantum Computing and QXE24 – IEEE Quantum Week 2024, Sep 2024, Montréal, Canada. ⟨10.1109/QCE60285.2024.10295⟩. ⟨hal-04839424⟩

    ParSys

    Year of publication

    Available in free access

  • Communication dans un congrès

    Julien Rauch, Brice Chichereau, Stéphane Vialle, Patrick Carribault, Damien Rontani. Investigating parallel execution of quantum Machine Learning circuits on superconducting hardware. QSET 2024 – 4th International Workshop on Quantum Software Engineering and Technology IEEE Quantum Week 2024 (QCE’24), Sep 2024, Montréal, Canada. ⟨10.1109/QCE60285.2024.10278⟩. ⟨hal-04812905⟩

    ParSys

    Year of publication

    Available in free access