Algorithms for Large-Scale Graph Processing, Seminar (ETH Zurich, Fall 2019)
Your presentation: The presentations will be in teams of two, and each team will present one of the papers in the list. The length of the presentation is 40 minutes, plus 5 minutes for questions and discussions. Also, see these guides for how to give a good technical presentation: an article by Ian Parberry, an article by Jones, Hughes, and Launchbury, and some slides by Puschel.
Questions about your paper: Prior to your presentation, you are expected to design a few questions about your paper. These questions are intended to be about high level concepts in the paper. By understanding the answers to these questions, one should be able to understand the problem that is studied and particularly, the main challenge in the problem investigated in that paper.
Participation: For each of your peers' presentation, you are expected to take a quick glance at the paper they are presenting, and answer the few questions that they designed. The main purpose of these questions is to ensure that you have had a look at the paper and you know its context and basics. This will help you in following the presentation. We will send you the questions a few days before the presentation (tentatively via a doodle link) and you should submit your (short) answers before the presentation.
List of Selected PapersEach team should select at least three papers from the following list and indicate them in the following doodle: Papers.
Indicate a preference ordering in the comment section. You will be assigned one of these papers.
- Goodrich et al.: Sorting, Searching, and Simulation in the MapReduce Framework ISAAC'11
- Andoni et al.: Parallel Algorithms for Geometric Graph Problems STOC'14
- Im et al.: Efficient massively parallel methods for dynamic programming STOC'17
- Andoni et al.: Parallel Graph Connectivity in Log Diameter Rounds FOCS'18
- Liu and Vondrak: Submodular Optimization in the MapReduce Model SOSA'19
- Behnezhad et al.: Massively Parallel Computation of Matching and MIS in Sparse Graphs PODC'19 (based on these two papers: paper 1 and paper 2)
- Chang et al.: The Complexity of (Delta + 1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation PODC'19
- Ghaffari et al.: Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds FOCS'19
- Ghaffari et al.: Faster Algorithms for Edge Connectivity via Random 2-Out Contractions arXiv'19
Other Papers: See this graduate course on Massively Parallel Algorithms for a list of other papers in this area.
- 18.09.2019 Introduction by Mohsen
- 25.09.2019 Talk by Manuela
- 02.10.2019 Talk by Julian