11f6643lec14b - W, # of tasks p max = c(W) Critical Path...

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

View Full Document Right Arrow Icon
Example 5.15 10/13/11
Background image of page 1

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

View Full DocumentRight Arrow Icon
Cost-optimality and the Isoefficiency Function
Background image of page 2
Minimum Execution Time, T p min
Background image of page 3

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

View Full DocumentRight Arrow Icon
Finding minimum cost-optimal Exec. Time, T p cost-opt
Background image of page 4
Background image of page 5

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

View Full DocumentRight Arrow Icon
Problem 5.3 from Chapter 5
Background image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: W, # of tasks p max = c(W) Critical Path Smax, max speedup T P , at p= p max /2 S pmax/2 E pmax E pmax/2 T , at p=p max /2...
View Full 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

11f6643lec14b - W, # of tasks p max = c(W) Critical Path...

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