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

DOI10.1016/S0020-0190(98)00087-8zbMATH Open1338.68038OpenAlexW2077576535MaRDI QIDQ293317FDOQ293317

Authors: N. C. Audsley, A. Burns 

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

Recommendations

• Scheduling of offset free systems
• Minimal schedulability interval for real-time systems of periodic tasks with offsets
• Feasibility analysis of real-time periodic tasks with offsets
• Exact and heuristic algorithms for thrift cyclic scheduling
• Fixed priority scheduling with limited priority levels

zbMATH Keywords

real timeperformance evaluationfixed priority dispatchingscheduling analysis

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• New strategies for assigning real-time tasks to multiprocessor systems

Cited In (4)

• Scheduling of offset free systems
• Optimal \((D - J)\)-monotonic priority assignment
• MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
• Minimal schedulability interval for real-time systems of periodic tasks with offsets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293317)