Cluster Assign Algorithm Based on Subgraph for DSP Compiler

For more issue width, the clustered VLIW processor is a common design in advanced DSP. A clustered processor need compiler assign cluster to each instruction in code-generation. For the problem that traditional cluster assign algorithm using local reference information, the paper proposes an algorithm which divide dependence graph to multiple sub-graph first, then assign cluster to each sub-graph later. It is verified that the algorithm is effective .