Utilization based schedulability bounds for age constraint process sets in real-time systems

DOI10.1023/A:1020232013487zbMATH Open1012.68021OpenAlexW1500869626MaRDI QIDQ1871069FDOQ1871069

Lars Lundberg

Publication date: 6 May 2003

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

Full work available at URL: https://doi.org/10.1023/a:1020232013487

zbMATH Keywords

real-timeschedulingperformance boundsage constraintharmonic periods

Mathematics Subject Classification ID

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

Cited In (1)

• Title not available (Why is that?)

   Recommendations

• Processor utilization bounds for real-time systems with precedence constraints 👍 👎
• Generalized rate monotonic schedulability bounds using relative period ratios 👍 👎
• Title not available (Why is that?) 👍 👎
• Rate monotonic scheduling in hard real-time systems 👍 👎
• Processor bounding for an efficient non-preemptive task scheduling algorithm 👍 👎

This page was built for publication: Utilization based schedulability bounds for age constraint process sets in real-time systems

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