cs140-complexity

cs140-complexity - Complexity Measures for Parallel...

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

View Full Document Right Arrow Icon
Complexity Measures for Parallel Computation
Background image of page 1

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

View Full DocumentRight Arrow Icon
Several possible models! 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 won’t discuss: LogP, UMH, ….
Background image of page 2
t p   =  execution time on  p  processors Work / Span Model Work / Span Model
Background image of page 3

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

View Full DocumentRight Arrow Icon
t p   =  execution time on  p  processors t 1   =   work Work / Span Model Work / Span Model
Background image of page 4
t p  =  execution time on  p  processors * Also called  critical-path length or  computational depth . t 1  =   work t  =  span  * Work / Span Model Work / Span Model
Background image of page 5

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

View Full DocumentRight Arrow Icon
p  =  execution time on  p  processors t 1  =  work t   span  * * Also called  critical-path length or  computational depth . W
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 15

cs140-complexity - Complexity Measures for Parallel...

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

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