Can I read Finite Ready Queues as a Mean for Overload Reduction in Weakly-hard Real-time Systems on EtoBox?

Finite Ready Queues as a Mean for Overload Reduction in Weakly-hard Real-time Systems by Leonie Ahrendts, Sophie Quinton, and Rolf Ernst is a scholarly article available to read on EtoBox.

What is Finite Ready Queues as a Mean for Overload Reduction in Weakly-hard Real-time Systems about?

Finite ready queues, implemented by bu ers, are a system reality in embedded real-time computing systems and networks. The dimensioning of queues is subject to constraints in industrial practice, and often the queue capacity is su cient for typical system behavior but is not su cient in peak overload conditions. This may lead to over ow and consequently to the discarding of jobs. In this paper, we explore whether nite queue capacity can also be used as a mean of design in order to reduce workload peaks and thus shorten a transient overload phase. We present an analysis method which is to the best of our knowledge the rst one able to give (a) worst-case response times guarantees as well as (b) weakly-hard guarantees for tasks which are executed on a computing system with nite queues. Experimental results show that nite queue capacity may only a have weak overload limiting e ect. This unexpected outcome can be explained by the system behavior in the worst-case corner cases. The analysis shows nevertheless that a trade-o between weakly-hard guarantees and queue sizes is possible. ## CCS CONCEPTS • Computer systems organization → Embedded and cyberphysical systems; Real-time systems;

Author

Leonie Ahrendts, Sophie Quinton, and Rolf Ernst

Publisher

ACM

Published

2017

Language

EN