Question and Answers

Question:

We know that list scheduling provides optimal binding solution in P-time where as clique partitioning requires exponential time for the same quality of solution. Why, still, clique partitioning is not considered obsolete?

Answer:

While list scheduling provides optimal solution, in terms of resource utilization of variables (i.e., registers) and operations (i.e., operators), in polynomial time, there is no provision of incorporating area of interconnects due to a given binding into the algorithm. However, in case of clique partitioning based solution weights can be assigned to the edges based on area that might result by binding the two operations (or variables) corresponding to the two nodes of the edge under question to a single operator (or register). So most of the area aware binding techniques consider clique partitioning (with required enhancements).