{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

scan0007

# scan0007 - SDSU Fall 2007 CS—662 Name Ck ”gut...

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: SDSU Fall 2007 CS—662 Name Ck ' ”gut he: {Ra (please print clearly) Theory of Parallel Algorithms MIDTERM EXAM #1 (100 points; problems are equally weighted) PROBLEM #1 Indicate whether each statement below is TRUE or FALSE by circling the appropriate letter The "slow-down lemma" states that any parallel algorithm that runs on a PRAM with n processors in time T can run on a PRAM with p processors in time O[£) ,forany n <p. '7 {b v. l\*1» \" If a problem can be solved in 0( log log N ) time by a PRAM with N BREW processors, then the same problem can be solved in 0( log log N ) time by a PRAM with N CREW processors. \ Preﬁx sum on an nz-element input array can be performed in O(log n) time "2 by a PRAM with 0( common CRCW processors. log n If a problem can be solved in 0(log N) time by a PRAM with N2 EREW proceSsors, then the same problem can be solved in 0(N log N) time by a PRAM with N common CRCW processors. An BREW PRAM with N processors requires at least O(log N) time to compute the Boolean OR of N bits. If one third of an algorithm must be run sequentially, then the maximum speedup possible by parallelizing the algorithm across four processors is 12/5. ...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online