Results 1 - 10 of 1,244

Scheduling Fixed-Priority Tasks with Preemption Threshold

by Yun Wang, Manas Saksena , 1999
"... In 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. In this paper, we use the notion of preemption threshold, first introduced by Express Logic, Inc. in their ThreadX real-time ..."
Abstract - Cited by 61 (0 self) - Add to MetaCart
In 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. In this paper, we use the notion of preemption threshold, first introduced by Express Logic, Inc. in their ThreadX real

New schedulability test conditions for non-preemptive scheduling on multiprocessor platforms

by Nan Guan , Wang Yi , Zonghua Gu , Qingxu Deng , Ge Yu - In RTSS , 2008
"... Abstract We study the schedulability analysis problem for nonpreemptive scheduling algorithms on multiprocessors. To our best knowledge, the only known work on this problem is the test condition proposed by Baruah [1] (referred to as [BAR-EDF np ]) for non-preemptive EDF scheduling, which will reje ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
scheduling (EDF np ) and Non-preemptive Fixed Priority scheduling (FP np ) respectively. Experiments with randomly generated task sets show that our proposed test conditions, especially the improved test conditions, have significant performance improvements compared with [BAR-EDF np ].

Quantifying the Exact Sub-Optimality of Non-Preemptive Scheduling

by Robert I. Davis, Abhilash Thekkilakattil, Oliver Gettings, Radu Dobrin, Sasikumar Punnekkat
"... Abstract—Fixed priority scheduling is used in many real-time systems; however, both preemptive and non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to an optimal uniprocessor scheduling algorithm such as preemptive Earliest Deadline First (EDF-P). In this paper, we ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract—Fixed priority scheduling is used in many real-time systems; however, both preemptive and non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to an optimal uniprocessor scheduling algorithm such as preemptive Earliest Deadline First (EDF-P). In this paper, we

2008 Real-Time Systems Symposium New Schedulability Test Conditions for Non-preemptive Scheduling on Multiprocessor Platforms ∗

by Nan Guan, Wang Yi, Zonghua Gu, Qingxu Deng, Ge Yu
"... We study the schedulability analysis problem for nonpreemptive scheduling algorithms on multiprocessors. To our best knowledge, the only known work on this problem is the test condition proposed by Baruah [1] (referred to as [BAR-EDFnp]) for non-preemptive EDF scheduling, which will reject a task se ..."
Abstract - Add to MetaCart
scheduling (EDFnp) and Non-preemptive Fixed Priority scheduling (FPnp) respectively. Experiments with randomly generated task sets show that our proposed test conditions, especially the improved test conditions, have significant performance improvements compared with [BAR-EDFnp]. 1

Cache-Aware Scheduling and Analysis for Multicores ∗

by Nan Guan, Martin Stigge, Wang Yi, Ge Yu
"... The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms; the way of handling the on-chip shared resources such as L2 cache may have a significant impact on the timing predictab ..."
Abstract - Cited by 35 (5 self) - Add to MetaCart
number of cache partitions, and makes sure that at any time a cache partition is occupied by at most one running task. In this way, the cache spaces of tasks are isolated at run-time. As technical contributions, we have developed a sufficient schedulability test for non-preemptive fixed-priority

Some Insights on Fixed-Priority Preemptive Non-Partitioned Multiprocessor Scheduling

by Björn Andersson, Jan Jonsson
"... Fixed-priority preemptive scheduling of independent periodic tasks on a homogeneous multiprocessor is solved using one of two different methods based on how tasks are assigned to the processors at run-time. In the partitioned method, ..."
Abstract - Cited by 27 (2 self) - Add to MetaCart
Fixed-priority preemptive scheduling of independent periodic tasks on a homogeneous multiprocessor is solved using one of two different methods based on how tasks are assigned to the processors at run-time. In the partitioned method,

Bounding the maximum length of non-preemptive regions under fixed priority scheduling

by Gang Yao, Giorgio Buttazzo, Marko Bertogna - In RTCSA ’09: Proceedings of the 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications , 2009
"... The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time literature and still some issues remain open. In fact, each approach has advantages and disadvantages, and no one dominates th ..."
Abstract - Cited by 25 (11 self) - Add to MetaCart
preemptive and non-preemptive scheduling by considering that each task can switch to non-preemptive mode, at any time, for a bounded interval. Three methods (with different complex-ity and performance) are presented to calculate the longest non-preemptive interval that can be executed by each task, under

Some Insights on Fixed-Priority Preemptive Non-Partitioned Multiprocessor Scheduling

by unknown authors
"... Fixed-priority preemptive scheduling of independent periodic tasks on a homogeneous multiprocessor is solved using one of two different methods based on how tasks are assigned to the processors at run-time. In the partitioned method, ..."
Abstract - Add to MetaCart
Fixed-priority preemptive scheduling of independent periodic tasks on a homogeneous multiprocessor is solved using one of two different methods based on how tasks are assigned to the processors at run-time. In the partitioned method,

Modeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus

by Devesh B. Chokshi, Ar Bhaduri
"... Modern real-time embedded systems are highly hetero-geneous and distributed. As a result, compositional meth-ods play an important role in the design and analysis of such complex systems. One such compositional analysis method is based on Real-Time Calculus [4, 14]. In this pa-per, we present an ana ..."
Abstract - Add to MetaCart
an analysis of fixed priority non-preemptive scheduling with the Real-Time Calculus. Although fixed priority non-preemptive scheduling was modeled with the Real-Time Calculus previously [7], we show that the model gives overly pessimistic results. We also compare our anal-ysis with the existing holistic

Non-Preemptive Real-Time Scheduling Of Dataflow Systems

by Thomas M. Parks, Edward A. Lee - In Proceedings of International Conference on Acoustics, Speech, and Signal Processing , 1995
"... Real-time signal processing applications can be described naturally with dataflow graphs. The systems we consider have a mix of real-time and non-real-time processing, where independent dataflow graphs represent tasks and individual dataflow actors are subtasks. Rate-monotonic scheduling is optimal ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
for fixed-priority, preemptive scheduling of periodic tasks. Priority inheritance protocols extend rate-monotonic scheduling theory to include tasks that contend for exclusive access to shared resources. We show that non-preemptive rate-monotonic scheduling can be viewed as preemptive scheduling where
Results 1 - 10 of 1,244