DocumentCode
3004470
Title
An optimal ILP algorithm for approaching identifying instruction set extension
Author
Chang, Jeong-Uk ; Lin, Chi-Ho
Author_Institution
Dept. of Comput. Inf., Semyung Univ., Jecheon, South Korea
fYear
2011
fDate
21-24 Nov. 2011
Firstpage
34
Lastpage
38
Abstract
In this paper, we proposed an optimal ILP approach to the instruction-set extension identification problem. An algorithm that iteratively generates and solves a set of ILP problems in order to generate a set of templates is proposed. A selection algorithm that ranks the generated templates based on isomorphism testing and potential evaluation is described. A Trimaran based framework is used to evaluate the quality of the instructions generated by the technique.
Keywords
instruction sets; integer programming; linear programming; Trimaran based framework; instruction-set extension identification problem; integer liner programming; isomorphism testing; optimal ILP algorithm; potential evaluation; selection algorithm; template set generation; Benchmark testing; Encryption; Hardware; Measurement; Program processors; Registers; Datapath; ILP; Instruction Set; Integer Liner Programming; Mixcolumn;
fLanguage
English
Publisher
ieee
Conference_Titel
TENCON 2011 - 2011 IEEE Region 10 Conference
Conference_Location
Bali
ISSN
2159-3442
Print_ISBN
978-1-4577-0256-3
Type
conf
DOI
10.1109/TENCON.2011.6129058
Filename
6129058
Link To Document