Scalable Nonblocking Data Structures

Posted by kdawson on Tuesday May 27, 2008 @08:10AM from the don't-fear-the-multi-core dept.

An anonymous reader writes "InfoQ has an interesting writeup of Dr. Cliff Click's work on developing highly concurrent data structures for use on the Azul hardware (which is in production with 768 cores), supporting 700+ hardware threads in Java. The basic idea is to use a new coding style that involves a large array to hold the data (allowing scalable parallel access), atomic update on those array words, and a finite-state machine built from the atomic update and logically replicated per array word. The end result is a coding style that has allowed Click to build 2.5 lock-free data structures that also scale remarkably well."

1 of 216 comments (clear)

Min score:

Reason:

Sort:

Java???? by maz2331 · 2008-05-27 08:29 · Score: 0, Flamebait

700 threads in JAVA? Why not use C++, actually optimize the hell out of the code, and get it down considerably. Or get a lot more done per thread.

Or... is this just a way to avoid having to get the really good coders who are more costly than the burn-bags?