DOC PREVIEW
ISU CPRE 558 - Best Effort Scheduling

This preview shows page 1-2 out of 6 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 6 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 6 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 6 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

CprE 458/558: Real-Time SystemsBest-Effort SchedulerBest-Effort Scheduler (Contd.)HVDF – Highest Value Density FirstCompetitive Analysis of BE schedulerCompetitive Analysis of BE scheduler (contd.)CprE 458/558: Real-Time Systems (G. Manimaran) 1CprE 458/558: Real-Time Systems Best Effort SchedulingCprE 458/558: Real-Time Systems (G. Manimaran) 2Best-Effort Scheduler•No schedulability check•Schedule construction – online•Overload handling (handling timing faults)–Value based scheduling (chapter 2)–Imprecise computation (chapter 4)–(m,k)-firm task scheduling (chapter 4)•Value based scheduling–Task Ti : <Ci, Pi, Vi> where Vi is the value offered by Ti.–If Ti finishes by di, it offers a value of Vi. Else, it offers a value of 0 (sometimes a negative value).CprE 458/558: Real-Time Systems (G. Manimaran) 3Best-Effort Scheduler (Contd.)•Deadline scheduler (eg., EDF) – good for under/normal load•Value-based scheduler (e.g., HVDF: Highest Value Density First) – good for overload•Hybrid (Adaptive) scheduler --- good for all loads•Heuristics Hi = function(value, deadline). •Several heuristics exist.CprE 458/558: Real-Time Systems (G. Manimaran) 4HVDF – Highest Value Density First•Value density = Vi/Ci (i.e., value per unit computation time).•Higher the value density, higher the importance and hence higher the priority.•HDVF scheduler schedules tasks based on “value density”CprE 458/558: Real-Time Systems (G. Manimaran) 5Competitive Analysis of BE scheduler•The competitive factor, BA , of an on-line scheduling algorithm is defined asWhere S: a given task setVA(S): value produced by given scheduler AVCA(S): value produced by clairvoyant scheduler, the scheduler which knows complete knowledge of all tasks at the beginning itself.Sallfo rBSVSVACAA,)()(CprE 458/558: Real-Time Systems (G. Manimaran) 6Competitive Analysis of BE scheduler (contd.)•The upper bound on the competitive factor for any on-line scheduling isWhere Y = highest value density / lowest value density•When Y = 1 (i.e., Vi = Ci), the competitive factor is 0.25 (for single processor, same as the result discussed in chapter


View Full Document

ISU CPRE 558 - Best Effort Scheduling

Download Best Effort Scheduling
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Best Effort Scheduling and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Best Effort Scheduling 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?