Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times
نویسندگان
چکیده
In this paper, we study schedulability analysis problems for multi-processor real-time systems. Assume a set of real time tasks whose execution times and deadlines are known. We use timed automata to describe the non-deterministic arrival times of tasks. The schedulability problem is to check whether the released task instances can be executed within their given deadlines on a multi-processor platform where each processor has a task queue to bu er task instances scheduled to run on the processor. On the positive side, we show that the problem is decidable for systems with non-preemptive schedulers or tasks with xed execution times. A surprising negative result is that for multi-processor systems with variable task execution times and a non-preemptive scheduler, the schedulability analysis problem is undecidable, which is still an open problem in the single-processor setting.
منابع مشابه
A Response-Time Analysis for Non-preemptive Job Sets under Global Scheduling
An effective way to increase the timing predictability of multicore platforms is to use non-preemptive scheduling. It reduces preemption and job migration overheads, avoids intra-core cache interference, and improves the accuracy of the worst-case execution time (WCET) estimation. However, existing schedulability tests for global non-preemptive multiprocessor scheduling are often too pessimisti...
متن کاملScalable Real-Time System Design using Preemption Thresholds
The maturity of schedulabilty analysis techniques for fixed-priority preemptive scheduling has enabled the consideration of timing issues at design time using a specification of the tasking architecture and estimates of execution times for tasks. While successful, this approach has limitations since the preemptive multi-tasking model does not scale well for a large number of tasks, and the fixe...
متن کاملRelaxing Resource-Sharing Constraints for Improved Hardware
Modern computer architectures, particularly multicore systems, include shared hardware resources such as caches and interconnects that introduce timing-interference channels. Unmanaged access to such resources can adversely affect the execution time of other tasks, and lead to unpredictable execution times and associated analysis pessimism that can entirely negate the benefits of a multicore pr...
متن کاملA Generic Approach to Schedulability Analysis of Real-Time Tasks
In off-line schedulability tests for real time systems, tasks are usually assumed to be periodic, i.e. they are released with fixed rates. To relax the assumption of complete knowledge on arrival times, we propose to use timed automata to describe task arrival patterns. In a recent work, it is shown that for fixed priority scheduling strategy and tasks with only timing constraints (i.e. executi...
متن کاملDeterministic and Statistical Deadline Guarantees for a Mixed Set of Periodic and Aperiodic Tasks
Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource requirements. We propose two new admission control approaches to address this problem. First, we present an efficient schedulability test, called utilization demand analysis, to handle periodic and aperiodic tasks with...
متن کامل