Control Scheme for a CGRA

  • Muhammad Ali Shami KTH Royal Institute of Technology
  • Ahmed Hemani KTH Royal Institute of Technology

Abstract


Ability to instantiate low cost and agile FSMs that can implement an arbitrary parallelism and combine such FSMs in a chain and in a hierarchy is one of the key differentiating factors between the ASICs and MPSOCs. CGRAs that have been reported in literature, like MPSOCs, also lack this ASIC like ability. The downside of ASICs is their lack of reuse and high engineering cost. We present a CGRA architecture that retains the programmability of CGRA and yet has the ASIC like ability to construct a) arbitrarily parallel data-path/FSM combine, b) chain an arbitrary number of such FSMs and c) create a hierarchy of such chains. We present in detail the architecture of such a control scheme and illustrate its use for an example composed of FFT and FIRs. We quantify the benefits of our approach by benchmarking for energy-delay product against a) ASICs (4.8X worse), b) a state-of-the-art CGRA (4.58X better) and FPGAs (63.95X better).
Keywords: Application specific integrated circuits, Switches, Registers, Program processors, Field programmable gate arrays, Parallel processing, Delay, CGRA, Dynamically Reprogrammable Resource Arrays, Reconfigurable Architecture
Published
2010-10-27
SHAMI, Muhammad Ali; HEMANI, Ahmed. Control Scheme for a CGRA. In: INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING (SBAC-PAD), 22. , 2010, Petrópolis/RJ. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2010 . p. 17-24.