Constraint satisfaction for storage files with FIFOs or stacks during scheduling

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