A retargetable framework for compiler/architecture co-development

被引:2
作者
Scharwaechter, Hanno [1 ]
Kammler, David [1 ]
Leupers, Rainer [1 ]
Ascheid, Gerd [1 ]
Meyr, Heinrich [1 ]
机构
[1] Rhein Westfal TH Aachen, ISS 611810, Chair Integrated Signal Proc Syst, D-52056 Aachen, Germany
关键词
Compiler/architecture co-design; Code-selection; Instruction Set Extension (ISE); Application Specific Instruction-set Processors (ASIP); INSTRUCTION; GENERATION; ALGORITHMS;
D O I
10.1007/s10617-011-9080-8
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Compiler-in-the-Loop (CiL) architecture exploration is widely accepted as being the right track for fast development of Application Specific Instruction-set Processors (ASIP). In this context, both, automatic application-specific Instruction Set Extension (ISE) and code generation by a compiler have received huge attention in the past. Together, both techniques enable processor designers to quickly adapt a processor's Instruction Set Architecture (ISA) to the needs of a certain set of applications and to provide an appropriate high-level programming model. This manuscript presents a tool flow for identification and utilization of Custom Instructions (CIs) during architecture exploration in an automated fashion. By embedding this tool flow in an industry-proven architecture exploration framework, a methodology for simultaneous compiler/architecture co-exploration is derived. The advantage of the presented tool flow lies in its ability to develop a reusable ISA and an appropriate compiler for a set of applications and therefore to support the design of programmable architectures. In addition, ASIP architecture exploration is effectively improved since time consuming application analysis and compiler retargeting is automated. Through compilation and simulation of several benchmarks in accordance to extended ISAs, reliable feedback on speedup, code size and usability of identified CIs is provided. Furthermore, results on area consumption for extended ISAs are presented in order to compare the obtained speedup with the invested hardware effort of new CIs.
引用
收藏
页码:311 / 342
页数:32
相关论文
共 76 条
[1]  
ADITYA S, 1999, ELCORS MACHINE DESCR
[2]   CODE GENERATION USING TREE MATCHING AND DYNAMIC-PROGRAMMING [J].
AHO, AV ;
GANAPATHI, M ;
TJIANG, SWK .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1989, 11 (04) :491-516
[3]  
[Anonymous], 1990, COMPUT INTRACTABILIT
[4]  
[Anonymous], 2004, P 2004 ACM SIGDA 12
[5]   Using register-transfer paths in code generation for heterogeneous memory-register architectures [J].
Araujo, G ;
Malik, S ;
Lee, MTC .
33RD DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 1996, 1996, :591-596
[6]   Designing domain-specific processors [J].
Arnold, M ;
Corporaal, H .
PROCEEDINGS OF THE NINTH INTERNATIONAL SYMPOSIUM ON HARDWARE/SOFTWARE CODESIGN, 2001, :61-66
[7]  
Atasu K, 2005, 2005 INTERNATIONAL CONFERENCE ON HARDWARE/SOFTWARE CODESIGN AND SYSTEM SYNTHESIS, P172
[8]  
Baleani M, 2002, CODES 2002: PROCEEDINGS OF THE TENTH INTERNATIONAL SYMPOSIUM ON HARDWARE/SOFTWARE CODESIGN, P151, DOI 10.1109/CODES.2002.1003617
[9]  
Biswas Pradipta, 2006, P COLING ACL 2006 ST, P1
[10]  
Bonzini P., 2006, P 2006 INT C COMP AR, P242