This preview shows pages 1–8. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Party! Term paper Term paper Party! Party! Exam study Exam study 331 HW 331 HW P r P r Term paper Term paper 2 Max lateness = 2 Max lateness = 2 Todays agenda Prove that the greedy schedule output minimizes the maximum lateness Two definitions for schedules f=s For every i in 1..n do Schedule job i from s(i)=f to f(i)=f+t i f=f+t i Idle time Inversion Max gap between two consecutively scheduled tasks i i j j Idle time =1 Idle time =0 (i,j) is an inversion if i is scheduled before j but d i > d j i i j j i i j j What is the idle time and max # inversion for greedy schedule? What is the idle time and max # inversion for greedy schedule?...
View
Full
Document
This note was uploaded on 12/11/2011 for the course CSE 331 taught by Professor Rudra during the Fall '11 term at SUNY Buffalo.
 Fall '11
 RUDRA

Click to edit the document details