An Integer Programming Approach to Instruction Set Selection Problem

概要

論文の詳細を見る
The performance of ASIPs (Application Specific Integrated Processors) is heavily affected by the design of their instruction set architecture. In order to maximize the performance of ASIP, it is essential to design an architecture that has an optimum instruction set. This paper describes a new method that automates the design of optimum instruction set of ASIP. This method solves the Instruction set implementation Method Selection Problem (IMSP). IMSP is to be solved in the instruction set architecture design. First, the IMSP is formalized as an integer programming problem, which is to maximize the performance of the CPU under the constraints of chip area and power consumption. Then, a branch-and-bound algorithm to solve IMSP is described. According to the experimental results, the proposed algorithm is quite effective and efficient in solving the IMSP. The presented method automates a complex part of the ASIP chip design and is also a good design tool that enables designer to predict the performance of their design before completion.
社団法人電子情報通信学会の論文
1993-10-25