From: Yigong Liu (yigongliu_at_[hidden])
Date: 2007-06-11 11:36:03
I haven't done any benchmark yet. I don't see why concurrency using the
proposed Boost.Join library will be inherently "slower" than other
implementations. I have implemented some of the optimizations mentioned in
the Comega paper (implemented in Comega compiler) using template techniques.
I believe there are still more im provements to be made. However considering
how much resources Intel has put into optimizing TBB.... That is also why we
propose libraries to the community / list for review so that more experts
can have a look of the implementation and find the weakness.
Thanks for looking into it.
On 6/11/07, Mathias Gaunard <mathias.gaunard_at_[hidden]> wrote:
> Yigong Liu wrote:
> > 2> implementing
> > data parallel algorithms (parallel loop and map-reduce) using Join,
> which is
> > helpful for programming today's multi-core machines.
> Have you benchmarked those against "faster" implementations, like the
> algorithms in Intel Threading Building Blocks, to see what the
> performance overhead of join calculus is?
> Unsubscribe & other changes:
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk