ASFRM: An Array State Self-feedback-Based Self-reconfiguration Mechanism in a Reconfigurable Array Processor.

Saved in:
Bibliographic Details
Title: ASFRM: An Array State Self-feedback-Based Self-reconfiguration Mechanism in a Reconfigurable Array Processor.
Authors: Yang, Kun1 (AUTHOR), Jiang, Lin2 (AUTHOR) jianglin@xust.edu.cn, Deng, Junyong3 (AUTHOR), Shan, Rui3 (AUTHOR), Li, Kangle1 (AUTHOR), Zhang, Xiaofan4 (AUTHOR)
Source: Journal of Circuits, Systems & Computers. 9/30/2025, Vol. 34 Issue 14, p1-29. 29p.
Subjects: Array processors, Legal judgments, Scheduling, Encoding, Hardware
Abstract: With complex tasks in neural network computing, existing reconfiguration methods have a long reconfiguration time and it is not easy to achieve fast task switching. Therefore, this paper presents an array state self-feedback based self-reconfiguration mechanism (ASFRM) to quickly achieve autonomous task switching and dynamic scheduling based on task execution status. This mechanism is based on the array state information autonomously fed back by the reconfigurable array, and the host controller makes autonomous judgments and decisions on the current execution status of the array, achieving dynamic task rearrangement, dynamic scheduling of the array and fast task switching. The proposed ASFRM can switch configurations between different tasks within 6 clock cycles. To verify the correctness and efficiency of ASFRM, we modeled the hardware with synthesizable RTL encoding and implemented it on FPGA and chip. The experimental results show that compared with traditional reconfiguration methods and SIMD-like methods, ASFRM can effectively reduce reconfiguration overhead. The volume of bits in the configuration file has decreased by an average of 11.79% and 4.51%. The reconfiguration time has decreased by an average of 52.79% and 37.12%. Based on the UMC 55 nm process, the operating frequency can reach 400 MHz. Meanwhile, the chip area is 64 mm2 and the throughput is 115.2 GOPS. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Circuits, Systems & Computers is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:With complex tasks in neural network computing, existing reconfiguration methods have a long reconfiguration time and it is not easy to achieve fast task switching. Therefore, this paper presents an array state self-feedback based self-reconfiguration mechanism (ASFRM) to quickly achieve autonomous task switching and dynamic scheduling based on task execution status. This mechanism is based on the array state information autonomously fed back by the reconfigurable array, and the host controller makes autonomous judgments and decisions on the current execution status of the array, achieving dynamic task rearrangement, dynamic scheduling of the array and fast task switching. The proposed ASFRM can switch configurations between different tasks within 6 clock cycles. To verify the correctness and efficiency of ASFRM, we modeled the hardware with synthesizable RTL encoding and implemented it on FPGA and chip. The experimental results show that compared with traditional reconfiguration methods and SIMD-like methods, ASFRM can effectively reduce reconfiguration overhead. The volume of bits in the configuration file has decreased by an average of 11.79% and 4.51%. The reconfiguration time has decreased by an average of 52.79% and 37.12%. Based on the UMC 55 nm process, the operating frequency can reach 400 MHz. Meanwhile, the chip area is 64 mm2 and the throughput is 115.2 GOPS. [ABSTRACT FROM AUTHOR]
ISSN:02181266
DOI:10.1142/S0218126625503050