[concurrency-interest] Implicit parallelism

Gustav Åkesson gustav.r.akesson at gmail.com
Sat Aug 10 14:45:42 EDT 2013

Hi guys,

My discussion here concerns implicit parallelism. Let's say we have the
following setup:

public class Integer

public class ImmutableArrayList

I'm looking for a way so that the parallelism would be introduced without
hard-coding anything related to parallelism (i.e. not stating anything like
.parallel or .par on the collection). Only thing needed would be something
annotation-ish which tells the execution environment that this
datastructure with elements is inherently thread-safe. Then the execution
could determine if it would be beneficial to do so. For instance, for a
structure with e.g. five elements, then it would not, but for millions of
elements, it would most likely be. Perhaps it could even find some kind of
sweet-spot of number of elements in which the parallel overhead exceeds the

Let's say we wish to sum all the integers in an ImmutableArrayList (setup
below), would it be possible for the compiler (javac, scalac or what have
you) and JVM to conspire and decide "hey, let's run this in parallel since
it doesn't violate application semantics and it can/will be faster"? Is
there any research in this area in regards to the JVM?

Best Regards,

Gustav Åkesson
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs.oswego.edu/pipermail/concurrency-interest/attachments/20130810/b5ff3a49/attachment.html>

More information about the Concurrency-interest mailing list