Measuring the performance of schedulability tests
From MaRDI portal
Recommendations
- Liu and Layland's schedulability test revisited
- scientific article; zbMATH DE number 2112450
- Performance evaluation of schedulers in a probabilistic setting
- Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms
- Comments on ``Generalized rate monotonic schedulability bounds using relative period ratios
Cites work
Cited in
(55)- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
- Approximation techniques for response-time analysis of static-priority tasks
- An extensible framework for multicore response time analysis
- Online and offline scheduling with cache-related preemption delays
- Parameter adaptation for generalized multiframe tasks: schedulability analysis, case study, and applications to self-suspending tasks
- On the heterogeneity bias of cost matrices when assessing scheduling algorithms
- Improved response-time bounds in fixed priority scheduling with arbitrary deadlines
- An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
- Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement
- Exact speedup factors and sub-optimality for non-preemptive scheduling
- Narrowing the speedup factor gap of partitioned EDF
- A fault-tolerant time-triggered scheduling algorithm of mixed-criticality systems
- Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN
- FPSL, FPCL and FPZL schedulability analysis
- Interference-aware fixed-priority schedulability analysis on multiprocessors
- Fault-tolerant and real-time scheduling for mixed-criticality systems
- ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors
- The limited-preemptive feasibility of real-time tasks on uniprocessors
- Architecture aware semi partitioned real-time scheduling on multicore platforms
- Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation
- Sensitivity analysis for fixed-priority real-time systems
- Response time analysis for fixed priority real-time systems with energy-harvesting
- Cache related pre-emption delays in hierarchical scheduling
- Synthesising succinct strategies in safety games with an application to real-time scheduling
- Garbage collection-aware utility accrual scheduling
- Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems
- On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling
- Energy-aware scheduling mandatory/optional tasks in multicore real-time systems
- A new sufficient schedulability analysis for hybrid scheduling
- Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme
- Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
- Energy efficient fault-tolerant earliest deadline first scheduling for hard real-time systems
- Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms
- Parametric schedulability analysis of a launcher flight control system under reactivity constraints
- DMAC: Deadline-Miss-Aware Control
- PREM-based optimal task segmentation under fixed priority scheduling
- scientific article; zbMATH DE number 7559342 (Why is no real title available?)
- Scheduling self-suspending tasks: new and old results
- Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand
- Response-time analysis of limited-preemptive parallel DAG tasks under global scheduling
- scientific article; zbMATH DE number 7559357 (Why is no real title available?)
- Efficiently approximating the probability of deadline misses in real-time systems
- Push forward: global fixed-priority scheduling of arbitrary-deadline sporadic task systems
- Feasibility analysis under fixed priority scheduling with limited preemptions
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
- \textsc{Soteria}: a formal digital-twin-enabled framework for safety-assurance of latency-aware cyber-physical systems
- Worst case response time analysis for completely fair scheduling in Linux systems
- Minimizing cache usage with fixed-priority and earliest deadline first scheduling
- Timing-aware analysis of shared cache interference for non-preemptive scheduling
- A design flow for supporting component-based software development in multiprocessor real-time systems
- Response-time analysis for fixed-priority systems with a write-back cache
- Uneven memory regulation for scheduling IMA applications on multi-core platforms
- Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling
- FFOB: efficient online mode-switch procrastination in mixed-criticality systems
- The space of EDF deadlines: The exact region and a convex approximation
This page was built for publication: Measuring the performance of schedulability tests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813145)
