Efficient scheduling of DSP code on processors with distributed register files

Code generation methods for digital signal processors are increasingly hampered by the combination of tight timing constraints imposed by the algorithms and the limited capacity of the available register files. Traditional methods that schedule spill code to satisfy storage capacity have difficulty...

Full description

Saved in:
Bibliographic Details
Main Authors: Mesman, B., Alba Pinto, C.A., van Eijk, K.
Format: Conference Proceeding
Language:English
Subjects:
Application specific processors
Digital signal processing
Digital signal processing chips
Laboratories
Power dissipation
Processor scheduling
Registers
Signal generators
Signal processing
Timing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Code generation methods for digital signal processors are increasingly hampered by the combination of tight timing constraints imposed by the algorithms and the limited capacity of the available register files. Traditional methods that schedule spill code to satisfy storage capacity have difficulty satisfying the timing constraints. The method presented in the paper analyses the combination of limited register file capacity, resource- and timing constraints during scheduling. Value lifetimes are serialized until all capacity constraints are guaranteed to be satisfied after scheduling. Experiments in the FACTS environment show that we efficiently obtain high quality instruction schedules for innermost loops of DSP algorithms.
DOI:10.1109/ISSS.1999.814267