Multiprocessor scheduling of age constraint processes

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 of process L/sub i/ in cycle k to the end in cycle k+1 must not exceed the age constraint A/sub i/ for that process. Multiprocessors provide a scalable and cost-effective way of meeting the performance demands of such systems. The age constraint can be met using fixed priority scheduling and periods equal to A/sub i//2. However, this approach restricts the number of process sets which are schedulable. We define a method for obtaining process periods other than A/sub i//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 A/sub i//2.