Distributed Computing Laboratory DCL

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
education [2019/04/05 16:10]
mmonti
education [2019/04/05 16:11] (current)
mmonti
Line 23: Line 23:
 DCL offers master projects in the following areas: DCL offers master projects in the following areas:
  
-  * **Probabilistic Byzantine Resilience**: ​ Development of high-performance,​ Byzantine-resilient distributed systems with provable probabilistic guarantees. Two options are currently available, both building on previous work on probabilistic Byzantine broadcast: (i) a theoretical project, focused the correctness of probabilistic Byzantine-tolerant distributed algorithms; (ii) a practical project, focused on numerically evaluating of our theoretical results. Please contact [[mailto:matteo.monti@epfl.ch|Matteo Monti]] to get more information.+  * **Probabilistic Byzantine Resilience**: ​ Development of high-performance,​ Byzantine-resilient distributed systems with provable probabilistic guarantees. Two options are currently available, both building on previous work on probabilistic Byzantine broadcast: (i) a theoretical project, focused the correctness of probabilistic Byzantine-tolerant distributed algorithms; (ii) a practical project, focused on numerically evaluating of our theoretical results. Please contact [[matteo.monti@epfl.ch|Matteo Monti]] to get more information.
  
   * **Dynamically Distributed Spatial Indexing**: ​ a project here would consist in studying existing spatial index data structures and algorithms, e.g., simple grids, Quadtrees, R-Trees etc., and how they may be dynamically distributed for indexing a large number of moving objects; please contact [[mailto:​benoit.garbinato@unil.ch|Benoit Garbinato]] to get more information.   * **Dynamically Distributed Spatial Indexing**: ​ a project here would consist in studying existing spatial index data structures and algorithms, e.g., simple grids, Quadtrees, R-Trees etc., and how they may be dynamically distributed for indexing a large number of moving objects; please contact [[mailto:​benoit.garbinato@unil.ch|Benoit Garbinato]] to get more information.