(m,k)-firm constraints and DBP scheduling: impact of the initial k-sequence and exact schedulability test

Details (m,k)-firm constraints and DBP scheduling: impact of the initial k-sequence and exact schedulability test (m,k)-firm constraints and DBP scheduling: impact of the initial k-sequence and exact schedulability test

2008-05-02

arxiv.org/abs/0805.0200v2

Computer Science

Operating Systems

Scientific paper

In this paper we study the scheduling of (m,k)-firm synchronous periodic task systems using the Distance Based Priority (DBP) scheduler. We first show three phenomena: (i) choosing, for each task, the initial k-sequence 1^k is not optimal, (ii) we can even start the scheduling from a (fictive) error state (in regard to the initial k-sequence) and (iii) the period of feasible DBP-schedules is not necessarily the task hyper-period. We then show that any feasible DBP-schedule is periodic and we upper-bound the length of that period. Lastly, based on our periodicity result we provide an exact schedulability test.

Affiliated with

Also associated with

No associations

Rating

(m,k)-firm constraints and DBP scheduling: impact of the initial k-sequence and exact schedulability test 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 (m,k)-firm constraints and DBP scheduling: impact of the initial k-sequence and exact schedulability test, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and (m,k)-firm constraints and DBP scheduling: impact of the initial k-sequence and exact schedulability test will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-341011