Feasibility intervals for fixed-priority real-time scheduling on uniform multiprocessors

In this paper we study the global scheduling of periodic task systems upon uniform multiprocessor platforms. We first show two very general properties which are well-known for uniprocessor platforms and which remain. for multiprocessor one: (i) under few and not so restrictive assumptions, we show that any feasible schedules of periodic task system are periodic from some point and (ii) for the specific case of synchronous periodic task systems, the show that the schedule repeats front the origin. We then present our main result: any feasible schedules of asynchronous periodic task sets using a fixed-priority scheduler are periodic from a specific point. Moreover, we characterize that point anal we provide a feasibility interval for those systems.