arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.05421cs.LGcs.AI
收藏

NullaNet Tiny:通过固定函数组合逻辑进行超低延迟DNN推理

NullaNet Tiny: Ultra-low-latency DNN Inference Through Fixed-function Combinational Logic

University of Southern California(南加州大学)

Mahdi Nazemi, Arash Fayyazi, Amirhossein Esmaili, Atharva Khare, Soheil Nazar Shahsavani, Massoud Pedram

摘要:

虽然对深度神经网络(DNN)的有效处理有大量的研究,但是对于具有严格的亚微秒延迟要求的应用,这些模型的超低延迟实现仍然是一个未解决的挑战性问题。基于现场可编程门阵列(FPGA)的DNN加速器正在成为取代基于图形处理单元/中央处理单元的平台的有力竞争者,考虑到其性能、灵活性和能效。本文介绍了NullaNet Tiny,这是一个跨栈设计和优化框架,用于构建资源和能源高效,超低延迟的基于FPGA的神经网络加速器。其关键思想是用映射到FPGA器件的本地查找表(LUT)的布尔逻辑表达式(这种操作的示例是乘法累加和批量归一化)来替换计算DNN中的各种滤波器/神经元函数所需的昂贵操作。与Xilinx的LogicNets相比,在大致相同的分类精度水平下,我们的设计实现了2.36 $\times$的低延迟和24.42 $\times$的低LUT利用率。

英文摘要:

While there is a large body of research on efficient processing of deep neural networks (DNNs), ultra-low-latency realization of these models for applications with stringent, sub-microsecond latency requirements continues to be an unresolved, challenging problem. Field-programmable gate array (FPGA)-based DNN accelerators are gaining traction as a serious contender to replace graphics processing unit/central processing unit-based platforms considering their performance, flexibility, and energy efficiency. This paper presents NullaNet Tiny, an across-the-stack design and optimization framework for constructing resource and energy-efficient, ultra-low-latency FPGA-based neural network accelerators. The key idea is to replace expensive operations required to compute various filter/neuron functions in a DNN with Boolean logic expressions that are mapped to the native look-up tables (LUTs) of the FPGA device (examples of such operations are multiply-and-accumulate and batch normalization). At about the same level of classification accuracy, compared to Xilinx's LogicNets, our design achieves 2.36$\times$ lower latency and 24.42$\times$ lower LUT utilization.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑