×
SET SOME GOALS. STAY QUIET ABOUT THEM. SMASH THE HELL OUT OF THEM. CLAP FOR YOUR DAMN SELF.
--Your friends at LectureNotes
Close

Note for Real Time Systems - RTS By Ajit singh kushwaha

  • Real Time Systems - RTS
  • Note
  • delhi technological university -
  • Computer Science Engineering
  • 121 Views
  • Uploaded 2 years ago
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-2

CPSC-663: Real-Time Systems Aperiodic and Sporadic Jobs Priority Queues for Periodic/Sporadic/Aperiodic Jobs reject Sporadic Jobs Periodic Jobs Acceptance Test Processor Aperiodic Jobs Background/Interrupt-Driven vs. Slack Stealing • Background: – Aperiodic job queue has always lowest priority among all queues. – Periodic tasks and accepted jobs always meet deadlines. – Simple to implement. – Execution of aperiodic jobs may be unduly delayed. • Interrupt-Driven: – Response time as short as possible. – Periodic tasks may miss some deadlines. • Slack Stealing: – Postpone execution of periodic tasks only when it is safe to do so: • Well-suited for clock-driven environments. • What about priority-driven environments? (quite complicated) 2

Text from page-3

CPSC-663: Real-Time Systems Aperiodic and Sporadic Jobs Examples Background: T1 T2 = ( 3, 1 ) = ( 10 , 4 ) A : r = 0.1 , e = 2.1 Interrupt-Driven: Slack Stealing: Polled Execution vs. Bandwidth Preserving Servers • • Polling Server (ps, es ): ps : es : Terminology: – – – – scheduled as periodic task. Poller ready for execution every ps time units. Upper bound on execution time. (Execution) budget: es Replenishment: set budget to es at beginning of period. Poller consumes budget at rate 1 while executing aperiodic jobs. Poller exhausts budget whenever poller finds aperiodic queue empty. – Whenever the budget is exhausted, the scheduler removes the poller from periodic queue until replenished. • Bandwidth-preserving server algorithms: – Improve upon polling approach – Use periodic servers – Are defined by consumption and replenishment rules. 3

Text from page-4

CPSC-663: Real-Time Systems Aperiodic and Sporadic Jobs Example: Polling Server Rate-Monotonic: A : r = 2.8, e = 1.7 PS=(3, 1) T1=(φ=2, 3.5, 1.5) T2=(φ =0, 6.5, 0.5) budget Deferrable Servers • Rules: – Consumption: – Replenishment: Execution budget consumed only when server executes. Execution budget of server is set to es at each multiple of ps . • Preserves budget when no aperiodic job is ready. • Any budget held prior to replenishment is lost (no carry-over). 4

Text from page-5

CPSC-663: Real-Time Systems Aperiodic and Sporadic Jobs Example: Deferrable Server with RM Rate-Monotonic: A : r = 2.8, e = 1.7 DS=(3, 1) T1=(φ=2, 3.5, 1.5) T2=(φ=0, 6.5, 0.5) budget Example: Deferrable Server with EDF EDF: A : r = 2.8, e = 1.7 DS=(3, 1) T1=(φ=2, 3.5, 1.5) T2=(φ=0, 6.5, 0.5) budget 5

Lecture Notes