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

DOI10.1109/12.477249zbMATH Open1068.68618OpenAlexW2140710806MaRDI QIDQ4421136FDOQ4421136

Authors: 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

Recommendations

• An integrated DBP for streams with (m, k)-firm real-time guarantee
• scientific article; zbMATH DE number 986997
• On Scheduling Policies for Streams of Structured Jobs
• Dynamic routing of real-time jobs among parallel EDF queues: a performance study
• Rate monotonic scheduling in hard real-time systems

Mathematics Subject Classification ID

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

Cited In (14)

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

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

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