Polynomial-time subgraph enumeration for automated instruction set extension

Authors:
Paolo Bonzini;Laura Pozzi
Affiliations:
University of Lugano (USI), Switzerland;University of Lugano (USI), Switzerland
Venue:
Proceedings of the conference on Design, automation and test in Europe
Year:
2007

Citing 12
Cited 16

Generalized dominators and post-dominators

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Synthesis of Application Specific Instructions for Embedded DSP Software

IEEE Transactions on Computers
A fast algorithm for finding dominators in a flowgraph

ACM Transactions on Programming Languages and Systems (TOPLAS)
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Automatic application-specific instruction-set extensions under microarchitectural constraints

Proceedings of the 40th annual Design Automation Conference
Processor Acceleration Through Automated Instruction Set Customization

Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture
Scalable custom instructions identification for instruction-set extensible processors

Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems
ISEGEN: Generation of High-Quality Instruction Set Extensions by Iterative Improvement

Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
An integer linear programming approach for identifying instruction-set extensions

CODES+ISSS '05 Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Scalable subgraph mapping for acyclic computation accelerators

CASES '06 Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems
Code transformation strategies for extensible embedded processors

CASES '06 Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems
Polynomial-time subgraph enumeration for automated instruction set extension

Proceedings of the conference on Design, automation and test in Europe

Polynomial-time subgraph enumeration for automated instruction set extension

Proceedings of the conference on Design, automation and test in Europe
Pattern-based behavior synthesis for FPGA resource reduction

Proceedings of the 16th international ACM/SIGDA symposium on Field programmable gate arrays
Customizing computation accelerators for extensible multi-issue processors with effective optimization techniques

Proceedings of the 45th annual Design Automation Conference
An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph

Graph-Theoretic Concepts in Computer Science
Recurrence-aware instruction set selection for extensible embedded processors

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Modern development methods and tools for embedded reconfigurable systems: A survey

Integration, the VLSI Journal
Fast, nearly optimal ISE identification with I/O serialization through maximal clique enumeration

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A generalized control-flow-aware pattern recognition algorithm for behavioral synthesis

Proceedings of the Conference on Design, Automation and Test in Europe
Runtime reconfiguration of custom instructions for real-time embedded systems

Proceedings of the Conference on Design, Automation and Test in Europe
The Instruction-Set Extension Problem: A Survey

ACM Transactions on Reconfigurable Technology and Systems (TRETS)
An efficient algorithm for custom instruction enumeration

Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI
Practical and effective domain-specific function unit design for CGRA

ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
An algorithm for finding input-output constrained convex sets in an acyclic digraph

Journal of Discrete Algorithms
Exact custom instruction enumeration for extensible processors

Integration, the VLSI Journal
On the feasibility and limitations of just-in-time Instruction set extension for FPGA-based reconfigurable processors

International Journal of Reconfigurable Computing - Special issue on Selected Papers from the International Conference on Reconfigurable Computing and FPGAs (ReConFig'10)
Complexity of computing convex subgraphs in custom instruction synthesis

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 our knowledge, this is the first paper to prove this and to present a practical algorithm for this problem with polynomial complexity. Our algorithm is based on properties of convex subgraphs that link them to the concept of multiple-vertex dominators. We discuss several pruning techniques that, without sacrificing the optimality of the algorithm, make it practical for data-flow graphs of a thousands nodes or more.