A Lock-Free Hash Table - Cliff Click
"Shawn Hartsock" <[email protected]>
| Newsgroups | gmane.org.user-groups.trijug.juglist |
|---|---|
| Message-ID | <[email protected]> |
My apologies if you've all already seen this. ...floating around on Slashdot right now: http://video.google.com/videoplay?docid=2139967204534450862 In summary Dr. Cliff Click has written a concurrent data structure that gets around what many considered intrinsic barriers to multi-threaded programming. His talk is very accessible and he makes an interesting use of a Finite State machine as proof-of-correctness. I'd love to hear this groups take on Azul and these techniques. I'm also curious if many Java programmers in the triangle have to deal with concurrency themselves or if they happily let Spring/J2EE take care of the issues by marking things transactional. The interesting bit in Click's talk (at least to me) is that he has a concurrent data structure that is thread safe and doesn't make use of a single lock or synchronize. (If he is I'm missing it and would love to be corrected.) -- /** Shawn.Hartsock http://hartsock.blogspot.com/ //*/