On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm

DOI10.1007/S11241-015-9241-0zbMath1351.68043OpenAlexW2109017620MaRDI QIDQ255296

Vincenzo Bonifaci, Marko Bertogna, Robert I. Davis

Publication date: 9 March 2016

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

Full work available at URL: https://doi.org/10.1007/s11241-015-9241-0

zbMATH Keywords

exact schedulability testsglobal fixed-priority pre-emptive schedulingoptimal priority assignmentperiodic tasksreal-time schedulingsporadic tasks

Mathematics Subject Classification ID

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

Cites Work

• Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
• Feasibility analysis of sporadic real-time multiprocessor task systems
• On priority assignment in fixed priority scheduling
• A survey of hard real-time scheduling for multiprocessor systems
• Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm