2009•Journal of Circuits and SystemsRequires access

An ASIP compiler design and implementation

Lingling Sun

Open publisher page 0 citations

Abstract

A new code-generation algorithm which handles code selection and register allocation simultaneously is presented to satisfy register restriction of application specific instruction processors(ASIPs) and real-time requirement from applications. A model is presented to describe the complicated restrictions among registers of ASIP register file in this paper. The traditional graph-coloring algorithm is improved to be adapted to ASIP according to this model. The register allocation is translated into how to simplify this graph. At last the algorithm is applied to an ASIP compiler. Experimental results show it has better performance of code-generation and less register spilling than traditional code-generation algorithm.

About this research paper

What this paper is about

A new code-generation algorithm which handles code selection and register allocation simultaneously is presented to satisfy register restriction of application specific instruction processors(ASIPs) and real-time requirement from applications. A model is presented to describe the complicated restrictions among registers of ASIP register file in this paper. The traditional graph-coloring algorithm is improved to be adapted to ASIP according to this model. The register allocation is translated into how to simplify this graph. At last the algorithm is applied to an ASIP compiler. Experimental results show it has better performance of code-generation and less register spilling than traditional code-generation algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A new code-generation algorithm which handles code selection and register allocation simultaneously is presented to satisfy register restriction of application specific instruction processors(ASIPs) and real-time requirement from applications. A model is presented to describe the complicated restrictions among registers of ASIP register file in this paper. The traditional graph-coloring algorithm is improved to be adapted to ASIP according to this model. The register allocation is translated into how to simplify this graph. At last the algorithm is applied to an ASIP compiler. Experimental results show it has better performance of code-generation and less register spilling than traditional code-generation algorithm.

Key concepts: Register allocation, Computer science, Compiler, Register file, Code generation, Parallel computing, Processor register, Optimizing compiler

Related papers

Back to paper searchBrowse research topicsOriginal source
An ASIP compiler design and implementation — Research Paper | ScholarLens