{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

11f6643-ch3problems

# 11f6643-ch3problems - Problems from Chapter 3 3.2 A Max...

This preview shows pages 1–6. Sign up to view the full content.

Problems from Chapter 3 9/15/11 3.2 A B C D Max. degree of concurrency Critical path length Max. achievable speedup (no limit on processes) Min. number of processes needed for max. speedup Max. speedup with number of processes = 2 processes = 4 Processes = 8

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
3.3 What are the average degrees of concurrency and critical path lengths of task dependency graphs corresponding to the decompositions of matrix multiplication shown below.
3.6 Enumerate the critical paths in the decomposition of LU factorization shown below.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
3.15 Assume a decomposition such that each execution of line 7 in the following code is a task. Draw a task-dependency graph and a task-interaction graph.
3.19 Consider a simplified version of bucket-sort. You are given an array A of n random integers in the range [1,r] as input. The output data consists of r buckets, such that at the end of the algorithm, Bucket i contains indices of all the elements of A that are equal to i. Decscribe a decomposition based on partitioning of the input data array A and an appropriate mapping onto p processes.

This preview has intentionally blurred sections. Sign up to view the full version.

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

{[ snackBarMessage ]}

### Page1 / 6

11f6643-ch3problems - Problems from Chapter 3 3.2 A Max...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online