Better Than Optimal: Fast Identification of Custom Instruction Candidates

Authors:
J. Reddington;G. Gutin;A. Johnstone;E. Scott;A. Yeo
Affiliations:
-;-;-;-;-
Venue:
CSE '09 Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 02
Year:
2009

Citing 0
Cited 3

An algorithm for finding input-output constrained convex sets in an acyclic digraph

Journal of Discrete Algorithms
Constraint Programming Approach to Reconfigurable Processor Extension Generation and Application Compilation

ACM Transactions on Reconfigurable Technology and Systems (TRETS)
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

Asymptotically optimal algorithms do not always yield the fastest practical algorithm on realistic cases. We examine Gutin etal.'s recently published optimal algorithm for enumerating the set of convex subgraphs under input/output constraints with application to custom instruction identification. We show that (i) suppressing some of the machinery in their algorithm results in a sub-optimal algorithm which is significantly faster in practice on real-world examples and that (ii) the constants of proportionality in the running time for both optimal and sub-optimal versions can be significantly improved by using additional output set filtering constraints.