Das, S. ; Chakrabarti, P. P. ; Dasgupta, P. (2006) Instruction-set-extension exploration using decomposable heuristic search In: 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design VLSI Design 2006, 3-7 January 2006.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/abstract/document/15814...
Related URL: http://dx.doi.org/10.1109/VLSID.2006.106
Abstract
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 101683 |
| Deposited On: | 09 Mar 2018 10:17 |
| Last Modified: | 09 Mar 2018 10:17 |
Repository Staff Only: item control page
