Polynomial-time subgraph enumeration for automated instruction set extension

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2007, Pages 1331-1336

  Bonzini, Paolo ^a   Pozzi, Laura ^a  

^a UNIVERSITY OF LUGANO   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; GRAPHIC METHODS; PROBLEM SOLVING; PROGRAM PROCESSORS;

AUTOMATED INSTRUCTION SET EXTENSION; DATA FLOW GRAPHS;

POLYNOMIALS;

EID: 34548295212     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2007.364482     Document Type: Conference Paper

References (14)

1. A. V. Aho and J. D. Ullman. Theory of Parsing, Translation and Compiling. Prentice Hall, 1973.
2. K. Atasu, G. Dündar, and C. Ozturan. An integer linear programming approach for identifying instruction-set extensions. In Proc. of CODES+ISSS, 2005.
3. K. Atasu, L. Pozzi, and P. Ienne. Automatic application-specific instruction-set extensions under microarchitectural constraints. In Proc. of DAC, 2003.
4. P. Biswas, S. Banerjee, N. Dutt, L. Pozzi, and P. Ienne. ISEGEN: Generation of high-quality instruction set extensions by iterative improvement. In Proc. of DATE, 2005.
5. P. Bonzini and L. Pozzi. Code transformation strategies for extensible embedded processors. In Proc. of CASES, 2006.
6. H. Choi, J.-S. Kim, C.-W. Yoon, I.-C. Park, S. H. Hwang, and C.-M. Kyung. Synthesis of application specific instructions for embedded DSP software. In IEEE TC, June 1999.
7. N. Clark, A. Hormati, and S. Mahlke. Scalable subgraph mapping for acyclic computation accelerators. In Proc. of CASES, 2006.
8. N. Clark, H. Zhong, and S. Mahlke. Processor acceleration through automated instruction set customisation. In Proc. of MICRO, 2003.
9. E. Dubrova, M. Teslenko, and A. Martinelli. On relation between non-disjoint decomposition and multiple-vertex dominators. In Proc. of ISCAS, 2004.
10. R. Gupta. Generalized dominators and post-dominators. In Proc. of POPL, 1992.
11. T. Lengauer and R. E. Tarjan. A fast algorithm for finding dominators in a flowgraph. In ACM TOPLAS, 1979.
12. L. Pozzi, K. Atasu, and P. Ienne. Optimal and approximate algorithms for the extension of embedded processor instruction sets. In IEEE TCAD, July 2006.
13. P. Yu and T. Mitra. Scalable custom instructions identification for instruction set extensible processors. In Proc. of CASES, 2004.
14. P. Bonzini and L. Pozzi Polynomial-time subgraph enumeration for automated instruction set extension. TR 2006/07, University of Lugano, 2006. http://www.inf.unisi.ch/file/pub/15/bonzini-pozzi-2006-07.pdf