Automatic design of application-specific reconfigurable processor extensions with UPaK synthesis kernel

ACM Transactions on Design Automation of Electronic Systems

Volumn 15, Issue 1, 2009, Pages

  Wolinski, Christophe ^a   Kuchcinski, Krzysztof ^b   Raffin, Erwan ^c  

^a CAMPUS DE BEAULIEU   (France)

^b LUND UNIVERSITY   (Sweden)

^c FCA UNESP   (Brazil)

Author keywords

Constraint programming; Reconfigurable architectures; Resource assignment; Scheduling; System level synthesis

Indexed keywords

APPLICATION EXECUTION; APPLICATION MAPPING; APPLICATION-SPECIFIC; AS GRAPH; AUTOMATIC DESIGN; COMPUTATIONAL PATTERNS; CONSTRAINT PROGRAMMING; DESIGN FLOWS; HARDWARE AND SOFTWARE; NEW TOOLS; PARALLEL APPLICATION; PARALLEL INSTRUCTIONS; RE-CONFIGURABLE; RECONFIGURABLE ARCHITECTURE; RECONFIGURABLE PROCESSORS; RESOURCE ASSIGNMENT; RESOURCE CONSTRAINED SCHEDULING; SCHEDULING SYSTEMS; SEPARATE ALGORITHM; SPECIFIC INSTRUCTION; SUBGRAPH ISOMORPHISM; SYNTHESIS KERNELS;

COMPUTATIONAL EFFICIENCY; COMPUTER PROGRAMMING; CONSTRAINT THEORY; PATTERN MATCHING; SET THEORY;

RECONFIGURABLE HARDWARE;

EID: 74049161644     PISSN: 10844309     EISSN: 15577309     Source Type: Journal    
DOI: 10.1145/1640457.1640458     Document Type: Article

References (34)

1. ARNOLD, M. AND CORPORAAL, H. 2001. Designing domain specific processors. In Proceedings of the 9th International Workshop on Hardware/Software CoDesign. 61-66.
2. ATASU, K., POZZI, L., AND IENNE, P. 2003. Automatic application-specific instructionset extensions under microarchitectural constraints. In Proceedings of the 40th Design Automation Conference (DAC).
3. BISWAS, P., BANERJEE, S., DUTT, N., POZZI, L., AND IENNE, P. 2005. ISEGEN: Generation of highquality instruction set extensions by iterative improvement. In Proceedings of the 42nd Design Automation Conference (DAC).
4. BRISK, P., KAPLAN, A., KASTNER, R., AND SARRAFZADEH, M. 2002. Instruction generation and regularity extraction for reconfigurable processors. In Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES'02). ACM, New York, NY, 262-269.
5. BRISK, P., KAPLAN, A., AND SARRAFZADEH, M. 2004. Area-efficient instruction set synthesis for reconfigurable system-on-chip designs. In Proceedings of the 41st Design Automation Conference, 395-400.
6. CHOI, H., YI, J. H., LEE, J.-Y., PARK, I.-C., AND KYUNG, C.-M. 1999. Exploiting intellectual properties in ASIP designs for embedded DSP software. In Proceedings of the 36th ACM/IEEE Conference on Design Automation (DAC'99). ACM, New York, NY, 939-944.
7. CLARK, N., ZONG, H., ANDMAHLKE, S. 2003. Processor acceleration through automated instruction set customization. In Proceedings of the 36th Annual International Symposium on Microarchitecture.
8. CONG, J. AND JIANG, W. 2008. Pattern-based behavior synthesis for FPGA resource reduction. In Proceedings of the 16th International ACM/SIGDA Symposium on Field Programmable Gate Arrays (FPGA'08). ACM, New York, NY, 107-116.
9. CORAZAO, M., KHALAF, M., GUERRA, L., POTKONJAK, M., AND RABAEY, J. 2004. Performance optimization using template mapping for datapath-intensive high-level synthesis. IEEE Trans. Comput. Aid. Des. 15, 8, 877-888.
10. CORDELLA, L. P., FOGGIA, P., SANSONE, C., AND VENTO, M. 2004. A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26, 10, 1367-1372.
11. GOODWIN, D. AND PETKOV, D. 2003. Automatic generation of application specific processors. In Proceedings of the International Conference on Compilers, Architecture and Synthesis for Embedded Systems (CASES'03). ACM, New York, NY, 137-147.
12. GUO, Y. 2006. Mapping applications to a coarse-grained reconfigurable architecture. PhD Thesis, University of Twent, Eindhoven, Netherlands.
13. GUO, Y., SMIT, G., BROERSMA, H., AND HEYSTERS, P. 2003. A graph covering algorithm for a coarse grain reconfigurable system. In Proceedings of the Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'03).
14. HOPCROFT, J. E. AND KARP, R. M. 1973. An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 4, 225-231.
15. HUANG, Z.,MALIK, S.,MOREANO, N., AND ARAUJO, G. 2004. The design of dynamically reconfigurable datapath coprocessors. ACM Trans. Embed. Comput. Syst. 3, 2.
16. KASTNER, R., KAPLAN, A., MEMIK, S. O., AND BOZORGZADEH, E. 2002. Instruction generation for hybrid reconfigurable systems. ACM Trans. Des. Autom. Electron. Syst. 7, 4.
17. KOUNTOURIS, A. ANDWOLINSKI, C. 2002. Efficient scheduling of conditional behaviors for high level synthesis. ACM Trans. Des. Autom. Electron. Syst. 7, 3, 380-412.
18. KUCHCINSKI, K. 2003. Constraints-driven scheduling and resource assignment. ACM Trans. Des. Autom. Electron. Syst. 8, 3, 355-383.
19. LARROSA, J. ANDVALIENTE,G. 2002. Constraint satisfaction algorithms for graph pattern matching. Math. Struct. Comput. Sci. 12, 403-422.
20. LEE, C., POTKONJAK, M., AND MANGIONE-SMITH, W. H. 1997. MediaBench: A tool for evaluating and synthesizing multimedia and communicatons systems. In Proceedings of the International Symposium on Microarchitecture. 330-335.
21. LEUPERS, R., KARURI, K., KRAEMER, S., AND PANDEY, M. 2006. A design flow for configurable embedded processors based on optimized instruction set extension synthesis. In Proceedings of the Conference and Exhibition on Design, Automation and Test in Europe (DATE).
22. MCKAY, B. D. 2004. The nauty page. http://cs.anu.edu.au/~bdm/nauty/.
23. MOREANO, N., BORIN, E., DE SOUZA, C., AND ARAUJO,G. 2005. Efficient datapath merging for partially reconfigurable architectures. IEEE Trans. Comput. Aid. Des. 24, 7, 969-980.
24. PEYMANDOUST, A., POZZI, L., IENNE, P., ANDDEMICHELI,G. 2003. Automatic instruction set extension and utilization for embedded processors. In Proceedings of the IEEE International Conference on Application Specific Systems, Architecture, and Processes (ASAP).
25. ROSSI, F., VAN BEEK, P., ANDWALSH, T., EDS. 2006. Handbook of Constraint Programming. Elsevier Science Publishers, Amsterdam, Netherlands.
26. SORLIN, S. AND SOLNON, C. 2004. A global constraint for graph isomorphism problems. In Proceedings of the 1st International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'04).
27. SUN, F., RAVI, S., RAGHUNATHAN, A., AND JHA, N. K. 2002. Synthesis of custom processors based on extensible platforms. In Proceedings of the IEEE/ACM International Conference on Computer- Aided Design (ICCAD'02). ACM, New York, NY, 641-648.
28. ULLMANN, J. R. 1976. An algorithm for subgraph isomorphism. J. ACM 23, 1, 31-42.
29. WANG, G., GONG,W., AND KASTNER, R. 2004. System level partitioning for programmable platforms using the ant colony optimization. In Proceedings of the International Workshop on Logic & Synthesis (IWLS'04).
30. WOLINSKI, C. AND KUCHCINSKI, K. 2007a. Computation patterns identification for instruction set extensions implemented as reconfigurable hardware. In Proceedings of the International Conference on Engineering of Reconfigurable Systems and Algorithms.
31. WOLINSKI, C. AND KUCHCINSKI, K. 2007b. Identification of application specific instructions based on sub-graph isomorphism constraints. In Proceedings of the IEEE 18th International Conference on Application-Specific Systems, Architectures and Processors.
32. WOLINSKI, C. AND KUCHCINSKI, K. 2008. Automatic selection of application-specific reconfigurable processor extensions. In Proceedings of the International Conference and Exhibition on Design Automation and Test in Europe.
33. WOLINSKI, C., KUCHCINSKI, K., AND POSTULA, A. 2007. UPaK: Abstract unified pattern based synthesis kernel for hardware and software systems. Materials of the University Booth at DATE.
34. WOLINSKI, C., KUCHCINSKI, K., ANDRAFFIN,E. 2009. Architecture-driven synthesis of reconfigurable cells. In Proceedings of the 17th Euromicro Conference on Digital System Design.