Loading…
This event has ended. Visit the official site or create your own event on Sched.
View analytic
Wednesday, September 27 • 4:45pm - 5:45pm
An Interesting Lock-free Queue - Part 2 of N

Log in to save this to your schedule and see who's attending!

Feedback form is now closed.
This is the long awaited continuation of a previous CppCon talk ("Lock-free by Example") on an "interesting" lock-free queue. ("interesting"? Well, "multi-producer, multi-consumer, growing, shrinking, mostly contiguous, lock-free circular queue" is a bit long. Maybe "complicated" is a better word.)

Attendance at the previous talk is completely NOT required.

This time we will not just review where we left off, but attempt to "prove" that what we did is actually correct, and thus discuss how to prove correctness of lock-free algorithms, and discuss provability vs testing.

And then, with the first steps proven (or disproven! - and hopefully corrected!), we can continue to expand the features of the queue, and tackle the new challenges that arise.

Also, this is secretly a talk to convince you not to do lock-free programming. Shhh...

Speakers
avatar for Tony Van Eerd

Tony Van Eerd

Ninja/Jedi/Tony, Christie Digital
Tony has been coding for well over 25 years, and maybe coding well for some of that. Lots of pixel++, UX, threading, etc. Previously at Inscriber, Adobe, BlackBerry, he now enables Painting with Light at Christie. He is on the C++ Committee. He is a Ninja and a Jedi. Lock-free is... Read More →


Wednesday September 27, 2017 4:45pm - 5:45pm
ENIAC (404) Meydenbauer Center

Attendees (122)