[amelius]

> Traditional data structures assume a single-threaded execution model and break if multiple operations canbe performed at once. (Just imagine how awful it would be if you tried to access a splay tree with multiplethreads.) Can you design data structures that work safely in a parallel model – or, better yet, take maxi-mum advantage of parallelism? In many cases, the answer is yes, but the data structures look nothing liketheir single-threaded counterparts.

Makes me wonder which data structures have "parallel" versions besides the two mentioned.

[thekdude]

The Art of Multiprocessor Programming by Herlihy and Shavit have many examples, including stacks, queues, skip lists, and hash tables. There's plenty of papers out there too that have parallel implementations of vectors, various tree structures and more.

[teej]

Check out CRDTs - https://en.wikipedia.org/wiki/Conflict-free_replicated_data_...

[dominotw]

would all of scala's default( immutable) datastructures fit the bill?

[dominotw]

I was just curious. Not sure why this is downvoted.