A high-level overview of general algorithms included in Intel® TBB to let you know what's possible: parallel_reduce, parallel_do, parallel_for_each: parallel_invoke, parallel_pipeline, parallel_sort and parallel_scan
parallel_invoke
n-bodies: a parallel TBB solution: parallel code with parallel_invoke: will it run faster?
Earlier in the month I fleshed out a spatially arranged subdivision method I learned from Matteo Frigo but didn’t have time to actually run it and compare against my baselines. And in the meantime my test machine has been regrooved into a Windows 7 box, so my first order of business is to retest my baselines. I reran the serial algorithm a few times and averaged the results. While the raw numbers (using the same compiler and machine but jus
n-bodies: a parallel TBB solution: parallel code: balanced recursive parallelism with parallel_invoke
Last time, after struggling with different lock configurations to reduce synchronization overhead managing the interactions of n-squared bodies, I changed perspectives on the problem by spatially representing the interactions between all the bodies and (re-)discovering in that view a means to group the interactions so that independent threads could work together without having to worry about locking the data.
n-bodies: implementing a parallel solution in Intel TBB
Hrrrumph! I’m not sure I’m cut out for this blogging business, which I hear now is becoming passé anyway. Twitter has become all the rage. I’m too much a Luddite to even conceive of a meaningful technical discussion in blots of 140 characters or less. TwitterTech? Nah!
