cs240a-complexity

cs240a-complexity - CS 240A: Complexity Measures for...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

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

Unformatted text preview: CS 240A: Complexity Measures for Parallel Computation Several possible models! Execution time and parallelism: Work / Span Model Total cost of moving data: Communication Volume Model Detailed models that try to capture time for moving data: Latency / Bandwidth Model (for message-passing) Cache Memory Model (for hierarchical memory) Other detailed models we wont discuss: LogP, UMH, . tp = execution time on p processors Work / Span Model tp = execution time on p processors t1 = work Work / Span Model tp = execution time on p processors * Also called critical-path length or computational depth . t1 = work t = span * Work / Span Model tp = execution time on p processors t1 = work t = span * * Also called critical-path length or computational depth . W ORK L AW tp t1/p S PAN L AW tp t Work / Span Model Work: t1(A B) = Series Composition...
View Full Document

This note was uploaded on 12/27/2011 for the course CMPSC 240A taught by Professor Gilbert during the Fall '09 term at UCSB.

Page1 / 15

cs240a-complexity - CS 240A: Complexity Measures for...

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

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