[concurrency-interest] RFR [8011215] optimization of CopyOnWriteArrayList.addIfAbsent()

Stanimir Simeonoff stanimir at riflexo.com
Tue Apr 2 19:37:40 EDT 2013

On Wed, Apr 3, 2013 at 1:47 AM, Martin Buchholz <martinrb at google.com> wrote:

> On Tue, Apr 2, 2013 at 3:45 PM, Ivan Gerasimov <ivan.gerasimov at oracle.com>wrote:
>> Thank you, Ulf!
>>  maybe the old code wins for looong arrays, so there could be a threshold
>>> to decide between old and new code:
>> I've modified the benchmark code to test arrays with 90'000 to 100'000
>> elements. (Previously was testing 1 to 100 elements.)
>> The performance gain turns out to be even more significant.
>> On my machine tests show that with that many elements the new code runs
>> 40% faster.
>> Honestly, I didn't expect that. I thought my code might be a bit slower
>> and hoped that not much slower.
> Yeah, that's a bit surprising.  Perhaps because you're avoiding the branch
> of testing object for null on each iteration?
> The branch would be perfectly predicted by the CPU, so it cannot be that.
System.arraycopy would be much better for larger arrays as it uses SSE
extensions to copy but normally COW structures would not have so many
btw, the 2 pass version benefits of low memory footprint equals() (and all
in L2 cache). Basically if you don't get cache trashing Arrays.copy would
be the better one.


> _______________________________________________
> Concurrency-interest mailing list
> Concurrency-interest at cs.oswego.edu
> http://cs.oswego.edu/mailman/listinfo/concurrency-interest
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs.oswego.edu/pipermail/concurrency-interest/attachments/20130403/059fa9e0/attachment.html>

More information about the Concurrency-interest mailing list