决策树被认为是数据分类的最有力的工具之一。加速决策树搜索对于功耗和延迟预算有限的边缘应用至关重要。在本文中,我们提出了一个内容寻址存储器(CAM)的决策树(DT)推理加速。我们提出了一种新的“自适应精度”计划,结果在一个紧凑的实现,并使一个有效的双射映射到三元内容可寻址存储器,同时保持高的推理精度。此外,电阻CAM(ReCAM)功能合成器的开发映射的决策树的ReCAM和执行功能模拟的能量,延迟和准确性的评估。我们研究了硬件非理想条件下的决策树准确性,包括设备缺陷,制造变异性和输入编码噪声。我们在各种DT数据集上测试我们的框架,包括\textit{Give Me Some Credit},\textit{Titanic}和\textit{COVID-19}。我们的研究结果显示,与最先进的硬件加速器相比,节能高达{42.4\%},能量延迟面积产品高达17.8倍,流水线实现每秒高达3.33亿次决策。
英文摘要:
Decision trees are considered one of the most powerful tools for data classification. Accelerating the decision tree search is crucial for on-the-edge applications that have limited power and latency budget. In this paper, we propose a Content Addressable Memory (CAM) Compiler for Decision Tree (DT) inference acceleration. We propose a novel "adaptive-precision" scheme that results in a compact implementation and enables an efficient bijective mapping to Ternary Content Addressable Memories while maintaining high inference accuracies. In addition, a Resistive-CAM (ReCAM) functional synthesizer is developed for mapping the decision tree to the ReCAM and performing functional simulations for energy, latency, and accuracy evaluations. We study the decision tree accuracy under hardware non-idealities including device defects, manufacturing variability, and input encoding noise. We test our framework on various DT datasets including \textit{Give Me Some Credit}, \textit{Titanic}, and \textit{COVID-19}. Our results reveal up to {42.4\%} energy savings and up to 17.8x better energy-delay-area product compared to the state-of-art hardware accelerators, and up to 333 million decisions per sec for the pipelined implementation.
RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory
Department of Computer Science and Information Engineering, National Taiwan University(国立台湾大学计算机科学与资讯工程学系);IRIT, Université de Toulouse, Toulouse INP–UT3, CNRS(图卢兹大学IRIT实验室);Lab-STICC, CNRS UMR 6285 , ENSTA, Institut Polytechnique de Paris(ENSTA巴黎理工学院Lab-STICC实验室)
The University of Hong Kong(香港大学);Hewlett Packard Labs, Hewlett Packard Enterprise(慧与(HPE)惠普实验室);University of Notre Dame(圣母大学);Forschungszentrum Jülich GmbH(于利希研究中心);RWTH Aachen University(亚琛工业大学)
CAMA: Energy and Memory Efficient Automata Processing in Content-Addressable Memories
加速有限自动机处理对于推进模式匹配、数据采掘、生物信息学、入侵检测和机器学习中的实时分析至关重要。最近利用SRAM和DRAM的内存中自动机加速器已经显示出比传统数字设计令人兴奋的改进。然而,所有SOTA设计所使用的状态转换的位向量表示仅在处理最坏情况的完全随机模式时是最佳的,而在运行大多数真实世界的基准测试时会浪费大量的内存和能量。我们提出了CAMA,内容可寻址存储器(CAM)启用自动机加速器处理同质非确定性有限自动机(NFA)。一个完全不同的状态表示方案,以及共同设计的新电路和数据编码方案,大大降低了能源,内存和芯片面积最现实的NFA。本文对CAMA进行了全面优化,主要贡献如下:(1)采用16 × 256的8管(8 T)CAM阵列进行状态匹配,取代SOTA设计中的256 × 256的6 T SRAM阵列或两个16 × 256的6 T SRAM组;(2)提出了一种新的编码方案,能够在8 T SRAM中进行内容搜索,并适应不同的应用;(3)可重新配置和可扩展的架构,在所有测试基准上提高效率,而不会失去对与SOTA设计兼容的任何NFA的支持;(4)优化框架,自动选择编码方案并将给定的NFA映射到所提出的硬件。两个版本的CAMA,一个优化的能量(CAMA-E)和其他的吞吐量(CAMA-T),在28纳米CMOS工艺,并在21个真实世界和合成基准进行了全面评估。CAMA-E的能量比CA、2-…
Trustworthy Tree-based Machine Learning by $MoS_2$ Flash-based Analog CAM with Inherent Soft Boundaries
Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong SAR, China(香港大学电子与电气工程系);College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China(浙江大学信息科学与电子工程学院);Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA(Notre Dame 大学计算机科学与工程系);Center for Advanced Semiconductor and Integrated Circuit, The University of Hong Kong, Hong Kong SAR, China(香港大学先进半导体与集成电路中心)