LEAP: Latency- energy- and area-optimized lookup pipeline

E. N. Harris, Samuel Wasmundt, Lorenzo De Carli, K. Sankaralingam, Cristian Estan
{"title":"LEAP: Latency- energy- and area-optimized lookup pipeline","authors":"E. N. Harris, Samuel Wasmundt, Lorenzo De Carli, K. Sankaralingam, Cristian Estan","doi":"10.1145/2396556.2396595","DOIUrl":null,"url":null,"abstract":"Table lookups and other types of packet processing require so much memory bandwidth that the networking industry has long been a major consumer of specialized memories like TCAMs. Extensive research in algorithms for longest prefix matching and packet classification has laid the foundation for lookup engines relying on area- and power-efficient random access memories. Motivated by costs and semiconductor technology trends, designs from industry and academia implement multi-algorithm lookup pipelines by synthesizing multiple functions into hardware, or by adding programmability. In existing proposals, programmability comes with significant overhead. We build on recent innovations in computer architecture that demonstrate the efficiency and flexibility of dynamically synthesized accelerators. In this paper we propose LEAP, a latency-energy- and area- optimized lookup pipeline based on an analysis of various lookup algorithms. We compare to PLUG, which relies on von-Neumann-style programmable processing. We show that LEAP has equivalent flexibility by porting all lookup algorithms previously shown to work with PLUG. At the same time, LEAP reduces chip area by 1.5×, power consumption by 1.3×, and latency typically by 5×. Furthermore, programming LEAP is straight-forward; we demonstrate an intuitive Python-based API.","PeriodicalId":267774,"journal":{"name":"2012 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"216 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2396556.2396595","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Table lookups and other types of packet processing require so much memory bandwidth that the networking industry has long been a major consumer of specialized memories like TCAMs. Extensive research in algorithms for longest prefix matching and packet classification has laid the foundation for lookup engines relying on area- and power-efficient random access memories. Motivated by costs and semiconductor technology trends, designs from industry and academia implement multi-algorithm lookup pipelines by synthesizing multiple functions into hardware, or by adding programmability. In existing proposals, programmability comes with significant overhead. We build on recent innovations in computer architecture that demonstrate the efficiency and flexibility of dynamically synthesized accelerators. In this paper we propose LEAP, a latency-energy- and area- optimized lookup pipeline based on an analysis of various lookup algorithms. We compare to PLUG, which relies on von-Neumann-style programmable processing. We show that LEAP has equivalent flexibility by porting all lookup algorithms previously shown to work with PLUG. At the same time, LEAP reduces chip area by 1.5×, power consumption by 1.3×, and latency typically by 5×. Furthermore, programming LEAP is straight-forward; we demonstrate an intuitive Python-based API.
LEAP:延迟-能量和面积优化的查找管道
表查找和其他类型的数据包处理需要如此多的内存带宽,以至于网络行业长期以来一直是专用内存(如tcam)的主要消费者。对最长前缀匹配和分组分类算法的广泛研究为基于区域和功率效率的随机存取存储器的查找引擎奠定了基础。受成本和半导体技术趋势的影响,工业界和学术界的设计通过将多个功能集成到硬件中或通过增加可编程性来实现多算法查找管道。在现有的提案中,可编程性带来了巨大的开销。我们以计算机体系结构的最新创新为基础,展示了动态合成加速器的效率和灵活性。本文在分析各种查找算法的基础上,提出了一种基于延迟、能量和面积优化的查找管道LEAP。我们比较了PLUG,它依赖于冯-诺伊曼式可编程处理。我们通过将之前展示的所有查找算法移植到PLUG中来展示LEAP具有同等的灵活性。同时,LEAP将芯片面积减少1.5倍,功耗减少1.3倍,延迟通常减少5倍。此外,编程LEAP是直截了当的;我们将演示一个直观的基于python的API。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书