Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
education [2019/03/28 18:02]
zablotch
education [2019/05/24 16:59]
fablpd
Line 3: Line 3:
 ====== Education ====== ====== Education ======
  
 +\\
  
 The lab is teaching the following courses: The lab is teaching the following courses:
 \\ \\
 +
 +  * [[education/​ca_2018|Concurrent Algorithms]] (theory & practice)
 +  * [[education/​da|Distributed Algorithms]] (theory & practice)
 \\ \\
-  * [[education/​ca_2018|Concurrent Algorithms]] +The lab taught in the past the following courses: 
-  * [[education/​da|Distributed Algorithms]]+
   * <​html><​a href="​http://​moodle.epfl.ch/​course/​view.php?​id=14044">​Information,​ Calcul et Communication</​a></​html>​   * <​html><​a href="​http://​moodle.epfl.ch/​course/​view.php?​id=14044">​Information,​ Calcul et Communication</​a></​html>​
   * <​html><​a href="​http://​cowww.epfl.ch/​proginfo/​wwwhiver/">​Introduction à la Programmation Orientée Objet</​a></​html>​   * <​html><​a href="​http://​cowww.epfl.ch/​proginfo/​wwwhiver/">​Introduction à la Programmation Orientée Objet</​a></​html>​
Line 23: Line 26:
 DCL offers master projects in the following areas: DCL offers master projects in the following areas:
  
-  * **Dynamically Distributed Spatial Indexing**:  ​a project here would consist in studying existing spatial index data structures and algorithmse.g., simple gridsQuadtrees, R-Trees etc., and how they may be dynamically ​distributed ​for indexing ​large number ​of moving objects; please ​contact [[mailto:​benoit.garbinato@unil.ch|Benoit Garbinato]] to get more information.+  * **Probabilistic Byzantine Resilience**:  ​Development of high-performanceByzantine-resilient distributed systems with provable probabilistic guaranteesTwo options are currently availableboth building on previous work on probabilistic Byzantine broadcast: (i) a theoretical projectfocused the correctness of probabilistic Byzantine-tolerant ​distributed ​algorithms; (ii) practical project, focused on numerically evaluating ​of our theoretical results. Please ​contact [[matteo.monti@epfl.ch|Matteo Monti]] to get more information.
  
- 
-  * **Multicore computing**:​ a project here would consist for instance in designing and implementing efficient lock-based or lock-free shared objects; please contact [[https://​people.epfl.ch/​igor.zablotchi|Igor Zablotchi]] to get more information. 
  
   * **Distributed computing using RDMA and/or NVRAM**: contact [[https://​people.epfl.ch/​igor.zablotchi|Igor Zablotchi]] for more information.   * **Distributed computing using RDMA and/or NVRAM**: contact [[https://​people.epfl.ch/​igor.zablotchi|Igor Zablotchi]] for more information.
- 
-  * **Dynamic distributed computing**:​ a project here would consist for instance in designing and implementing applications that would run in a simulation of a cloud with high churn, but possibly robust to arbitrary behavior of some of its components; please contact [[http://​people.epfl.ch/​matej.pavlovic|Matej Pavlovic]] to get more information. 
  
   * **[[Distributed ML|Distributed Machine Learning]]**   * **[[Distributed ML|Distributed Machine Learning]]**