Gang FTP scheduling of periodic and parallel rigid real-time tasks

Details Gang FTP scheduling of periodic and parallel rigid real-time tasks Gang FTP scheduling of periodic and parallel rigid real-time tasks

2010-06-14

arxiv.org/abs/1006.2617v1

Computer Science

Operating Systems

Scientific paper

In this paper we consider the scheduling of periodic and parallel rigid tasks. We provide (and prove correct) an exact schedulability test for Fixed Task Priority (FTP) Gang scheduler sub-classes: Parallelism Monotonic, Idling, Limited Gang, and Limited Slack Reclaiming. Additionally, we study the predictability of our schedulers: we show that Gang FJP schedulers are not predictable and we identify several sub-classes which are actually predictable. Moreover, we extend the definition of rigid, moldable and malleable jobs to recurrent tasks.

Affiliated with

Also associated with

No associations

Rating

Gang FTP scheduling of periodic and parallel rigid real-time tasks 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 Gang FTP scheduling of periodic and parallel rigid real-time tasks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gang FTP scheduling of periodic and parallel rigid real-time tasks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-421850