Peeling algorithm for custom instruction identification
2010pp. 720–723
Citations Over Time
Abstract
To speedup the custom instruction identification for the application specific instruction-set processor (ASIP), this paper proposes a peeling algorithm. It starts with the maximal valid pattern, and then gets a set of valid sub-patterns through deleting the source and sink respectively. Furthermore, a local priority is proposed for the exhaustive pruning. The final experiment indicates a distinct speedup compared to the fastest deterministic algorithm.
Related Papers
- → Multiply-accumulate instruction set extension in a soft-core RISC Processor(2012)8 cited
- → Customized instruction set simulation for soft-core RISC processor(2012)4 cited
- → A framework for automatic custom instruction identification on multi-issue ASIPs(2014)3 cited
- → Generation of application-domain Specific Instruction-set Processors(2010)8 cited
- VSIP:Implementation ofVideoSpecific Instruction-set Processor(2006)