Computing nowadays is inherently distributed. Be it a mainstream multi-core machine, a computing cluster, or a large-scale distributed service, a modern computing system involves multiple processes that concurrently perform independent computations and communicate to synchronize their activities. Understanding distributed computations is therefore essential to be competitive in practice or research in computer science.
The school will offer courses on a wide range of practical and theoretical aspects of distributed systems given by renowned experts in the field. The program will cover the following topics:
All talks will be given in English.
The school is open to anyone interested in theoretical and practical aspects of distributed computing. There are no special prerequisites, though the attendees are expected to have certain maturity in math and programming.
Maurice Herlihy has an A.B. in Mathematics from Harvard University, and a Ph.D. in Computer Science from M.I.T. He has served on the faculty of Carnegie Mellon University and the staff of DEC Cambridge Research Lab. He is the recipient of the 2003 Dijkstra Prize in Distributed Computing, the 2004 Gödel Prize in theoretical computer science, the 2008 ISCA influential paper award, the 2012 Edsger W. Dijkstra Prize, and the 2013 Wallace McDowell award. He received a 2012 Fulbright Distinguished Chair in the Natural Sciences and Engineering Lecturing Fellowship, and he is fellow of the ACM, a fellow of the National Academy of Inventors, the National Academy of Engineering, and the National Academy of Arts and Sciences.
Leslie B. Lamport is an American computer scientist. Lamport is best known for his seminal work in distributed systems and as the initial developer of the document preparation system LaTeX. Leslie Lamport was the winner of the 2013 Turing Award for imposing clear, well-defined coherence on the seemingly chaotic behavior of distributed computing systems, in which several autonomous computers communicate with each other by passing messages. He devised important algorithms and developed formal modeling and verification protocols that improve the quality of real distributed systems. These contributions have resulted in improved correctness, performance, and reliability of computer systems.
Michael L. Scott is the Arthur Gould Yates Professor of Engineering and past chair of the Department of Computer Science at the University of Rochester, in Rochester, NY, USA. He is a Fellow of the ACM and the IEEE, and a recipient of the 2006 SIGACT/SIGOPS Edsger W. Dijkstra Prize.
His textbook on programming language design and implementation (Programming Language Pragmatics, 4th ed., Morgan Kauffman, 2016) is used at more than 200 universities around the world.
In the java.util.concurrent library, he is a co-inventor of the ConcurrentLinkedQueue, Exchanger, and SynchronousQueue classes.
Ittai does research in Algorithms and Distributed Computing.
He is a founding member and Senior Researcher in the newly founded VMware Research Group. Prior to joining VMware, he was a Researcher in Microsoft Research Silicon Valley (2008-2014). He holds a PHd in Computer Science from the Hebrew University.
Ittai has a broad interest in the areas of algorithms and distributed computing. His work spans from the theory of algorithms through the foundations of distributed computing to practical aspects in industrial research, algorithm engineering and distributed systems.
Achour Mostefaoui is currently Professor at the Computer Science Department of the University of Nantes, France. He received his M.Sc. in computer science in 1991, and a Ph.D. in 1994 from the University of Rennes. He is co-head of the GDD research team within the LS2N Lab. He authored more than 150 research papers.
Trevor Brown is currently an assistant professor in the Cheriton School of Computer Science at the University of Waterloo. Before that, he was a postdoctoral researcher at the Institute of Science and Technology, Austria. Before that, he was a postdoctoral researcher at the Technion, Israel Institute of Technology. Before that, he was a PhD student at the University of Toronto.
Although Trevor was in the theory group at the University of Toronto, he would say that his work is closer to systems work than theory. He cares greatly about rigor, whether in theoretical or experimental work. His research currently revolves around concurrent data structures and non-uniform memory architectures. He is also interested in transactional memory, non-volatile memory, and memory allocation and reclamation.
Danny Hendler received his B.Sc. degree in Mathematics and Computer Science and his M.Sc. and Ph.D. degrees in Computer Science from Tel-Aviv University. In 2001 he returned to academia after spending 18 years in Israel's hi-tech industry, holding various technical and managerial positions. He joined the Department of Computer Science at Ben-Gurion University of the Negev in 2006 and is currently an Associate Professor in the department. Since 2014 he has served as the vice head of BGU's Cyber Security Research Center. His key research interests are distributed and parallel computation, cyber security, and complex network analysis.
Dan Alistarh is an Assistant Professor at IST Austria. His research focuses on concurrent data structures and distributed algorithms, and spans from algorithms and lower bounds to practical implementations.
Before IST, Dan was affiliated with ETH Zurich and Microsoft Research, Cambridge, UK. Prior to that, he was a Postdoctoral Associate at MIT CSAIL, working with Prof. Nir Shavit. He received his PhD from the EPFL, under the guidance of Prof. Rachid Guerraoui.
His research is supported through a 2018 ERC Starting Grant.
Eli Gafni received his first degree from the Technion, second from UIUC, and third from MIT, all in E.E. He was involved with the Internet in the early days when it consisted of only few nodes. Unlike his contemporaries in MIT, of which quite a few went on to become few hundred times Internet millionaires, he joined UCLA computer science department and abstracted the Internet to the point that he became even too theoretical for that discipline.
He received the Presidential Young Investigator award when he was young and promising. He still promises but ain't young any more. His claim to fame is for missing on the Godel award, for lack of Journal Version, leading one of the 3 teams which found the relationship between distributed computing and algebraic topology.
Nevertheless, with tenure, he is still a Professor at UCLA, holding forth that intellectual fun or the ability to roam perhaps aimlessly through intellectually challenging roads is the reason to be in university rather than Industry. He does not envy the millionaires, he is only partially responsible for the sorry financial state of the UC system, and most of his publications are still missing a Journal Version.
The program hasn't been finally approved yet, so there still might be some changes.
Click on the title to read the talk description. All talks with their short descriptions are here.
First day closing
Second day closing
Third day closing
Vitalii Aksenov currently is a postdoctoral fellow at IST Austria. His research focuses on practice and theory of concurrent data structures.
Before IST, Vitalii received his PhD from Paris 7 Diderot and ITMO University under the guidance of professor Petr Kuznetsov.