CSC 7103 20091027

CSC 7103 20091027 - CSC 7103 Ji = (Ci, Ti) 10/27/2009 Page...

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

View Full Document Right Arrow Icon
CSC 7103 10/27/2009 Page 1 of 3 J i = (C i , T i ) Job = ( Cpu time, time period ) We’ve talked about how to schedule a job before its period is up. Rate Monotonic scheduling – each job has a rate, which is the period, if T i > T j , then Pr i < Pr j . Rate monotonic is optimal! Optimality – if there exists a feasible schedule, then it will be found. If we look at the worst case for arrival of tasks, and rate monotonic works, then it will always work for any case that is not the worst case. Critical instance – the time / arrival of tasks such that when the scheduling is started at that time, then we are guaranteed that the task is always scheduled – even if all higher priority tasks arrive at the same time. Figure 1 – Example scheduling Example using Figure 1 – if a higher priority task would have arrived later during the critical instance, then the time for T i could only decrease, since it would have been scheduled earlier and had more execution time. What is the maximum length of time to schedule T
Background image of page 1

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

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

This note was uploaded on 01/25/2010 for the course CSC 7103 taught by Professor Kannan,r during the Fall '08 term at LSU.

Page1 / 3

CSC 7103 20091027 - CSC 7103 Ji = (Ci, Ti) 10/27/2009 Page...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online