Constraint satisfaction for storage files with FIFOs or stacks during scheduling

Author

Pinto, Carlos A Alba ; Mesman, Bart ; van Eijk, Koen ; Jess, Jochen

Author_Institution

Design Autom. Section, Eindhoven Univ. of Technol., Netherlands

fYear

2001

fDate

2001

Firstpage

824

Abstract

This paper presents a method that, during scheduling of DSP algorithms, handles constraints of storage files with FIFOs or stacks together with resource and timing constraints. Constraint analysis techniques and the characteristics of the exact coloring of conflict graphs are used to identify values that are bottlenecks for storage assignment with the aim of ordering their accesses. This is done with pairs of values until it can guarantee that all constraints will be satisfied

Keywords

constraint handling; constraint theory; data flow graphs; file organisation; graph colouring; processor scheduling; signal processing; storage allocation; timing; DSP algorithms; FIFO; conflict graph colouring; constraint analysis techniques; constraint satisfaction; resource constraints; scheduling; stacks; storage assignment; storage files; timing constraints; Delay; Design automation; Digital signal processing; Scheduling algorithm; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Design, Automation and Test in Europe, 2001. Conference and Exhibition 2001. Proceedings

Conference_Location

Munich

ISSN

1530-1591

Print_ISBN

0-7695-0993-2

Type

conf

DOI

10.1109/DATE.2001.915176

Filename

915176

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3019692