Abstract
Automatic generation of custom instructions is the key to the extensible processors. The generation of custom instructions includes two crucial steps: 1) custom instruction enumeration and 2) custom instruction selection. This letter focuses on the custom instruction enumeration step. Enumerating all custom instruction candidates satisfying architectural constraints from an application graph is a computationally difficult problem. Considering the high complexity of the custom instruction enumeration, we propose a simple but efficient parallel search method based on multidepth graph partitioning for enumerating custom instructions. Experimental results show that the proposed method can give near-linear speedup and outperforms the latest parallel methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
