Adam Morrison
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
no series more than once — all 6 in the filters
on a stage with
all 11 in the filters
who talks about the same things
- Anton Podkopaev5 talks
- Artem Khyzha2 talks
- Vitaly Aksenov4 talks
- Ivan Prisyazhniy4 talks
- Andreas Pavlogiannis18 talks
- Ori Lahav17 talks
| title | conference | date |
|---|---|---|
| Disentangling the Dual Role of NIC Receive Rings | OSDI '25 | 2025-07-07 |
Claim: rxBisect splits each Rx ring into two independent rings so allocation and packet delivery decouple, implemented with software NIC emulation and… | ||
| Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure | USENIX ATC '23 | 2023-07-10 |
Shows a concrete timing attack called prefix siphoning that abuses LSM-tree range filters (demonstrated on SuRF and the prefix Bloom filter) to recover key… | ||
| ShRing: Networking with Shared Receive Rings | OSDI 2023 | 2023-07-10 |
Multicore NIC receive rings default to 1024-entry rings with ~1.5 KiB per buffer, so per-core working sets reach ~1.5 MiB and the aggregate exceeds LLC/DDIO… | ||
| Privbox: Faster System Calls Through Sandboxed Privileged Execution | USENIX ATC '22 | 2022-07-11 |
Privbox implements a semi-privileged sandbox that runs annotated hot paths at ring 0 on Linux (LLVM toolchain) yet vets them with a verifier and… | ||
| Designing fast lock free algorithms by understanding cache coherence dynamics | Hydra 2021 | 2021-06-15 |
Shows that cache-coherence dynamics (the MESI-style directory flow and forward/invalidation messages) make contended CAS operations serialize and incur latency… | ||
| Proving Highly-Concurrent Traversals Correct | OOPSLA 2020 | 2020-11-15 |
Paper proves that optimistic lock-free traversals are correct by reducing concurrent traversal correctness to sequential reasoning plus two concrete… | ||
| nothing matches | ||