cs240a-complexity

# cs240a-complexity - Complexity Measures for Parallel...

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

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

View Full Document

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

View Full Document

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

View Full Document

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.

Unformatted text preview: Complexity Measures for Parallel Computation Work and span Work and span Work and span Work and span * Also called critical-path length or computational depth . Work and span Work and span * Also called critical-path length or computational depth . W ORK L AW ∙ T P ≥T 1 /P S PAN L AW ∙ Work and span Work and span Work: T 1 (A B) ∪ = Series Composition Series Composition A B Work: T 1 (A B) = T ∪ 1 (A) + T 1 (B) Span: T ∞ (A B) = T ∪ ∞ (A) +T ∞ (B) Span: T ∞ (A B) = ∪ Parallel Composition Parallel Composition A B Span: T ∞ (A B) = max{T ∪ ∞ (A), T ∞ (B)} Span: T ∞ (A B) = ∪ Work: T 1 (A B) ∪ = Work: T 1 (A B) = T ∪ 1 (A) + T 1 (B) Def. T 1 /T P = speedup on P processors. If T 1 /T P = Θ (P) , we have linear speedup , = P, we have perfect linear speedup , > P, we have superlinear speedup , (which is not possible in this model, because of the Work Law T P ≥ T 1 /P) Speedup Speedup Parallelism...
View Full Document

{[ snackBarMessage ]}

### Page1 / 13

cs240a-complexity - Complexity Measures for Parallel...

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

View Full Document
Ask a homework question - tutors are online