By Topic

A Fast Custom Instructions Identification Algorithm based on Basic Convex Pattern Model for Supporting ASIP Automated Design

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
$31 $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)
Kang Zhao ; Tsinghua Univ., Beijing ; Jinian Bian ; Sheqin Dong

To improve the computation efficiency of application specific instruction-set processor (ASIP), a strategy of hardware/software collaborative design is usually utilized. In this process, the auto-customization of instruction set has always been a key part to support the automated design of ASIP. The key issue of this problem is how to effectively reduce the huge exponential exploration space in the instruction identification process. To address this issue, we first formulate it as a sub-graph enumeration problem under multi-constraints, and then propose a fast instruction identification algorithm based on basic convex pattern (BCP) model. The kernel technique in this algorithm is the transformation from the graph exploration to the formula-based computations. Experimental results have indicated that the proposed algorithm has a distinct reduction on the execution time.

Published in:

Computer Supported Cooperative Work in Design, 2007. CSCWD 2007. 11th International Conference on

Date of Conference:

26-28 April 2007