|
S c i e n t i f i c P a r a l l e l C o m p u t i n g c h a p t e r 1 |
||||||
| ABOUT | CODE | CONTACT | ERRATA | HOME | LINKS | PUP |
| |
||||||
| Chapter 1 | Introduction |
| where | what |
| page 10, line 3 | The second performance should be 338 MFLOPS instead of 330 MFLOPS. |
| page 21, program segment at the bottom | The lower bound in the loop is k+(p-1)b and the upper bound in the loop is k+pb; it is incorrect that the upper bound for p is the same as the lower bound for p+1. Instead, the loop limits should be (lower bound) k+(p-1)b+1 and (upper bound) k+pb, or (lower bound) k+(p-1)b and (upper bound) k+pb-1. |