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

Team members

Last publications

  • 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⟩

    ParSys

    Year of publication

    Available in free access

    HAL publication

  • Traduction

    Pierre Jehel, Stéphane Vialle. Collaborative Platform for Railway Projects – Business Needs Analysis and Their Formalization as Functional Requirements. 2023. ⟨hal-05371720⟩

    ParSys

    Year of publication

    Available in free access

    HAL publication

  • Thèse

    Sylvain Joube. Portable Performance for High Throughput Computing. Other [cs.OH]. Université Paris-Saclay, 2025. English. ⟨NNT : 2025UPASG063⟩. ⟨tel-05418502⟩

    ParSys

    Year of publication

    Available in free access

    HAL publication

  • 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⟩

    ParSys

    Year of publication

    HAL publication

  • 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⟩

    ParSys

    Year of publication

    Available in free access

    HAL publication

  • Pré-publication, Document de travail

    Joffroy Beauquier, Aijia Guan. Pool Games. 2025. ⟨hal-05372921⟩

    ParSys

    Year of publication

    Available in free access

    HAL publication

  • Communication dans un congrès

    Pierre Fraigniaud, Minh Hang Nguyen, AmiArchitectures et modèles pour l'Interaction Paz. Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure. 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Mar 2025, Jena, Germany. ⟨10.4230/LIPIcs.STACS.2025.34⟩. ⟨hal-05249104⟩

    ParSys

    Year of publication

    Available in free access

    HAL publication

  • Communication dans un congrès

    Atte Torri, Przemysław Dominikowski, Brice Pointal, Oguz Kaya, Laércio Lima Pilla, et al.. Near-Optimal Contraction Strategies for the Scalar Product in the Tensor-Train Format. Euro-Par 2025 – 31 International European Conference on Parallel and Distributed Computing, Aug 2025, Dresden, Germany. pp.63-77, ⟨10.1007/978-3-031-99872-0_5⟩. ⟨hal-05285400⟩

    ParSys

    Year of publication

    Available in free access

    HAL publication

All Publications