Polynomial-Time Subgraph Enumeration for Automated Instruction Set Extension

Provided by: edaa
Format: PDF
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time with respect to the size of the graph. These subgraphs have been shown to represent efficient Instruction Set Extensions for customizable processors. The search space for this problem is inherently polynomial but, to the authors' knowledge, this is the first paper to prove this and to present a practical algorithm for this problem with polynomial complexity. Their algorithm is based on properties of convex subgraphs that link them to the concept of multiple-vertex dominators.

Find By Topic