11f6643-ch3problems - Problems from Chapter 3 9/15/11 3.2 A...

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

View Full Document Right Arrow Icon
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
Background image of page 1

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

View Full DocumentRight Arrow Icon
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.
Background image of page 2
3.6 Enumerate the critical paths in the decomposition of LU factorization shown below.
Background image of page 3

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

View Full DocumentRight Arrow Icon
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.
Background image of page 4
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.
Background image of page 5

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

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/29/2012 for the course CS 6643 taught by Professor Staff during the Fall '08 term at The University of Texas at San Antonio- San Antonio.

Page1 / 6

11f6643-ch3problems - Problems from Chapter 3 9/15/11 3.2 A...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online