Matloff’s parallel programming book is suitable for either students or professionals, as there is very little theoretical analysis of parallel algorithms, such as O() analysis, maximum theoretical speedup, acyclic graphs and so on. Instead he has provided extensive coverage of what he calls “wizardry” aspects–material known to experienced practitioners but generally not in books, such as coverage of loop iteration scheduling and memory effects of storing large arrays.
Read more at insideHPC
