|
Boost : |
Subject: Re: [boost] [SORT] Parallel Algorithms
From: Francisco José Tapia (fjtapia_at_[hidden])
Date: 2015-03-26 09:07:44
Thanks,
I will see. Always is interested to hear Mr Kaiser, and learn new things
from their huge knowledge
Francisco
2015-03-26 7:15 GMT+01:00 Jeremy Murphy <jeremy.william.murphy_at_[hidden]>:
> Hi Francisco,
>
> On 17 December 2014 at 05:42, Francisco José Tapia <fjtapia_at_[hidden]>
> wrote:
>
> >
> > SCALABILITY : Some algorithms don't scale well when the number of
> threads
> > grow. Increasing the number of threads don't decrease the execution time.
> > This lack of scalability is emphasized when the size of the elements to
> > sort grows
>
>
> Sorry about butting in so late, but on the topic of scalability and
> potential superiority to TBB, you might be interested to check out Hartmut
> Kaiser's talk on asynchronous computing (
> https://www.youtube.com/watch?v=5xyztU__yys) and his lab's library, HPX (
> http://stellar.cct.lsu.edu/projects/hpx/).
> Cheers.
>
> Jeremy
>
> _______________________________________________
> Unsubscribe & other changes:
> http://lists.boost.org/mailman/listinfo.cgi/boost
>
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk