Errata for Parallel Programming with Microsoft® .NET
Submit your own errata for this product.
The errata list is a list of errors and their corrections that were found after the product was released. If the error was corrected in a later version or reprint the date of the correction will be displayed in the column titled "Date Corrected".
The following errata were submitted by our customers and approved as valid errors by the author or editor.
Color Key: Serious Technical Mistake Minor Technical Mistake Language or formatting error Typo Question Note Update
| Version |
Location |
Description |
Submitted By |
Date Submitted |
Date Corrected |
| Printed |
Page 1
first line on first page after the title |
The ISBN you got from O’Reilly, listed below, and which is printed inside the Parallel Programming with Microsoft.NET book on the copyright page, 9780735640603 is incorrect. If you go to Amazon, for instance, and search by ISBN number, the book you get is Parallel Programming with Microsoft Visual Studio 2010 Step by Step, written by Doris Marshall. The ISBN number for our book is listed on Amazon as 9780735651593. The bar code on the back of our book is the correct number. It’s not a really big deal but just thought you should know.
|
Ade Miller
 |
Oct 18, 2012 |
|
| PDF |
Page 8
5th paragraph, just above Fig 1 |
Change "percent" to "fraction":
Amdahl’s law says that no matter how many cores you have, the
maximum speedup you can ever achieve is (1 / percent of time spent
in sequential processing).
Should be
Amdahl’s law says that no matter how many cores you have, the
maximum speedup you can ever achieve is (1 / fraction of time spent
in sequential processing).
Note from the Author or Editor:
Amdahl’s law says that no matter how many cores you have, the maximum speedup you can ever achieve is (1 / fraction of time spent in sequential processing).
|
Anonymous |
Sep 26, 2010 |
|
| Printed, PDF, ePub, Mobi, Safari Books Online |
Page 18
Second paragraph |
Change "the loop index" to "a loop-indexed variable"
Loop-carried dependence. If the body of a parallel for loop
performs arithmetic on the loop index, there is likely to be a
dependency that is known as loop-carried dependence.
Should be
Loop-carried dependence. If the body of a parallel for loop
performs arithmetic on a loop-indexed variable, there is likely to be a
dependency that is known as loop-carried dependence.
(arithmetic on a "loop index" is something else)
Note from the Author or Editor:
Error. Should read:
Loop-carried dependence. If the body of a parallel for loop performs arithmetic on a loop-indexed variable, there is likely to be a dependency that is known as loop-carried dependence. |
Steve Bearman |
Sep 26, 2010 |
|
| Printed, PDF, ePub, Mobi, Safari Books Online |
Page 63
FIrst paragraph in BYPASSING THE THREAD POOL section |
Codeplex: On page 63 of the Preliminary Draft there is a typo: "form" should be "from." This is found in the following text:
"If you don’t want a task to use a worker thread **form** the thread pool, you can create a new thread for its dedicated use."
Ade: This should read:
If you don’t want a task to use a worker thread from the thread pool, you can create a new thread for its dedicated use.
|
Ade Miller
|
Oct 18, 2012 |
|
| Printed, PDF, ePub, Mobi, Safari Books Online |
Page 99
Bottom of first paragraph in FUNCTIONAL STYLE section. |
Codeplex: jsh003guardz63 wrote Jul 19, 2011 at 7:31 AM
Minor typo - page 99. "However, in general, explicit data flow is less prone to error that implied data flow." should be "than implied data flow"
Ade: This should read:
However, in general, explicit data flow is less prone to error than implied data flow.
|
Ade Miller
|
Oct 18, 2012 |
|
| Printed, PDF, ePub, Mobi, Safari Books Online |
Page 131
Related Patterns section, 1st sentence of 1st indented paragraph |
The word consumer is mispelled in the following sentence:
Pipelines are expressions of a general technique known as producer/
cotnsumer.
Note from the Author or Editor:
This is a spelling mistake the term should read:
producer/consumer |
genegw |
Sep 18, 2010 |
|
|
| |
