By Topic

An optimal ILP algorithm for approaching identifying instruction set extension

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jeong-Uk Chang ; Dept. of Computer Information, Semyung University, Jecheon-city Chung-buk, Korea ; Chi-Ho Lin

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.

Published in:

TENCON 2011 - 2011 IEEE Region 10 Conference

Date of Conference:

21-24 Nov. 2011