| Abstract |
|---|
| Real-time systems often consist of a number of independent processes which operate under an age constraint. In such systems, the maximum time from the start process Li in cycle k to the end in cycle k+1 must not exceed the age constraint Ai. The age constraint can be met by using fixed priority scheduling and periods equal to Ai/2. However, this approach restricts the number of schedulable process sets.We define a method for obtaining process periods other than Ai/2. The periods are calculated in such a way that the age constraints are met. Our approach is better in the sense that a larger number of process sets can be scheduled compared to using periods equal to Ai/2. |
| Contact |
| Lars Lundberg Department of Computer Science,University of Karlskrona/Ronneby,S-37225 Ronneby,Sweden, lasse@ide.hk-r.se |