Scalability and QoS Guarantee for the Streams with the(p,k) Constraint
Dongsong Zhang · Computer Engineering and Science · 2008
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.