New Results on Fixed Priority Aperiodic Servers
نویسندگان
چکیده
The issue of using the Sporadic Server (SS) for scheduling aperiodic tasks has received new attention under the POSIX standard as it has been proposed in P1003.1d, the additional real-time extensions to POSIX. The SS has been traditionally considered a better approach to the deferrable server (DS) due to its supposed higher achievable utilisation. However, SS also has higher implementation complexity. Nevertheless, the analysis of the comparisons performed from several authors between DS and SS is not conclusive. A review on fixed priority servers is presented with a new parameter selection technique and comprehensive performance analysis based on simulation techniques. With this parameter selection, it is shown that no server performs significantly better than the other in most of the situations. This suggests that future POSIX revisions for real-time support should also consider mechanisms by which other types of servers could be implemented.
منابع مشابه
Optimal Priority Assignment for Aperiodic Tasks with Firm Deadlines in Fixed Priority Pre-Emptive Systems
An optimal priority assignment policy is presented for independent aperiodic tasks with arbitrary ready times and firm deadlines, scheduled on a uniprocessor along with a set of hard periodic/sporadic tasks. The latter tasks are assumed to have been assigned unique fixed priorities according to some arbitrary policy and guaranteed, via off-line feasibility analysis, to meet their deadlines. In ...
متن کاملSchedulability Tests for Fixed Priority Scheduling
Tasks can be classi ed as either periodic which execute every some time units or vice versa as aperiodic. Sporadic tasks are a special case of aperiodic tasks which are guaranteed to have a minimum spacing between consecutive instances of the same task. Sporadic tasks sets can be handled by modeling them as periodic tasks and therefore we will concentrate on the former two types of tasks. Sched...
متن کاملExtended Global Dual Priority Algorithm for Multiprocessor Scheduling in Hard Real-Time Systems
In this paper we present a global scheduling method for shared memory multiprocessor systems that provides a fixed-priority preemptive scheduling of periodic tasks, hard aperiodic tasks and soft aperiodic tasks on a set of identical processors. The method is based on the functioning of the Dual Priority Scheduling Algorithm extended to work in a multiprocessor environment. This algorithm guaran...
متن کاملPower-Aware Scheduling of Mixed Task Sets in Priority-Driven Systems
We propose power-aware on-line task scheduling algorithms for mixed task sets which consist of both periodic and aperiodic tasks. The proposed algorithms utilize the execution behaviors of scheduling servers for aperiodic tasks. Since there is a trade-off between the energy consumption and the response time of aperiodic tasks, the proposed algorithms focus on bounding the response time degradat...
متن کاملDynamic Voltage Scaling for Mixed Task Sets in Fixed-Priority Systems
We address the problem of dynamic voltage scaling (DVS) for real-time systems with both periodic and aperiodic tasks. Although many DVS algorithms have been developed for real-time systems with periodic tasks, the arbitrary temporal behaviors of aperiodic tasks make it difficult to use the algorithms for such a system with mixed tasks. We propose an off-line DVS algorithm and on-line DVS algori...
متن کامل