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 G2 in a base graph G2, such that G2 is isomorphic

• Type: Journal
• Year: 2008
• Where: JUCS
• Authors: Ricardo Santos, Rodolfo Azevedo, Guido Araujo
• Keywords: Directed Acyclic Graph, JUCS 2008, Subgraph G2, Subgraph Isomorphism Problem