26 Mar
2015
26 Mar
'15
6:15 a.m.
Hi Francisco,
On 17 December 2014 at 05:42, Francisco José Tapia
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