Loading…
This event has ended. View the official site or create your own event → Check it out
This event has ended. Create your own
Please visit the C++Now website.
View analytic
Friday, May 13 • 11:00am - 12:30pm
An Interesting Lock-free Queue - Part 2 of N

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

This is a continuation of last year's talk 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 last year's talk is completely NOT required. This time we will not just review where we left off last year, 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.

Speakers
avatar for Tony Van Eerd

Tony Van Eerd

Christie Digital
Tony Van Eerd has been coding for well over 25 years, and hopefully coding well for at least some of that. Most of that time has been in the graphics/video/film/broadcast industry (at Inscriber/Adobe), writing low level pixel++, high level UI, as well as threading and everything else in between. After a few years of being "the C++ Guy" at BlackBerry, he is back to doing math and pixel++, now at Christie Digital.


Friday May 13, 2016 11:00am - 12:30pm
Flug Auditorium

Attendees (43)