检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黄以华[1] 凌国俊[1] 廖世文[1] 刘燕林[1] 张健翀[1]
机构地区:[1]中山大学电子与通信工程系,广东广州510275
出 处:《电子学报》2010年第11期2476-2481,共6页Acta Electronica Sinica
基 金:国家自然科学基金(No.60871059)
摘 要:随着半导体工艺技术的发展,芯片内部集成的功能模块越来越多.各功能模块通过总线方式连接,因而片上总线仲裁架构成为制约芯片性能提高的瓶颈.通过改善片上总线仲裁器设计,能有效缓解由于各功能模块争用总线资源而引起的芯片性能下降.本文提出一种基于博弈论的片上总线仲裁机制,利用求解多人博弈问题的方法解决总线争用问题,并以片上系统的性能指标为约束条件,得到解决总线争用问题的一般模型.最后,通过仿真及实际硬件平台对算法进行测试,结果表明应用本算法的指令处理速度比应用固定优先级算法快236%,比应用轮换算法快53%.With the development of semiconductor technology,more and more functional modules are integrated on a chip.The on-chip-bus Arbitration architecture has become bottlenecks in the improvement of chip performance,as modules are connected through the bus.The degradation of chip performance due to the contention for bus resources can be relieved by optimizing the design of the on-chip-bus arbiter,so this paper presents a game theory-based on-chip-bus arbitration mechanism which solves the bus contention problem by using game theory.Moreover,we build a general model to solve the problem with restriction of the performance of system on chip.Finally,we test the algorithm through simulation and hardware platform designed by us.Results show that the command processing speed using game theory arbitration is 236% faster than the one using FP(Fixed-Priority) algorithm and 53% faster than the one using RR(Round Robin) algorithm.
分 类 号:TP39[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15