An analysis of fixed-priority schedulability on a multiprocessor

DOI10.1007/S11241-005-4686-1MaRDI QIDQ853595zbMATH OpenOpenAlexFDO

Authors Theodore P. Baker

Publication date 17 November 2006

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

Full work available at URL https://doi.org/10.1007/s11241-005-4686-1

zbMATH Keywords

real timeschedulingfixed prioritymultiprocessorutilization boundsymmetric multiprocessingdeadline monotonicrate monotonic

Mathematics Subject Classification ID

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

Recommendations

• Push forward: global fixed-priority scheduling of arbitrary-deadline sporadic task systems
• Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
• Utilization bounds for multiprocessor rate-monotonic scheduling

Cites work

• scientific article; zbMATH DE number 1559529 (Why is no real title available?)
• On a Real-Time Scheduling Problem
• Real time scheduling theory: A historical perspective
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Cited in

(30)

• A bound analysis of scheduling instructions on pipelined processors with a maximal delay of one cycle
• On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm
• Laxity dynamics and LLF schedulability analysis on multiprocessor platforms
• Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation
• Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
• Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
• A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling
• Feasibility analysis under fixed priority scheduling with limited preemptions
• Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
• Schedulability analysis of global EDF
• The limited-preemptive feasibility of real-time tasks on uniprocessors
• Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
• FPSL, FPCL and FPZL schedulability analysis
• Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory
• Real-time application mapping for many-cores using a limited migrative model
• Timing analysis of compound scheduling policies: application to posix1003.1B
• Fixed priority scheduling with limited priority levels
• Guaranteeing response times for aperiodic tasks in global multiprocessor scheduling
• Interference-aware fixed-priority schedulability analysis on multiprocessors
• Priority-driven scheduling of periodic task systems on multiprocessors
• Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
• Optimal virtual cluster-based multiprocessor scheduling
• Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms
• Utilization bound for periodic task set with composite deadline
• Lowest priority first based feasibility analysis of real-time systems
• Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
• Predictability of fixed-job priority schedulers on heterogeneous multiprocessor real-time systems
• Push forward: global fixed-priority scheduling of arbitrary-deadline sporadic task systems
• Improved multiprocessor global schedulability analysis
• May-Happen-in-Parallel Analysis for Priority-Based Scheduling

This page was built for publication: An analysis of fixed-priority schedulability on a multiprocessor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853595)