On fixed priority scheduling, offsets and co-prime task periods

DOI10.1016/S0020-0190(98)00087-8zbMath1338.68038OpenAlexW2077576535MaRDI QIDQ293317

F. Blanchet-Sadri, M. Dambrine

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000878?np=y

zbMATH Keywords

performance evaluationreal timefixed priority dispatchingscheduling analysis

Mathematics Subject Classification ID

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

Related Items (2)

MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling ⋮ Optimal \((D - J)\)-monotonic priority assignment

Cites Work

• Unnamed Item
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• New strategies for assigning real-time tasks to multiprocessor systems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: On fixed priority scheduling, offsets and co-prime task periods