Automated Design Space Exploration of CGRA Processing Element Architectures using Frequent Subgraph Analysis
Jackson Melchert, Kathleen Feng, Caleb Donovick, Ross Daly, Clark, Barrett, Mark Horowitz, Pat Hanrahan, Priyanka Raina

TL;DR
This paper introduces an automated method for designing specialized CGRA processing elements by mining frequent subgraphs from application sets, resulting in architectures that significantly improve energy efficiency and reduce area.
Contribution
It presents a novel approach using frequent subgraph analysis to automatically generate application-specific CGRA processing elements.
Findings
Specialized PEs are up to 10.5x more energy efficient.
Generated PEs consume 9.1x less area.
Method improves design efficiency for image processing and machine learning domains.
Abstract
The architecture of a coarse-grained reconfigurable array (CGRA) processing element (PE) has a significant effect on the performance and energy efficiency of an application running on the CGRA. This paper presents an automated approach for generating specialized PE architectures for an application or an application domain. Frequent subgraphs mined from a set of applications are merged to form a PE architecture specialized to that application domain. For the image processing and machine learning domains, we generate specialized PEs that are up to 10.5x more energy efficient and consume 9.1x less area than a baseline PE.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEmbedded Systems Design Techniques · VLSI and FPGA Design Techniques · VLSI and Analog Circuit Testing
