Recurrence-aware instruction set selection for extensible embedded processors

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 16, Issue 10, 2008, Pages 1259-1267

  Bonzini, Paolo ^a,b   Pozzi, Laura ^a,b  

^a UNIVERSITY OF LUGANO   (Switzerland)

^b IEEE

Author keywords

Application specific microprocessors; Customizable microprocessors; Instruction selection; Instruction set extensions; Toolchain automation

Indexed keywords

AUTOMATIC PROGRAMMING; CHLORINE COMPOUNDS;

APPLICATION CODES; APPLICATION-SPECIFIC MICROPROCESSORS; AUTOMATIC GENERATION; COVERING PROBLEMS; CUSTOM INSTRUCTION; CUSTOMIZABLE MICROPROCESSORS; EMBEDDED PROCESSORS; EXACT ALGORITHMS; EXACT SOLUTIONS; GREEDY SEARCH; INSTRUCTION SELECTION; INSTRUCTION SETS; INSTRUCTION-SET EXTENSIONS; LOCAL OPTIMUM; NOVEL ALGORITHMS; OPTIMAL SEARCH; TOOLCHAIN AUTOMATION;

SET THEORY;

EID: 52649104912     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2008.2001863     Document Type: Conference Paper

References (22)

1. K. Atasu, L. Pozzi, and P. Ienne, "Automatic application-specific instruction-set extensions under microarchitectural constraints," in Proc. 40th Design Autom. Conf., Anaheim, CA, Jun. 2003, pp. 256-61.
2. N. Clark, H. Zhong, and S. Mahlke, "Processor acceleration through automated instruction set customization," in MICRO 36: Proc. 36th Annu. Int. Symp. Microarchitecture, San Diego, CA, Dec. 2003, pp. 129-140.
3. P. Bonzini and L. Pozzi, "Code transformation strategies for extensible embedded processors," in Proc. Int. Conf. Compilers, Architectures, and Synthesis for Embedded Syst., Seoul, South Korea, Oct. 2006, pp. 242-52.
4. J. Cong, Y. Fan, G. Han, and Z. Zhang, "Application-specific instruction generation for configurable processor architectures," in Proc. ACM/SIGDA 12th Int. Symp. Field Programmable Gate Arrays, Monterey, CA, Feb. 2004, pp. 183-89.
5. R. Kastner, A. Kaplan, S. O. Memik, and E. Bozorgzadeh, "Instruction generation for hybrid reconfigurable systems," ACM Trans. Design Autom. Electron. Syst. (TODAES), vol. 7, no. 4, pp. 605-27, Oct. 2002.
6. N. Clark, A. Hormati, S. Mahlke, and S. Yehia, "Scalable subgraph mapping for acyclic computation accelerators," in Proc. Int. Conf. Compilers, Architectures, and Synthesis for Embedded Syst., Seoul, South Korea, Oct. 2006, pp. 147-157.
7. P. Bonzini and L. Pozzi, "A retargetable framework for automated discovery of custom instructions," in Proc. 18th Int. Conf. Appl.-Specific Syst., Architectures and Processors, Montreal, QC, Canada, Jul. 2007, pp. 334-41.
8. L. Pozzi, K. Atasu, and P. Ienne, "Exact and approximate algorithms for the extension of embedded processor instruction sets," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 25, no. 4, pp. 1209-1229, Jul. 2006.
9. L. Cordella, P. Foggia, C. Sansone, and M. Vento, "A (sub)graph isomorphism algorithm for matching large graphs," IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, no. 10, pp. 1367-1372, Oct. 2004.
10. A. Peymandoust, L. Pozzi, P. Ienne, and G. D. Micheli, "Automatic instruction set extension and utilization for embedded processors," in Proc. 14th Int. Conf. Appl.-Specific Syst., Architectures and Processors, The Hague, The Netherlands, Jun. 2003, pp. 103-14.
11. X. Chen, D. L. Maskell, and Y. Sun, "Fast identification of custom instructions for extensible processors," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 26, no. 1, pp. 359-68, Feb. 2007.
12. P. Bonzini and L. Pozzi, "Polynomial-time subgraph enumeration for automated instruction set extension," in Proc. Design, Autom. and Test in Europe Conf. Exhibition, Nice, France, Apr. 2007, pp. 1331-36.
13. P. Yu and T. Mitra, "Scalable custom instructions identification for instruction set extensible processors," in Proc. Int. Conf. Compilers, Architectures, and Synthesis for Embedded Systems, Washington, DC, Sep. 2004, pp. 69-78.
14. S. Hu and J. E. Smith, "Using dynamic binary translation to fuse dependent instructions," in Proc. Int. Symp. Code Generation and Optimiz., San Jose, CA, Mar. 2004, pp. 213-24.
15. C. W. Fraser, D. R. Hanson, and T. A. Proebsting, "Engineering a simple, efficient code-generator generator," ACM Lett. Programming Languages and Systems (LOPLAS), vol. 1, no. 3, pp. 213-26, 1992.
16. L. Pozzi and P. Ienne, "Exploiting pipelining to relax register-file port constraints of instruction-set extensions," in Proc. Int. Conf. Compilers, Architectures, and Synthesis for Embedded Syst., San Francisco, CA, Sep. 2005, pp. 2-10.
17. A. K. Verma, P. Brisk, and P. Ienne, "Rethinking custom ISE identification: A new processor-agnostic method," in Proc. Int. Conf. Compilers, Architectures, and Synthesis for Embedded Syst., Salzburg, Austria, Oct. 2007, pp. 125-134.
18. P. Biswas, N. Dutt, P. Ienne, and L. Pozzi, "Automatic identification of application-specific functional units with architecturally visible storage," in Proc. Design, Automation and Test in Europe Conf. Exhibition, Munich, Germany, Mar. 2006, pp. 212-217.
19. O. Coudert, "Solving graph optimization problems with zbdds," in Proc. Eur. Conf. Design and Test, Mar. 1997, pp. 224-228.
20. S. Minato, "Zero-suppressed bdds for set manipulation in combinatorial problems," in Proc. 30th Design Autom. Conf., New York, 1993, pp. 272-277.
21. H. G. Okuno, S. Minato, and H. Isozaki, "On the properties of combination set operations," Inf. Process. Lett., vol. 66, no. 4, pp. 195-199, May 1998.
22. M. Guthaus, J. Ringenberg, D. Ernst, T. Austin, T. Mudge, and R. Brown, "Mibench: A free, commercially representative embedded benchmark suite," in Proc. IEEE 4th Annu. Workshop Workload Characterization, Dec. 2001, pp. 3-14 [Online]. Available: http://www.eecs.umich.edu/mibench/ Publications/MiBench.pdf