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

13 years 4 months ago

Download www.jucs.org

: 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

Ricardo Santos, Rodolfo Azevedo, Guido Araujo

Real-time Traffic

Directed Acyclic Graph | JUCS 2008 | Subgraph G2 | Subgraph Isomorphism Problem |

claim paper

» Compiling custom instructions onto expressiongrained reconfigurable architectures

» High Level Synthesis of Pipelined Instruction Set Processors and BackEnd Compilers

» A taxonomy of application scheduling tools for high performance cluster computing

» A Theory for SoftwareHardware CoScheduling for ASIPs and Embedded Processors

» Exhaustive Enumeration of Legal Custom Instructions for Extensible Processors

» Lowpower lowcomplexity instruction issue using compiler assistance

» Toward high performance computing in unconventional computing environments

» Hyperblock formation a powerenergy perspective for high performance VLIW architectures

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JUCS
Authors	Ricardo Santos, Rodolfo Azevedo, Guido Araujo

Comments (0)

Sciweavers

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

Directed Acyclic Graph | JUCS 2008 | Subgraph G2 | Subgraph Isomorphism Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers