Author:
Gutin G.,Johnstone A.,Reddington J.,Scott E.,Yeo A.
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. K. Atasu, G. Dunbar, C. Ozturan, An integer linear programming approach for identifying instruction-set extensions, in: CODES+ISSSʼ05: Proc. 3rd IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis, 2005, pp. 172–177.
2. Algorithms for generating convex sets in acyclic digraphs;Balister;J. Discrete Algorithms,2009
3. Digraphs: Theory, Algorithms and Applications;Bang-Jensen,2009
4. P. Bonzini, L. Pozzi, Polynomial-time subgraph enumeration for automated instruction set extension, in: DATE 2007, pp. 1331–1336.
5. Fast identification of custom instructions for extensible processors;Chen;IEEE Trans. Comput.-Aided Design Integr. Circuits Syst.,2007
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Automating application-driven customization of ASIPs: A survey;Journal of Systems Architecture;2024-03
2. Acyclic Digraphs;Springer Monographs in Mathematics;2018
3. Application-Specific Processors;Handbook of Hardware/Software Codesign;2017
4. Application-Specific Processors;Handbook of Hardware/Software Codesign;2016
5. Maximum Convex Subgraphs Under I/O Constraint for Automatic Identification of Custom Instructions;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2015-03