Lecture07 - CSE 421 Algorithms Richard Anderson Lecture 7...

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

View Full Document Right Arrow Icon
CSE 421 Algorithms Richard Anderson Lecture 7 Greedy Algorithms: Homework Scheduling and Optimal Caching
Background image of page 1

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

View Full DocumentRight Arrow Icon
Greedy Algorithms Solve problems with the simplest possible algorithm The hard part: showing that something simple actually works Today’s problems (Sections 4.2, 4.3) Homework Scheduling Optimal Caching
Background image of page 2
Homework Scheduling Tasks to perform Deadlines on the tasks Freedom to schedule tasks in any order
Background image of page 3

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

View Full DocumentRight Arrow Icon
Scheduling tasks Each task has a length t i and a deadline d i All tasks are available at the start One task may be worked on at a time All tasks must be completed Goal: minimize maximum lateness – Lateness = f i – d i if f i >= d i
Background image of page 4
Example 2 3 2 4 Deadline Time 2 3 2 3 Lateness 1 Lateness 3
Background image of page 5

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

View Full DocumentRight Arrow Icon
Determine the minimum lateness 2 3 4 5 6 4 5 12 Show the schedule 2, 3, 4, 5 first and compute lateness Deadline Time
Background image of page 6
Greedy Algorithm Earliest deadline first Order jobs by deadline This algorithm is optimal This result may be surprising, since it ignores the job lengths
Background image of page 7

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

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

Page1 / 21

Lecture07 - CSE 421 Algorithms Richard Anderson Lecture 7...

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