Sufficient FTP Schedulability Test for the Non-Cyclic Generalized Multiframe Task Model

Details Sufficient FTP Schedulability Test for the Non-Cyclic Generalized Multiframe Task Model Sufficient FTP Schedulability Test for the Non-Cyclic Generalized Multiframe Task Model

2011-10-26

arxiv.org/abs/1110.5793v1

Computer Science

Operating Systems

Scientific paper

Our goal is to provide a sufficient schedulability test -ideally polynomial- for the scheduling of Non-Cyclic Generalized Multiframe Task Model using Fixed-Task-Priority schedulers. We report two first results: (i) we present and prove correct the critical instant for the Non-Cyclic Generalized Multiframe Task Model then (ii) we propose an algorithm which provides a sufficient (but pseudo-polynomial) schedulability test.

Affiliated with

Also associated with

No associations

Rating

Sufficient FTP Schedulability Test for the Non-Cyclic Generalized Multiframe Task Model 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 Sufficient FTP Schedulability Test for the Non-Cyclic Generalized Multiframe Task Model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sufficient FTP Schedulability Test for the Non-Cyclic Generalized Multiframe Task Model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-717158