(p,k)约束流的可扩展性和QoS保证

Scalability and QoS Guarantee for the Streams with the(p,k) Constraint

在弱硬实时应用中,(p,k)约束可以提供更精细的QoS保证。为了提高(p,k)约束流的可扩展性,本文通过分析(p,k)约束,给出其分类依据,提出了相应的静态和动态分类选择算法。实验结果表明,分类选择算法能够在性能和开销之间提供适当的折衷。

In weakly hard real-time applications, the （p,k） constraint can provide finer QoS guarantee. To improve the scalability of the streams with the （p,k） constraint, this paper analyzes the （p,k） constraint and presents the evidence of classification. Then, the corresponding static and dynamic class selection algorithms are brought up. Experimental results show that the presented algorithms can provide a proper trade-off between the performance and the overhead.