A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Enhanced fixed-priority scheduling with (m,k)-firm guarantee
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Energy minimization for real-time systems with (m; k)-guarantee
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Hi-index | 0.00 |
In this paper, we explore improving the schedulability and energy performance for real-time systems with (m, k)-constraints, which require that at least m out of any k consecutive jobs of a task meet their deadlines. The preliminary results demonstrated that our proposed approach is very promising in achieving these dual goals.