An <sc>fptas</sc> for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation

DOI10.1109/TC.2014.2346178zbMath1360.68280OpenAlexW2087568862MaRDI QIDQ2982179

Thi Huyen Chau Nguyen, Emmanuel Grolleau, Pascal Richard

Publication date: 16 May 2017

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

Full work available at URL: https://doi.org/10.1109/tc.2014.2346178

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Knapsack problem with objective value gaps ⋮ Improved response-time bounds in fixed priority scheduling with arbitrary deadlines

This page was built for publication: An <sc>fptas</sc> for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation