Results 241 to 250 of about 1,854,282 (287)
Some of the next articles are maybe not open access.
Schedulability analysis of periodic fixed priority systems
IEEE Transactions on Computers, 2004Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic tasks. They can be divided in two main classes: polynomial time tests and exact tests.
BINI, Enrico, G. C. BUTTAZZO
openaire +2 more sources
An Analysis of Fixed-Priority Schedulability on a Multiprocessor
Real-Time Systems, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Hierarchical Fixed Priority Pre-Emptive Scheduling
26th IEEE International Real-Time Systems Symposium (RTSS'05), 2006This paper focuses on the hierarchical scheduling of systems where a number of separate applications reside on a single processor. It addresses the particular case where fixed priority pre-emptive scheduling is used at both global and local levels, with a server associated with each application.
Davis, R.I., Burns, A.
openaire +3 more sources
Optimal Fixed Priority Assignment with Limited Priority Levels
2003The schedulability utilization of fixed priority scheduling will be reduced greatly if priority levels of the system are insufficient. In this case, more than one task must be grouped into a same priority. This paper extends necessary and sufficient conditions for analyzing the schedulability of fixed priority algorithms on resources with limited ...
Xuelian Bin, Yuhai Yang, Shiyao Jin
openaire +2 more sources
Optimal priority and threshold assignment for fixed-priority preemption threshold scheduling
ACM SIGBED Review, 2018Fixed-priority preemption-threshold scheduling (FPTS) is a generalization of fixed-priority preemptive scheduling (FPPS) and fixed-priority non-preemptive scheduling (FPNS). Since FPPS and FPNS are incomparable in terms of potential schedulability, FPTS has the advantage that it can schedule any task set schedulable by FPPS or FPNS and some that are ...
Leo Hatvani +2 more
openaire +4 more sources
Fixed priority scheduling with deadlines prior to completion
Proceedings Sixth Euromicro Workshop on Real-Time Systems, 2002Standard analysis for fixed priority scheduling assumes that all the computations for each task must be completed by the task's deadline. In practice this is rarely the case. The deadline is more correctly associated with the last observable event of the task, interval events and kernel overheads (such as the context switch away from the task) can ...
Alan Burns 0001 +2 more
openaire +2 more sources
Scheduling fixed-priority tasks with preemption threshold
Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306), 2003In the context of fixed-priority scheduling, feasibility of a task set with non-preemptive scheduling does not imply the feasibility with preemptive scheduling and vice versa. We use the notion of preemption threshold, first introduced by Express Logic, in their ThreadX real-time operating system, to develop a scheduling model that subsumes both ...
Yun Wang, Manas Saksena
openaire +1 more source
Global Semi-fixed-priority Scheduling on Multiprocessors
2011 IEEE 17th International Conference on Embedded and Real-Time Computing Systems and Applications, 2011Current real-time systems such as robots have multiprocessors and the number of processors tends to be increased. In order to achieve these real-time systems, global real-time scheduling has been required. Many real-time scheduling algorithms are usually based on Liu and Layland's model.
Hiroyuki Chishiro, Nobuyuki Yamasaki
openaire +1 more source
Analysis of hierar hical fixed-priority scheduling
Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002, 2005Reservation-based operating systems provide applications with guaranteed and timely access to system resources. One of their chief benefits is temporal isolation, which prevents the timing mis-behavior of one task from interfering with other tasks. Such a benefit is appealing enough that many systems [2, 8] desire to recursively apply this reservation ...
Saowanee Saewong +3 more
openaire +1 more source
2011
The scheduling algorithms treated in the previous chapters deal with homogeneous sets of tasks, where all computational activities are either aperiodic or periodic. Many real-time control applications, however, require both types of processes, which may also differ for their criticality.
openaire +1 more source
The scheduling algorithms treated in the previous chapters deal with homogeneous sets of tasks, where all computational activities are either aperiodic or periodic. Many real-time control applications, however, require both types of processes, which may also differ for their criticality.
openaire +1 more source