Building concurrent data structure is a broad field of wide concern. These notes cover much the same space as the notes from Chapter 4, Sync and Send – the Foundation of Rust Concurrency. Please do refer back to those notes.
- The Little Book of Semaphores, Allen Downey, available at http://greenteapress.com/wp/semaphores/.This is a charming book of concurrency puzzles, suitable for undergraduates but challenging enough in Rust for the absence of semaphores. We'll revisit this book in the next chapter when we build concurrency primitives out of atomics.
- The Computability of Relaxed Data Structures: Queues and Stacks as Examples, Nir Shavit and Gadi Taubenfeld. This chapter discussed the implementation of a concurrent queue based on the presentation of The Art of Multiprocessor Programming and the author's knowledge of Erlang's process queue. Queues are a common concurrent data structure and there are a great many possible approaches. This paper discusses an interesting notion...