By Topic

Instruction-set-extension exploration using decomposable heuristic search

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

3 Author(s)
Das, S. ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India ; Chakrabarti, P.P. ; Dasgupta, P.

Instruction-set-extensions (ISEs) are custom instructions designed specifically for a class of applications. Hence extracting the maximum benefit out of them is any designer's goal. ISE application is the problem of efficiently applying custom instructions such that some gain function like code-size is optimized. Traditional algorithmic techniques like ILP and state space search have failed to address practical designs. Hence a considerable effort has been put on the design of heuristic algorithms. In this paper we present a new optimal algorithm DCA* that combines divide-and-conquer technique with heuristic search to address this problem. We demonstrate the effectiveness of this novel algorithm on real life designs.

Published in:

VLSI Design, 2006. Held jointly with 5th International Conference on Embedded Systems and Design., 19th International Conference on

Date of Conference:

3-7 Jan. 2006