摘要
提出一种基于抢占阈值的最小空闲时间优先服务的总线仲裁算法。主设备总线服务请求的空闲时间越短,获得总线服务就越快,引入抢占阈值降低了总线服务频繁切换造成的颠簸现象。实验结果表明,该算法的MDP比常见的算法平均减少了43.8%,满足了各主设备总线服务请求的强实时要求。
In this paper, we present a preemption threshold least-slaek-first（PT-LSF） based arbitration algorithm. The smaller the remaining slack time of a master request was, the sooner it should to be serviced. Preemption threshold was adopt to relieve the thrashing caused by high frequently switching of bus service. Experimental results show that PT-LSF outperforms existing arbi- tration algorithms on real-time requirement and the average MDP of PT-LSF decreases by 43.8%.
出处
《电子技术应用》
北大核心
2010年第11期35-38,共4页
Application of Electronic Technique
关键词
片上总线
仲裁算法
最小空闲时间优先
抢占阈值
截止期错失率
on-chip bus
arbitration algorithm
least-slack-first（LSF）
preemption threshold
missed deadline percentage
