CV |  Home |  Awards, honors |  Publications |  Teaching, advising |  Exploration, Expeditions

Mentoring (Semester, Bachelor, Master Theses at ETH Zurich):

If you are a student interested in doing a thesis with me, send me an e-mail - we will meet and I will present you a list of projects. Each of them is a full research project that is dedicated to investigating some important problem in today's computer science (especially graph processing). Many of the projects I have (not all as I usually have some novel ideas in mind before putting them online) can be found in the "Thesis Topics" section of our lab website.

Please see my CV for a full and up-to-date list of supervised thesis projects.

So far, I have had a great pleasure to mentor the following students:


[finished] Kacper Janda, Bernal Szymon, Szymon Janikowski, bachelor students, AGH-UST. We are working on novel graph representations and graph compression.



[finished] Alessandro Maissen, a bachelor student, ETH Zurich. We are working on scalable network simulation infrastructure and on the structure of low diameter networks.




[finished] Jonas Bokstaller, a bachelor student, ETH Zurich. We worked on Infiniband routing in low diameter networks.



[finished] Philipp Bomatter, a bachelor student, ETH Zurich. We are working on scalable cache coherence.



[ongoing] Christoph Amevor, a bachelor student, ETH Zurich. We are working on information theory in the context of graphs.



[ongoing] Aryaman Fasciati, a master student, ETH Zurich. We are working on approximate data mining.



[finished] Patrick Iff, a bachelor student, ETH Zurich. We are working on approximate data mining.



[finished] Lukas Fluri, a bachelor student, ETH Zurich. We are working on novel abstractions for graph processing.



[finished] Joris Diem, a bachelor student, ETH Zurich. We are working on streaming graph processing.



[finished] Dawid Suder, a bachelor student, AGH-UST. We are working on low-diameter routing protocols for InfiniBand.



[finished] Karolina Cynk, a master student, AGH-UST. We are working on routing for low-diameter topologies.



[finished] Jakub Golinowski, a master student, ETH Zurich. We worked on accelerating graph traversals.



[finished] Sebastian Leisinger, a bachelor student, ETH Zurich. We worked on approximate data mining algorithms.



[finished] Florian Marending, a master student, ETH Zurich. We work on developing faster and more power-efficient graph algorithms by incorporating some machine learning tools, with the focus on understanding the potential of using deep learning methods on some optimization problems in graph theory.



[finished] Dimitri Stanojevic, a master student, ETH Zurich. Co-mentored with Johannes de Fine Licht and Tal Ben-Nun. We work on developing faster and power-efficient graph algorithms by incorporating FPGAs.



Michal Sudwoj, a bachelor student, ETH Zurich. We work on accelerating certain algorithms related to spectral graph theory.




[finished] Pascal Störzbach, a bachelor student, SPCL/Katowice Technology University. Co-mentored with Johannes de Fine Licht. We have been working on enabling high-performance dense linear algebra computations on FPGAs.


[finished] Daniel Peter, a bachelor student, ETH Zurich. Co-mentored with Alexandros Nikolaos Ziogas and Tal Ben-Nun. We work on enabling more performant machine learning, with the focus on deep learning.



[finished] Michał Podstawski, a master student, SPCL/Katowice Technology University. Co-mentored with Grzegorz Kwasniewski. We have been working on accelerating large-scale shared- and distributed-memory graph computations by reducing the amounts of communicated data in label-setting graph algorithms.


[finished] Philippe Mösch, a bachelor student, ETH Zurich. We work on extending our SlimSell vectorizable graph representation towards graph algorithms other than BFS.




[finished] Emanuel Peter, a bachelor student, ETH Zurich. Co-mentored with Claude Barthels. We worked on various applications of Remote Memory Access techniques for faster and less power-hungry distributed graph workloads.



[finished] Marc Fischer, a master student, ETH Zurich. Co-mentored with Tal Ben-Nun. We worked on deepening the understanding of streaming graph algorithms and investigating the possibilities of implementing them in FPGAs.



[finished] Simon Weber, a bachelor student, ETH Zurich. We worked on deepening the understanding of the tradeoffs between graph storage and graph algorithms' performance.




[finished] Jonas Gude, a bachelor student, ETH Zurich. We worked on modifying the structure of the CPU and the memory subsystem to accelerate graph processing as well as deepening the understanding of the tradeoffs between graph storage and graph algorithms' performance.



[finished] Elias Stalder, a bachelor student, ETH Zurich, Co-mentored with Salvatore Di Girolamo who was the project lead and the main mentor. The project aimed at better understanding of the performance effects in Portals4 Network Interface Cards with the applications for offloaded collective communication operations.


[finished] Severin Kistler, a bachelor student, ETH Zurich. Together with Severin, we attempted to accelerate graph processing using novel mechanisms available in Intel's Network Interface Cards and to redesign graph algorithms to be able to better utilize the capabilities present in modern NICs.



[finished] Pascal Blöchlinger, a bachelor student, ETH Zurich. Together with Pascal, we attempted to accelerate graph processing by incorporating some of linear algebra concepts, namely various matrix decompositions.


[finished] Fabian Gessler, a bachelor student, AGH-UST.
We worked on approximate graph processing.



[finished] Thomas Leu, a bachelor student, ETH Zurich. We worked on extending our SlimSell vectorizable graph representation towards graph algorithms other than BFS..



[finished] Krzysztof Nawara, a master student, AGH-UST / ETH Zurich. We worked on designing benchmarks for various aspects of distributed graph processing.




[finished] Marcel Schneider, a master student, ETH Zurich. We worked on using state-of-the-art hardware for multi-path high-performance adaptive routing in data centers.



[finished] Pavel Kalvoda, a master student, ETH Zurich. We worked on improving the performance of graph algorithms in distributed-memory and I/O settings using various different schemes and approaches, with a special focus on hierarchical parallel computing models. The thesis contributed to a full paper at PPoPP'18.


[finished] Dimitri Stanojevic, a bachelor student, ETH Zurich. We worked on improving the performance of graph algorithms using various augmentations to graph representations and several novel lossy compression schemes combined with state-of-the-art hardware. The thesis contributed to a full paper at PACT'18.


[finished] Tijana Zivic, a master student, ETH Zurich. We worked on improving the performance of graph processing using several interesting compression ideas, targeting both static and dynamic graphs. The thesis contributed to a full paper at PACT'18.


[finished] Linus Groner, (short-term project). We have been working on accelerating large-scale shared- and distributed-memory graph computations by reducing the amounts of communicated data in label-setting graph algorithms. The collaboration was short but very intense and contributed to our full paper at ACM HPDC'17.


[finished] Florian Marending, a bachelor student, ETH Zurich. We worked on analyzing the performance tradeoffs of BFS based on algebraic and combinatorial abstractions. We did the first analysis on the performance impact on BFS coming from different semirings in the algebraic abstraction. Finally, we accelerated BFS with SlimSell: a novel representation that heavily uses vectorization. The thesis contributed significantly to a full paper at IEEE IPDPS'17.


[finished] Maurice Hörold, a bachelor student, ETH Zurich.
We worked on improving the performance of distributed-memory BFS by incorporating novel prefetching schemes and by redesigning the graph representation to better match some of the BFS features.


[finished] David Schmidig, a bachelor student, ETH Zurich.
Together with David, we attempted to accelerate graph processing by incorporating some of linear algebra concepts.


[finished] Michał Podstawski, a bachelor student, Katowice Technology University.
We have been working on accelerating large-scale shared- and distributed-memory graph computations by reducing the amounts of communicated data in label-setting graph algorithms. The thesis contributed to full paper at ACM HPDC'17.


[finished] Patrick Schmid, a bachelor student, ETH Zurich.
Together with Patrick, we have conducted research into novel distributed reader-writer locking protocols for large HPC machines. The thesis resulted in a full paper at ACM HPDC'16 (we also received the Karsten Schwan Best Paper Award).


[finished] Erik Henriksson, a master student, ETH Zurich/Lund University.
Together with Erik, we have conducted research into adaptive routing schemes for data centers. Erik's first job: Google Zurich.



[finished] Hermann Schweizer, a bachelor student, ETH Zurich.
Hermann's thesis was dedicated to modeling and evaluating the performance of atomic operations on modern architectures. The thesis resulted in a full paper at PACT'15.

Teaching:

I was a teaching assistant for: