[concurrency-interest] Question about phasers and cache lines

√iktor Ҡlang viktor.klang at gmail.com
Wed Nov 30 04:32:08 EST 2011

On Wed, Nov 30, 2011 at 10:24 AM, David Holmes <davidcholmes at aapt.net.au>wrote:

> Mohan Radhakrishnan writes:
> > I understand forkjoin has a work stealing algorithm that could be
> > useful on multicore processors.
> I think that is somewhat inverted. Parallel decomposition techniques
> benefit
> from parallel processing - ie from multi-processors or multi-cores. Within
> such a framework work-stealing is just a generic technique to allow
> otherwise idle threads to continue doing useful work, avoid the need for
> context switching and thus reduce overhead.

I'd also say that worker-local task queues provide a really needed means of

> > Can anyone point out what facility a
> > phaser has similarly to work better on multicore processors ? I
> > couldn't locate anything after a search.
> Sorry I don't understand the question - "work better" than what? A Phaser
> is
> a generic synchronization barrier. As with the other j.u.c synchronizers it
> utilizes lock-free techniques to improve scalability on multi-processors.
> David Holmes
> _______________________________________________
> Concurrency-interest mailing list
> Concurrency-interest at cs.oswego.edu
> http://cs.oswego.edu/mailman/listinfo/concurrency-interest

Viktor Klang

Akka Tech Lead
Typesafe <http://www.typesafe.com/> - Enterprise-Grade Scala from the

Twitter: @viktorklang
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs.oswego.edu/pipermail/concurrency-interest/attachments/20111130/59d38593/attachment.html>

More information about the Concurrency-interest mailing list