J Shanghai Jiaotong Univ Sci ›› 2021, Vol. 26 ›› Issue (4): 511-521.doi: 10.1007/s12204-021-2319-z

• Computer & Communication Engineering • Previous Articles     Next Articles

Dynamical Self-Reconfigurable Mechanism for Data-Driven Cell Array

Dynamical Self-Reconfigurable Mechanism for Data-Driven Cell Array

SHAN Rui1* (山蕊), JIANG Lin2 (蒋林), WU Haoyue1 (吴昊玥), HE Feilong3 (贺飞龙), LIU Xinchuang1 (刘新闯)   

  1. (1. School of Electronic Engineering, Xi’an University of Posts and Telecommunications, Xi’an 710121, China;
    2. Laboratory of Integrated Circuit Design, Xi’an University of Science and Technology, Xi’an 710054, China;
    3. School of Computing, Xi’an University of Posts and Telecommunications, Xi’an 710121, China)
  2. (1. School of Electronic Engineering, Xi’an University of Posts and Telecommunications, Xi’an 710121, China;
    2. Laboratory of Integrated Circuit Design, Xi’an University of Science and Technology, Xi’an 710054, China;
    3. School of Computing, Xi’an University of Posts and Telecommunications, Xi’an 710121, China)
  • Online:2021-08-28 Published:2021-06-06
  • Contact: SHAN Rui* (山蕊) E-mail:shanrui0112@163.com

Abstract: The utilization of computation resources and reconfiguration time has a large impact on reconfiguration system performance. In order to promote the performance, a dynamical self-reconfigurable mechanism for datadriven cell array is proposed. Cells can be fired only when the needed data arrives, and cell array can be worked on two modes: fixed execution and reconfiguration. On reconfiguration mode, cell function and data flow direction are changed automatically at run time according to contexts. Simultaneously using an H-tree interconnection network, through pre-storing multiple application mapping contexts in reconfiguration buffer, multiple applications can execute concurrently and context switching time is the minimal. For verifying system performance, some algorithms are selected for mapping onto the proposed structure, and the amount of configuration contexts and execution time are recorded for statistical analysis. The results show that the proposed self-reconfigurable mechanism can reduce the number of contexts efficiently, and has a low computing time.

Key words: cell array | configurable computing | self-reconfigurable mechanism | data-driven | data flow graph

摘要: The utilization of computation resources and reconfiguration time has a large impact on reconfiguration system performance. In order to promote the performance, a dynamical self-reconfigurable mechanism for datadriven cell array is proposed. Cells can be fired only when the needed data arrives, and cell array can be worked on two modes: fixed execution and reconfiguration. On reconfiguration mode, cell function and data flow direction are changed automatically at run time according to contexts. Simultaneously using an H-tree interconnection network, through pre-storing multiple application mapping contexts in reconfiguration buffer, multiple applications can execute concurrently and context switching time is the minimal. For verifying system performance, some algorithms are selected for mapping onto the proposed structure, and the amount of configuration contexts and execution time are recorded for statistical analysis. The results show that the proposed self-reconfigurable mechanism can reduce the number of contexts efficiently, and has a low computing time.

关键词: cell array | configurable computing | self-reconfigurable mechanism | data-driven | data flow graph

CLC Number: