Here is one of the first : http://www.azulsystems.com/sites/www.azulsystems.com/files/events/javaone_20... But search for lock-free or buffer-trees for all manner of fun. It is a fascinating intersection of architecture, programming languages, and concurrency. There's a big gap between what happens and what people think happens in memory models. A simple example is the antipattern of the double-checked lock. And further: study the C standard for what memory guarantees it provides. -tom On Apr 20, 2014 12:05 PM, "Fred Lunnon" <fred.lunnon@gmail.com> wrote:
Got any good references or URLs, then? WFL
On 4/20/14, Tom Rokicki <rokicki@gmail.com> wrote:
Supporting efficient and correct multithreading, and predictable SIMD, is of much more interest to me than bit twiddling.
Consider for example something as fundamental as a hash table, but accessible to multiple threads. Much work has been done, some fascinating. On Apr 20, 2014 10:30 AM, "Warren D Smith" <warren.wds@gmail.com> wrote:
Do you want to work on defining a new computer language? Send me email.
-- Warren D. Smith
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun