I wrote a new parallel directory listing program with C++11 async tasks, but this time the number of tasks operating in parallel was bounded. The result was an algorithm that reminded me of MapReduce, so I described how MapReduce works. Here’s the video.
Follow @BartoszMilewski
(You can also follow me on Google+, if you search for Bartosz Milewski.)
October 17, 2011
C++11 Concurrency Series: 6. Map Reduce
Posted by Bartosz Milewski under C++, Concurrency, Multicore, Multithreading, Programming, Tutorial1 Comment
Bartosz Milewski's Programming Cafe 
October 17, 2011 at 1:10 pm
[…] I wrote a new parallel directory listing program with C++11 async tasks, but this time the number of tasks operating in parallel was bounded. The result was an algorithm that reminded me of MapReduce, so I described how MapReduce works. Here’s the video. (You can also follow me on Google+, if you search for Bartosz […] Read the whole article […]