1 / 11

Limited-Preemption Scheduling of Sporadic Tasks Systems

Limited-Preemption Scheduling of Sporadic Tasks Systems. RETIS Lab. Real-Time Systems Laboratory. Research Area: Real-Time Scheduling and Resource Management. Marko Bertogna. Introduction. Sporadic task system with arbitrary deadlines

idaa
Download Presentation

Limited-Preemption Scheduling of Sporadic Tasks Systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Limited-Preemption Scheduling of Sporadic Tasks Systems RETIS Lab Real-Time Systems Laboratory Research Area: Real-Time Scheduling and Resource Management Marko Bertogna

  2. Introduction • Sporadic task system with arbitrary deadlines • t= t1, t2,…, tn withti = (ei ,di ,pi) • Preemptive EDF is an optimal scheduler • Exact feasibility test: with for each , until a pseudo-polynomially far point

  3. PREEMPTIVE Optimal schedulability performances Need to use protocols for the access to shared resources NON-PREEMPTIVE Higher feasibility overhead Lower run-time overhead Simplified access to shared resources To preempt or not? Ideal situation: optimal scheduling algorithm with low run-time overhead Allow preemption only when necessary for maintaining feasibility

  4. Limited-preemption EDF • Non-preemption function Q(t) • Jobs priorities according to EDF • Two modes: regular and non-preemptive • Initially, a job JL executes in regular mode • When a higher priority job JH arrives, JL goes in non-preemptive mode JH Regular t min[cL,Q(DL - t)] DL JL Regular Non-Preemptive

  5. Non-preemption function Q(t) • Compute Q(t) such that • Feasibility is maintained • Non-preemptive sections as large as possible • Properties of Q(t) • Monotonic non-increasing • Changes value only at time-instants corresponding to task deadlines in a synchronous periodic release sequence

  6. Computing Q(t) • For every deadline D2, D3, …, Dm ≡ dmax : Same operations as in the EDF feasibility check:

  7. Complexity • Pseudo-polynomial complexity • Comes for free when feasibility has to be checked as well • When storing the Q(t) table, possible to discard some value, finding suboptimal results • Very small memory requirements (from simulations) • No more than 9 points of discontinuity • Average number of 3 discontinuities

  8. Simulations • uniform Ui • n = 5 • pi in [10,1000] • t in [0,106]

  9. Simulations • uniform Ui • n = 10 • pi in [10,1000] • t in [0,106]

  10. Considerations and conclusions • Optimal scheduling algorithm based on EDF • Reduced number of context changes • Small computational complexity and memory requirements • Advantages w.r.t. preemptive EDF • Lower run-time overhead • Easy way to deal with shared resources • Enhanced predictability

  11. Marko BertognaPhD studentmarko@sssup.it RETIS Lab Real-Time Systems Laboratory Thank you

More Related