Data Structures of the Future: Concurrent, Optimistic, and Relaxed
Staff - Faculty of Informatics
Start date: 4 April 2017
End date: 5 April 2017
|
|||||||||||
|
|||||||||||
Abstract: |
|||||||||||
A central computing trend over the last decade has been the need to process increasingly larger amounts of data as efficiently as possible.This development is challenging both software and hardware design, and is altering the way data structures and algorithms are constructed, implemented, and deployed. In this talk, I will present some examples of such new data structure design ideas and implementations. In particular, I will discuss some inherent limitations of parallelizing classic data structures, and then focus on approaches to circumvent these limitations. The first approach is to relax the algorithm semantics, to allow for approximation, |
|||||||||||
|
|||||||||||
Biography: |
|||||||||||
Dan Alistarh is an Assistant Professor at IST Austria, currently visiting ETH Zurich on an SNF Ambizione Fellowship. Previously, he was a Researcher at Microsoft Research, Cambridge, UK, and a Postdoctoral Associate at MIT CSAIL. He received his PhD from the EPFL, under the guidance of Prof. Rachid Guerraoui. |
|||||||||||
|
|||||||||||
|