Previous | Next --- Slide 23 of 48
Back to Lecture Thumbnails

Could someone explain what we learned from this parallel programming example? My impression was that it is much slower to spawn new threads for each new task than it is to partition many tasks to a small number of threads that keep running until all the tasks are complete.


Yes, @pandu, that is correct. I took away the same inference from the example.