Results 231 to 240 of about 1,854,282 (287)

Fixed priority scheduling with limited priority levels

IEEE Transactions on Computers, 1995
Summary: This paper develops necessary and sufficient conditions for analyzing the schedulability of fixed priority algorithms on resources with limited priority levels. We introduce the degree of schedulable saturation \((S_{\max})\) as an objective function.
J K Strosnider
exaly   +4 more sources

Generalized Fixed-Priority Scheduling with Limited Preemptions

2012 24th Euromicro Conference on Real-Time Systems, 2012
Fixed-priority scheduling with deferred preemption(FPDS) and fixed-priority scheduling with preemption thresholds(FPTS) have been proposed in the literature as viable alternatives to fixed-priority preemptive scheduling (FPPS), that reduce memory requirements, reduce the cost of arbitrary preemptions, and may improve the feasibility of a task set even ...
Reinder J. Bril, Martijn M. H. P. van den Heuvel, Ugur Keskin, Johan J. Lukkien   +3 more
openaire   +3 more sources

Improving fixed priority schedulability with dynamic priority as secondary criterion

Journal of Embedded Computing, 2006
In this paper, we focus on a non-preemptive scheduling, combining fixed priorities and dynamic priorities on a uniprocessor. This scheduling is called FP/DP. Results presented in this paper can be applied indifferently to tasks and flows. With any flow are associated a fixed priority denoting the importance degree of the flow and a temporal parameter,
Steven Martin 0001, Pascale Minet, Laurent George 0001   +2 more
exaly   +3 more sources

On priority assignment in fixed priority scheduling

Information Processing Letters, 2001
N C Audsley
exaly   +4 more sources

Engineering and analysis of fixed priority schedulers

IEEE Transactions on Software Engineering, 1993
Scheduling theory holds great promise as a means to a priori validate timing correctness of real-time applications. However, there currently exists a wide gap between scheduling theory and its implementation in operating system kernels running on specific hardware platforms.
Daniel I. Katcher, Hiroshi Arakawa, Jay K. Strosnider   +2 more
openaire   +2 more sources

Synchronous sessions and fixed priority scheduling

Journal of Systems Architecture, 1997
Abstract Fixed priority scheduling is usually applied to tasks that communicate only asynchronously. Synchronous communication, although more suitable for some application requirements, is more difficult to analyse, as a task can be blocked several times and the duration of each block is dependent on the behaviour of other tasks.
Alan Burns 0001, Andy J. Wellings
openaire   +2 more sources

Applying fixed priority scheduling in practice

Proceedings of the 4th international workshop on Software and performance, 2004
In this paper we are primarily concerned with embedded real-time systems such as mobile phones or personal communication devices. Today personal communication devices are more than voice call terminals. Mobile phones serve as platforms for a variety of mobile applications including text and picture messaging as well as personal information management ...
Raimondas Lencevicius, Alexander Ran
openaire   +1 more source