检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:GAO Lei GONG ZhengHu LIU YaPing LAI MingChe PENG Wei
机构地区:[1]Department of Computer, National University of Defense Technology, Changsha 410073, China
出 处:《Science in China(Series F)》2008年第11期1772-1784,共13页中国科学(F辑英文版)
基 金:the National Basic Research Program of China (973 Program) (Grant No. 2003CB314802)
摘 要:With the explosive growth of Internet, the low efficiency of BGP has seriously influenced its usability. In this work, a TLP (thread level parallelism) approach with local speculation is proposed to improve the BGP performance. The thread partition is locally performed on each separated sub-module at route processing, and the speculation strategy is implemented to guarantee the memory consistency and sequential commit. Experiments on Intel Quad-core server show that this approach reaches an average speedup of 1.46 under single peer, multi-peers and route flapping. It is also shown that the packet throughput can be improved greatly under multiple sessions by taking advantage of TLP.With the explosive growth of Internet, the low efficiency of BGP has seriously influenced its usability. In this work, a TLP (thread level parallelism) approach with local speculation is proposed to improve the BGP performance. The thread partition is locally performed on each separated sub-module at route processing, and the speculation strategy is implemented to guarantee the memory consistency and sequential commit. Experiments on Intel Quad-core server show that this approach reaches an average speedup of 1.46 under single peer, multi-peers and route flapping. It is also shown that the packet throughput can be improved greatly under multiple sessions by taking advantage of TLP.
关 键 词:BGP MULTI-CORE local speculation PARALLELISM
分 类 号:TP39[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.41.22