Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks |
| |
Authors: | Baruah Sanjoy K |
| |
Affiliation: | (1) The University of North Carolina at, Chapel Hill |
| |
Abstract: | The recurring real-time task model for hard-real-time task is studied from a feasibility-analysis perspective. This model generalizes earlier models such as the sporadic task model and the generalized multiframe task model. Algorithms are presented for the static-priority and dynamic-priority feasibility-analysis of systems of independent recurring real-time tasks in a preemptive uniprocessor environment. |
| |
Keywords: | hard-real-time scheduling conditional code dynamic priorities static priorities feasibility analysis |
本文献已被 SpringerLink 等数据库收录! |