Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Omri Kahalon

dblp:298/5408 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0002-4243-7553ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 77% Interconnection networks and networks-on-chip · 23%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 87% Distributed computing theory · 13%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › virtualization
device pass-through
0.912025
Device-Assisted Live Migration of RDMA Devices · SOSP 2025
Cloud and datacenter computing › virtualization › virtual machine migration
live migration
0.912025
Device-Assisted Live Migration of RDMA Devices · SOSP 2025
Interconnection networks and networks-on-chip
remote direct memory access
0.912025
Device-Assisted Live Migration of RDMA Devices · SOSP 2025
Cloud and datacenter computing
virtualization
0.912025
Device-Assisted Live Migration of RDMA Devices · SOSP 2025
Graph algorithms and graph theory
graph spanners
0.612022
Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners · PODC 2022
Graph algorithms and graph theory › graph spanners
metric spanners
0.612022
Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners · PODC 2022
Cloud and datacenter computing
cloud infrastructure
0.312025
Device-Assisted Live Migration of RDMA Devices · SOSP 2025
Distributed computing theory
distributed graph algorithms
0.212022
Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners · PODC 2022

Methods — techniques the papers use, named apart from their topics

metric embedding · 0.6
YearPublicationVenuePosition
2025 Device-Assisted Live Migration of RDMA Devices
abstract
Recently, we have seen growing pressure to move highperformance workloads, such as HPC and AI, to cloud environments that offer more affordable and manageable infrastructure. These workloads require direct access to RDMA devices for high-performance communication. Device passthrough, however, violates the decoupling between the guest OS and the underlying hardware, making Live Migration (LM) extremely challenging [29, 38, 40, 42, 48].
Artem Y. Polyakov, Gal Shalom, Asaf Schwartz, Aviad Yehezkel, Omri Ben David, Omri Kahalon, Ariel Shahar, Liran Liss
SOSP6
2022 Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners
abstract
Spanners for metric spaces have been extensively studied, perhaps most notably in low-dimensional Euclidean spaces - due to their numerous applications. Euclidean spanners can be viewed as means of compressing the (n2) pairwise distances of a d-dimensional Euclidean space into O(n) = O∈,d (n) spanner edges, so that the spanner distances preserve the original distances to within a factor of 1 + ε, for any ε > 0. Moreover, one can compute such spanners efficiently in the standard centralized and distributed settings. Once the spanner has been computed, it serves as a "proxy" overlay network, on which the computation can proceed, which gives rise to huge savings in space and other important quality measures. The original metric enables us to "navigate" optimally - a single
Omri Kahalon, Hung Le 0001, Lazar Milenkovic, Shay Solomon
PODC1