Optimal Utilization Bounds for the Fixed-priority Scheduling of Periodic Task
نویسنده
چکیده
In fixed-priority scheduling the priority of a job, once assigned, may not change. A new fixed-priority algorthm for scheduling systems of periodic tasks upon identical multiprocessors is proposed. This algorithm has an achievable utilization of (m + 1)/2 upon m unit-capacity processors. It is proven that this algorithm is optimal from the perspective of achievable utilization, in the sense that no fixed-priority algorithm for scheduling periodic task systems upon identical multiprocessors may have an achievable utilization greater than (m+ 1)/2.
منابع مشابه
On utilization bounds for a periodic resource under rate monotonic scheduling
This paper revisits utilization bounds for a periodic resource under the rate monotonic (RM) scheduling algorithm. We show that the existing utilization bound, as presented in [8, 9], is optimistic. We subsequently show that by viewing the unavailability of the periodic resource as a deferrable server at highest priority, existing utilization bounds for systems with a deferrable server [3, 11] ...
متن کاملFixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines
This paper considers the problem of fixed priority scheduling of periodic tasks with arbitrary deadlines. A general criterion for the schedulability of such a task set is given. Worst case bounds are given which generalize the Liu and Layland bound. The results are shown to provide a basis for developing predictable distributed real-time systems.
متن کاملExact Feasibility Tests for Real-Time Scheduling of Periodic Tasks upon Multiprocessor Platforms
In this paper we study the global scheduling of periodic task systems upon multiprocessor platforms. We first show two very general properties which are well-known for uniprocessor platforms and which remain for multiprocessor platforms: (i) under few and not so restrictive assumptions, we show that feasible schedules of periodic task systems are periodic from some point with a period equal to ...
متن کاملExact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms
In this paper, we study the global scheduling of periodic task systems on unrelated multiprocessor platforms. We first show two general properties which are well known for uniprocessor platforms and which are also true for unrelated multiprocessor platforms: (i) under few and not so restrictive assumptions, we prove that feasible schedules of periodic task systems are periodic starting from som...
متن کاملOn the complexity of optimal priority assignment for periodic tasks upon identical processors
In this paper we study global fixed-priority scheduling of periodic task systems upon identical multiprocessor platforms. Based on existing feasibility tests for periodic task systems upon identical multiprocessor platforms, we show (using a dummy priority assignment algorithm) that optimal priority assignment for these systems exists. Then we provide an algorithm based on RMUS[m/(3m−2)] that h...
متن کامل