Approaches to Allocation and Assignment
Left-Edge Algorithm
- (REAL(ADAM): Registers)
- (CATHEDRAL: extended with heuristic for repetitive schedules)
Clique Partitioning with Graph-Based Heuristic
- (FACET: Combining Operations into ALUs, Registers, Busses)
Weight-directed Clique Partitioning
- (HAL: Registers, Merging Multiplexers into Busses)
Vertex Graph Coloring with Compatibility Sets
- (CADDY: Registers, FUs, Busses)
Bipartite Graph Edge Coloring
- (<ESC>, SPAID : Register files / Busses)
0-1 Linear Programming
- (Balakrishnan et al.: Multi-port Memories )