Reliable Embedded Systems

Concurrency-friendly data structures PDF Print E-mail
Linked Lists and Balanced Trees are familiar data structures, but can they make the leap to parallelized environments?

This time you will say: "What did the old fart (Robert) dig out this time? I don't want to go back to my classes about data structures!". Maybe it's worth having a look at this article by Herb Sutter tough.

Full Story 

 

 

 

 

 
< Prev   Next >
With your technical knowledge you are kind of ambidextrous in your domain Amitesh Sahay
 
Partners
You are here  :Home arrow Blog arrow Concurrency-friendly data structures