An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph
A set X of vertices of an acyclic graph is convex if any vertex on a directed path between elements of X is itself in X. We construct an algorithm for generating all input-output constrained convex (IOCC) sets in an acyclic digraph, which uses several novel ideas. We show that our algorithm is more efficient than algorithms described in the literature in both the worst case and computational experiments. IOCC sets of acyclic digraphs are of interest in the area of modern embedded processor technology.
Unable to display preview. Download preview PDF.
- 1.Bonzini, P., Pozzi, L.: Polynomial-time subgraph enumeration for automated instruction set extension. In: DATE 2007, pp. 1331–1336 (2007)Google Scholar
- 3.Guthaus, M.R., Ringenberg, J.S., Ernst, D., Austin, T.M., Mudge, T., Brown, R.B.: MiBench: A free, commercially representative embedded benchmark suite. In: Proceedings of the WWC-4, 2001 IEEE International Workshop on Workload Characterization, pp. 3–14 (2001)Google Scholar
- 4.Gutin, G., Johnstone, A., Reddington, J., Scott, E., Soleimanfallah, A., Yeo, A.: An algorithm for finding connected convex subgraphs of an acyclic digraph. In: Algorithms and Complexity in Durham, 2007. College Publications (2008)Google Scholar
- 6.Reddington, J.: Improvements to instruction identification for custom instruction set design. PhD Thesis, Royal Holloway, University of London (2008)Google Scholar