{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Lecture06 - CSE 421 Algorithms Richard Anderson Lecture 6...

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

CSE 421 Algorithms Richard Anderson Lecture 6 Greedy Algorithms

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

View Full Document
Greedy Algorithms Solve problems with the simplest possible algorithm The hard part: showing that something simple actually works Pseudo-definition An algorithm is Greedy if it builds its solution by adding elements one at a time using a simple rule
Scheduling Theory Tasks Processing requirements, release times, deadlines Processors Precedence constraints Objective function Jobs scheduled, lateness, total execution time

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

View Full Document
Tasks occur at fixed times Single processor Maximize number of tasks completed Tasks {1, 2, . . . N} Start and finish times, s(i), f(i) Interval Scheduling
What is the largest solution?

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

View Full Document
Greedy Algorithm for Scheduling Let T be the set of tasks, construct a set of independent tasks I, A is the rule determining the greedy algorithm I = { } While (T is not empty) Select a task t from T by a rule A Add t to I Remove t and all tasks incompatible with t from T
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 20

Lecture06 - CSE 421 Algorithms Richard Anderson Lecture 6...

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

View Full Document
Ask a homework question - tutors are online