With the swift progress of deep neural networks and large-scale models, the demands for the computational performance of hardware are escalating at an accelerated pace. As a result, the Computing In Memory chip has emerged as an innovative architectural solution. Nevertheless, the efficient coordination of the Computing In Memory chip arrays has emerged as a critical factor that restricts the further enhancement of its performance. In this paper, we zero in on the approach of generating the optimal order based on the artificial bee colony algorithm and the Top-Left scheduling logic algorithm. To address the issue of the slower speed of the artificial bee colony algorithm, we have ingeniously designed a rapid and highly accurate pointer network. Through meticulous experimental verification, the proposed pointer network not only significantly boosts the computation speed but also maintains an elevated level of accuracy.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Efficient Automatic Arrangement Algorithm for Computing in Memory Chips Array

  • Tong Zhang,
  • Weiping Pan,
  • Hao Li

摘要

With the swift progress of deep neural networks and large-scale models, the demands for the computational performance of hardware are escalating at an accelerated pace. As a result, the Computing In Memory chip has emerged as an innovative architectural solution. Nevertheless, the efficient coordination of the Computing In Memory chip arrays has emerged as a critical factor that restricts the further enhancement of its performance. In this paper, we zero in on the approach of generating the optimal order based on the artificial bee colony algorithm and the Top-Left scheduling logic algorithm. To address the issue of the slower speed of the artificial bee colony algorithm, we have ingeniously designed a rapid and highly accurate pointer network. Through meticulous experimental verification, the proposed pointer network not only significantly boosts the computation speed but also maintains an elevated level of accuracy.