cs140-complexity-nocache

cs140-complexity-nocache - • Detailed complexity measures...

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

View Full Document Right Arrow Icon
Complexity measures for parallel computation Complexity measures for parallel computation Problem parameters: n index of problem size p number of processors Algorithm parameters: t p running time on p processors t 1 time on 1 processor = sequential time = “work” t time on unlimited procs = critical path length = “span” v total communication volume
Background image of page 1

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

View Full DocumentRight Arrow Icon
Laws of parallel complexity Laws of parallel complexity
Background image of page 2
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: • Detailed complexity measures for data movement I Detailed complexity measures for data movement I Moving data between processors by message-passing • Machine parameters: • α or t startup latency (message startup time in seconds) • β or t data inverse bandwidth (in seconds per word) • Time to send & recv or bcast a message of w words: α + w* β comm...
View Full Document

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

Page1 / 3

cs140-complexity-nocache - • Detailed complexity measures...

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

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