Mohsen Ghaffari: Katalogdaten im Frühjahrssemester 2018 |
| Name | Herr Dr. Mohsen Ghaffari |
| Lehrgebiet | Informatik |
| ghaffari@inf.ethz.ch | |
| URL | https://people.inf.ethz.ch/gmohsen/ |
| Departement | Informatik |
| Beziehung | Assistenzprofessor (Tenure Track) |
| Nummer | Titel | ECTS | Umfang | Dozierende | |
|---|---|---|---|---|---|
| 227-0558-00L | Principles of Distributed Computing  | 6 KP | 2V + 2U + 1A | R. Wattenhofer, M. Ghaffari | |
| Kurzbeschreibung | We study the fundamental issues underlying the design of distributed systems: communication, coordination, fault-tolerance, locality, parallelism, self-organization, symmetry breaking, synchronization, uncertainty. We explore essential algorithmic ideas and lower bound techniques. | ||||
| Lernziel | Distributed computing is essential in modern computing and communications systems. Examples are on the one hand large-scale networks such as the Internet, and on the other hand multiprocessors such as your new multi-core laptop. This course introduces the principles of distributed computing, emphasizing the fundamental issues underlying the design of distributed systems and networks: communication, coordination, fault-tolerance, locality, parallelism, self-organization, symmetry breaking, synchronization, uncertainty. We explore essential algorithmic ideas and lower bound techniques, basically the "pearls" of distributed computing. We will cover a fresh topic every week. | ||||
| Inhalt | Distributed computing models and paradigms, e.g. message passing, shared memory, synchronous vs. asynchronous systems, time and message complexity, peer-to-peer systems, small-world networks, social networks, sorting networks, wireless communication, and self-organizing systems. Distributed algorithms, e.g. leader election, coloring, covering, packing, decomposition, spanning trees, mutual exclusion, store and collect, arrow, ivy, synchronizers, diameter, all-pairs-shortest-path, wake-up, and lower bounds | ||||
| Skript | Available. Our course script is used at dozens of other universities around the world. | ||||
| Literatur | Lecture Notes By Roger Wattenhofer. These lecture notes are taught at about a dozen different universities through the world. Distributed Computing: Fundamentals, Simulations and Advanced Topics Hagit Attiya, Jennifer Welch. McGraw-Hill Publishing, 1998, ISBN 0-07-709352 6 Introduction to Algorithms Thomas Cormen, Charles Leiserson, Ronald Rivest. The MIT Press, 1998, ISBN 0-262-53091-0 oder 0-262-03141-8 Disseminatin of Information in Communication Networks Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger. Springer-Verlag, Berlin Heidelberg, 2005, ISBN 3-540-00846-2 Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes Frank Thomson Leighton. Morgan Kaufmann Publishers Inc., San Francisco, CA, 1991, ISBN 1-55860-117-1 Distributed Computing: A Locality-Sensitive Approach David Peleg. Society for Industrial and Applied Mathematics (SIAM), 2000, ISBN 0-89871-464-8 | ||||
| Voraussetzungen / Besonderes | Course pre-requisites: Interest in algorithmic problems. (No particular course needed.) | ||||
| 252-4220-00L | A Taste of Research: Algorithms and Combinatorics  Maximale Teilnehmerzahl: 16 Um das vorhandene Angebot optimal auszunutzen, behält sich das D-INFK vor, Belegungen von Studierenden zu löschen, die sich in mehreren Veranstaltungen dieser Kategorie eingeschrieben haben, bereits die erforderlichen Leistungen in dieser Kategorie erbracht haben oder aus anderen organisatorischen Gründen nicht auf die Belegung der Veranstaltung angewiesen sind. | 2 KP | 2S | B. Gärtner, A. Steger, M. Ghaffari | |
| Kurzbeschreibung | Students work together with lecturers on open problems in algorithms and combinatorics. | ||||
| Lernziel | The goal is to learn and practice important research techniques: literature search, understanding and presenting research papers, developing ideas in the group, testing of conjectures with the computer, writing down results. | ||||
| Inhalt | Work on original research papers and open problems in the areas of algorithms and combinatorics. | ||||
| Skript | Not available. | ||||
| Literatur | Will be announced in the seminar. | ||||
| Voraussetzungen / Besonderes | Passed exam in Algorithms, Probability, and Computing. | ||||