ecte431 ecte931实时计算教程优先级驱动周期性任务调度解决方案-tutorial.pdfVIP

ECTE431/ECTE931:REAL-TIMECOMPUTING

Tutorial2:Priority-drivenSchedulingofPeriodicTasks

Solution

1.Givetwodifferentexplanationsofwhytheperiodictasks(2,1),(4,1)and(8,2)are

schedulablebytherate-monotonicalgorithm.

Solution:

Usingschedulableutilisationtest

Thetotalutilisation:1/2+1/4+2/8=1.Becausethetotalutilisationislessthanorequalto1

andthisisa“simplyperiodic”taskset,thetasksetisschedulablewiththeRMalgorithm.

Usingexhaustiveschedulingsimulation

1

2.AsystemconsistsofthreepreemptableperiodictasksT1=(3,1),T2=(5,2)andT3=

(8,3)

a)Whatisthetotalutilisation?

b)Constructtheearliest-deadline-firstscheduleforthissystemforthetimeinterval[0,

32).Labelallmisseddeadlines.

c)Constructarate-monotonicscheduleforthissystemintheinterval[0,32).Labelall

misseddeadlines.

d)SupposewewanttoreducetheexecutiontimeoftaskT3tomakethesystem

schedulablewiththeEDFalgorithm.WhatistheumexecutiontimeoftaskT3?

d)SupposewewanttoreducetheexecutiontimeoftaskT3tomakethesystem

schedulablewiththeRMalgorithm.WhatistheumexecutiontimeoftaskT3

accordingtotheschedulableutilisationtest?

Solution:

a)U=1/3+2/5+3/8=1.10831.Thereforethetasksetisnotschedulableandtherewillbe

misseddeadlines.

b)EDFschedule