Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
education [2019/05/24 16:57] fablpd |
education [2019/05/24 16:59] fablpd |
||
|---|---|---|---|
| Line 10: | Line 10: | ||
| * [[education/ca_2018|Concurrent Algorithms]] (theory & practice) | * [[education/ca_2018|Concurrent Algorithms]] (theory & practice) | ||
| * [[education/da|Distributed Algorithms]] (theory & practice) | * [[education/da|Distributed Algorithms]] (theory & practice) | ||
| + | \\ | ||
| The lab taught in the past the following courses: | The lab taught in the past the following courses: | ||
| Line 28: | Line 28: | ||
| * **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. | * **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. | ||
| - | |||
| - | |||
| - | * **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. | ||
| - | * **[[Distributed ML|Distributed Machine Learning]]** | + | |
| * **Distributed and Fault-tolerant algorithms**: projects here would consist in designing failure detection mechanisms suited for large-scale systems, real-time systems, and systems with unreliable communication or partial synchrony. This task also involves implementing, evaluating, and simulating the performance of the developed mechanisms to verify the achievable guarantees; please contact [[http://people.epfl.ch/david.kozhaya|David Kozhaya]] to get more information. | * **Distributed and Fault-tolerant algorithms**: projects here would consist in designing failure detection mechanisms suited for large-scale systems, real-time systems, and systems with unreliable communication or partial synchrony. This task also involves implementing, evaluating, and simulating the performance of the developed mechanisms to verify the achievable guarantees; please contact [[http://people.epfl.ch/david.kozhaya|David Kozhaya]] to get more information. | ||