{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

scan0032

# scan0032 - SDSU Fall 2006 CS-662 Parallel Algorithms...

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 2006 CS-662 Parallel Algorithms PRACTICE MIDTERM EXAM #2 (100 points; problems are equally weighted) PROBLEM #1 Indicate whether each statement below is TRUE or FALSE by circling the appropriate letter @ F Merging of two sorted m—element sequences of nonnegative integers can be accomplished in 000g m) time by a PRAM with m CREW processors. ( a i F Merging of two sorted m-element sequences of nonnegaﬁve integers can be accomplished in 0(log 111) time by a PRAM with 2m BREW processors. l ) F Merging of two sorted m—elernent sequences ofnonnegative integers can be accomplished Q(log m) time by a PRAM with 0(7), ] CREW log m processors. F Merging of two sorted m-element sequences of nonnegative integers can be accomplished 0(log log m) time by a PRAM with with 2m CREW prOcessors. [email protected] F Merging of two sorted m-element sequences of nonnegative integers can be accomplished 0(log log m) time by a PRAM with O[——Zl——] log log m CREW processors. T Odd-even merge of two sorted m-element sequences of nonnegative integers requires +(N) auxiliary memory in addition to the (ﬁnite) cache memory local to each processor T ® No work-optimal algorithm exists for merging two sorted m-element sequences ' of nonnegative integers in 0(10g m) time , . T E f i No work-optimal algorithm exists for merging two sorted m-element sequences 1 of nonnega’uve Integers 1n O(log log m) time. Odd-even merge can be implemented on a PRAM that uses only BREW processors. ‘ ...
View Full Document

{[ snackBarMessage ]}