Scheduling Algorithms for Multiprogramming in a Hard Real-Time.ppt

SchedulingAlgorithmsforMultiprogramminginaHardReal-TimeEnvironment(thenandnow)EECS750–Spring2006Presentedby:ShaneSantner,TJStaley,ingsofRateMonotonicAnalysisConclusionIntroSchedulingisaproblemwhichhasbeenworkedonformanyyearsHardreal-timeschedulingpresentsitsownsetofuniqueproblemsRateMonotonicSchedulingpresentsoneapproachtoaddressingtheproblemofHardreal-timeschedulingThePaperSchedulingAlgorithmsforMultiprogramminginaHardReal-©1973IntroductionHardReal-Time–pletewithinapredefinedamountoftimeSoftReal-Time–Statisticaldistributionofresponse-eptableBackgroundRateMonotonicreferstoassigningprioritiesasamonotonicfunctionoftherate(urrence)(RMS)(RMA)canbeperformedstaticallyonanyhardreal-(Static)DeadlineDrivenPriorityAssignment(Dynamic)MixedPriorityAssignmentEnvironmentPapermakesfiveassumptionsabouttaskswithinahardreal-timesystem:ursTasksareindependentofeachotherRun-timeforeachtaskisconstantAllnon-periodictasksarespecialInitializationtasksFailureroutines