Output details
11 - Computer Science and Informatics
Royal Holloway, University of London
Article title
Algorithms for generating convex sets in acyclic digraphs
Type
D - Journal article
Title of journal
Journal of Discrete Algorithms
Article number
-
Volume number
7
Issue number
4
First page of article
509
ISSN of journal
1570-8667
Year of publication
2009
Number of additional authors
7
Additional information
<08> This paper presents an optimal algorithm for enumerating the convex sets in a program’s data dependency graph. The paper has led to further research from the same group on input-output constrained convex sets, published at WG 2008, EUC 2009 and as an invited paper in J. Discrete Algorithms 13 (2012). Applications include customisable processors in embedded computing where candidate sub-programs for single-cycle evaluation form convex sets in the data dependency graph; e.g. the recent paper 'Isomorphism-Aware Identification of Custom Instructions With I/O Serialization' by Ahn and Choi in IEEE Trans. Computer-Aided Design of Integrated Circuits and Sys.
Interdisciplinary
-
Cross-referral requested
-
Research group
C - Centre for Software Language Engineering
Citation count
3
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
