Lecture07 - Greedy Algorithms CSE 421 Algorithms Richard...

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

View Full Document Right Arrow Icon
1 CSE 421 Algorithms Richard Anderson Lecture 7 Greedy Algorithms: Homework Scheduling and Optimal Caching 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 Homework Scheduling • Tasks to perform • Deadlines on the tasks • Freedom to schedule tasks in any order 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 Example 2 3 2 4 Deadline Time 2 3 2 3 Lateness 1 Lateness 3 Determine the minimum lateness 2 3 4 5 6 4 5 12 Deadline Time
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Greedy Algorithm • Earliest deadline first • Order jobs by deadline • This algorithm is optimal Analysis • Suppose the jobs are ordered by deadlines, d 1 <= d 2 <= . . . <= d
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

Lecture07 - Greedy Algorithms CSE 421 Algorithms Richard...

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