An analysis of fixed-priority schedulability on a multiprocessor

DOI10.1007/S11241-005-4686-1zbMATH Open1103.68393OpenAlexW2090557530MaRDI QIDQ853595FDOQ853595

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

Recommendations

• Feasibility analysis of sporadic real-time multiprocessor task systems
• Feasibility analysis of sporadic real-time multiprocessor task systems
• 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

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)

Cites Work

• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Title not available (Why is that?)
• Real time scheduling theory: A historical perspective
• On a Real-Time Scheduling Problem

Cited In (23)

• 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
• Feasibility analysis under fixed priority scheduling with limited preemptions
• A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling
• Schedulability analysis of global EDF
• Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
• FPSL, FPCL and FPZL schedulability analysis
• 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
• Title not available (Why is that?)
• Interference-aware fixed-priority schedulability analysis on multiprocessors
• Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
• Priority-driven scheduling of periodic task systems on multiprocessors
• Optimal virtual cluster-based multiprocessor scheduling
• Utilization bound for periodic task set with composite deadline
• 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
• Improved multiprocessor global schedulability analysis
• May-Happen-in-Parallel Analysis for Priority-Based Scheduling
• A bound analysis of scheduling instructions on pipelined processors with a maximal delay of one cycle

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)