Abstract
A new model for sporadic task systems is introduced. This model - the generalized multiframe task model - further generalizes both the conventional sporadic-tasks model, and the more recent multiframe model of Mok and Chen. A framework for determining feasibility for a wide variety of task systems is established: this framework is applied to this task model to obtain a feasibility-testing algorithm that runs in time pseudo-polynomial in the size of the input for all systems of such tasks whose densities are bounded by a constant less than one.
| Original language | English |
|---|---|
| Pages (from-to) | 5-22 |
| Number of pages | 18 |
| Journal | Real-Time Systems |
| Volume | 17 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1999 |