⚡ 本页包含 AI 生成的分析内容,仅供参考
该论文提出了一种用于软件定义网络交换机的物理不可克隆函数(PUF)保护的三态内容寻址存储器(TCAM),每比特能耗仅0.795fJ。通过优先级排序单元(PRU)跳过规则移动来减少频繁的数据搬移,并利用离线检测弱依赖规则存储在不同区域以限制优先级比较范围,从而降低功耗。
Shaojun Wei1, Yang Hu1, Shouyi Yin1 3 The priority requirement induces frequent data movement. A priority rank unit (PRU) is implemented to skip rule shifting during updates. Weak-dependent rules are detected offline and stored in different regions, which include exclusive bits and are unlikely to match the same search key in the meantime. Therefore, priority comparison is restricted to a reduced region. Within each region, the incoming priority is pushed to the available entry of the priority rank unit. The rank buffer is updated according to the comparison results between the stored and the new priority. When multiple rules match, the rank buffer generates a one-hot result based on the rank order. By decoupling priority constraints, we avoid stored rule movement at the cost of a PRU, which is 4.1% of the TCAM area. Tsinghua University, Beijing, China Hong Kong University of Science and Technology, Hong Kong, China
Zhiheng Yue1, Xujiang Xiang1, Fengbin Tu2, Yang Wang1, Yiming Wang1,