首页 | 本学科首页   官方微博 | 高级检索  
     

基于最小空闲时间优先的片上总线仲裁算法
引用本文:任沛阁,王勇,刘安,莫远楠.基于最小空闲时间优先的片上总线仲裁算法[J].电子技术应用,2010(11).
作者姓名:任沛阁  王勇  刘安  莫远楠
作者单位:空军工程大学工程学院;空军通信训练基地;西安电子科技大学;
摘    要:提出一种基于抢占阈值的最小空闲时间优先服务的总线仲裁算法。主设备总线服务请求的空闲时间越短,获得总线服务就越快,引入抢占阈值降低了总线服务频繁切换造成的颠簸现象。实验结果表明,该算法的MDP比常见的算法平均减少了43.8%,满足了各主设备总线服务请求的强实时要求。

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

A least-slack-first based arbitration algorithm for on-chip bus
REN Pei Ge,WANG Yong,LIU An,MO Yuan Nan.A least-slack-first based arbitration algorithm for on-chip bus[J].Application of Electronic Technique,2010(11).
Authors:REN Pei Ge  WANG Yong  LIU An  MO Yuan Nan
Affiliation:REN Pei Ge~(1,2),WANG Yong~1,LIU An~1,MO Yuan Nan~3 (1.The Engineering College of Air Force Engineering University,Xi'an 710038,China,2.Air Force Communication Training Base,Baoding 071051,3.Xidian University,Xi'an 710071,China)
Abstract:In this paper,we present a preemption threshold least-slack-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 arbitration algorithms on real-time requirement and the average MDP of PT-LSF decreases by 43.8%.
Keywords:on-chip bus  arbitration algorithm  least-slack-first(LSF)  preemption threshold  missed deadline percentage  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号