Measuring the performance of schedulability tests

DOI10.1007/S11241-005-0507-9zbMATH Open1083.68008OpenAlexW2141440050MaRDI QIDQ813145FDOQ813145

Authors: Enrico Bini, Giorgio C. Buttazzo 

Publication date: 30 January 2006

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-005-0507-9

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

zbMATH Keywords

EDF: Earliest Deadline FirstFP: Fixed PrioritiesHB: Hyperbolic BoundRM: Rate Monotonic

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• New strategies for assigning real-time tasks to multiprocessor systems
• The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments

Cited In (51)

• Sensitivity analysis for fixed-priority real-time systems
• DMAC: Deadline-Miss-Aware Control
• Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand
• Efficiently approximating the probability of deadline misses in real-time systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation
• Cache related pre-emption delays in hierarchical scheduling
• Response time analysis for fixed priority real-time systems with energy-harvesting
• Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
• Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
• Feasibility analysis under fixed priority scheduling with limited preemptions
• Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems
• Online and offline scheduling with cache-related preemption delays
• The limited-preemptive feasibility of real-time tasks on uniprocessors
• Title not available (Why is that?)
• The space of EDF deadlines: The exact region and a convex approximation
• A fault-tolerant time-triggered scheduling algorithm of mixed-criticality systems
• FPSL, FPCL and FPZL schedulability analysis
• Parametric schedulability analysis of a launcher flight control system under reactivity constraints
• Fault-tolerant and real-time scheduling for mixed-criticality systems
• Architecture aware semi partitioned real-time scheduling on multicore platforms
• Synthesising succinct strategies in safety games with an application to real-time scheduling
• Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme
• Parameter adaptation for generalized multiframe tasks: schedulability analysis, case study, and applications to self-suspending tasks
• On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling
• Interference-aware fixed-priority schedulability analysis on multiprocessors
• Garbage collection-aware utility accrual scheduling
• Response-time analysis of limited-preemptive parallel DAG tasks under global scheduling
• Approximation techniques for response-time analysis of static-priority tasks
• Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms
• An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
• A new sufficient schedulability analysis for hybrid scheduling
• Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
• ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors
• Energy-aware scheduling mandatory/optional tasks in multicore real-time systems
• Narrowing the speedup factor gap of partitioned EDF
• Energy efficient fault-tolerant earliest deadline first scheduling for hard real-time systems
• 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
• FFOB: efficient online mode-switch procrastination in mixed-criticality systems
• Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling
• Uneven memory regulation for scheduling IMA applications on multi-core platforms
• Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN
• Exact speedup factors and sub-optimality for non-preemptive scheduling
• Push forward: global fixed-priority scheduling of arbitrary-deadline sporadic task systems
• On the heterogeneity bias of cost matrices when assessing scheduling algorithms
• An extensible framework for multicore response time analysis
• Improved response-time bounds in fixed priority scheduling with arbitrary deadlines
• Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement

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)