Non-Migratory Feasibility and Migratory Schedulability Analysis of Multiprocessor Real-Time Systems

Download Now
Provided by: Wayne Stansfield
Topic: Hardware
Format: PDF
Given the specifications of a hard-real-time system, feasibility analysis is the process of determining whether the system can be executed in such a manner that all deadlines are met. Given a run-time algorithm for scheduling a hard-real-time system, schedulability analysis is the process of determining whether the specified system will always meet all deadlines when scheduled according to the given algorithm. Note that feasibility-analysis concerns an existential question: does there exist a schedule? While, schedulability analysis addresses the related question of how one would actually generate such a schedule during run-time for systems deemed feasible.
Download Now

Find By Topic