Building a Lock-free Multi-producer, Multi-consumer Queue for Tcmalloc - Matt Kulukundis - CppCon 21

Описание к видео Building a Lock-free Multi-producer, Multi-consumer Queue for Tcmalloc - Matt Kulukundis - CppCon 21

https://cppcon.org/
https://github.com/CppCon/CppCon2021
---
Lock free multi-producer, multi-consumer queues are an area of active research in concurrent data structures, but their performance varies heavily with the specific constraints of the surrounding system. This talk tells the story of building such a queue to replace a component in tcmalloc, Google's malloc implementation. In the process, we will cover

designing the initial data structure based on LMAX's disruptor pattern
refactoring the existing code to increase testability and experimentation without introducing overhead
adding micro benchmarks for the new code
revising micro benchmarks in the face of conflicting system level metrics
optimizing the data structure based on those conclusions
debugging difficult concurrency bugs
measuring the final result with system level metrics

---
Matt Kulukundis
Matt is a senior software engineer on the C++ libraries team at Google. Prior to Google he has worked on compilers, machine learning, and underwater robotics. In his free time, he scuba dives in warm places.

---
Videos Filmed & Edited by Bash Films: http://www.BashFilms.com

YouTube Channel Managed by Digital Medium Ltd https://events.digital-medium.co.uk

Register Now For CppCon 2022: https://cppcon.org/registration/

Комментарии

Информация по комментариям в разработке