Marcin Chrapek
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Marcin Chrapek has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Torsten Hoefler
ETH Zurich, Zurich, Switzerland
5 shared publications - Mikhail Khalilov
ETH Zurich, Zurich, Switzerland
3 shared publications - Siyuan Shen
ETH Zurich, Zurich, Switzerland
3 shared publications - Timo Schneider
ETH Zurich, Zurich, Switzerland
2 shared publications - Abdul Kabbani
Microsoft Corporation, Redmond, USA
1 shared publication - Afif Boudaoud
ETH Zurich, Zurich, Switzerland
1 shared publication
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 610-622
Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
Advances in embedding models for text, image, audio, and video drive progress across multiple domains, including retrieval-augmented generation, recommendation systems, and others. Many of these applications require an efficient method to retrieve items that are close to a given query in the embedding space while satisfying a filter condition based on the item's attributes, a problem known as filtered approximate nearest neighbor search (FANNS). By performing an in-depth literature analysis on FANNS, we identify a key gap in the research landscape: publicly available datasets with embedding vectors from state-of-the-art transformer-based text embedding models that contain abundant real-world attributes covering a broad spectrum of attribute types and value distributions. To fill this gap, we introduce the arxiv-for-fanns dataset of transformer-based embedding vectors for the abstracts of over 2.7 million arXiv papers, enriched with 11 real-world attributes such as authors and categories. We benchmark eleven different FANNS methods on our new dataset to evaluate their performance across different filter types, numbers of retrieved neighbors, dataset scales, and query selectivities. We distill our findings into eight key observations that guide users in selecting the most suitable FANNS method for their specific use cases.
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 610-622
Open AccessBenchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
Advances in embedding models for text, image, audio, and video drive progress across multiple domains, including retrieval-augmented generation, recommendation systems, and others. Many of these applications require an efficient method to retrieve items that are close to a given query in the embedding space while satisfying a filter condition based on the item's attributes, a problem known as filtered approximate nearest neighbor search (FANNS). By performing an in-depth literature analysis on FANNS, we identify a key gap in the research landscape: publicly available datasets with embedding vectors from state-of-the-art transformer-based text embedding models that contain abundant real-world attributes covering a broad spectrum of attribute types and value distributions. To fill this gap, we introduce the arxiv-for-fanns dataset of transformer-based embedding vectors for the abstracts of over 2.7 million arXiv papers, enriched with 11 real-world attributes such as authors and categories. We benchmark eleven different FANNS methods on our new dataset to evaluate their performance across different filter types, numbers of retrieved neighbors, dataset scales, and query selectivities. We distill our findings into eight key observations that guide users in selecting the most suitable FANNS method for their specific use cases.
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 137-151
PerfDojo: Automated ML Library Generation for Heterogeneous Architectures
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 137-151
Open AccessPerfDojo: Automated ML Library Generation for Heterogeneous Architectures
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1223-1239
SDR-RDMA: Software-Defined Reliability Architecture for Planetary Scale RDMA Communication
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1223-1239
Open AccessSDR-RDMA: Software-Defined Reliability Architecture for Planetary Scale RDMA Communication
- Open Access
- 8 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1005-1019
EDAN: Towards Understanding Memory Parallelism and Latency Sensitivity in HPC
- 8 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1005-1019
Open AccessEDAN: Towards Understanding Memory Parallelism and Latency Sensitivity in HPC
- Open Access
- 11 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-17
HEAR: Homomorphically Encrypted Allreduce
Allreduce is one of the most commonly used collective operations. Its latency and bandwidth can be improved by offloading the calculations to the network. However, no way exists to conduct such offloading securely; in state-of-the-art solutions, the data is passed unprotected into the network. Security is a significant concern for High-Performance Computing applications, but achieving it while maintaining performance remains challenging. We present HEAR, the first high-performance system for securing in-network compute and Allreduce operations based on homomorphic encryption. HEAR implements carefully designed and modified encryption schemes for the most common Allreduce functions and leverages communication domain knowledge in MPI programs to obtain decryption and encryption routines with high performance. HEAR operates on integers and floats with no code base and no or little hardware changes. We design and evaluate HEAR, showing its minimal overhead, and open-source our implementation. HEAR represents the first step towards achieving confidential HPC.
- 11 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-17
Open AccessHEAR: Homomorphically Encrypted Allreduce
Allreduce is one of the most commonly used collective operations. Its latency and bandwidth can be improved by offloading the calculations to the network. However, no way exists to conduct such offloading securely; in state-of-the-art solutions, the data is passed unprotected into the network. Security is a significant concern for High-Performance Computing applications, but achieving it while maintaining performance remains challenging. We present HEAR, the first high-performance system for securing in-network compute and Allreduce operations based on homomorphic encryption. HEAR implements carefully designed and modified encryption schemes for the most common Allreduce functions and leverages communication domain knowledge in MPI programs to obtain decryption and encryption routines with high performance. HEAR operates on integers and floats with no code base and no or little hardware changes. We design and evaluate HEAR, showing its minimal overhead, and open-source our implementation. HEAR represents the first step towards achieving confidential HPC.