Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling

DOI10.1080/00207540410001705211zbMath1060.90039OpenAlexW2071491617MaRDI QIDQ4671285

No author found.

Publication date: 26 April 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540410001705211

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Delay composition in preemptive and non-preemptive real-time pipelines ⋮ Reduction-based schedulability analysis of distributed systems with cycles in the task graph

Cites Work

• Unnamed Item
• A calculus for network delay. I. Network elements in isolation
• A calculus for network delay. II. Network analysis
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling