CSE331 Lecture 21

# CSE331 Lecture 21 - Party! Term paper Term paper Party!...

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

Lecture 21 CSE 331 Oct 19, 2011

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

View Full Document
Technical Interviews (Sean) - Thursday October 27 th - 6:30 – 9:00 PM - Faculty comments - Free Stuff!!! - Sign-Ups
Online office hrs tonight 10:00pm

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

View Full Document
Scheduling to minimize lateness n jobs: i th job ( t i ,d i ) Schedule the n jobs: i th job gets interval [ s(i),f(i)=s(i)+t i ) At most one job at any time At most one job at any time Algo picks s(i) Algo picks s(i) GOAL: Minimize MAXIMUM lateness Lateness of job i , l i = max (0,f(i)-d i ) Not the sum Not the sum start time: s
The Greedy Algorithm (Assume jobs sorted by deadline: d 1 ≤ d 2 ≤ …. . ≤ d n ) 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

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

View Full Document
Solving end of Semester blues Monday Tuesday Wednesday Thursday Friday Project Project 331 HW 331 HW Exam study Exam study Party!

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

View Full Document
This is the end of the preview. Sign up to access the rest of the 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.

### Page1 / 8

CSE331 Lecture 21 - Party! Term paper Term paper Party!...

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

View Full Document
Ask a homework question - tutors are online