Schedulability of generalized multiframe task sets under static priority assignment

Authors:
H. Takada;K. Sakamura
Affiliations:
-;-
Venue:
RTCSA '97 Proceedings of the 4th International Workshop on Real-Time Computing Systems and Applications
Year:
1997

Citing 0
Cited 7

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

Real-Time Systems
A New Scheduling Algorithm and a Compensation Strategy for Imprecise Computation

COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Interactive schedulability analysis

ACM Transactions on Embedded Computing Systems (TECS)
Exact Response Time Scheduling Analysis of Accumulatively Monotonic Multiframe Real Time Tasks

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Exact scheduling analysis of non-accumulatively monotonic multiframe tasks

Real-Time Systems
Schedulability analysis of non-preemptive recurring real-time tasks

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Feasibility analysis of real-time transactions

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multiframe task model has been proposed to effectively model a task whose execution times are periodically changed according to a specified pattern. Schedulability of task sets consisting of multiframe tasks or generalized multiframe tasks (GMF tasks) is now being investigated under various conditions. This paper discusses the necessary and sufficient condition of the schedulability of GMF task sets under a priority-based preemptive scheduling with static priority assignment. The critical instant theorem for GMF task sets is described and the necessary and sufficient condition of their schedulability is presented based on the theorem. We also introduce the maximum interference junction (MIF) and propose a polynomial-time feasibility decision algorithm using the MIF.