maciej besta – curriculum vitae · 2020. 12. 23. · sc20 c+a ˝...

Maciej BestaCurriculum Vitae

Education2013–present PhD Studies in Computer Science, ETH Zürich, Zürich, Switzerland,

PhD Student in Scalable Parallel Computing Laboratory (SPCL), Institute of ComputerSystems, Department of Computer Science. Advisor: Torsten HoeflerCore research efforts best described by “Understanding and Accelerating Large-Scale GraphProcessing and Analytics”, with special focus on the high-performance aspects; see the “ResearchInterests” section for more details.

2006–2012 Master of Science in Computer Science,AGH University of Science and Technology (AGH-UST), Krakow, Poland,Individual studies in Computer Science at the Faculty of Electrical Engineering, Automatics,Computer Science and Electronics. Final grade: very goodGraduation with honors (summa cum laude).Mentor: Ryszard Tadeusiewicz (AGH-UST)Thesis: Event Display System for the TOTEM Experiment at CERN .

2009–2010 Studies in Physics & Astronomy, Jagiellonian University, Krakow, Poland,Individual studies in Physics and Astronomy at the Faculty of Physics, Astronomy and AppliedComputer Science.

2003–2006 Secondary School, Ruda Śląska, Poland,Finished with greatest honors.

Professional and Scientific Experience2012–present ETH Zürich, Zürich, Switzerland,

Intern and Research Assistant in Scalable Parallel Computing Laboratory (SPCL), Institute ofComputer Systems, Department of Computer Science,Research in High-Performance Computing; see “Research Interests” & “Research Projects” Sections.

2011–2012 CERN (European Organization for Nuclear Research), Geneva, Switzerland,Software developer in the TOTEM Experiment, responsible for the development and mainte-nance of the TOTEM event display system for the online data preview,Selection of technologies involved: C++, Python, OpenGL, ROOT.

2011–2012 Phi Fiduciaire, Geneva, Switzerland,Independent consultant, responsible for: the analysis and development of a financial simulationalsystem, management of software undertakings and projects, creation and management (as aproject leader) of EaglesWings: Polish Software Developers Platform for establishing interactionsbetween Swiss corporations and Polish computer science specialists,Selection of technologies involved: MATLAB, Java.

2010–2011 CERN (European Organization for Nuclear Research), Geneva, Switzerland,Technical Student in the Engineering Department, responsible for: the development of themagnets information system for FLUKA (Monte Carlo Particle Physics package) for thesimulational needs of the Large Hadron Collider (LHC), reconstruction of the LHC tunnelgeometry description for FLUKA, construction of a system for project management at FLUKA,Selection of technologies involved: Python, Bottle web framework, bash, awk, Flair.

2009–2010 CERN (European Organization for Nuclear Research), Geneva, Switzerland,Software developer in the TOTEM Experiment, responsible for the development of the TOTEMevent display system for the offline data analysis,Selection of technologies involved: C++, Python, OpenGL, ROOT.

Universitätsstrasse 6 – 8092 ZürichQ [email protected] of 20

mailto:[email protected]

2009 CERN (European Organization for Nuclear Research), Geneva, Switzerland,Erasmus Student in the TOTEM Experiment, responsible for: the analysis and constructionof the event display system (extending the open-source FROG Event Display system to theTOTEM Experiment), code development,Selection of technologies & activities involved: requirements analysis, OO analysis & design, C++, Python,OpenGL, ROOT.

Research InterestsMy research interests focus on understanding and accelerating large-scale graph processing,storage, and analytics, in any types of settings and workloads. “Processing” broadly indicates anytransformations applied to graph datasets, “storage” widely refers to any challenges related to how the graphis represented or stored, and “analytics” names any form of activity targeted at extracting scientific insightsfrom graphs. I approach the associated problems holistically at different abstraction levels, including including(1) hardware, (2) networking, (3) the OS and runtime / middleware, (4) algorithms, and (5) programmingmodels, abstractions, or paradigms. The common aspect of these efforts is not only to solve a practical problem,but also to understand better the underlying fundamental properties of a given problem, system, phenomenon,or solution. This is done with performance modeling or any other formal way of describing a [given subspace]of reality. I particularly like to apply different theoretical concepts to important practical challenges. Relationsbetween my specific research efforts and the above concepts are shown in Figure 1.

Hardware

Networking

OS, Middleware,Run�mes

Algorithms

Abstrac�ons, Paradigms,Programming models

[SC19c]

[arXiv'19a]

[PACT'15]

[HPDC'15]

[FPGA'19]

[arXiv'19b][a

rXiv'19c]

[arXiv'18]

[arXiv'19d]

[arXiv'19e]

[TRETS'19]

[ASPLOS'18][SC14]

[ICS'15] [IPDPS'19]

[SC17][HPDC'16]

[PACT'18]

[IPDPS'17]

[HPDC'17]

[SC13]

[SC19b][PPoPP'18]

[CACM'18]

[HPDC'14]

[HPDC'15]

[SC13]

[PADAL'14]

[ICS'15]

[FPGA'19][SC19a]

Storage

Pro

cessingA

naly�

cs

figure 1: Relations of my research efforts (expressed as released papers) and different parts of the computing stack. “ ” indicates a best

paper award, best student paper award, or research highlights. “ ” indicates a best paper finalist, best student paper finalist, or another

form of additional paper recognition.



Selection of Awards, Achievements, and Honors2019 Best Paper Finalist & Best Student Paper Finalist at ACM/IEEE SC19, Denver, CO, USA,

for a paper “Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing,Storage, and Analytics” (at ACM/IEEE Supercomputing 2019).

2019 Best Student Paper Award and Best Paper Finalist at ACM/IEEE SC19, Denver, CO, USA,for a paper “Red-Blue Pebbling Revisited: Near Optimal Parallel Matrix Multiplication” (atACM/IEEE Supercomputing 2019).

2019 ACM/SIGDA Student Travel Award at FPGA’19, Monterey, CA, US.2019 Best Paper Finalist at ACM/SIGDA FPGA’19, Monterey, CA, US,

best paper finalist at the 27th ACM/SIGDA International Symposium on Field-ProgrammableGate Arrays (FPGA’19) (4 selected papers).

2018 ACM SIGARCH Student Travel Award at PACT’18, Limassol, Cyprus.2018 ACM Research Highlights,

paper published in the Communications of the ACM Research Highlights (“Enabling Highly-Scalable Remote Memory Access Programming with MPI-3 One Sided”).

2018 HiPEAC Paper Award, Awarded by the HiPEAC Steering Committee for an ASPLOS’18paper.

2018 ACM SIGARCH Student Travel Award at ASPLOS’18, Williamsburg, VA, USA.2017 ACM Student Travel Award at HPDC’17, Washington, USA.2017 IEEE Student Travel Award at IPDPS’17, Orlando, FL, USA.2017 SIGHPC Student Scholarship to attend the 50th Turing Award Anniversary, San Francisco,

USA,won participation in the celebration of the 50th Turing Award Conference.

2017 IPDPS’17 PhD Forum, Orlando, Florida, USA,won participation in the IEEE IPDPS’17 PhD Forum programme.

2016 Best Paper Award at ACM HPDC’16, Kyoto, Japan,designated as best paper at the ACM International Symposium on High-Performance Paralleland Distributed Computing (HPDC’16) (one out of the total of 120 submissions).

2016 ACM Student Travel Award at HPDC’16, Kyoto, Japan.2015 ACM/IEEE-CS George Micheal Memorial HPC Fellowship, Austin, Texas, USA,

“The fellowship honors exceptional PhD students throughout the world whose research focusareas are in high-performance computing, networking, storage, and large-scale data analysis.” .

2015 Best Paper Award at ACM HPDC/FCRC’15, Portland, USA,designated as best paper at the ACM International Symposium on High-Performance Paralleland Distributed Computing (HPDC’15) (one out of the total of 116 submissions).

2014 Best Student Paper Award at ACM/IEEE SC14, New Orleans, USA,designated as best student paper at ACM/IEEE Supercomputing 2014; selected by a committeeduring the conference out of a set of six candidates (out of the total of 394 submissions).

2014 Best Paper finalist at ACM HPDC’14, Vancouver, Canada,best paper finalist at the ACM International Symposium on High-Performance Parallel andDistributed Computing (HPDC’14) (3 out of the total of 130 submissions).

2014 ACM Student Travel Award at HPDC’14, Vancouver, Canada.2013 Best Paper Award at ACM/IEEE SC13, Denver, CO, USA,

designated as best paper at ACM/IEEE Supercomputing 2013; selected by a committee duringthe conference out of a set of thirteen candidates (out of the total of 457 submissions).

2013 Best Student Paper finalist at ACM/IEEE SC13, Denver, CO, USA,best student paper finalist at ACM/IEEE Supercomputing 2013 (8 out of 457 submissions).



2013 Google European Doctoral Fellowship, Zürich, Switzerland,The first Google Fellowship in Parallel Computing. “Google Fellowship students are a selectgroup recognized by Google researchers and their institutions as some of the most promisingyoung academics in the world.” .

2013 Master Thesis Award (“AGH Diamonds”), Krakow, Poland,Laureate (2nd place) in the competition “AGH Diamonds” for the best master thesis at theAGH University of Science and Technology, Poland.

2012 Honorary AGH Graduation, Krakow, Poland,Summa cum laude from the AGH University of Science and Technology, Poland.

2012 “Student Nobel Prize”, Warsaw, Poland,Winner of the national competition for the Best Student of Poland.

2012 Above-maximum final average of grades, Krakow, Poland,Thanks to several circumstances during my MSc studies, I reached a final average of grades of5.17 with 5.0 being the maximum stated on my diploma (at AGH-UST).

2010 Polish Education Minister’s Scholarship, Warsaw, Poland,National–level scholarship, awarded for academic and scientific achievements (for 2010/2011).

2010 “Sapere Auso” Academic Scholarship, Krakow, Poland,Regional–level scholarship, awarded for academic and scientific achievements (for 2010/2011).

2009 Polish Education Minister’s Scholarship, Warsaw, Poland,National–level scholarship, awarded for academic and scientific achievements (for 2009/2010).

2009 “Sapere Auso” Academic Scholarship, Krakow, Poland,Regional–level scholarship, awarded for academic and scientific achievements (for 2009/2010).

2007-2010 University distinctions, Krakow, Poland,Distinctions awarded for academic results.

2007-2010 University scholarships, Krakow, Poland,Scholarships awarded for academic results.

2006 National Mathematical Competition, Poznań, Poland,Winner of the national–level mathematical competition.

2005 Polish Prime Minister’s Scholarship, Warsaw, Poland,National–level scholarship, awarded for education results.



PublicationsC – a conference paper, J – a journal paper, R – a relevant research report,A – an independent (standalone) arXiv paper (no matching conference/journal paper),+ A – an arXiv extension of a conference/journal paper,

– best paper award or best student paper award or research highlights,– best paper finalist or best student paper finalist or another form of paper distinction,

☀ – a core part of the paper is the outcome of a mentored master thesis,☀ – a core part of the paper is the outcome of a mentored bachelor thesis.

2021:

SPAA’21 C + A L. Gianinazzi, M. Besta, Y. Schaffner, T. Hoefler. “Parallel Algorithms for FindingLarge Cliques in Sparse Graphs”, Proceedings of the 33th ACM Symposium on Parallelism inAlgorithms and Architectures (SPAA’21).

SPAA’21 C + A G. Kwasniewski, T. Ben-Nun, L. Gianinazzi, A. Calotoiu, T. Schneider, A. N. Ziogas,M. Besta, T. Hoefler. “Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/OLower Bounds for Statically Analyzable Programs”, Proceedings of the 33th ACM Symposiumon Parallelism in Algorithms and Architectures (SPAA’21).

arXiv’21 A M. Besta, R. Kanakagiri, G. Kwasniewski, R. Ausavarungnirun, J. Beránek, K. Kanel-lopoulos, K. Janda, Z. Vonarburg-Shmaria, L. Gianinazzi, I. Stefan, J. Gómez-Luna, N. Blach,M. Copik, L. Kapp-Schwoerer, S. Di Girolamo, M. Konieczny, O. Mutlu, T. Hoefler. “SISA:Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems”,Full version: https://arxiv.org/pdf/2104.07582.pdf.

arXiv’21 A M. Copik, G. Kwasniewski, M. Besta, M. Podstawski, T. Hoefler. “SeBS: A ServerlessBenchmark Suite for Function-as-a-Service Computing”,Full version: https://arxiv.org/pdf/2012.14132.pdf.

VLDB’21 C + A M. Besta, Z. Vonarburg-Shmaria, Y. Schaffner, L. Schwarz, G. Kwasniewski, L.Gianinazzi, J. Beránek, K. Janda, T. Holenstein, S. Leisinger, P. Tatkowski, E. Ozdemir, A. Balla,M. Copik, P. Lindenberger, P. Kalvoda, M. Konieczny, O. Mutlu, T. Hoefler. “GraphMineSuite:Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra”,Proceedings of the 47th International Conference on Very Large Data Bases,Full version: https://arxiv.org/pdf/2103.03653.pdf.

CACM’21 J + A S. Sakr, A. Bonifati, H. Voigt, A. Iosup, ..., M. Besta, .... “The Future is Big Graphs!A Community View on Graph Processing Systems”, Communications of the ACM,Full version: https://arxiv.org/pdf/2012.06171.pdf.

PPoPP’21(short paper)

C + A G. Kwasniewski, T. Ben-Nun, A. N. Ziogas, T. Schneider, M. Besta, T. Hoefler.“On the Parallel I/O Optimality of Linear Algebra Kernels: Near-Optimal LU Factorization”,Proceedings of the 26th ACM SIGPLAN symposium on Principles and Practice of ParallelProgramming 2021 (PPoPP’21),Full version: https://arxiv.org/pdf/2010.05975.pdf.

TPDS’21 J + A J. de Fine Licht, M. Besta, S. Meierhans, T. Hoefler. “Transformations of High-Level Synthesis Codes for High-Performance Computing”, IEEE Transactions on Parallel andDistributed Systems (TPDS),Full version: https://arxiv.org/pdf/1805.08288.pdf.

TPDS’21 J + A M. Besta, J. Domke, M. Schneider, M. Konieczny, S. Di Girolamo, T. Schneider,A. Singla, T. Hoefler. “High-Performance Routing with Multipathing and Path Diversity inEthernet and HPC Networks”, IEEE Transactions on Parallel and Distributed Systems (TPDS),Full version: https://arxiv.org/pdf/2007.03776.pdf.

2020:


https://arxiv.org/pdf/2104.07582.pdf








SC20 C + A ☀M. Besta, A. Carigiet, Z. Vonarburg-Shmaria, K. Janda, L. Gianinazzi, T. Hoefler.“High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, andQuality”, Proceedings of the IEEE/ACM International Conference on High PerformanceComputing, Networking, Storage and Analysis (SC20), (acceptance rate: 25%),Full version: https://arxiv.org/pdf/2008.11321.pdf.

SC20 C + A ☀M. Besta, M. Schneider, K. Cynk, M. Konieczny, E. Henriksson, S. Di Girolamo, A.Singla, T. Hoefler. “FatPaths: Routing in Supercomputers and Datacenters when Shortest PathsFall Short”, Proceedings of the IEEE/ACM International Conference on High PerformanceComputing, Networking, Storage and Analysis (SC20), (acceptance rate: 25%),Full version: https://arxiv.org/pdf/1906.10885.pdf.

IPDPS’20 C + A M. Besta, R. Kanakagiri, H. Mustafa, M. Karasikov, G. Rätsch, T. Hoefler, E.Solomonik. “Communication-Efficient Jaccard Similarity for High-Performance DistributedGenome Comparisons”, Proceedings of the 34th IEEE International Parallel and DistributedProcessing Symposium (IPDPS’20),Full version: https://arxiv.org/pdf/1911.04200.pdf.

TRETS’20 J + A M. Besta, M. Fischer, T. Ben-Nun, J. De Fine Licht, T. Hoefler. “Substream-CentricMaximum Matchings on FPGA”, Proceedings of the ACM Transactions on ReconfigurableTechnology and Systems (TRETS),Special Issue, invited paper ,Full version: https://arxiv.org/pdf/2010.14684.pdf.

arXiv’20 A M. Besta, M. Fischer, V. Kalavri, M. Kapralov, T. Hoefler. “Practice of StreamingProcessing of Dynamic Graphs: Concepts, Models, and Systems”,Full version: https://arxiv.org/pdf/1912.12740.pdf.

2019:

SC19 C+ A M. Besta, S. Weber, L. Gianinazzi, R. Gerstenberger, A. Ivanov, Y. Oltchik, T.Hoefler. “Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing,Storage, and Analytics”, Proceedings of the IEEE/ACM International Conference on HighPerformance Computing, Networking, Storage and Analysis (SC19), (acceptance rate: 25%,87/344),Best Paper Finalist & Best Student Paper Finalist ,Full version: https://arxiv.org/pdf/1912.08950.pdf.

SC19 C+ A G. Kwasniewski, M. Kabic, M. Besta, R. Solca, J. VandeVondele, T. Hoefler: “Red-Blue Pebbling Revisited: Near Optimal Parallel Matrix Multiplication”, Proceedings of theIEEE/ACM International Conference on High Performance Computing, Networking, Storageand Analysis (SC19), (acceptance rate: 25%, 87/344),Best Paper Finalist & Best Student Paper Award ,Full version: https://arxiv.org/pdf/1908.09606.pdf.

SC19 C+ A S. Di Girolamo, K. Taranov, A. Kurth, M. Schaffner, T. Schneider, J. Beranek,M. Besta, L. Benini, D. Roweth, T. Hoefler. “Network-Accelerated Non-Contiguous MemoryTransfers”, Proceedings of the IEEE/ACM International Conference on High PerformanceComputing, Networking, Storage and Analysis (SC19), (acceptance rate: 25%, 87/344),Full version: https://arxiv.org/pdf/1908.08590.pdf.

IPDPS’19 C + A T. Ben-Nun, M. Besta, S. Huber, A. N. Ziogas, D. Peter, T. Hoefler. “A Modu-lar Benchmarking Infrastructure for High-Performance and Reproducible Deep Learning”,Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium(IPDPS’19),Full version: https://arxiv.org/pdf/1901.10183.pdf.












FPGA’19 C + A ☀ M. Besta, M. Fischer, T. Ben-Nun, J. De Fine Licht, T. Hoefler. “Substream-Centric Maximum Matchings on FPGA”, Proceedings of the 27th ACM/SIGDA InternationalSymposium on Field-Programmable Gate Arrays, (acceptance rate: 23%),Best Paper Finalist (4/30) ,Full version: https://arxiv.org/pdf/2010.14684.pdf.

arXiv’19 A ☀ M. Besta, E. Peter, R. Gerstenberger, M. Fischer, M. Podstawski, C. Barthels, G.Alonso, T. Hoefler. “Demystifying Graph Databases: Analysis and Taxonomy of Data Organi-zation, System Designs, and Graph Queries”,Full version: https://arxiv.org/pdf/1910.09017.pdf.

arXiv’19 A + A M. Besta, D. Stanojevic, J. De Fine Licht, T. Ben-Nun, T. Hoefler. “Graph Processingon FPGAs: Taxonomy, Survey, Challenges”,Full version: https://arxiv.org/pdf/1903.06697.pdf.

2018:

PACT’18 C + A M. Besta, D. Stanojevic, T. Zivic, J. Singh, M. Hörold, T. Hoefler. “Log(Graph): ANear-Optimal High-Performance Graph Representation”, Proceedings of the 27th InternationalConference on Parallel Architectures and Compilation, (acceptance rate: 29%, 36/126),Full version: https://arxiv.org/pdf/2010.15879.pdf.

ASPLOS’18 C+ A M. Besta, S. M. Hassan, S. Yalamanchili, R. Ausavarungnirun, O. Mutlu, T. Hoefler.“Slim NoC: A Low-Diameter On-Chip Network Topology for High Energy-Efficiency andScalability”, Proceedings of the 23rd ACM International Conference on Architectural Supportfor Programming Languages and Operating Systems (ASPLOS ’18), (acceptance rate: 18.2%,56/307,HiPEAC Paper Award),Full version: https://arxiv.org/pdf/2010.10683.pdf.

PPoPP’18 C ☀ L. Gianinazzi, P. Kalvoda, A. De Palma, M. Besta, T. Hoefler. “Communication-Avoiding Minimum Cuts and Connected Components”, Proceedings of the 23rd ACM SIGPLANsymposium on Principles and Practice of Parallel Programming 2018 (PPoPP’18), (acceptancerate: 20%, 28/138).

CACM’18 J R. Gerstenberger, M. Besta, T. Hoefler. “Enabling Highly-Scalable Remote MemoryAccess Programming with MPI-3 One Sided”, Communications of the ACM, October issue of2018,Article in the “Research Highlights” Section .

arXiv’18 A M. Besta, T. Hoefler. “Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations”,Full version: https://arxiv.org/pdf/1806.01799.pdf.

2017:

SC17 C+ A E. Solomonik, M. Besta, F. Vella, T. Hoefler. “Scaling Betweenness Centralityusing Communication-Efficient Sparse Matrix Multiplication”, Proceedings of the IEEE/ACMInternational Conference on High Performance Computing, Networking, Storage and Analysis(SC17), (acceptance rate: 18.6%, 61/327),Full version: https://arxiv.org/pdf/1609.07008.pdf.

HPDC’17 C+ A M. Besta, M. Podstawski, L. Groner, E. Solomonik, T. Hoefler. “To Push or To Pull:On Reducing Communication and Synchronization in Graph Computations”, Proceedings of the26th ACM International Symposium on High-Performance Parallel and Distributed Computing(HPDC’17), (acceptance rate: 19%),Full version: https://arxiv.org/pdf/2010.16012.pdf.











IPDPS’17 C+ A ☀ M. Besta, F. Marending, E. Solomonik, T. Hoefler. “SlimSell: A VectorizableGraph Representation for Breadth-First Search”, Proceedings of the 31st IEEE InternationalParallel and Distributed Processing Symposium (IPDPS’17), (acceptance rate: 25%),Full version: https://arxiv.org/pdf/2010.09913.pdf.

2016:

arXiv’16 A E. Solomonik, M. Besta, F. Vella, T. Hoefler: Betweenness Centrality is more Parallelizablethan Dense Matrix Multiplication,Full version: https://arxiv.org/pdf/1609.07008.pdf.

HPDC’16 C+ A ☀ [First two authors contributed equally to the work] P. Schmid, M. Besta, T. Hoe-fler. “High-Performance Distributed RMA Locks”, Proceedings of the 25th ACM InternationalSymposium on High-Performance Parallel and Distributed Computing (HPDC’16), (acceptancerate: 15.5%, 20/129), Best Paper Award ,Full version: https://arxiv.org/pdf/2010.09854.pdf.

2015:

PACT’15 C+ A ☀ [First two authors contributed equally to the work] H. Schweizer, M. Besta, T.Hoefler. “Evaluating the Cost of Atomic Operations on Modern Architectures”, Proceedings ofthe 24th International Conference on Parallel Architectures and Compilation, (acceptance rate:21%, 38/179),Full version: https://arxiv.org/pdf/2010.09852.pdf.

HPDC’15 C+ A M. Besta, T. Hoefler. “Accelerating Irregular Computations with Hardware Transac-tional Memory and Active Messages”, Proceedings of the 24th ACM International Symposiumon High-Performance Parallel and Distributed Computing (HPDC’15), (acceptance rate: 16%,18/116), Best Paper Award ,Full version: https://arxiv.org/pdf/2010.09135.pdf.

ICS’15 C+ A M. Besta, T. Hoefler. “Active Access: A Mechanism for High-Performance DistributedData-Centric Computations”, Proceedings of the 29th ACM International Conference onSupercomputing (ICS’15), (acceptance rate: 25%),Full version: https://arxiv.org/pdf/1910.12897.pdf.

2014:

Scientific’14 J R. Gerstenberger, M. Besta, T. Hoefler: Enabling Highly-Scalable Remote Memory AccessProgramming with MPI-3 One Sided, Journal of Scientific Computing, 2014.

SC14 C+ A M. Besta, T. Hoefler. “Slim Fly: A Cost-Effective Low Diameter Network Topology”,Proceedings of the IEEE/ACM International Conference on High Performance Computing,Networking, Storage and Analysis (SC14), (acceptance rate: 20%, 82/394),Best Student Paper Award ,Full version: https://arxiv.org/pdf/1912.08968.pdf.

HPDC’14 C+ A M. Besta, T. Hoefler. “Fault Tolerance for Remote Memory Access ProgrammingModels”, Proceedings of the 23rd ACM Intl. Symposium on High-Performance Parallel andDistributed Computing (HPDC’14), (acceptance rate: 16%, 21/130),Best Paper Finalist (3/130) ,Full version: https://arxiv.org/pdf/2010.09025.pdf.

PADAL’14 R A. Tate, (...), M. Besta, et al.: Programming Abstractions for Data Locality, , ResearchReport from the PADAL Workshop 2014 at the Swiss National Supercomputing Center (CSCS).










https://hal.inria.fr/hal-01083080/document


2013:

SC13 C+ A R. Gerstenberger, M. Besta, T. Hoefler. “Enabling Highly-Scalable Remote MemoryAccess Programming with MPI-3 One Sided”, Proceedings of the IEEE/ACM InternationalConference on High Performance Computing, Networking, Storage and Analysis (SC13), (ac-ceptance rate: 20%, 92/457),Best Paper Award (1/92) and Best Student Paper Finalist (8/92) ,Full version: https://arxiv.org/pdf/2001.07747.pdf.

Earlier (undergrad):EPL’11 J (Acknowledged for software development work) The TOTEM Collaboration: Proton-proton

elastic scattering at the LHC energy of√

s = 7TeV , EPL (Europhysics Letters), volume 95,number 4, pages 41001, 2011.

ICATPP’09 C V. Avati, M. Berretti, M. Besta et al: Offline Software for the TOTEM Experiment atthe LHC, In Proceedings of the 11th Conference on Astroparticle, Particle and Space Physics,Detectors and Medical Physics Applications, ICATPP’09, pages 658–665, Oct. 2010.

EDS’09 C G. Antchev, P. Aspell, V. Avati, M. G. Bagliesi, V. Berardi, M. Berretti, M. Besta et al:Diffraction at TOTEM, In Proc. of the 13th International Conference on Elastic and DiffractiveScattering: Moving Forward into the LHC Era, EDS’09, pages 249–256, Jun.–Jul. 2009.

Posters, Short Papers, and Various Technical ReportsPosters IPDPS’17, HPDC’17, ASPLOS’18, ETH Systems Group Industry Retreat 2016, ETH Systems

Group Industry Retreat 2017.Technicalreports

Reports expending the following papers:● Slim NoC: A Low-Diameter On-Chip Network Topology for High Energy-Efficiency and Scalability,● Evaluating the Cost of Atomic Operations on Modern Architectures,● Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages,● Fault Tolerance for Remote Memory Access Programming Models,● Slim Fly: A Cost-Effective Low Diameter Network Topology.

Teaching ExperienceFall 2019 Design of Parallel and High-Performance Systems, ETH Zürich, Zürich, Switzerland,

Mentoring groups of students.Fall 2015 Research Topics in Software Engineering, ETH Zürich, Zürich, Switzerland,

Advising master students.Fall 2013 Research Topics in Software Engineering, ETH Zürich, Zürich, Switzerland,

Advising bachelor students.Spring 2013 Parallel Programming, ETH Zürich, Zürich, Switzerland,

Exercise sessions with ≈ 12 students.

Mentoring ExperienceIn my mentoring activities, I focus on fostering research attitudes and activites. Each bachelor or master thesisproject is founded on a small research idea that I would pursue myself, given time. Some theses were partsof the same, larger project, and some of them were also a part of a larger collaboration with other researchgroups. My mentoring activities teach me a lot about managing various research projects at the same timeand about guiding different people so that they can get the most out of the project in terms of developing aresearch attitude towards solving problems.M – a master thesis, B – a bachelor thesis, S – a semester project

Spring 2021 M Patrick Iff, ETH Zürich,We work on on-chip interconnects.




Spring 2021 M Raphael Grob, ETH Zürich,We work on graph neural networks.

Spring 2021 M Patrick Gruntz, ETH Zürich, Co-mentored with Daniele De Sensi and SalvatoreDi GirolamoWe work on enhancing graph analytics with modern interconnect hardware developments.

Spring 2021 M Ioana Stefan, ETH Zürich, Co-mentored with Raghavendra Kanakagiri.We work on accelerating graph mining algorithms.

Spring 2021 B Maxime Benrubi, ETH Zürich, Co-mentored with Raghavendra Kanakagiri.We work on accelerating graph mining algorithms.

Fall 2020 B Maximilan Fries, ETH Zürich, Co-mentored with Lukas Gianinazzi and NikoliDryden.We work on graph neural networks.

Fall 2020 M Roman Haag, ETH Zürich, Co-mentored with Robert Gerstenberger.We work on graph databases.

Fall 2020 M Yannick Schaffner, ETH Zürich, Co-mentored with Lukas Gianinazzi.We work on accelerating mining cliques in large graphs.

Fall 2020 B Anton Schäfer, ETH Zürich, Co-mentored with Lukas Gianinazzi and NikoliDryden.We work on graph neural networks.

Fall 2020 M Jakub Jałowiec, ICM, Poland, Co-mentored with Marek Michalewicz and RobertGerstenberger.We work on accelerating graph databases.

Fall 2020 M Wojciech Chlapek, ICM, Poland, Co-mentored with Marek Michalewicz andRobert Gerstenberger.We work on accelerating graph databases.

Fall 2020 S Tomasz Świerczewski, ICM, Poland, Co-mentored with Marek Michalewicz andRobert Gerstenberger.We work on accelerating graph databases.

Fall 2020 M Gabriel Gjini, ETH Zürich,We worked on accelerating graph databases.

Fall 2020 S Leonardo Schwarz, ETH Zürich,We work on accelerating mining cliques in large graphs.

Fall 2020 B Lukas Kapp-Schwoerer, ETH Zürich, We work on accelerating graph mining.Fall 2020 B Christoph Erdmann, ETH Zürich, We work on accelerating graph mining.

Spring 2020 B Marko Nikic, ETH Zürich, We work on new paradigms for graph computations.Spring 2020 S Jacek Kuśnierz, AGH-UST, Poland, Co-mentored with Marek Konieczny.

We work on serverless computing.Spring 2020 B Cliff Hodel, ETH Zürich, Co-mentored with Grzegorz Kwaśniewski.

We work on accelerating linear algebra computations.Spring-Fall 2020 B Nils Blach, ETH Zurich, Co-mentored with Jens Domke and Marek Konieczny.

We work on Infiniband routing in low-diameter topologies.Fall 2019 M Dominik Stanaszek, AGH-UST, Poland, Co-mentored with Marek Konieczny.

We work on accelerating graph mining and lossy graph compression.Fall 2019 M Michał Grabowski, AGH-UST, Poland, Co-mentored with Marek Konieczny.

We work on accelerating graph mining and lossy graph compression.Fall 2019 M Adam Latos, AGH-UST, Poland, Co-mentored with Marek Konieczny.

We work on Infiniband routing in low-diameter topologies.Fall 2019 B Armon Carigiet, ETH Zürich, We work on accelerating parallel graph coloring.



Fall 2019 B Adrian Balla, ETH Zürich,We work on novel paradigms for designing graph mining algorithms.

Fall 2019 B Zur Shmaria, ETH Zürich, We work on accelerating maximal clique finding algorithms.Fall 2019 S Yannick Schaffner, ETH Zürich,

We work on accelerating mining cliques in large graphs.Fall 2019 S Luca Dolfi, ETH Zürich, We work on quantum processing.Fall 2019 M Justyna Maciąg, AGH-UST, Poland, Co-mentored with Marek Konieczny.

We work on low-diameter network topologies.Spring 2019 B Szymon Bernal, AGH-UST, Poland, Co-mentored with Marek Konieczny.

We work on NUMA-aware graph representations.Spring 2019 B Szymon Janikowski, AGH-UST, Poland, Co-mentored with Marek Konieczny.

We work on compressed high-performance graph representations.Spring 2019 B Kacper Janda, AGH-UST, Poland, Co-mentored with Marek Konieczny.

We work on generic high-performance graph representations.Spring 2019 B Alessandro Maissen, ETH Zürich,

We worked on accelerating network simulations and facilitating the design, analysis, andevaluation of network topologies, with focus on understanding the path diversity of topologies.

Spring 2019 B Jonas Bokstaller, ETH Zürich,We work on accelerating routing in Infiniband low-diameter networks.

Spring 2019 B Philipp Bomatter, ETH Zürich,We worked on scalable caching protocols and on large-scale manycore simulations.

Spring 2019 B Christoph Amevor, ETH Zürich,We worked on information theory and graph signal processing.

Spring 2019 M Aryaman Fasciati, ETH Zürich, Co-mentored with Grzegorz Kwaśniewski.We worked on novel approaches for developing algorithms into clique mining.

Spring 2019 B Patrick Iff, ETH Zürich, Co-mentored with Grzegorz Kwaśniewski.We worked on approximate graph computations.

Spring 2019 B Lukas Fluri, ETH Zürich, We worked on quantum processing.Fall 2018 B Joris Diem, ETH Zürich, We worked on accelerating streaming graph algorithms.Fall 2018 B Dawid Suder, AGH-UST / ETH Zürich, Co-mentored with Marek Konieczny.

We worked on enhancing InfiniBand routing..Fall 2018 M Karolina Cynk, AGH-UST / ETH Zürich, Co-mentored with Marek Konieczny

We worked on enhancing routing in data centers and high-performance systems.Fall 2018 M Jakub Golinowski, ETH Zürich,

We worked on accelerating graph processing based on the algebraic formulation.Fall 2018 B Sebastian Leisinger, ETH Zürich,

We worked on novel design approaches for approximate graph algorithms.Fall 2018 M Dimitri Stanojevic, co-mentored with Johannes de Fine Licht and Tal-Ben Nun,

ETH Zürich, We worked on hardware acceleration for graph processing.Fall 2018 M Florian Marending, ETH Zürich, co-mentored with Shigang Li

We worked on using deep learning for graph analytics.Spring 2018 B Pascal Störzbach, ETH Zürich, co-mentored with Johannes de Fine Licht

We worked on accelerating algebraic workloads on FPGAs.Spring 2018 B Michal Sudwoj, ETH Zürich,

We worked on accelerating graph database workloads with spectral graph theory.Spring 2018 B Daniel Peter, ETH Zürich, co-mentored with Alexandros Nikolaos Ziogas

We worked on benchmarking deep learning workloads.



Spring 2018 B Emanuel Peter, ETH Zürich, co-mentored with Claude BarthelsWe worked on accelerating graph database workloads.

Spring 2018 B Fabian Gessler, ETH Zürich, co-mentored with Grzegorz KwaśniewskiWe worked on approximate graph algorithms.

Fall 2017 B Philippe Mösch, ETH Zürich,We worked on extending the SlimSell vectorizable graph representation beyond BFS.

Fall 2017 B Simon Weber, ETH Zürich,We worked on lossy graph compression and approximate processing. The thesis contributedto a full paper at SC19 (Best Paper Finalist & Best Student Paper Finalist).

Fall 2017 M Marc Fischer, ETH Zürich, Co-mentored with Tal Ben-Nun.We worked on deepening the understanding of the streaming graph algorithms and investigatingthe possibilities of implementing them in FPGAs. The thesis received the ETH Medal.

Fall 2017 M Michał Podstawski, Katowice University of Technology (Poland),We worked on using parallel computing models more accurate than PRAM to model theperformance of parallel graph processing.

Spring 2017 B Thomas Leu, ETH Zürich,We worked on extending SlimSell vectorizable graph representation beyond BFS.

Spring 2017 M Krzysztof Nawara, AGH-UST,We worked on using state-of-the-art machine learning techniques to accelerate graph processingand on designing benchmarks for various aspects of distributed graph processing.

Spring 2017 B Severin Kistler, ETH Zürich, Co-mentored with Salvatore Di GirolamoWe attempted to accelerate graph processing using novel mechanisms available in Intel’s NetworkInterface Cards and to redesign graph algorithms to be able to better utilize the capabilitiespresent in modern NICs.

Spring 2017 B Elias Stalder, ETH Zürich, Co-mentored with Salvatore Di Girolamo who wasthe project lead and the main mentor. The project aimed at better understanding of theperformance effects in Portals4 Network Interface Cards with the applications for offloadedcollective communication operations.

Spring 2017 B Jonas Gude, ETH Zürich,We worked on modifying the structure of the CPU and the memory subsystem to accelerategraph processing as well as deepening the understanding of the tradeoffs between graph storageand graph algorithms’ performance.

Spring 2017 B Pascal Blöchlinger, ETH Zürich,We tried to accelerate graph processing by incorporating some of linear algebra concepts, namelyvarious matrix decompositions .

Fall 2016 M Marcel Schneider, ETH Zürich,We worked on using state-of-the-art hardware for high-performance adaptive multipath routingin data centers.

Fall 2016 M Pavel Kalvoda, ETH Zürich,We worked on improving the performance of graph algorithms in distributed-memory and I/Osettings using various different schemes and approaches, with a special focus on hierarchicalparallel computing models. The thesis contributed to a full paper at PPoPP’18 .

Fall 2016 B Dimitri Stanojevic, ETH Zürich,We worked on improving the performance of graph algorithms using various augmentations tograph representations and several novel lossy compression schemes combined with state-of-the-art hardware. The thesis contributed to a full paper at PACT’18 .

Fall 2016 M Tijana Zivic, ETH Zürich,We worked on improving the performance of graph processing using several interesting com-pression ideas, targeting both static and dynamic graphs.



Fall 2016 S Linus Groner, ETH Zürich,We worked on accelerating large-scale shared- and distributed-memory graph computations byreducing the amounts of communicated data in label-setting graph algorithms .

Spring 2016 B Florian Marending, ETH Zürich,We worked on analyzing the performance tradeoffs of BFS based on algebraic andcombinatorial abstractions. We did the first analysis on the performance impacton BFS coming from different semirings in the algebraic abstraction. Finally,we accelerated BFS with SlimSell: a novel representation that uses vectorization.The thesis contributed to a full paper at IEEE IPDPS’17.

Spring 2016 B David Schmidig, ETH Zürich,We tried to accelerate graph processing by incorporating some of linear algebra concepts.

Spring 2016 B Maurice Hörold, ETH Zürich,We worked on accelerating distributed-memory BFS by incorporating novel prefetching schemesand by redesigning the graph representation to better match some of the BFS features.

Spring 2015 B Michał Podstawski, Katowice University (Poland),We worked on accelerating large-scale shared- and distributed-memory graph computations byreducing the amounts of communicated data in label-setting graph algorithms.

Spring 2015 B Patrick Schmid, ETH Zürich,We developed a family of the first topology-aware distributed RMA locks (MCS, Reader-Writer) that offer tunable performance: the user can influence which aspect of the lockis the most important (throughput of readers, throughput of writers, latency, fairness).The thesis resulted in a full paper at ACM HPDC’16 (Best Paper Award).

Spring 2015 M Erik Henriksson, ETH Zürich / Lund University (Sweden),We conducted research into adaptive routing schemes for data centers.

Fall 2014 B Hermann Schweizer, ETH Zürich,We conducted the first modeling and evaluation of the performance of atomic operations thatcovers multiple parameters (various architecture, cache levels, data sizes, thread counts, type ofoperations, etc.). The thesis resulted in a full paper at PACT’15.

Talks2021 Enabling High-Performance Large-Scale Irregular Computations , Invited keynote talk at

International Conference on Computational Science, online.2021 Enabling High-Performance Cost-Effective InfiniBand Architectures with Slim Fly Topologies,

Invited talk at Swiss HPC Advisory Council Conference, online.2020 High-performance parallel graph coloring with strong guarantees on work, depth, and quality,

A conference talk at ACM/IEEE Supercomputing’20, online.2020 Fat Paths: Routing in Supercomputers and Data Centers When Shortest Paths Fall Short, A

conference talk at ACM/IEEE Supercomputing’20, online.2019 Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage,

and Analytics, A conference talk at ACM/IEEE Supercomputing’19, Denver, CO, US.2019 Towards High-Performance Processing, Storage, and Analytics of Extreme-Scale Graphs,

Invited talk at the Department of Electronics, Informatics, and Telecommunications, AGHUniversity of Science and Technology, Krakow, Poland.

2019 Towards High-Performance Processing, Storage, and Analytics of Extreme-Scale Graphs,Invited talk at the Department of Electrotechnics, Automatics, Informatics, and BiomedicalEngineering, AGH University of Science and Technology, Krakow, Poland.

2019 Towards High-Performance Processing, Storage, and Analytics of Extreme-Scale Graphs,Invited talk at the Institute of Computer Modeling, Warsaw University, Warsaw.

2019 Towards High-Performance Processing, Storage, and Analytics of Extreme-Scale Graphs, A talkduring International Congress on Industrial and Applied Mathematics (ICIAM) 2019, Valencia,Spain.



2019 Substream-Centric Maximum Matchings on FPGA, A conference talk during FPGA’19, Mon-terey, USA.

2019 Graph Processing, Deep Learning, High-Performance Computing, Invited talk at the IIS’19,London, United Kingdon.

2018 Log(Graph): A Near-Optimal High-Performance Graph Representation, A conference talkduring PACT’18, Limassol, Cyprus.

2018 Lowering Diameter Enables Cost-Effective and High-Performance Networks, Invited talkat the Department of Electronics, Informatics, and Telecommunications, AGH University ofScience and Technology, Krakow, Poland.

2018 Lowering Diameter Enables Cost-Effective and High-Performance Networks, Invited talk atthe Department of Electrotechnics, Automatics, Informatics, and Biomedical Engineering, AGHUniversity of Science and Technology, Krakow, Poland.

2018 To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations,An invited talk at the Dagstuhl Workshop of High-Performance Graph Algorithms, Dagstuhl,Germany.

2018 To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations,A seminar talk for the Systems Group, ETH Zürich, Zürich, Switzerland.

2018 Lowering Diameter Enables Cost-Effective and High-Performance Networks, and How ToResearch It Better?, Invited talk at the CSCS Workshop at ETH Zurich, ETH Zurich, Zurich,Switzerland.

2018 SlimNoC: A Low-Diameter On-Chip Network Topology for High Energy-Efficiency and Scala-bility, A conference talk during ASPLOS’18, Williamsburg, VA, USA.

2018 Lowering Diameter Enables Cost-Effective and High-Performance Networks, Invited talkat WAMS (Workshop on Warehouse-scale Memory Systems), co-located with ASPLOS 2018,Williamsburg, VA, USA.

2018 The Relevance of Graph Processing, Invited talk at the IIS’18, London, United Kingdon.2017 To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations,

A seminar talk at the Department of Electrotechnics, Automatics, Informatics, and BiomedicalEngineering, AGH University of Science and Technology, Krakow, Poland.

2017 To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations,A conference talk during HPDC’17, Washington, D.C., USA.

2017 To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations,Invited talk at the University of Maryland, Washington, D.C., USA.

2017 Active Access: A Mechanism for High-Performance Distributed Data-Centric Computations,Invited talk at the International Workshop on Runtime and Operating Systems for Super-computers (ROSS) 2017, Washington, D.C., USA.

2017 To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations,Invited talk at the Lawrence Berkeley National Laboratory, Berkeley, California, USA.

2017 SlimSell: A Vectorizable Graph Representation for Breadth-First Search, A conference talkduring IPDPS’17, Orlando, FL, USA.

2017 High-Performance Distributed RMA Locks, An industry workshop invited talk at the SystemsGroup, ETH Zürich, Zürich, Switzerland.

2017 Is it possible to blur the boundaries between human persons and ’human-like’ robots? An HPCperspective, Invited talk at the IIS Conference, London, UK.

2016 Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages,A seminar talk at the Department of Electrotechnics, Automatics, Informatics, and BiomedicalEngineering, AGH University of Science and Technology, Krakow, Poland.

2016 Efficient Synchronization for Large-Scale Irregular Graph Computations, Invited talk at theDepartment of Electronics, Informatics, and Telecommunications, AGH University of Scienceand Technology, Krakow, Poland.



2016 Efficient Synchronization for Large-Scale Irregular Graph Computations, Invited talk at theComputer Science Department, Warsaw University of Technology, Warsaw, Poland.

2016 Evaluating the Cost of Atomic Operations on Modern Architectures, A seminar talk for theSoftware Group, ETH Zürich, Zürich, Switzerland.

2016 High-Performance Distributed RMA Locks, An industry workshop invited talk at the SystemsGroup, ETH Zürich, Zürich, Switzerland.

2016 Slim Fly: A Cost-Effective Low-Diameter Network Topology, A seminar talk for the SoftwareGroup, ETH Zürich, Zürich, Switzerland.

2016 High-Performance Distributed RMA Locks, A seminar talk for the Systems Group, ETH Zürich,Zürich, Switzerland.

2016 High-Performance Distributed RMA Locks, A conference talk during HPDC’16, Kyoto, Japan.2016 Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages,

A seminar talk for the Systems Group, ETH Zürich, Zürich, Switzerland.2016 Slim Fly: A Cost-Effective Low-Diameter Network Topology, An invited talk during an

industry retreat, Engelberg, Switzerland.2015 Slim Fly: A Cost-Effective Low-Diameter Network Topology, A talk for external visitors during

department evaluation, ETH Zürich, Zürich, Switzerland.2015 Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages,

A conference talk during HPDC’15, Portland, OR, USA.2015 Active Access: A Mechanism for High-Performance Distributed Data-Centric Computations, A

conference talk during ICS’15, Newport Beach, CA, USA.2015 Active Access: A Mechanism for High-Performance Distributed Data-Centric Computations, A

seminar talk for the Systems Group, ETH Zürich, Zürich, Switzerland.2014 Slim Fly: A Cost-Effective Low-Diameter Network Topology, An invited talk for Cray

engineers during SC14, New Orleans, LA, US.2014 Slim Fly: A Cost-Effective Low-Diameter Network Topology, A conference talk during SC14,

New Orleans, LA, US.2014 Fault Tolerance for Remote Memory Access Programming Models, A talk during SC14, New

Orleans, LA, US.2014 Fault Tolerance for Remote Memory Access Programming Models, A conference talk at the

ACM HPDC’14, Vancouver, BC, Canada.2014 Fault Tolerance for Remote Memory Access Programming Models, An institute seminar talk,

ETH Zürich, Zürich, Switzerland.2013 Enabling Highly-Scalable Remote Memory Access Programming with MPI-3 One Sided, A

conference talk at the ACM/IEEE Supercomputing (SC13), Denver, US.2013 Enabling Highly-Scalable Remote Memory Access Programming with MPI-3 One Sided, An

institute seminar talk, ETH Zürich, Zürich, Switzerland.2009–2012 Several talks on the Frog Event Display visualisation system for the TOTEM Experiment at

CERN, Geneva, Switzerland.2009 Thermodynamic of black holes, A student talk at the seminar of physics students’ scientific

association “Boson” at AGH-UST, Krakow, Poland.

ServiceHPGP’16 A PC member in the 1st High Performance Graph Processing workshop, Kyoto, Japan,

Co-located with the ACM HPDC 2016.SC14 A panelist in the discussion “HPC For Undergraduates: Grad Student Perspective” during

SC14, New Orleans, LA, US.PASC’14 Conference staff member at PASC’14.

PADAL’14 Help with organization.



Reviewing Reviewer for various conferences and journals, including SPAA’13, PPoPP’14, ICS’14, CF’14,HPDC’14, TOPC, TACO, IPDPS’15, JSFI, PACT’15, PPoPP’16, EuroSys’16, TPDS, JLT,Parallel Computing, JONS, .

Grants Helped with writing an application for a successful ERC Starting Grant.

Graduate CourseworkETH Zurich Concepts of Concurrent Computation, Graph Theory, Mathematical Optimization, Combina-

torial Optimization, How To Give Strong Technical Presentations, Models of Computation,Principles of Distributed Computing, Randomized Algorithms and Probabilistic Methods,others.

Technical Core Skills and ExperienceOptimization Knowledge of linear and integer linear programming methods especially when applied to graph

algorithms, some experience with CPLEX..Parallel

ProgrammingKnowledge of parallel programming techniques for shared memory and distributed memorysystems. Experience in the development of HPC applications using Message Passing Interface(MPI), hybrid programming (OpenMP + MPI, pthreads + MPI), transactional memory (IntelRTM & HLE, IBM BlueGene/Q HTM); some part experience with PGAS languages (UnifiedParallel C). Experience in designing parallel and distributed algorithms and protocols..

Networking Fundamental knowledge of the architectures of different networks. Experience with the designof high-performance network topologies and acquaintance with different HPC and datacenternetworks (DragonFly, Hypercube, Fat Tree, Torus, etc.).

Programminglanguages

Nowadays mostly: C, C++, Python, Bash. Past experience with Java, Assembler Language forx86. Some past experience with C#, Ada, Actionscript, Ruby, VHDL.

Softwareengineering

Past experience in the analysis, construction and development of software systems and pack-ages. Experience with Object Oriented Analysis and Design, Structured Analysis & Design,Requirements Analysis, UML.

Maths & physics Practical knowledge of different fundamental areas of mathematics and physics (statistics,probability theory, optimization, analysis, linear algebra, others).

Simulation Knowledge of numerical methods and software for simulation (MATLAB and Simulink). Pastexperience with Mathcad, ROOT, Flair.

Databases SQL language; past experience with PostgreSQL and MySQL.Artificial

intelligencePast experience in neural networks and expert systems development, and logic programming(Prolog, Datalog).

Codemanagement

SVN, GIT. Experience with different development environments (NetBeans, Eclipse, MicrosoftVisual Studio). Some past experience with Maven.

3D graphics Past experience in SoftImage XSI, GeoControl, OpenGL.Other CS

technologiesGUI (Swing, Qt), 2D graphics applications, past experience in enterprise development (J2EE,Hibernate, OSGi) and webmastering.

Associations2019–present HiPEAC affiliated member.2018–present SIGARCH student member.2016–present SIGHPC student member.2014–present ACM student member.2018–present IEEE TCCA student member.2014–present IEEE student member.

2009–2011 Computer Science students’ scientific association “BIT” at AGH-UST.2009–2011 Physics students’ scientific association “Boson” at AGH-UST.



2009–2011 Mountaineering students’ association “SAKWA” at AGH-UST.2009–2011 Kyokushin Karate students’ association “Sokół” at AGH-UST.

Languages, Soft Skills, Additional Skills & ActivitiesLanguages English – work proficiency, Certificate in Advanced English (CAE), grade A

Russian – communicativeFrench – beginnerPolish – mother tongue.

Driving Clean driving license, category B.Selection ofpersonality

features

● High level of determination.● Strong personality with high level of resistance to stress.● Tendency to strive for perfection with simultaneous understanding of the 80/20 principle.● Ability to both lead and mentor as well as learn effectively from others.● Ability to learn quickly..

Interviewing I am responsible for interviewing candidates for research positions in Scalable Parallel ComputingLab. This task gave me abroad perspective of other people’s attitudes, motivations, and preparedme to select good candidates for my future research groups.

Non-researchinterests

physics & astronomy (e.g., organized and gave a talk “thermodynamics of black holes whilebeing a student at AGH-UST in Poland”), theology, philosophy, history, difficult expeditions &exploration (see the next section), alpinism, painting, drawing, photography (organized severalphoto galleries).



Exploration, Expeditions, Personality TrainingI have organized nearly 30 expeditions into some of the most remote, isolated, and logisticallydemanding mountain ranges and plateaus of North & East Siberia and Siberian Arctic, usuallysolo, both in summer and in winter.

Statement of ReasonI strongly believe that my expeditions facilitate the development of personality strength, mental endurance,perseverance and tenacity, resourcefulness, resistance to stress, and leadership skills. They have positivelycontributed to many of my research activities: all the mental and psychological resources developed and trainedin very hostile environments can be directly reused when tackling demanding deadlines and any other researchchallenges. The expeditions are also a great lesson in efficient risk management and decision making: one mustlearn how to quickly and efficiently make many decisions that may immediately either endanger or save one’s life.

Profile of ExpeditionsI am most interested in: (1) climbing remote peaks in deep winter conditions in January–February(usually previously unclimbed in winter) in the coldest parts of Siberia (e.g., Yakutia, Kolyma), (2) traversingand exploring the most isolated mountain ranges (e.g., located in Chukotka, Taimyr Peninsula, andCentral Siberian Plateau), and (3) photography, focusing on attempts to picture and express theisolation and remoteness of the visited mountains.

The maximized metrics in my expeditions are: (1) the isolation and the distance from nearest civilizationoutposts (and thus indirectly logistics and transportation challenges) as well as (2) the severity of weatherand climate. The most isolated location I explored were Byrranga Mountains (twice), with the nearest villagebeing located more than 500 km away in a straight line. The most severe weather I encountered was whileclimbing and exploring deep taiga in January-February in various mountains of Yakutia (many times), withtemperatures dropping regularly to -50 C; the extremes were around -60 C (these were all solo expeditions,unsupported, with sleeping in a tent for multiple consecutive days).

Some expeditions are stationary and combined with intense readings of research papers in the isolation ofinspiring views.

Why Siberia and Siberian Arctic?Because this is an extremely hostile and unyielding environment, very challenging, virtually unexplored, andcompletely pristine in most parts. Both summers and winters come with numerous mental and physicalchallenges related to weather, climate, terrain. Deep valleys full of swampy and impassable taiga forests; vast,gloomy, and severe plateaus with ferocious winds; unexplored crevassed glaciers; violent and wide rivers; greyand bleak polar deserts; endless marshy tundra; sheer cliffs and deep canyons; technically demanding mountainridges and faces; temperatures as low as -70 C (without the windchill factor) and as high as +40 C; deep, soft,and unstable snow; vast fields of sharp stones; wild animals; ultimate isolation and solitude; and many others.

Most important expeditions:

W – a winter expedition, A – an autumn expedition, S – a summer expeditionS – a solo expedition, T – focus on trekking, C – focus on climbing

January 2021 W S C First (ever) winter ascent of the highest peak in Anadyr Highlands, solo,The first winter ascent (January) of the highest peak “Two Cirques” in Anadyr Highlands (Western Chukotka).The peak is located in a very cold region of Western Chukotka, where temperatures around -60 C are recorded.Ascent on skis and crampons. Early January and northern location also meant very low amounts od sunlight(around 4–5 hours per day). .



February 2020 W S C First (ever) winter ascent of the highest peak in Verkhoyansky Mountains, solo,The first winter ascent (February) of the highest peak in Verkhoyansky Mountains (Yakutia). The peak isunnamed, its altitude is 2415 meters. The peak is located in the district where Verkhoyansk, one of the coldestregions of Yakutia, also referred to as the northern “Pole of Cold”, is located (similarly to Oymyakon, the regionwhere the lowest temperatures in the whole northern hemisphere of around -70 C were officially measured).Thus, the climbed peak is effectively one of the coldest mountains in the whole northern part ofthe world. It was a solo expedition. It was also probably the first winter exploration of the massif. The climbwas in unfavourable conditions (very strong winds, the famous “Purga” (also called “Buran”), the Siberian windof cold air). .

January 2020 W S C First (ever) winter ascent of the highest peak in Suntar-Khayata Mountains, solo,The first winter ascent (early January) of the highest peak in Suntar-Khayata Mountains (Yakutia). The peakis called Mus-Khaya, its altitude is 2960 meters. The peak is located in the Oymyakon District, which is thecoldest region of Yakutia. Thus, as Oymyakon is known as the northern “Pole of Cold” (the region where thelowest temperatures in the whole northern hemisphere of around -70 C were officially measured), the climbedpeak is effectively the coldest mountain in the whole northern part of the world. It was a soloexpedition. It was also probably the first winter exploration of the glaciers in the massif. The distance from thepeak to the nearest village: over a 130km (it took 3 days one-way to approach the massif on snow mobilesacross virgin deep taiga forests and high mountain plateaus). Amount of daylight: 5-6 hours. No sunlight invalleys at all. Temperatures in valleys: down to -55 C. Temperatures while climbing: down to -45 C .

January 2019 W S C First (ever) winter ascent of the highest peak in Momsky Mountains (solo),The first winter ascent (January) of the highest (unnamed) peak in Momsky Mountains (Yakutia); the altitude ofthe peak is 2480m. The peak has no name and there is no photo available on the Internet, even the mountaineersfrom Yakutsk that I know, who trek there, do not have one because of the remoteness of the area. It was a soloexpedition. It was also probably the first winter exploration of the only glaciated part of the Momsky Mountains.The distance from the peak to the nearest village: over a 100km (it took 3 days one-way to approach the massifon snow mobiles). Amount of daylight: 6-8 hours. No sunlight in valleys at all. Temperatures in valleys: downto -55 C. Temperatures while climbing: down to -40 C. I climbed the peak through its north face; the climb wassomehow technical (slopes up to ≈60 degrees). My difficulty assessment (considering only the technical part):between AD+ and D- using the general alpine grade. .

End ofDecember 2017

W S C Solo Winter Climb of Mt. Elbrus,Solo winter climb of the highest European peak, in 2.5 days (total time from and back to the airport). I hadvirtually no prior acclimatization (I only spent one night at 3800 meters 10 days before the climb). Iwas also suffering from an extreme lack of sleep in the week (and the night) before the trip –no more than 3-4 hours of sleep each night, for 6 nights in a row (because of large amounts ofresearch work to be done and because of very invonvenient flights to Mineralne Vody). Still, Imanaged to summit the main (highest) peak. .



August 2017 A S T The first traverse of Eastern Byrranga Mountains,Solo, unsupported traverse of the highest, most remote, and least known and researched part of ByrrangaMountains, described in scarce research papers (e.g., “Biogeography of the Byrranga Mountains,Taymyr Peninsula, Russian Arctic”) as one of the least known areas of the whole Arctic; a regionwith extremely difficult access. These mountains belong to my foremost focus because I am firmly convincedthat they are the most isolated and remote mountain range in the whole Arctic and Siberia. In very short: Icovered around 320 kilometers in 9.5 days, on foot, solo, fully unsupported. The average of 40 kilometers perday, the maximum distance of 67 kilometers in non-stop 21 hours of march in difficult terrain,all while having non-trivial feet damage. The terrain was almost always swamps, fields of sharp stones,glaciers, deep snow, or large and violent rivers. I climbed all the three highest peaks above 1100 meters, traversedglaciers, all in the complete isolation with the nearest village around 500 kilometers away in a straight line.To maximize the chances of success, I organized the expedition on purpose to make it a “one-way” traverse(= “finish or perish”). I was left by a helicopter at the southern border of the mountains and I organized apick-up far in the North, beyond the northern border of the mountains, 300 kilometers away. There were verylittle chances of helicopter arriving to any other point except for the pick-up location. This was the forcingand the motivating aspect for finishing the whole march, and it ultimately ensured expedition success. It wassimultaneously a very fruitful lesson in risk management. This expedition received a distinction in the"Travel" track during the largest Polish symposium “Kolosy” (“Giants”) on exploration. .

February -March 2011

W T The first Polish winter ascent of the highest Ural peak,Winter polar expedition with temperatures down to -40 C. The first Polish winter ascent of Mt. Narodnaya (thehighest Ural peak). Covered ≈250 km on foot and skis. .

Awards and honors related to exploration:

- I am an official La Sportiva ambassador and athlete. La Sportiva is one of the biggest manufacturers ofmountaineering boots in the world.- I received an official Russian medal “For Merits”, for the successful first winter ascent of the highestmountain in Momsky Mountains in Yakutia (the largest Russian Republic).- The solo traverse of the Byrranga Mountains received a distinction in the “Travel” category duringthe symposium “Kolosy” (“Giants”) on exploration (the largest such event in Europe) in 2018.



maciej besta – curriculum vitae · 2020. 12. 23. · sc20 c+a ˝...

Documents