R. Ammendola, A. Biagioni, and O. Frezza, ASIP acceleration for virtual-to-physical address translation on RDMA-enabled FPGA-based network interfaces, Future Generation Computer Systems, vol.53, pp.109-118, 2015.

G. Zacharopoulos, L. Ferretti, E. Giaquinta, G. Ansaloni, and L. Pozzi, RegionSeeker: Automatically Identifying and Selecting Accelerators from Application Source Code, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.38, issue.4, pp.741-754, 2019.

L. Pozzi, K. Atasu, and P. Ienne, Exact and approximate algorithms for the extension of embedded processor instruction sets, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.25, issue.7, pp.1209-1229, 2006.

C. Xiao and E. Casseau, Exact custom instruction enumeration for extensible processors, Integration, the VLSI Journal, vol.45, issue.3, pp.263-270, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00746877

J. Reddington and K. Atasu, Complexity of Computing Convex Subgraphs in Custom Instruction Synthesis, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.20, pp.2337-2341, 2012.

T. Li, Z. Sun, W. Jigang, and X. Lu, Fast enumeration of maximal valid subgraphs for custom-instruction identification, pp.29-36, 2009.

K. Atasu, W. Luk, O. Mencer, C. Ozturan, and G. Dundar, FISH: Fast Instruction SyntHesis for Custom Processors, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.20, pp.52-65, 2012.

E. Giaquinta, A. Mishra, and L. Pozzi, Maximum Convex Subgraphs Under I/O Constraint for Automatic Identification of Custom Instructions, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.34, issue.3, pp.483-494, 2015.

P. Balister, S. Gerke, G. Gutin, A. Jojnstone, J. Reddington et al., Algorithms for generating convex sets in acyclic digraphs, Journal of Discrete Algorithms, vol.7, issue.4, pp.509-518, 2009.

S. Wang, C. Xiao, and W. Liu, A Faster Algorithm for Enumerating Connected Convex Subgraphs in Acyclic Digraphs, IEEE Embedded Systems Letters, vol.9, issue.1, pp.9-12, 2017.

G. Gutin and A. Yeo, On the number of connected convex subgraphs of a connected acyclic digraph, Journal of Discrete Algorithms, vol.157, issue.7, pp.1660-1662, 2009.

P. Balister, S. Gerke, and G. Gutin, Convex Sets in Acyclic Digraphs, Order-a Journal on the Theory of Ordered Sets & Its Applications, vol.26, issue.1, pp.95-100, 2009.

P. Yu and T. Mitra, Scalable custom instructions identification for instruction-set extensible processors, pp.69-78, 2004.

R. Tarjan, Depth-first search and linear graph algorithms, SIAM journal on computing, vol.1, issue.2, pp.146-160, 1972.

M. R. Guthaus, J. S. Ringenberg, D. Ernst, T. M. Austin, T. Mudge et al., Mibench: a free, commercially representative embedded benchmark suite, Annual Workshop on Workload Characterization, pp.3-14, 2001.

C. Lee, M. Potkonjak, and W. H. Mangione-smith, Mediabench: a tool for evaluating and synthesizing multimedia and communications systems, pp.330-335, 1997.

A. Floch, T. Yuki, A. E. Moussawi, and A. Morvan, A framework for prototyping custom hardware design flows, IEEE SCAM, pp.100-105, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00921370