摘要
利用到达和服务与时间的反函数 ,获得了一种计算与ATM交换连接的最坏情况延迟的直接算法 .在借鉴经典的强实时系统静态优先级调度理论的基础上 ,通过引入分区算法来计算ATM交换的延迟 ,在指定的时限内传送完所有的信息 .仿真实验结果表明 ,基于静态优先级的分区算法明显优于直接算法 ,ATM交换网连接的允许可能性平均提高 10 % .
Using the inverse of the arrival and service functions, the authors obtain a direct algorithm to compute the worst case delay, and based on the classical static priority scheduling theory for hard real time system, propose a delay computation method with partition algorithm. A firmer commitment is needed from the network, that is, it will always deliver all message completely and within specified deadline. The simulation experiments show that the partition algorithm is better than the direct algorithm, and the connections admission probabilities are raised by 10%.
出处
《中南工业大学学报》
CSCD
北大核心
2002年第3期322-324,共3页
Journal of Central South University of Technology(Natural Science)
基金
国家自然科学基金资助项目 (698740 2 4)
