Matching the speed gap between SRAM and DRAM

Feng Wang, M. Hamdi
{"title":"Matching the speed gap between SRAM and DRAM","authors":"Feng Wang, M. Hamdi","doi":"10.1109/HSPR.2008.4734429","DOIUrl":null,"url":null,"abstract":"With the constantly increasing Internet traffic, buffers are becoming major bottlenecks for todaypsilas high-end routers. In particular, router buffers are required to have both high speed and large capacities, which are hard to build with current single memory technology, such as SRAM or DRAM. A general approach is to make a combination of the SRAM and DRAM and exploit advantages from both. The main obstacle is to find a way matching the speed gap between them. And the requirement to maintain multiple flows in the system further complicates the problem. In this paper, we first investigate previous solutions that use different access granularities to match the speed gap. We point out their intrinsic scaling problems when the number of flows increases. Then, we propose to use parallelism to match the speed gap. Numerical studies and simulations both show that our proposal can theoretically support any number of flows in the router with just little SRAM under practical traffic. In addition, the memory management algorithm is also more scalable compared to those in previous solutions.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on High Performance Switching and Routing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HSPR.2008.4734429","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

With the constantly increasing Internet traffic, buffers are becoming major bottlenecks for todaypsilas high-end routers. In particular, router buffers are required to have both high speed and large capacities, which are hard to build with current single memory technology, such as SRAM or DRAM. A general approach is to make a combination of the SRAM and DRAM and exploit advantages from both. The main obstacle is to find a way matching the speed gap between them. And the requirement to maintain multiple flows in the system further complicates the problem. In this paper, we first investigate previous solutions that use different access granularities to match the speed gap. We point out their intrinsic scaling problems when the number of flows increases. Then, we propose to use parallelism to match the speed gap. Numerical studies and simulations both show that our proposal can theoretically support any number of flows in the router with just little SRAM under practical traffic. In addition, the memory management algorithm is also more scalable compared to those in previous solutions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
匹配SRAM和DRAM之间的速度差距
随着互联网流量的不断增加,缓冲区已成为当今高端路由器的主要瓶颈。特别是,路由器缓冲区需要同时具有高速和大容量,这是目前单一内存技术(如SRAM或DRAM)难以构建的。一般的方法是将SRAM和DRAM结合起来,并利用两者的优点。主要的障碍是找到一种方法来匹配它们之间的速度差距。在系统中维护多个流的需求进一步使问题复杂化。在本文中,我们首先研究了以前使用不同访问粒度来匹配速度差距的解决方案。指出了它们在流量增加时固有的标度问题。然后,我们建议使用并行性来匹配速度差距。数值研究和仿真都表明,在实际流量下,我们的方案理论上可以支持路由器中任意数量的流量,而SRAM很小。此外,与以前的解决方案相比,该内存管理算法也具有更高的可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic workload profiling and task allocation in packet processing systems A distributed and scalable MPLS architecture for next generation routers Distributed PC based routers: Bottleneck analysis and architecture proposal Efficient broadcasting in interface switching wireless networks Quick-Start and XCP on a network processor: Implementation issues and performance evaluation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1