一种考虑动态优先级的VC调度算法

Dynamic priority of VC scheduling algorithm

在分析VC(virtual clock)分组调度算法的优点和缺点的基础上,针对VC算法的静态优先级策略的主要缺点,即优先级只能在数据流建立初期指定,不能动态的改变,从而使得优先级的建立受到很大的限制进行了改进,提出动态优先级的策略,提出了一种考虑动态优先级的VC调度算法。阐述了设计的目标、改进措施,并给出了算法描述和软件仿真,仿真结果说明:动态优先权的应用使得数据流可以方便地根据实际情况灵活的调整自身的性能要求,从而可以更加方便地满足用户要求的变化。

Based on the analysis of VC （virtual clock）, to the main weakness of static priority that priority is determined at the beginning of the form of the stream instead of changing dynamically, an improved VC scheduling algorithm is proposed, which considers the dynamic priority of VC. The design objectives, improving methods, algorithm description and simulation are presented. The result of simulation shows that the application of dynamic priority enables the data stream to satisfy the variety of the users＇ needs more flexibly, by adjusting its performance according to practical situation.