Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks

  • Authors:
  • Sanjoy K. Baruah

  • Affiliations:
  • The University of North Carolina at Chapel Hill Baruah@cs.unc.edu

  • Venue:
  • Real-Time Systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.