A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Verifying Weakly-Hard Real-Time Properties of Traffic Streams in Switched Networks
2018
Euromicro Conference on Real-Time Systems
In this paper, we introduce the first verification method which is able to provide weakly-hard real-time guarantees for tasks and task chains in systems with multiple resources under partitioned scheduling with fixed priorities. Existing weakly-hard real-time verification techniques are restricted today to systems with a single resource. A weakly-hard real-time guarantee specifies an upper bound on the maximum number m of deadline misses of a task in a sequence of k consecutive executions. Such
doi:10.4230/lipics.ecrts.2018.15
dblp:conf/ecrts/AhrendtsQBE18
fatcat:zwxbja44rjel7dfcopiksmbdri