A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
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 wellknown 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, we show that the schedule repeats from the origin.doi:10.1109/etfa.2006.355388 dblp:conf/etfa/CucuG06 fatcat:rvdhzntr35hafjl4erjdggjtuq