Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
Journal of Systems Architecture: the EUROMICRO Journal
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Maximizing the Robustness of TDMA Networks with Applications to TTP/C
Real-Time Systems
A linguistic decision support model for QoS priorities in networking
Knowledge-Based Systems
| Hi-index | 0.24 |
In real-time systems, one generally identifies two types of timing requirements, hard and soft constraints. In this study, it is assumed that the Hard Real-Time traffic (HRT) is periodic with deadlines that must be guaranteed, while the Soft Real-Time traffic (SRT) is aperiodic with timing constraints that could occasionally be missed without major consequences. In this paper, the problem of scheduling these two types of traffic with different performance objectives will be addressed: (1) ensure that the timing requirements of HRT traffic are met; (2) minimize as much as possible the response time of SRT traffic while satisfying (1). For this purpose, we propose an easily implementable and low-complexity traffic shaping policy, which preserves feasibility and improves response times for SRT traffic. The underlying idea is that it is possible to diminish the response time of SRT traffic if the busy periods induced by the HRT traffic are ''harmoniously'' distributed over time, creating time intervals during which the resource (i.e. the processor or the medium) can be used by SRT traffic with minimum delay. A computer-implementable algorithm that has to be executed independently on each node of the bus is also provided, as well as several extensions of the original model.