The complexity and difficulty in proving equation or inequation are reduced effectively through establishing suitable probability models. 摘要通過構(gòu)造適當?shù)母怕誓Ｐ褪沟靡恍┰竞茈y證明的等式或不等式的證明變得簡單而容易。
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. 文中給出該算法的可調(diào)度判定不等式，并且通過對經(jīng)典任務集的調(diào)度結(jié)果，驗證了算法的有效性和靈活性。