At the turn of the 21st century, a significant breakthrough has been achieved in distributed computing, by analyzing computation using tools from combinatorial topology. The topological approach led to numerous outstanding results regarding the design and analysis of distributed algorithms for a large class of tasks, and a large variety of models. However, the “topological revolution” mostly impacted shared memory computing models, while the models related to distributed computing in networks, and the tasks related to graph problems were left aside. As a result, despite tremendous progress, the techniques used in distributed network computing, for both lower and upper bounds, remain ad hoc, and a global conceptual understanding of computing in networks is still missing. Thanks to the use of algebraic topology, the project DUCAT aims at providing distributed network computing with the same conceptual benefits and generic tools as the ones obtained by distributed shared memory computing.

Full description of the project


Reference: ANR-20-CE48-0006


Permanent Academic Members

Scientific meetings