DocumentCode
3227561
Title
Peeling algorithm for custom instruction identification
Author
Zhao, Kang ; Bian, Jinian
Author_Institution
Dept. Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
fYear
2010
fDate
6-9 Dec. 2010
Firstpage
720
Lastpage
723
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.
Keywords
application specific integrated circuits; identification; instruction sets; application specific instruction set processor; custom instruction identification; deterministic algorithm; exhaustive pruning; peeling algorithm; Benchmark testing; Clocks; Design automation; Genetics; Linux; Partitioning algorithms; US Department of Transportation;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems (APCCAS), 2010 IEEE Asia Pacific Conference on
Conference_Location
Kuala Lumpur
Print_ISBN
978-1-4244-7454-7
Type
conf
DOI
10.1109/APCCAS.2010.5774821
Filename
5774821
Link To Document