Is Parallel Programming Hard, And, If So, What Can You Do About It?
The purpose of this book is to help you understand how to program shared-memory parallel machines without risking your sanity.1 By describing the algorithms and designs that have worked well in the past, we hope to help you avoid at least some of the pitfalls that have beset parallel projects. But you should think of this book as a foundation on which to build, rather than as a...
The purpose of this book is to help you understand how to program shared-memory parallel machines without risking your sanity.1 By describing the algorithms and designs that have worked well in the past, we hope to help you avoid at least some of the pitfalls that have beset parallel projects. But you should think of this book as a foundation on which to build, rather than as a completed cathedral. Your mission, if you choose to accept, is to help make further progress in the exciting field of parallel programming, progress that should in time render this book obsolete. Parallel programming is not as hard as it is reputed, and it is hoped that this book makes it even
easier for you.
Paul McKenney is a Distinguished Engineer and CTO of Linux at
IBM's Linux Technology Center (LTC). He is the maintainer of
the Linux kernel's implementation of RCU and a contributor to
the user-level implementation.He chaired the Linux Plumbers
Conference Program Committee in 2009 and 2011, and served on
the Linux Kernel Summit Program Committee in 2010 and 2011.
He has publi...
Paul McKenney is a Distinguished Engineer and CTO of Linux at
IBM's Linux Technology Center (LTC). He is the maintainer of
the Linux kernel's implementation of RCU and a contributor to
the user-level implementation.He chaired the Linux Plumbers
Conference Program Committee in 2009 and 2011, and served on
the Linux Kernel Summit Program Committee in 2010 and 2011.
He has published one netbook, one book chapter, and more than
one hundred papers and presentations, and holds more than 80
patents in the USA, PRC, and elsewhere.