Application-specific instruction generation for configurable processor architectures

ACM/SIGDA International Symposium on Field Programmable Gate Arrays - FPGA

Volumn 12, Issue , 2004, Pages 183-189

  Cong, Jason ^a   Fan, Yiping ^a   Han, Guoling ^a   Zhang, Zhiru ^a  

^a University of California   (United States)

Author keywords

ASIP; Binate covering; Compilation; Configurable processor; Technology mapping

Indexed keywords

ALGORITHMS; COMBINATORIAL CIRCUITS; COMPUTER AIDED DESIGN; COMPUTER SCIENCE; CONFORMAL MAPPING; CONSTRAINT THEORY; EMBEDDED SYSTEMS; MATHEMATICAL MODELS; PATTERN RECOGNITION; POLYNOMIALS;

APPLICATION-SPECIFIC INSTRUCTION-SET PROCESSORS (ASIP); BINATE COVERING; COMPILATION; CONFIGURABLE PROCESSORS; TECHNOLOGY MAPPING;

PROGRAM PROCESSORS;

EID: 2442428419     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/968280.968307     Document Type: Conference Paper

References (27)

1. A. Aho and S. C. Johnson, "Optimal Code Generation for Expression Trees," Journal of the ACM, vol. 23, pp. 488-501, Jul. 1976.
2. K. Atasu, L. Pozzi, and P. Ienne, "Automatic Application-Specific Instruction-Set Extensions under Microarchitectural Constraints," in Proceedings of the 40th DAC Design Automation Conference, pp. 256-261, Jun. 2003.
3. L. Babai and E. M. Luks, "Canonical Labeling of Graphs," in Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pp. 171-183, Dec. 1983.
4. R. K. Brayton and F. Somenzi, "Boolean Relations and the Incomplete Specification of Logic Networks," in Proceedings of the 1989 International Conference on Computer-Aided Design, pp. 316-319, Nov. 1989.
5. T. J. Callahan, J. R. Hauser, and J. Wawrzynek, "The Garp Architecture and C Compiler," IEEE Computer, vol. 33(4), pp. 62-69, Apr. 2000.
6. J. Cong, C.Wu, and Y. Ding, "Cut Ranking and Pruning: Enabling a General and Efficient FPGA Mapping Solution," in Proceedings of the 7th ACM/SIGDA International Symposium of FPGAs, pp. 29-35, Feb. 1999.
7. O. Coudert, "On Solving Binate Covering Problems," in Proceedings of the 33rd Design Automation Conference, pp. 197-202, Jun. 1996.
8. R. E. Gonzalez, "Xtensa: A Configurable and Extensible Processor," IEEE Micro, vol. 20(2), pp. 60-70, Mar. 2000.
9. A. Grasselli and F. Luccio, "A Method for Minimizing the Number of Internal States in Incompletely Specified Machines," IEEE Transactions on Electronic Computers, vol. 14(3), pp. 350-359, Jun. 1965.
10. S. Hauck, T.W. Fry, M.M. Hosler, and J.P. Kao, "The Chimaera Reconfigurable Functional Unit," in Proceedings of Annual IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 87-96, Apr. 1997.
11. J. L. Hennessy and D. A. Patterson, "Computer Architecture: A Quantitative Approach, Second Edition," Morgan Kaufmann Publishers, San Francisco, 1996.
12. R. M. Karp, "Reducibility Among Combinatorial Problems," Tech. Rep #3, EECS Department, University of California, Berkeley, Apr. 1972.
13. R. Kastner, A. Kaplan, S. Ogrenci Memik, and E. Bozorgzaden, "Instruction Generation for Hybrid Reconfigurable Systems," ACM Transactions on Design Automation of Electronic Systems, vol. 7, pp. 605-627, Oct. 2002.
14. K. Keutzer and D. Richards, "Computational Complexity of Logic Synthesis and Optimization," in Proceedings of International Workshop on Logic Synthesis, May 1989.
15. K. Keutzer, "DAGON: Technology Binding and Local Optimization by DAG Matching," in Proceedings of the 24th Design Automation Conference, pp. 341-347, Jun. 1987.
16. S. Liao, S. Devadas, K. Keutzer, and S. Tjiang, "Instruction Selection Using Binate Covering for Code Size Optimization," in Proceedings of International Conference on Computer Aided Design, pp. 393-399, Nov. 1995.
17. B. D. McKay, "Practical Graph Isomorphism," Congressus Numerantium, vol 30, pp. 45-87, 1981.
18. G. D. Micheli, "Synthesis and Optimization of Digital Circuits," McGraw-Hill, 1994.
19. A. Peymandoust, L. Pozzi, P. Ienne, and G. De Micheli, "Automatic Instruction-Set Extension and Utilization for Embedded Processors," in Proceedings of the 14th International Conference on Application-specific Systems, Architectures and Processors, Jun. 2003.
20. R. L. Rudell, "Logic Synthesis for VLSI Design," Ph.D. Thesis, U. C. Berkeley, ERL Memo 89/49, 1989.
21. D. C. Schmidt and L. E. Druffel, "A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices," Journal of the ACM, vol. 23 no. 3, pp. 433-445, Jul. 1976.
22. M. B. Srivastava and M. Potkonjak, "Optimum and Heuristic Transformation Techniques for Simultaneous Optimization of Latency and Throughput," IEEE Transactions on VLSI Systems, vol. 3, no. 1, pp. 2-19, Mar. 1995.
23. V. Zivojinovic, J. M. Velarde, C. Schlager, and H. Meyr, "DSPStone - A DSP-oriented Benchmarking Methodology," in Proceedings of International Conference on Signal Processing Application Technology, pp. 715-720, Oct. 1994.
24. Altera Corp., http://www.altera.com.
25. Nauty Package, http://cs.anu.edu.au/people/bdm/nauty.
26. SUIF Compiler, http://suif.stanford.edu.
27. Tensilica Inc., http://www.tensilica.com.