Follow
Maciej Besta
Title
Cited by
Cited by
Year
Slim fly: A cost effective low-diameter network topology
M Besta, T Hoefler
SC'14: proceedings of the international conference for high performance …, 2014
2872014
Enabling highly-scalable remote memory access programming with MPI-3 one sided
R Gerstenberger, M Besta, T Hoefler
Proceedings of the International Conference on High Performance Computing …, 2013
1492013
To push or to pull: On reducing communication and synchronization in graph computations
M Besta, M Podstawski, L Groner, E Solomonik, T Hoefler
Proceedings of the 26th International Symposium on High-Performance Parallel …, 2017
1262017
Evaluating the cost of atomic operations on modern architectures
H Schweizer, M Besta, T Hoefler
2015 International Conference on Parallel Architecture and Compilation (PACT …, 2015
952015
Survey and taxonomy of lossless graph compression and space-efficient graph representations
M Besta, T Hoefler
arXiv preprint arXiv:1806.01799, 2018
732018
Scaling betweenness centrality using communication-efficient sparse matrix multiplication
E Solomonik, M Besta, F Vella, T Hoefler
Proceedings of the International Conference for High Performance Computing …, 2017
712017
A modular benchmarking infrastructure for high-performance and reproducible deep learning
T Ben-Nun, M Besta, S Huber, AN Ziogas, D Peter, T Hoefler
2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2019
702019
Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries
M Besta, E Peter, R Gerstenberger, M Fischer, M Podstawski, C Barthels, ...
arXiv preprint arXiv:1910.09017, 2019
68*2019
Transformations of high-level synthesis codes for high-performance computing
J de Fine Licht, M Besta, S Meierhans, T Hoefler
IEEE Transactions on Parallel and Distributed Systems 32 (5), 1014-1029, 2020
642020
Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication
G Kwasniewski, M Kabić, M Besta, J VandeVondele, R Solcà, T Hoefler
Proceedings of the International Conference for High Performance Computing …, 2019
602019
Slimsell: A vectorizable graph representation for breadth-first search
M Besta, F Marending, E Solomonik, T Hoefler
2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2017
552017
Programming abstractions for data locality
A Tate, A Kamil, A Dubey, A Groblinger, B Chamberlain, B Goglin, ...
Office of Scientific and Technical Information (OSTI), 2014
502014
The future is big graphs: a community view on graph processing systems
S Sakr, A Bonifati, H Voigt, A Iosup, K Ammar, R Angles, W Aref, M Arenas, ...
Communications of the ACM 64 (9), 62-71, 2021
482021
Slim noc: A low-diameter on-chip network topology for high energy efficiency and scalability
M Besta, SM Hassan, S Yalamanchili, R Ausavarungnirun, O Mutlu, ...
ACM SIGPLAN Notices 53 (2), 43-55, 2018
482018
Accelerating irregular computations with hardware transactional memory and active messages
M Besta, T Hoefler
Proceedings of the 24th International Symposium on High-Performance Parallel …, 2015
472015
Graph processing on fpgas: Taxonomy, survey, challenges
M Besta, D Stanojevic, JDF Licht, T Ben-Nun, T Hoefler
arXiv preprint arXiv:1903.06697, 2019
452019
Practice of streaming processing of dynamic graphs: Concepts, models, and systems
M Besta, M Fischer, V Kalavri, M Kapralov, T Hoefler
IEEE Transactions on Parallel and Distributed Systems, 2021
43*2021
Fault tolerance for remote memory access programming models
M Besta, T Hoefler
Proceedings of the 23rd international symposium on High-performance parallel …, 2014
392014
Sebs: A serverless benchmark suite for function-as-a-service computing
M Copik, G Kwasniewski, M Besta, M Podstawski, T Hoefler
Proceedings of the 22nd International Middleware Conference, 64-78, 2021
382021
High-performance distributed RMA locks
P Schmid, M Besta, T Hoefler
Proceedings of the 25th ACM International Symposium on High-Performance …, 2016
352016
The system can't perform the operation now. Try again later.
Articles 1–20