Register files constraint satisfaction during scheduling of DSP code

Algorithms in digital signal processing (DSP) impose tight timing constraints that the compiler has to respect while considering the limited capacity of the available register files in a target DSP processor. Traditional code generation methods that schedule spill code to satisfy storage capacity ma...

Full description

Saved in:
Bibliographic Details
Main Authors: Pinto, C.A.A., Mesman, B., Van Eijk, K.
Format: Conference Proceeding
Language:English
Subjects:
Digital signal processing
Electronic equipment
Grounding
Kernel
Power systems
Processor scheduling
Registers
Signal processing algorithms
Timing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Algorithms in digital signal processing (DSP) impose tight timing constraints that the compiler has to respect while considering the limited capacity of the available register files in a target DSP processor. Traditional code generation methods that schedule spill code to satisfy storage capacity may take many iterations and are usually not capable of satisfying the timing constraints. In this paper we present a new method to handle register file capacity constraints during scheduling. The method identifies potential bottlenecks for register binding and subsequently serializes the lifetimes of values until it can be guaranteed that all capacity constraints will be satisfied after scheduling. Experiments show that we efficiently obtain high quality instruction schedules for DSP kernels.
DOI:10.1109/SBCCI.1999.802971