The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Untuk meningkatkan kecekapan pengiraan pemproses set arahan khusus aplikasi (ASIP), strategi reka bentuk kolaboratif perkakasan/perisian biasanya digunakan. Dalam proses ini, penyesuaian automatik set arahan khusus sentiasa menjadi bahagian penting untuk menyokong reka bentuk automatik ASIP. Isu utama masalah ini ialah bagaimana untuk mengurangkan ruang penerokaan eksponen yang besar secara berkesan dalam proses pengenalan arahan. Untuk menangani isu ini, kami mula-mula merumuskannya sebagai masalah penghitungan subgraf yang boleh dilaksanakan di bawah pelbagai kekangan, dan kemudian mencadangkan algoritma pengenalan arahan pantas berdasarkan model baharu yang dipanggil corak cembung asas (BCP). Teknik kernel dalam algoritma ini ialah transformasi daripada penerokaan graf kepada pengiraan berasaskan formula. Keputusan eksperimen telah menunjukkan bahawa algoritma yang dicadangkan mempunyai pengurangan yang berbeza dalam masa pelaksanaan.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Kang ZHAO, Jinian BIAN, Sheqin DONG, Yang SONG, Satoshi GOTO, "Fast Custom Instruction Identification Algorithm Based on Basic Convex Pattern Model for Supporting ASIP Automated Design" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 6, pp. 1478-1487, June 2008, doi: 10.1093/ietfec/e91-a.6.1478.
Abstract: To improve the computation efficiency of the application specific instruction-set processor (ASIP), a strategy of hardware/software collaborative design is usually utilized. In this process, the auto-customization of specific 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 feasible sub-graph enumeration problem under multiple constraints, and then propose a fast instruction identification algorithm based on a new model called basic convex pattern (BCP). The kernel technique in this algorithm is the transformation from the graph exploration to the formula-based computations. The experimental results have indicated that the proposed algorithm has a distinct reduction in the execution time.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.6.1478/_p
Salinan
@ARTICLE{e91-a_6_1478,
author={Kang ZHAO, Jinian BIAN, Sheqin DONG, Yang SONG, Satoshi GOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Fast Custom Instruction Identification Algorithm Based on Basic Convex Pattern Model for Supporting ASIP Automated Design},
year={2008},
volume={E91-A},
number={6},
pages={1478-1487},
abstract={To improve the computation efficiency of the application specific instruction-set processor (ASIP), a strategy of hardware/software collaborative design is usually utilized. In this process, the auto-customization of specific 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 feasible sub-graph enumeration problem under multiple constraints, and then propose a fast instruction identification algorithm based on a new model called basic convex pattern (BCP). The kernel technique in this algorithm is the transformation from the graph exploration to the formula-based computations. The experimental results have indicated that the proposed algorithm has a distinct reduction in the execution time.},
keywords={},
doi={10.1093/ietfec/e91-a.6.1478},
ISSN={1745-1337},
month={June},}
Salinan
TY - JOUR
TI - Fast Custom Instruction Identification Algorithm Based on Basic Convex Pattern Model for Supporting ASIP Automated Design
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1478
EP - 1487
AU - Kang ZHAO
AU - Jinian BIAN
AU - Sheqin DONG
AU - Yang SONG
AU - Satoshi GOTO
PY - 2008
DO - 10.1093/ietfec/e91-a.6.1478
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2008
AB - To improve the computation efficiency of the application specific instruction-set processor (ASIP), a strategy of hardware/software collaborative design is usually utilized. In this process, the auto-customization of specific 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 feasible sub-graph enumeration problem under multiple constraints, and then propose a fast instruction identification algorithm based on a new model called basic convex pattern (BCP). The kernel technique in this algorithm is the transformation from the graph exploration to the formula-based computations. The experimental results have indicated that the proposed algorithm has a distinct reduction in the execution time.
ER -