Jeffrey Mendelsohn
where else to find them
no profile links on file
what they talk about
where they keep going back
- ACCU3 editions2018–2024
on a stage with
never shared a talk
who talks about the same things
- Roberto Clapis11 talks
- Jana Machutová4 talks
- Ruslan Nikolaev3 talks
- Matt Kulukundis5 talks
- Anthony Williams18 talks
- Rainer Grimm26 talks
| title | conference | date |
|---|---|---|
| Introduction to Lock/Wait Free Algorithms - Defining and Understanding the Terms | ACCU 2024 | 2024-04-17 |
Defines compare-and-swap as the common atomic primitive and gives a concrete claim: lock‑free means for every subset of threads at least one thread can make… | ||
| Introduction to Epoch-Based Memory Reclamation | ACCU 2023 | 2023-04-19 |
Epoch-based reclamation tracks threads with an epoch counter: threads increment a current-epoch counter on entry and decrement on exit, retired nodes go into… | ||
| Would 'reserve'/'upgrade'/'downgrade' Methods Improve 'std::shared_mutex'? | ACCU 2018 | 2018-04-11 |
Implements a competitive reserve/upgrade variant of std::shared_mutex on Linux, runs a microbenchmark that times completed jobs (80th percentile) while… | ||
| Reader-Writer Lock versus Mutex | Meeting C++ 2017 | 2017-11-09 |
Claim: a mutex often outperforms a reader‑writer lock in high‑contention, short‑hold regimes. Evaluation uses Linux multi‑platform benchmarks with synthetic… | ||
| Reader-Writer Lock versus Mutex - Understanding a Lost Bet | CppCon 2017 | 2017-09-24 |
A controlled Linux benchmark simulates back-to-back access to a shared map (load ≈300 math ops) and compares do-nothing, a single atomic operation, pthread… | ||
| nothing matches | ||