A dynamic priority assignment technique for streams with (m, k)-firm deadlines

DOI10.1109/12.477249zbMath1068.68618OpenAlexW2140710806MaRDI QIDQ4421136

M. Hamdaoui, Parameswaran Ramanathan

Publication date: 10 November 2003

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/9330

Mathematics Subject Classification ID

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

Related Items (13)

Scheduling algorithms based on weakly hard real-time constraints ⋮ Optimal control of discrete event systems with weakly hard real-time constraints ⋮ Dynamic real-time scheduling of firm periodic tasks with hard and soft aperiodic tasks ⋮ Approximation algorithms for scheduling real-time jobs with multiple feasible intervals ⋮ Analysis of window-constrained execution time systems ⋮ Optimizing path real-time logic for unified real-time system ⋮ An \(\mathsf{EDF}\)-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems ⋮ Tardiness bounds under global EDF scheduling on a multiprocessor ⋮ Energy efficient scheduling for real-time embedded systems with QoS guarantee ⋮ An integrated DBP for streams with (m, k)-firm real-time guarantee ⋮ From Iteration to System Failure: Characterizing the FITness of Periodic Weakly-Hard Systems ⋮ Efficient stability analysis approaches for nonlinear weakly-hard real-time control systems ⋮ Quantifying the Resiliency of Fail-Operational Real-Time Networked Control Systems

This page was built for publication: A dynamic priority assignment technique for streams with (m, k)-firm deadlines