Constraint Satisfaction for Relative Location Assignment and Scheduling

Tight data- and timing constraints are imposed by communication and multimedia applications. The architecture for the embedded processor imply resource constraints. Instead of random-access registers, relative location storages or rotating register files are used to exploit the available parallelism of resources by means of reducing the initiation interval in pipelined schedules. Therefore, the compiler or synthesis tool must deal with the difficult tasks of scheduling of operations and location assignment of values while respecting all the constraints including the storage file capacity. This paper presents a method that handles constraints of relative location storages during scheduling together with timing and resource constraints. The characteristics of the coloring of conflict graphs, representing the relative overlap of value instances, are analyzed in order to identify the bottlenecks for location assignment with the aim of serializing their lifetimes. This is done with pai...

• Type: Conference
• Year: 2001
• Where: ICCAD
• Authors: Carlos A. Alba Pinto, Bart Mesman, Jochen A. G. Jess
• Keywords: Hardware, ICCAD 2001, Relative Location Storages, Resource Constraints, Timing Constraints