The award-winning Introduction to Algorithms is the leading textbook on computer algorithms and the most cited reference in all of computer science. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers.

The vast majority of algorithms in the book are serial algorithms suitable for running on a uniprocessor computer in which only one instruction executes at a time. In the “Multithreaded Algorithms” chapter, the authors extend the algorithmic model to encompass parallel algorithms, which can run on a multiprocessor computer that permits multiple instructions to execute concurrently. In particular, they explore the elegant model of dynamic multithreaded algorithms, which are amenable to algorithmic design and analysis, as well as to efficient implementation in practice.

Multithreaded Algorithms Chapter
Source: Cilk Arts blog

Multicore Books