Maximizing Guaranteed QoS in (m, k)-firm Real-time Systems

Authors:
Jian (Denny) Lin;Albert M. K. Cheng
Affiliations:
University of Houston, USA;University of Houston, USA
Venue:
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2006

Citing 0
Cited 2

Improving Web Server Performance with Adaptive Proxy Caching in Soft Real-time Mobile Applications

Journal of VLSI Signal Processing Systems
Energy reduction for scheduling a set of multiple feasible interval jobs

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

tasks in soft/firm real-time systems under overloaded conditions. In general, they are provided by application designers to guarantee the minimum levels of quality of service (QoS). Many problems concentrating in task schedulability under these constraints were investigated in the last ten years. However, little work has been done in combining the optimization of the QoS and task schedulability subject to these (m, k)-firm constraints. In this paper, we consider the problem of maximizing the guaranteed performance while maintaining a schedulable task set in periodic firm real-time systems. To quantify the performance, we propose a granularityrelated metric called Granularity of Quality of Service - Reward (GQoS-reward). We then show that maximizing the total GQoS-reward is an NP-Hard problem and a heuristic method to solve the problem is studied. In addition to the improvement to the GQoS, positive effects on other main performance metrics for soft/firm real time systems, such as effective processor utilization (EPU), total accumulated reward and instability, are also supported by the simulation results using our optimization strategy.