{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

scan0038

scan0038 - "Mﬁ\k SDSU Fall 2006 ’ Wit ‘3‘ Name...

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: "Mﬁ\k\ SDSU Fall 2006 ’ Wit ‘3‘ - / Name . ’ , , d \ '1 {a CS—662 . fer“ _ (please print clearly) Theory ofParallel Algorithm "9"” i 6 ' LU \\ /(§() (353,.54l (w: k TERM EXAM #1 _ W“ J“ M (100 points; problems are equally weighted) PROBLEM V7 , i 1 Indicate whether each statement below is TRUE or FAL' bv ' rcling the appropriate letter wan C Kc M T F ,9 The "slow—down lemma" states that any parallel algorithm that runs on aﬂPRAM with n processors in time T can run on 3? AM with p processors in time a N i\\ O£££),foranyn<p. ' f m 3] o t '9) I F ' _ ' r Cr) F Ifa 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. {J T/ F Preﬁx sum on an nz-element input array can be performed in O(log n) time 2 by a PRAM with CL 12 J common CRCW processors. 0 g n (D F If a problem can be solved in 0(log N) time by a PRAM with N2 BREW processors, then the same problem can be solved in O(N log N) time by a PRAM with N common CRCW processors. An EREW PRAM with N processors requires at least 0(10g N) time to compute the Boolean OR of N bits. /\, T 4' E 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. 2.— ’ 3 ‘ , .7. , ~ ‘* z ‘1. 3,» “25’. ’2“ ”t New C ’L fig!” ...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online