Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This project aims at building a dynamic and scalable framework for Byzantine fault tolerant distributed computation. By organizing nodes of a distributed system in fault-tolerant clusters, we mask Byzantine failures of single nodes and provide an abstractions of reliable and highly available units at the level of these clusters.
Jean-Paul Richard Kneib, Benjamin Yvan Alexandre Clement, Benjamin Emmanuel Nicolas Beauchesne, Mathilde Jauzac, Johan Richard
Jean-Paul Richard Kneib, Pascale Jablonka, David Richard Harvey, Benjamin Yvan Alexandre Clement, Mathilde Jauzac, Huanyuan Shan, Hakim Atek, Anja Von der Linden, Matthieu Schaller, Céline Tchernin, Richard Massey, Johan Richard