8-twoup - A Scheduling Problem • We wish to schedule a...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: A Scheduling Problem • We wish to schedule a set of jobs on a single server. • Each job requires one unit of execution time and has its own deadline. • We schedule each job in turn at the latest available time prior to its deadline. • If there is no time available prior to a job’s deadline, we don’t schedule it. • Problem: How do we quickly find the latest available time prior to a job’s deadline? 1 Partial Solution • We number the time slots 1 ..n , so that slot i is the last slot prior to time i . • We partition the time slots into disjoint sets such that each set contains a time interval in which only the first time slot is available. • In order to ensure that the first interval has an available time slot, we include time slot , which is always considered to be available. 2 Needed Operations • In order to be able to find the latest available time slot no later than slot i , we must be able to determine which set contains i , and what the available time slot in that set is. – With each set we associate a unique representative , which is some element in the set....
View Full Document

This note was uploaded on 09/06/2009 for the course CIS 11274 taught by Professor Howell during the Spring '09 term at Kansas State University.

Page1 / 7

8-twoup - A Scheduling Problem • We wish to schedule a...

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