CLRS 3rd Ch. 27 reading notes

According to http://www.youtube.com/watch?v=e6mTwgZuV50, the most significant update in CLRS 3rd is the introduction of Parallel Algorithm (Chapter 27). There’s a free e-doc version of this chapter from Intel : http://software.intel.com/sites/products/documentation/cilk/book_chapter.pdf

The writing style keeps consistent with CLRS 2nd – it has to doesn’t it, the authors are still CLRS. A useful metric (“work” & “strand” theorem) is the key tool for parallel algorithms analysis, and two traditional algorithms are paralleled and analyzed: Fibonacci and merge sort.

But I’m not quite satisfied with this new chapter, considering my high anticipation before. I don’t think essence of parallelism is all covered and more other algorithms could be paralleled too, and that will make this chapter more plentiful.