An analysis of fixed-priority schedulability on a multiprocessor

DOI10.1007/S11241-005-4686-1zbMath1103.68393OpenAlexW2090557530MaRDI QIDQ853595

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

schedulingmultiprocessorreal timefixed priorityutilization boundsymmetric multiprocessingdeadline monotonicrate monotonic

Mathematics Subject Classification ID

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

Related Items (7)

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems ⋮ FPSL, FPCL and FPZL schedulability analysis ⋮ Interference-aware fixed-priority schedulability analysis on multiprocessors ⋮ Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems ⋮ Unnamed Item ⋮ Optimal virtual cluster-based multiprocessor scheduling ⋮ Real-time application mapping for many-cores using a limited migrative model

Cites Work

• Real time scheduling theory: A historical perspective
• On a Real-Time Scheduling Problem
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Unnamed Item

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