The complexity and difficulty in proving equation or inequation are reduced effectively through establishing suitable probability models. 摘要通過(guò)構造適當的概率模型使得一些原本很難證明的等式或不等式的證明變得簡(jiǎn)單而容易。
Schedulability test inequation of the algorithm is presented in the paper.The validity and the flexibility of the algorithm are proved through the analysis of classical task sets. 文中給出該算法的可調度判定不等式，并且通過(guò)對經(jīng)典任務(wù)集的調度結果，驗證了算法的有效性和靈活性。
