default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaciej Besta
Person information
- affiliation: ETH Zürich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j10]Maciej Besta
, Robert Gerstenberger, Emanuel Peter, Marc Fischer, Michal Podstawski, Claude Barthels, Gustavo Alonso, Torsten Hoefler:
Demystifying Graph Databases: Analysis and Taxonomy of Data Organization, System Designs, and Graph Queries. ACM Comput. Surv. 56(2): 31:1-31:40 (2024)- [j9]Maciej Besta, Torsten Hoefler:
Parallel and Distributed Graph Neural Networks: An In-Depth Concurrency Analysis. IEEE Trans. Pattern Anal. Mach. Intell. 46(5): 2584-2606 (2024) - [c46]Maciej Besta, Nils Blach, Ales Kubicek, Robert Gerstenberger, Michal Podstawski, Lukas Gianinazzi, Joanna Gajda, Tomasz Lehmann, Hubert Niewiadomski, Piotr Nyczyk, Torsten Hoefler:
Graph of Thoughts: Solving Elaborate Problems with Large Language Models. AAAI 2024: 17682-17690 - [c45]Yves Baumann, Tal Ben-Nun, Maciej Besta, Lukas Gianinazzi, Torsten Hoefler, Piotr Luczynski:
Low-Depth Spatial Tree Algorithms. IPDPS 2024: 180-192 - [c44]Nils Blach, Maciej Besta, Daniele De Sensi, Jens Domke, Hussein Harake, Shigang Li, Patrick Iff, Marek Konieczny, Kartik Lakhotia, Ales Kubicek, Marcel Ferrari, Fabrizio Petrini, Torsten Hoefler:
A High-Performance Design, Implementation, Deployment, and Evaluation of The Slim Fly Network. NSDI 2024 - [c43]Lukas Gianinazzi, Alexandros Nikolaos Ziogas, Langwen Huang, Piotr Luczynski, Saleh Ashkboosh, Florian Scheidl, Armon Carigiet, Chio Ge, Nabil Abubaker, Maciej Besta, Tal Ben-Nun, Torsten Hoefler:
Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication. PPoPP 2024: 404-416 - [c42]Patrik Okanovic, Grzegorz Kwasniewski, Paolo Sylos Labini, Maciej Besta, Flavio Vella, Torsten Hoefler:
High Performance Unstructured SpMM Computation Using Tensor Cores. SC 2024: 54 - [c41]Kartik Lakhotia, Laura Monroe, Kelly Isham, Maciej Besta, Nils Blach, Torsten Hoefler, Fabrizio Petrini:
PolarStar: Expanding the Horizon of Diameter-3 Networks. SPAA 2024: 345-357 - [i60]Maciej Besta, Florim Memedi, Zhenyu Zhang, Robert Gerstenberger, Nils Blach, Piotr Nyczyk, Marcin Copik, Grzegorz Kwasniewski, Jürgen Müller, Lukas Gianinazzi, Ales Kubicek, Hubert Niewiadomski, Onur Mutlu, Torsten Hoefler:
Topologies of Reasoning: Demystifying Chains, Trees, and Graphs of Thoughts. CoRR abs/2401.14295 (2024) - [i59]Lukas Gianinazzi, Alexandros Nikolaos Ziogas, Langwen Huang, Piotr Luczynski, Saleh Ashkboos, Florian Scheidl, Armon Carigiet, Chio Ge, Nabil Abubaker, Maciej Besta, Tal Ben-Nun, Torsten Hoefler:
Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication. CoRR abs/2402.19364 (2024) - [i58]Yves Baumann, Tal Ben-Nun, Maciej Besta, Lukas Gianinazzi, Torsten Hoefler, Piotr Luczynski:
Low-Depth Spatial Tree Algorithms. CoRR abs/2404.12953 (2024) - [i57]Maciej Besta, Lorenzo Paleari, Ales Kubicek, Piotr Nyczyk, Robert Gerstenberger, Patrick Iff, Tomasz Lehmann, Hubert Niewiadomski, Torsten Hoefler:
CheckEmbed: Effective Verification of LLM Solutions to Open-Ended Tasks. CoRR abs/2406.02524 (2024) - [i56]Maciej Besta, Ales Kubicek, Roman Niggli, Robert Gerstenberger, Lucas Weitzendorf, Mingyuan Chi, Patrick Iff, Joanna Gajda, Piotr Nyczyk, Jürgen Müller, Hubert Niewiadomski, Marcin Chrapek, Michal Podstawski, Torsten Hoefler:
Multi-Head RAG: Solving Multi-Aspect Problems with LLMs. CoRR abs/2406.05085 (2024) - [i55]Maciej Besta, Florian Scheidl, Lukas Gianinazzi, Shachar Klaiman, Jürgen Müller, Torsten Hoefler:
Demystifying Higher-Order Graph Neural Networks. CoRR abs/2406.12841 (2024) - [i54]Patrik Okanovic, Grzegorz Kwasniewski, Paolo Sylos Labini, Maciej Besta, Flavio Vella, Torsten Hoefler:
High Performance Unstructured SpMM Computation Using Tensor Cores. CoRR abs/2408.11551 (2024) - [i53]Maciej Besta, Robert Gerstenberger, Patrick Iff, Pournima Sonawane, Juan Gómez-Luna, Raghavendra Kanakagiri, Rui Min, Onur Mutlu, Torsten Hoefler, Raja Appuswamy, Aidan O'Mahony:
Hardware Acceleration for Knowledge Graph Processing: Challenges & Recent Developments. CoRR abs/2408.12173 (2024) - 2023
- [j8]Maciej Besta, Marc Fischer, Vasiliki Kalavri, Michael Kapralov, Torsten Hoefler:
Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems. IEEE Trans. Parallel Distributed Syst. 34(6): 1860-1876 (2023) - [c40]Patrick Iff, Maciej Besta, Matheus A. Cavalcante, Tim Fischer, Luca Benini, Torsten Hoefler:
Sparse Hamming Graph: A Customizable Network-on-Chip Topology. DAC 2023: 1-6 - [c39]Patrick Iff, Maciej Besta, Matheus A. Cavalcante, Tim Fischer, Luca Benini, Torsten Hoefler:
HexaMesh: Scaling to Hundreds of Chiplets with an Optimized Chiplet Arrangement. DAC 2023: 1-6 - [c38]Maciej Besta, Afonso Claudino Catarino, Lukas Gianinazzi, Nils Blach, Piotr Nyczyk, Hubert Niewiadomski, Torsten Hoefler:
HOT: Higher-Order Dynamic Graph Representation Learning With Efficient Transformers. LoG 2023: 15 - [c37]Maciej Besta, Robert Gerstenberger, Marc Fischer, Michal Podstawski, Nils Blach, Berke Egeli, George Mitenkov, Wojciech Chlapek, Marek T. Michalewicz, Hubert Niewiadomski, Jürgen Müller, Torsten Hoefler:
The Graph Database Interface: Scaling Online Transactional and Analytical Graph Workloads to Hundreds of Thousands of Cores. SC 2023: 22:1-22:18 - [c36]Maciej Besta, Pawel Renc, Robert Gerstenberger, Paolo Sylos Labini, Alexandros Nikolaos Ziogas, Tiancheng Chen, Lukas Gianinazzi, Florian Scheidl, Kalman Szenes, Armon Carigiet, Patrick Iff, Grzegorz Kwasniewski, Raghavendra Kanakagiri, Chio Ge, Sammy Jaeger, Jaroslaw Was, Flavio Vella, Torsten Hoefler:
High-Performance and Programmable Attentional Graph Neural Networks with Global Tensor Formulations. SC 2023: 66:1-66:16 - [c35]Kartik Lakhotia, Kelly Isham, Laura Monroe, Maciej Besta, Torsten Hoefler, Fabrizio Petrini:
In-network Allreduce with Multiple Spanning Trees on PolarFly. SPAA 2023: 165-176 - [d3]Maciej Besta, Robert Gerstenberger, Marc Fischer, Michal Podstawski, Jürgen Müller, Nils Blach, Berke Egeli, George Mitenkov, Marek T. Michalewicz, Torsten Hoefler:
GDI-RMA 0.1 Software Artifact. Zenodo, 2023
- [d2]Maciej Besta, Pawel Renc, Robert Gerstenberger, Paolo Sylos Labini, Alexandros Nikolaos Ziogas, Tiancheng Chen, Lukas Gianinazzi, Florian Scheidl, Kalman Szenes, Armon Carigiet, Patrick Iff, Grzegorz Kwasniewski, Raghavendra Kanakagiri, Chio Ge, Sammy Jaeger, Jaroslaw Was, Flavio Vella, Torsten Hoefler:
GNN Scaling 0.1 Software Artifact. Zenodo, 2023 - [d1]Lukas Gianinazzi, Alexandros Nikolaos Ziogas, Piotr Luczynski, Saleh Ashkboosh, Langwen Huang, Florian Scheidl, Chio Ge, Armon Carigiet, Maciej Besta, Tal Ben-Nun, Torsten Hoefler:
Arrow Matrix Decompositions. Zenodo, 2023 - [i52]Kartik Lakhotia, Laura Monroe, Kelly Isham, Maciej Besta, Nils Blach, Torsten Hoefler, Fabrizio Petrini:
PolarStar: Expanding the Scalability Horizon of Diameter-3 Networks. CoRR abs/2302.07217 (2023) - [i51]Maciej Besta, Robert Gerstenberger, Marc Fischer, Michal Podstawski, Jürgen Müller, Nils Blach, Berke Egeli, George Mitenkov, Wojciech Chlapek, Marek T. Michalewicz, Torsten Hoefler:
High-Performance Graph Databases That Are Portable, Programmable, and Scale to Hundreds of Thousands of Cores. CoRR abs/2305.11162 (2023) - [i50]Maciej Besta, Nils Blach, Ales Kubicek, Robert Gerstenberger, Lukas Gianinazzi, Joanna Gajda, Tomasz Lehmann, Michal Podstawski, Hubert Niewiadomski, Piotr Nyczyk, Torsten Hoefler:
Graph of Thoughts: Solving Elaborate Problems with Large Language Models. CoRR abs/2308.09687 (2023) - [i49]Julia Bazinska, Andrei Ivanov, Tal Ben-Nun, Nikoli Dryden, Maciej Besta, Siyuan Shen, Torsten Hoefler:
Cached Operator Reordering: A Unified View for Fast GNN Training. CoRR abs/2308.12093 (2023) - [i48]Nils Blach, Maciej Besta, Daniele De Sensi, Jens Domke, Hussein Harake, Shigang Li, Patrick Iff, Marek Konieczny, Kartik Lakhotia, Ales Kubicek, Marcel Ferrari, Fabrizio Petrini, Torsten Hoefler:
A High-Performance Design, Implementation, Deployment, and Evaluation of The Slim Fly Network. CoRR abs/2310.03742 (2023) - [i47]Patrick Iff, Benigna Bruggmann, Maciej Besta, Luca Benini, Torsten Hoefler:
RapidChiplet: A Toolchain for Rapid Design Space Exploration of Chiplet Architectures. CoRR abs/2311.06081 (2023) - [i46]Maciej Besta, Afonso Claudino Catarino, Lukas Gianinazzi, Nils Blach, Piotr Nyczyk, Hubert Niewiadomski, Torsten Hoefler:
HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers. CoRR abs/2311.18526 (2023) - 2022
- [c34]Niels Gleinig, Maciej Besta, Torsten Hoefler:
I/O-Optimal Cache-Oblivious Sparse Matrix-Sparse Matrix Multiplication. IPDPS 2022: 36-46 - [c33]András Strausz, Flavio Vella, Salvatore Di Girolamo, Maciej Besta, Torsten Hoefler:
Asynchronous Distributed-Memory Triangle Counting and LCC with RMA Caching. IPDPS 2022: 291-301 - [c32]Maciej Besta, Raphael Grob, Cesare Miglioli, Nicola Bernold, Grzegorz Kwasniewski, Gabriel Gjini, Raghavendra Kanakagiri, Saleh Ashkboos, Lukas Gianinazzi, Nikoli Dryden, Torsten Hoefler:
Motif Prediction with Graph Neural Networks. KDD 2022: 35-45 - [c31]Maciej Besta, Patrick Iff, Florian Scheidl, Kazuki Osawa, Nikoli Dryden, Michal Podstawski, Tiancheng Chen, Torsten Hoefler:
Neural Graph Databases. LoG 2022: 31 - [c30]Salvatore Di Girolamo, Daniele De Sensi, Konstantin Taranov, Milos Malesevic, Maciej Besta, Timo Schneider, Severin Kistler, Torsten Hoefler:
Building Blocks for Network-Accelerated Distributed File Systems. SC 2022: 10:1-10:14 - [c29]Kartik Lakhotia, Maciej Besta, Laura Monroe, Kelly Isham, Patrick Iff, Torsten Hoefler, Fabrizio Petrini:
PolarFly: A Cost-Effective and Flexible Low-Diameter Topology. SC 2022: 12:1-12:15 - [c28]Maciej Besta, Cesare Miglioli, Paolo Sylos Labini, Jakub Tetek, Patrick Iff, Raghavendra Kanakagiri, Saleh Ashkboos, Kacper Janda, Michal Podstawski, Grzegorz Kwasniewski, Niels Gleinig, Flavio Vella, Onur Mutlu, Torsten Hoefler:
ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations. SC 2022: 43:1-43:17 - [i45]András Strausz, Flavio Vella, Salvatore Di Girolamo, Maciej Besta, Torsten Hoefler:
Asynchronous Distributed-Memory Triangle Counting and LCC with RMA Caching. CoRR abs/2202.13976 (2022) - [i44]Maciej Besta, Torsten Hoefler:
Parallel and Distributed Graph Neural Networks: An In-Depth Concurrency Analysis. CoRR abs/2205.09702 (2022) - [i43]Salvatore Di Girolamo, Daniele De Sensi, Konstantin Taranov, Milos Malesevic, Maciej Besta, Timo Schneider, Severin Kistler, Torsten Hoefler:
Building Blocks for Network-Accelerated Distributed File Systems. CoRR abs/2206.10007 (2022) - [i42]Kartik Lakhotia, Maciej Besta, Laura Monroe, Kelly Isham, Patrick Iff, Torsten Hoefler, Fabrizio Petrini:
PolarFly: A Cost-Effective and Flexible Low-Diameter Topology. CoRR abs/2208.01695 (2022) - [i41]Maciej Besta, Cesare Miglioli, Paolo Sylos Labini, Jakub Tetek, Patrick Iff, Raghavendra Kanakagiri, Saleh Ashkboos, Kacper Janda, Michal Podstawski, Grzegorz Kwasniewski, Niels Gleinig, Flavio Vella, Onur Mutlu, Torsten Hoefler:
ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations. CoRR abs/2208.11469 (2022) - [i40]Maciej Besta, Patrick Iff, Florian Scheidl, Kazuki Osawa, Nikoli Dryden, Michal Podstawski, Tiancheng Chen, Torsten Hoefler:
Neural Graph Databases. CoRR abs/2209.09732 (2022) - [i39]Patrick Iff, Maciej Besta, Matheus A. Cavalcante, Tim Fischer, Luca Benini, Torsten Hoefler:
Sparse Hamming Graph: A Customizable Network-on-Chip Topology. CoRR abs/2211.13980 (2022) - [i38]Patrick Iff, Maciej Besta, Matheus A. Cavalcante, Tim Fischer, Luca Benini, Torsten Hoefler:
HexaMesh: Scaling to Hundreds of Chiplets with an Optimized Chiplet Arrangement. CoRR abs/2211.13989 (2022) - 2021
- [b1]Maciej Besta:
Enabling High-Performance Large-Scale Irregular Computations. ETH Zurich, Zürich, Switzerland, 2021 - [j7]Sherif Sakr, Angela Bonifati, Hannes Voigt, Alexandru Iosup, Khaled Ammar, Renzo Angles, Walid G. Aref, Marcelo Arenas, Maciej Besta, Peter A. Boncz, Khuzaima Daudjee, Emanuele Della Valle, Stefania Dumbrava, Olaf Hartig, Bernhard Haslhofer, Tim Hegeman, Jan Hidders, Katja Hose, Adriana Iamnitchi, Vasiliki Kalavri, Hugo Kapp, Wim Martens, M. Tamer Özsu, Eric Peukert, Stefan Plantikow, Mohamed Ragab, Matei Ripeanu, Semih Salihoglu, Christian Schulz, Petra Selmer, Juan F. Sequeda, Joshua Shinavier, Gábor Szárnyas, Riccardo Tommasini, Antonino Tumeo, Alexandru Uta, Ana Lucia Varbanescu, Hsiang-Yun Wu, Nikolay Yakovets, Da Yan, Eiko Yoneki:
The future is big graphs: a community view on graph processing systems. Commun. ACM 64(9): 62-71 (2021) - [j6]Maciej Besta, Zur Vonarburg-Shmaria, Yannick Schaffner, Leonardo Schwarz, Grzegorz Kwasniewski, Lukas Gianinazzi, Jakub Beránek, Kacper Janda, Tobias Holenstein, Sebastian Leisinger, Peter Tatkowski, Esref Özdemir, Adrian Balla, Marcin Copik, Philipp Lindenberger, Marek Konieczny, Onur Mutlu, Torsten Hoefler:
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra. Proc. VLDB Endow. 14(11): 1922-1936 (2021) - [j5]Maciej Besta, Jens Domke, Marcel Schneider, Marek Konieczny, Salvatore Di Girolamo, Timo Schneider, Ankit Singla, Torsten Hoefler:
High-Performance Routing With Multipathing and Path Diversity in Ethernet and HPC Networks. IEEE Trans. Parallel Distributed Syst. 32(4): 943-959 (2021) - [j4]Johannes de Fine Licht, Maciej Besta, Simon Meierhans, Torsten Hoefler:
Transformations of High-Level Synthesis Codes for High-Performance Computing. IEEE Trans. Parallel Distributed Syst. 32(5): 1014-1029 (2021) - [c27]Maciej Besta, Raghavendra Kanakagiri, Grzegorz Kwasniewski, Rachata Ausavarungnirun, Jakub Beránek, Konstantinos Kanellopoulos, Kacper Janda, Zur Vonarburg-Shmaria, Lukas Gianinazzi, Ioana Stefan, Juan Gómez-Luna, Jakub Golinowski, Marcin Copik, Lukas Kapp-Schwoerer, Salvatore Di Girolamo, Nils Blach, Marek Konieczny, Onur Mutlu, Torsten Hoefler:
SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems. MICRO 2021: 282-297 - [c26]Marcin Copik, Grzegorz Kwasniewski, Maciej Besta, Michal Podstawski, Torsten Hoefler:
SeBS: a serverless benchmark suite for function-as-a-service computing. Middleware 2021: 64-78 - [c25]Grzegorz Kwasniewski, Tal Ben-Nun, Alexandros Nikolaos Ziogas, Timo Schneider, Maciej Besta, Torsten Hoefler:
On the parallel I/O optimality of linear algebra kernels: near-optimal LU factorization. PPoPP 2021: 463-464 - [c24]Grzegorz Kwasniewski, Marko Kabic, Tal Ben-Nun, Alexandros Nikolaos Ziogas, Jens Eirik Saethre, André Gaillard, Timo Schneider, Maciej Besta, Anton Kozhevnikov, Joost VandeVondele, Torsten Hoefler:
On the parallel I/O optimality of linear algebra kernels: near-optimal matrix factorizations. SC 2021: 70 - [c23]Lukas Gianinazzi, Maciej Besta, Yannick Schaffner, Torsten Hoefler:
Parallel Algorithms for Finding Large Cliques in Sparse Graphs. SPAA 2021: 243-253 - [c22]Grzegorz Kwasniewski, Tal Ben-Nun, Lukas Gianinazzi, Alexandru Calotoiu, Timo Schneider, Alexandros Nikolaos Ziogas, Maciej Besta, Torsten Hoefler:
Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower Bounds for Statically Analyzable Programs. SPAA 2021: 328-339 - [i37]Maciej Besta, Zur Vonarburg-Shmaria, Yannick Schaffner, Leonardo Schwarz, Grzegorz Kwasniewski, Lukas Gianinazzi, Jakub Beránek, Kacper Janda, Tobias Holenstein, Sebastian Leisinger, Peter Tatkowski, Esref Özdemir, Adrian Balla, Marcin Copik, Philipp Lindenberger, Pavel Kalvoda, Marek Konieczny, Onur Mutlu, Torsten Hoefler:
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra. CoRR abs/2103.03653 (2021) - [i36]Maciej Besta, Raghavendra Kanakagiri, Grzegorz Kwasniewski, Rachata Ausavarungnirun, Jakub Beránek, Konstantinos Kanellopoulos, Kacper Janda, Zur Vonarburg-Shmaria, Lukas Gianinazzi, Ioana Stefan, Juan Gómez-Luna, Marcin Copik, Lukas Kapp-Schwoerer, Salvatore Di Girolamo, Marek Konieczny, Onur Mutlu, Torsten Hoefler:
SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems. CoRR abs/2104.07582 (2021) - [i35]Grzegorz Kwasniewski, Tal Ben-Nun, Lukas Gianinazzi, Alexandru Calotoiu, Timo Schneider, Alexandros Nikolaos Ziogas, Maciej Besta, Torsten Hoefler:
Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower Bounds for Statically Analyzable Programs. CoRR abs/2105.07203 (2021) - [i34]Maciej Besta, Marcel Schneider, Salvatore Di Girolamo, Ankit Singla, Torsten Hoefler:
Towards Million-Server Network Simulations on Just a Laptop. CoRR abs/2105.12663 (2021) - [i33]Maciej Besta, Raphael Grob, Cesare Miglioli, Nicola Bernold, Grzegorz Kwasniewski, Gabriel Gjini, Raghavendra Kanakagiri, Saleh Ashkboos, Lukas Gianinazzi, Nikoli Dryden, Torsten Hoefler:
Motif Prediction with Graph Neural Networks. CoRR abs/2106.00761 (2021) - [i32]Lukas Gianinazzi, Maximilian Fries, Nikoli Dryden, Tal Ben-Nun, Maciej Besta, Torsten Hoefler:
Learning Combinatorial Node Labeling Algorithms. CoRR abs/2106.03594 (2021) - [i31]Grzegorz Kwasniewski, Marko Kabic, Tal Ben-Nun, Alexandros Nikolaos Ziogas, Jens Eirik Saethre, André Gaillard, Timo Schneider, Maciej Besta, Anton Kozhevnikov, Joost VandeVondele, Torsten Hoefler:
On the Parallel I/O Optimality of Linear Algebra Kernels: Near-Optimal Matrix Factorizations. CoRR abs/2108.09337 (2021) - [i30]Lukas Gianinazzi, Maciej Besta, Yannick Schaffner, Torsten Hoefler:
Parallel Algorithms for Finding Large Cliques in Sparse Graphs. CoRR abs/2109.09663 (2021) - 2020
- [j3]Maciej Besta, Marc Fischer, Tal Ben-Nun, Dimitri Stanojevic, Johannes de Fine Licht, Torsten Hoefler:
Substream-Centric Maximum Matchings on FPGA. ACM Trans. Reconfigurable Technol. Syst. 13(2): 8:1-8:33 (2020) - [c21]Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar Rätsch, Torsten Hoefler, Edgar Solomonik:
Communication-Efficient Jaccard similarity for High-Performance Distributed Genome Comparisons. IPDPS 2020: 1122-1132 - [c20]Maciej Besta, Marcel Schneider, Marek Konieczny, Karolina Cynk, Erik Henriksson, Salvatore Di Girolamo, Ankit Singla, Torsten Hoefler:
FatPaths: routing in supercomputers and data centers when shortest paths fall short. SC 2020: 27 - [c19]Maciej Besta, Armon Carigiet, Kacper Janda, Zur Vonarburg-Shmaria, Lukas Gianinazzi, Torsten Hoefler:
High-performance parallel graph coloring with strong guarantees on work, depth, and quality. SC 2020: 99 - [i29]Robert Gerstenberger, Maciej Besta, Torsten Hoefler:
Enabling Highly-Scalable Remote Memory Access Programming with MPI-3 One Sided. CoRR abs/2001.07747 (2020) - [i28]Maciej Besta, Jens Domke, Marcel Schneider, Marek Konieczny, Salvatore Di Girolamo, Timo Schneider, Ankit Singla, Torsten Hoefler:
High-Performance Routing with Multipathing and Path Diversity in Supercomputers and Data Centers. CoRR abs/2007.03776 (2020) - [i27]Maciej Besta, Armon Carigiet, Zur Vonarburg-Shmaria, Kacper Janda, Lukas Gianinazzi, Torsten Hoefler:
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality. CoRR abs/2008.11321 (2020) - [i26]Grzegorz Kwasniewski, Tal Ben-Nun, Alexandros Nikolaos Ziogas, Timo Schneider, Maciej Besta, Torsten Hoefler:
On the Parallel I/O Optimality of Linear Algebra Kernels: Near-Optimal LU Factorization. CoRR abs/2010.05975 (2020) - [i25]Maciej Besta, Torsten Hoefler:
Fault Tolerance for Remote Memory Access Programming Models. CoRR abs/2010.09025 (2020) - [i24]Maciej Besta, Torsten Hoefler:
Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages. CoRR abs/2010.09135 (2020) - [i23]Hermann Schweizer, Maciej Besta, Torsten Hoefler:
Evaluating the Cost of Atomic Operations on Modern Architectures. CoRR abs/2010.09852 (2020) - [i22]Patrick Schmid, Maciej Besta, Torsten Hoefler:
High-Performance Distributed RMA Locks. CoRR abs/2010.09854 (2020) - [i21]Maciej Besta, Florian Marending, Edgar Solomonik, Torsten Hoefler:
SlimSell: A Vectorizable Graph Representation for Breadth-First Search. CoRR abs/2010.09913 (2020) - [i20]Maciej Besta, Syed Minhaj Hassan, Sudhakar Yalamanchili, Rachata Ausavarungnirun, Onur Mutlu, Torsten Hoefler:
Slim NoC: A Low-Diameter On-Chip Network Topology for High Energy Efficiency and Scalability. CoRR abs/2010.10683 (2020) - [i19]Maciej Besta, Marc Fischer, Tal Ben-Nun, Dimitri Stanojevic, Johannes de Fine Licht, Torsten Hoefler:
Substream-Centric Maximum Matchings on FPGA. CoRR abs/2010.14684 (2020) - [i18]Maciej Besta, Dimitri Stanojevic, Tijana Zivic, Jagpreet Singh, Maurice Hoerold, Torsten Hoefler:
Log(Graph): A Near-Optimal High-Performance Graph Representation. CoRR abs/2010.15879 (2020) - [i17]Maciej Besta, Michal Podstawski, Linus Groner, Edgar Solomonik, Torsten Hoefler:
To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations. CoRR abs/2010.16012 (2020) - [i16]Sherif Sakr, Angela Bonifati, Hannes Voigt, Alexandru Iosup, Khaled Ammar, Renzo Angles, Walid G. Aref, Marcelo Arenas, Maciej Besta, Peter A. Boncz, Khuzaima Daudjee, Emanuele Della Valle, Stefania Dumbrava, Olaf Hartig, Bernhard Haslhofer, Tim Hegeman, Jan Hidders, Katja Hose, Adriana Iamnitchi, Vasiliki Kalavri, Hugo Kapp, Wim Martens, M. Tamer Özsu, Eric Peukert, Stefan Plantikow, Mohamed Ragab, Matei Ripeanu, Semih Salihoglu, Christian Schulz, Petra Selmer, Juan F. Sequeda, Joshua Shinavier, Gábor Szárnyas, Riccardo Tommasini, Antonino Tumeo, Alexandru Uta, Ana Lucia Varbanescu, Hsiang-Yun Wu, Nikolay Yakovets, Da Yan, Eiko Yoneki:
The Future is Big Graphs! A Community View on Graph Processing Systems. CoRR abs/2012.06171 (2020) - [i15]Marcin Copik, Grzegorz Kwasniewski, Maciej Besta, Michal Podstawski, Torsten Hoefler:
SeBS: A Serverless Benchmark Suite for Function-as-a-Service Computing. CoRR abs/2012.14132 (2020)
2010 – 2019
- 2019
- [c18]Maciej Besta, Marc Fischer, Tal Ben-Nun, Johannes de Fine Licht, Torsten Hoefler:
Substream-Centric Maximum Matchings on FPGA. FPGA 2019: 152-161 - [c17]Tal Ben-Nun, Maciej Besta, Simon Huber, Alexandros Nikolaos Ziogas, Daniel Peter, Torsten Hoefler:
A Modular Benchmarking Infrastructure for High-Performance and Reproducible Deep Learning. IPDPS 2019: 66-77 - [c16]Grzegorz Kwasniewski, Marko Kabic, Maciej Besta, Joost VandeVondele, Raffaele Solcà, Torsten Hoefler:
Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication. SC 2019: 24:1-24:22 - [c15]Maciej Besta, Simon Weber, Lukas Gianinazzi, Robert Gerstenberger, Andrey Ivanov, Yishai Oltchik, Torsten Hoefler:
Slim graph: practical lossy graph compression for approximate graph processing, storage, and analytics. SC 2019: 35:1-35:25 - [c14]Salvatore Di Girolamo, Konstantin Taranov, Andreas Kurth, Michael Schaffner, Timo Schneider, Jakub Beránek, Maciej Besta, Luca Benini, Duncan Roweth, Torsten Hoefler:
Network-accelerated non-contiguous memory transfers. SC 2019: 56:1-56:14 - [i14]Tal Ben-Nun, Maciej Besta, Simon Huber, Alexandros Nikolaos Ziogas, Daniel Peter, Torsten Hoefler:
A Modular Benchmarking Infrastructure for High-Performance and Reproducible Deep Learning. CoRR abs/1901.10183 (2019) - [i13]Maciej Besta, Dimitri Stanojevic, Johannes de Fine Licht, Tal Ben-Nun, Torsten Hoefler:
Graph Processing on FPGAs: Taxonomy, Survey, Challenges. CoRR abs/1903.06697 (2019) - [i12]Maciej Besta, Marcel Schneider, Karolina Cynk, Marek Konieczny, Erik Henriksson, Salvatore Di Girolamo, Ankit Singla, Torsten Hoefler:
FatPaths: Routing in Supercomputers, Data Centers, and Clouds with Low-Diameter Networks when Shortest Paths Fall Short. CoRR abs/1906.10885 (2019) - [i11]Salvatore Di Girolamo, Konstantin Taranov, Andreas Kurth, Michael Schaffner, Timo Schneider, Jakub Beránek, Maciej Besta, Luca Benini, Duncan Roweth, Torsten Hoefler:
Network-Accelerated Non-Contiguous Memory Transfers. CoRR abs/1908.08590 (2019) - [i10]Grzegorz Kwasniewski, Marko Kabic, Maciej Besta, Joost VandeVondele, Raffaele Solcà, Torsten Hoefler:
Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication. CoRR abs/1908.09606 (2019) - [i9]Maciej Besta, Emanuel Peter, Robert Gerstenberger, Marc Fischer, Michal Podstawski, Claude Barthels, Gustavo Alonso, Torsten Hoefler:
Demystifying Graph Databases: Analysis and Taxonomy of Data Organization, System Designs, and Graph Queries. CoRR abs/1910.09017 (2019) - [i8]Maciej Besta, Torsten Hoefler:
Active Access: A Mechanism for High-Performance Distributed Data-Centric Computations. CoRR abs/1910.12897 (2019) - [i7]Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar Rätsch, Torsten Hoefler, Edgar Solomonik:
Communication-Efficient Jaccard Similarity for High-Performance Distributed Genome Comparisons. CoRR abs/1911.04200 (2019) - [i6]Maciej Besta, Simon Weber, Lukas Gianinazzi, Robert Gerstenberger, Andrey Ivanov, Yishai Oltchik, Torsten Hoefler:
Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics. CoRR abs/1912.08950 (2019) - [i5]Maciej Besta, Torsten Hoefler:
Slim Fly: A Cost Effective Low-Diameter Network Topology. CoRR abs/1912.08968 (2019) - [i4]Maciej Besta, Marc Fischer, Vasiliki Kalavri, Michael Kapralov, Torsten Hoefler:
Practice of Streaming and Dynamic Graphs: Concepts, Models, Systems, and Parallelism. CoRR abs/1912.12740 (2019) - 2018
- [j2]Robert Gerstenberger, Maciej Besta, Torsten Hoefler:
Enabling highly scalable remote memory access programming with MPI-3 one sided. Commun. ACM 61(10): 106-113 (2018) - [c13]Maciej Besta, Dimitri Stanojevic, Tijana Zivic, Jagpreet Singh, Maurice Hoerold, Torsten Hoefler:
Log(graph): a near-optimal high-performance graph representation. PACT 2018: 7:1-7:13 - [c12]Maciej Besta, Syed Minhaj Hassan, Sudhakar Yalamanchili, Rachata Ausavarungnirun, Onur Mutlu, Torsten Hoefler:
Slim NoC: A Low-Diameter On-Chip Network Topology for High Energy Efficiency and Scalability. ASPLOS 2018: 43-55 - [c11]Lukas Gianinazzi, Pavel Kalvoda, Alessandro De Palma, Maciej Besta, Torsten Hoefler:
Communication-avoiding parallel minimum cuts and connected components. PPoPP 2018: 219-232 - [i3]Johannes de Fine Licht, Maciej Besta, Simon Meierhans, Torsten Hoefler:
Transformations of High-Level Synthesis Codes for High-Performance Computing. CoRR abs/1805.08288 (2018) - [i2]Maciej Besta, Torsten Hoefler:
Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations. CoRR abs/1806.01799 (2018) - 2017
- [c10]Maciej Besta, Michal Podstawski, Linus Groner, Edgar Solomonik, Torsten Hoefler:
To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations. HPDC 2017: 93-104 - [c9]Maciej Besta, Florian Marending, Edgar Solomonik, Torsten Hoefler:
SlimSell: A Vectorizable Graph Representation for Breadth-First Search. IPDPS 2017: 32-41 - [c8]Edgar Solomonik, Maciej Besta, Flavio Vella, Torsten Hoefler:
Scaling betweenness centrality using communication-efficient sparse matrix multiplication. SC 2017: 47 - 2016
- [c7]Patrick Schmid, Maciej Besta, Torsten Hoefler:
High-Performance Distributed RMA Locks. HPDC 2016: 19-30 - [i1]Edgar Solomonik, Maciej Besta, Flavio Vella, Torsten Hoefler:
Betweenness Centrality is more Parallelizable than Dense Matrix Multiplication. CoRR abs/1609.07008 (2016) - 2015
- [c6]Hermann Schweizer, Maciej Besta, Torsten Hoefler:
Evaluating the Cost of Atomic Operations on Modern Architectures. PACT 2015: 445-456 - [c5]Maciej Besta, Torsten Hoefler:
Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages. HPDC 2015: 161-172 - [c4]Maciej Besta, Torsten Hoefler:
Active Access: A Mechanism for High-Performance Distributed Data-Centric Computations. ICS 2015: 155-164 - 2014
- [j1]Robert Gerstenberger, Maciej Besta, Torsten Hoefler:
Enabling highly-scalable remote memory access programming with MPI-3 One Sided. Sci. Program. 22(2): 75-91 (2014) - [c3]Maciej Besta, Torsten Hoefler:
Fault tolerance for remote memory access programming models. HPDC 2014: 37-48 - [c2]Maciej Besta, Torsten Hoefler:
Slim Fly: A Cost Effective Low-Diameter Network Topology. SC 2014: 348-359 - 2013
- [c1]Robert Gerstenberger, Maciej Besta, Torsten Hoefler:
Enabling highly-scalable remote memory access programming with MPI-3 one sided. SC 2013: 53:1-53:12
Coauthor Index
[j10] [j9] [c46] [c45] [c44] [c43] [c42] [c41] [i60] [i59] [i58] [i57] [i56] [i55] [i54] [i53] [j8] [c40] [c39] [c38] [c37] [c36] [c35] [d3] [d2] [d1] [i52] [i51] [i50] [i49] [i48] [i47] [i46] [c34] [c33] [c32] [c31] [c30] [c29] [c28] [i45] [i44] [i43] [i42] [i41] [i40] [i39] [i38] [j6] [j5] [j4] [c27] [c26] [c25] [c24] [c23] [c22] [i37] [i36] [i35] [i34] [i33] [i32] [i31] [i30] [j3] [c21] [c20] [c19] [i29] [i28] [i27] [i26] [i25] [i24] [i23] [i22] [i21] [i20] [i19] [i18] [i17] [i15] [c18] [c17] [c16] [c15] [c14] [i14] [i13] [i12] [i11] [i10] [i9] [i8] [i7] [i6] [i5] [i4] [j2] [c13] [c12] [c11] [i3] [i2] [c10] [c9] [c8] [c7] [i1] [c6] [c5] [c4] [j1] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
