一种基于权重与轮询的双层仲裁算法  

A Two-level Arbitration Algorithm Based on Weight and Round-robin

作　　者：吴睿振 杨银堂[1] 张丽[1] 陆锋雷 

机构地区：[1]西安电子科技大学微电子学院,西安710071

出　　处：《电子与信息学报》2013年第12期3024-3029,共6页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(JJ0500112501);国家863计划项目(2009AA 01Z258)资助课题

摘　　要：该文提出一种基于权重与轮询(Round-Robin,RR)的双层仲裁算法,在无冲突和多冲突情况下分别采用改进的固定优先级(Fixed Priority,FP)和RR仲裁轮流工作,并通过彩票项设置权重。在非空非抢占(NonIdling and NonPreemptive,NINP)模型下相比传统FP,RR和Lottery仲裁算法有更好的输出带宽比、带宽占用率和功耗,在速度和面积上有一定优势。该算法适应多种请求环境,逻辑简单,容易实现,可应用于总线结构的片上系统(System-on-Chip,SoC)。A two-level arbitration algorithm based on weight and Round-Robin （RR） is presented. It sets weight by tickets and employs improved Fixed Priority （FP） and RR arbitration to work in turn respectively under the conditions that there is no contention and there exit heavy contentions. In the NonIdling and NonPreemptive （NINP） model, the proposed arbitration algorithm is much better in the output bandwidth ratio, bandwidth utilization, power, fanout and it also has advantages in speed and area compared with the commonly-used FP, RR and Lottery arbitration algorithms. The proposed arbitration algorithm is suitable in various request environments, simple in logic and easy to implement, so it can be applied to SoC bus systems.

关 键 词：片上系统(SoC) 仲裁算法 固定优先级(FP) 轮询(RR) LOTTERY 

分 类 号：TN402[电子电信—微电子学与固体电子学]