Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors

Download Now
Provided by: Universite Laval
Topic: Hardware
Format: PDF
In this paper, the authors study the global scheduling of periodic task systems upon uniform multiprocessor platforms. They first show two very general properties which are well-known for uniprocessor platforms and which remain for multiprocessor one: under few and not so restrictive assumptions, they show that any feasible schedules of periodic task system are periodic from some point and for the specific case of synchronous periodic task systems, they show that the schedule repeats from the origin.
Download Now

Find By Topic