Feasibility Intervals for Multiprocessor Fixed-Priority Scheduling of Arbitrary Deadline Periodic Systems

Provided by: edaa
Topic: Hardware
Format: PDF
In this paper the authors study the global scheduling of periodic task systems with arbitrary deadlines upon identical multiprocessor platforms. They first show two very general properties which are well-known for uniprocessor platforms and which remain for multiprocessor platforms: under few and not so restrictive assumptions, they show that any feasible schedule of arbitrary deadline periodic task systems is periodic from some point and for the specific case of synchronous periodic task systems, they show that the schedule repeats from the origin.

Find By Topic