Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems

Details Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems

2009-08-25

arxiv.org/abs/0908.3519v1

Computer Science

Operating Systems

Scientific paper

The multiprocessor Fixed-Job Priority (FJP) scheduling of real-time systems is studied. An important property for the schedulability analysis, the predictability (regardless to the execution times), is studied for heterogeneous multiprocessor platforms. Our main contribution is to show that any FJP schedulers are predictable on unrelated platforms. A convenient consequence is the fact that any FJP schedulers are predictable on uniform multiprocessors.

Affiliated with

Also associated with

No associations

Rating

Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-232708