Cliff Click Jr.’s Blog
Go to: Cliff Click Jr.’s Blog
2 shares
JavaOne
via Cliff Click Jr.’s Blog by Cliff Click on April 30, 2008
... what I'm proposing is very accessible (no Phd required!).Towards a Coding Style for Scalable Nonblocking Data Structures is ... well, hopefully the title is fairly self-explanatory. I've talked this on this blog before; slides here. The basic idea is a coding style that involves a large array to hold the data (allowing scalable parallel access), atomic update on those array words, a...
Shared by: Bob Lee, Mustafa K. Isik,
[ Back to top]
2 shares
Post JavaOne Update
via Cliff Click Jr.’s Blog by Cliff Click on May 11, 2008
... not as pasty-white as myself (and I arrived with one of them). It was so different, that it felt like a refreshing change from the usual SF polyglot... but I was glad to walk out the door and see somebody who didn't look like a mirror image of myself. Like programming languages, sameness is bland in the short term and a form of death in the long term. Viva 'la difference!Cliff
Shared by: cb160, Mustafa K. Isik,
[ Back to top]
1 shares
Talk is Cheap...
via Cliff Click Jr.’s Blog by Cliff Click on February 11, 2008
... our current concurrent programming models. Concurrent programming is very hard, and most of the currently debated solutions (e.g. transactional memory, atomic, locks, threads) does NOT address the hardest part of writing concurrent code.Debugging Data Races - given as a BOF to last years JavaOne. I'll freshen up the slides but mostly cover the same ground.Toward a Coding Style for S...
Shared by: Mustafa K. Isik,
[ Back to top]
1 shares
Another round of Micro-benchmark Advice
via Cliff Click Jr.’s Blog by Cliff Click on March 06, 2008
... makes mediocore code for "the middle of the method" and does anOn-Stack-Replacement of the interpreter frame for the compiled frame. The -client compiler is invoked for loop-containing methods immediately,but makes less optimized code. Fix: make all timingmethods from modest-count outer loops which then call methods whichthemselves have a long trip count loop:for( int i=0; i<100; i++ ) ...
Shared by: Bob Lee,
[ Back to top]