Loading…
This event has ended. View the official site or create your own event → Check it out
This event has ended. Create your own
View analytic
Wednesday, September 23 • 2:00pm - 3:00pm
How to make your data structures wait-free for reads

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

In this talk we will describe a new concurrency control algorithm with Blocking write operations and Wait-Free Population Oblivious read operations, which we named the Left-Right algorithm.

We will show a new pattern where this algorithm is applied, which requires using two instances of a given resource, and can be used for any data structure, allowing concurrent access to it similarly to a Reader-Writer lock, but in a non-blocking manner for reads, including safe memory management without needing a Garbage Collector.

Speakers
avatar for Pedro Ramalhete

Pedro Ramalhete

Cisco
Pedro has a PhD in Particle Physics for research done at CERN. Most of the research itself required programming in C++, and I also had a major participation in the coding of the experiment's data acquisition and decoding software in C and C++. I'm currently working at Cisco writing networking software, with emphasis on real-time concurrent synchronization techniques, and wait-free/lock-free data structures.


Wednesday September 23, 2015 2:00pm - 3:00pm
Hopper Theater Meydenbauer Center

Attendees (153)