基于最小空闲时间优先的片上总线仲裁算法  

A least-slack-first based arbitration algorithm for on-chip bus

作　　者：任沛阁[1,2] 王勇[1] 刘安[1] 莫远楠[3] 

机构地区：[1]空军工程大学工程学院,陕西西安710038 [2]空军通信训练基地,河北保定071051 [3]西安电子科技大学,陕西西安710071

出　　处：《电子技术应用》2010年第11期35-38,共4页Application of Electronic Technique

摘　　要：提出一种基于抢占阈值的最小空闲时间优先服务的总线仲裁算法。主设备总线服务请求的空闲时间越短,获得总线服务就越快,引入抢占阈值降低了总线服务频繁切换造成的颠簸现象。实验结果表明,该算法的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%.

关 键 词：片上总线 仲裁算法 最小空闲时间优先 抢占阈值 截止期错失率 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]