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

多路有序优先级和有序环形仲裁器设计
引用本文:杨冬勤,黄航,张小燕,于忠臣.多路有序优先级和有序环形仲裁器设计[J].计算机工程,2011,37(24):236-238.
作者姓名:杨冬勤  黄航  张小燕  于忠臣
作者单位:1. 北京工业大学北京市嵌入式系统重点实验室,北京,100124
2. 北京航空航天大学化学与环境学院,北京,100191
摘    要:为解决传统仲裁器不能记忆请求顺序的问题,设计多路有序优先级仲裁器和有序环形仲裁器。通过先入先出(FIFO)电路来保存请求的先后顺序,将FIFO电路分别与优先级仲裁器和环形仲裁器组合,从而构成有序仲裁器。实验结果表明,该设计能简化复杂度,提高仲裁器处理请求能力,但延时和面积性能略有下降。

关 键 词:有序仲裁器  优先级仲裁器  环形仲裁器  先入先出电路  令牌
收稿时间:2011-06-28

Design of N-way Ordered Priority and Ordered Ring Arbiter
YANG Dong-qin,HUANG Hang,ZHANG Xiao-yan,YU Zhong-chen.Design of N-way Ordered Priority and Ordered Ring Arbiter[J].Computer Engineering,2011,37(24):236-238.
Authors:YANG Dong-qin  HUANG Hang  ZHANG Xiao-yan  YU Zhong-chen
Affiliation:1(1.Embedded System Key Lab of Beijing,Beijing University of Technology,Beijing 100124,China;2.School of Chemistry and Environment,Beihang University,Beijing 100191,China)
Abstract:To improve shortcoming of traditional arbiters, this paper proposes N-way ordered arbiter, which is based on combination of First in First Out(FIFO) and priority arbiter and ring arbiter respectively. FIFO is used for savingthe request orders. It proposes a new structure of priority and a new ring arbiter. Results show that, modular design simplifies the complexity, improves the ability of arbiter to process the request, and the ability of saving the request in order reduces latency and area properties.
Keywords:ordered arbiter  priority arbiter  ring arbiter  First In First Out(FIFO) circuit  token
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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