Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems

DOI10.1007/978-3-540-77444-0_20zbMath1131.68350OpenAlexW1575939710MaRDI QIDQ5445754

Sanjoy K. Baruah, Nathan Fisher

Publication date: 6 March 2008

Published in: Distributed Computing and Networking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77444-0_20

Mathematics Subject Classification ID

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

Related Items (6)

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems ⋮ FPSL, FPCL and FPZL schedulability analysis ⋮ Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible ⋮ Improved multiprocessor global schedulability analysis ⋮ Unnamed Item ⋮ An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems

This page was built for publication: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems