Allocation

• Given scheduled DFG

• Assign nodes to resources to minimize resources

• Construct conflict graph:

  • Edge between nodes whose schedules conflict

• Solve by graph coloring

Previous slide

Next slide

Back to first slide

View graphic version