Matt Kulukundis
where else to find them
what they talk about
all 6 in the filters
where they keep going back
- CppCon4 editions2017–2021
on a stage with
- Jon Cohenonce
- Mike Kruskalonce
who talks about the same things
- Jeffrey Mendelsohn5 talks
- Roberto Clapis11 talks
- Paul E. McKenney23 talks
- Tony Van Eerd17 talks
- Anthony Williams18 talks
- André Almeida14 talks
| title | conference | date |
|---|---|---|
| Introducing Protobuf Editions - Matt Kulukundis & Mike Kruskal, Google | gRPConf 2023 | 2023-09-20 |
Protobuf Editions introduces edition-scoped defaults and per-field features that let generated APIs evolve incrementally without changing wire format; features… | ||
| Building a Lock-free Multi-producer, Multi-consumer Queue for Tcmalloc | CppCon 2021 | 2021-10-24 |
Built a lock‑free MPMC queue to replace the mutexed transfer cache inside tcmalloc, using atomics, widened counters to mitigate ABA, unit tests, fuzzing and… | ||
| Abseil's Open Source Hashtables: 2 Years In | CppCon 2019 | 2019-09-15 |
Abseil’s flat hash tables use 16-wide SSE probes with an h1/h2 split to avoid EQ calls, yielding about 5–10% faster finds but 10–20% slower hot inserts in… | ||
| Touring the Tips of the Week Series | CppCon 2018 | 2018-09-23 |
Overview of the C++ Tip of the Week series with concrete rules: copies vs moves follow a name-counting rule (one name → move, two names → copy), prefer value… | ||
| Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step | CppCon 2017 | 2017-09-24 |
A new hash table called SwissTable implements a 2-level, N-way associative probing design with per-slot control bytes (seven-bit H2 tags) packed in 16-byte… | ||
| nothing matches | ||