Dynamic real-time scheduling of firm periodic tasks with hard and soft aperiodic tasks

DOI10.1007/s11241-006-4962-8zbMath1103.68413OpenAlexW2017175900MaRDI QIDQ853601

Audrey Marchand, Maryline Silly-Chetto

Publication date: 17 November 2006

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

Full work available at URL: https://doi.org/10.1007/s11241-006-4962-8

zbMATH Keywords

quality of servicedynamic schedulingreal-timeperiodic taskssporadic tasksaperiodic tasksearliest deadline

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments
• A dynamic priority assignment technique for streams with (m, k)-firm deadlines
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Dynamic real-time scheduling of firm periodic tasks with hard and soft aperiodic tasks