Instruction Scheduling Based on Subgraph Isomorphism for a High Performance Computer Processor

This paper1 presents an instruction scheduling algorithm based on the subgraph isomorphism problem. given a directed acyclic graph (dag) g1,our algorithm looks for a subgraph g. 2 in a base graph g2, such that g. 2 is isomorphic to g1. the base graph g2 represents the arrangement of the processing elements of a high performance computer architecture named 2d-vliw and g. 2 is the set of those processing elements required to execute operations in g1.wehavecompared this algorithm with a greedy list scheduling strategy using programs of the spec and mediabench suites. in our experiments, the average operation per cycle (opc) and operations per instruction (opi) achieved by our algorithm are 1.45 and 1.40 times better than the opc and opi obtained by the list scheduling algorithm.