I previously asked this question on Programmers.SE, without success.I'm looking for written learning resources on how to design concurrent data structures. I'm more interested in the design process (e.g., identifying the right invariants) than in the final product (a full code listing).For a concrete example: I really enjoyed Chris Okasaki's book Purely Functional Data Structures, because it's more than just a reference - it guides the reader through the design of its data structures and algorithms. Often, the book motivates a tricky or non-obvious design by first giving a more nave version, and only then refining it until the desired time complexity (either worst-case or amortized) is achieved. This is the kind of thing I'm looking for.So:What techniques or heuristics exist for designing concurrent data structures?Are there any books, papers, blog posts, tutorials, etc. explaining these techniques and heuristics?
How to design concurrent data structures?
ds.algorithms;reference request;ds.data structures;concurrency