Effective compilation support for Variable Instruction Set Architecture

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn 2002-January, Issue , 2002, Pages 56-67

  Liu, J ^a   Kong, T ^a   Chow, F ^a  

^a Cognigine Corporation ^*  (United States)

Author keywords

Application specific processors; Computer architecture; Dictionaries; Embedded software; Hardware; Instruction sets; Lifting equipment; Processor scheduling; Program processors; Runtime

Indexed keywords

APPLICATION PROGRAMS; AUTOMATIC PROGRAMMING; BUDGET CONTROL; CODES (SYMBOLS); COMPUTER HARDWARE; COMPUTER SOFTWARE REUSABILITY; ECONOMIC AND SOCIAL EFFECTS; EMBEDDED SOFTWARE; GLOSSARIES; NETWORK COMPONENTS; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS; PROGRAM PROCESSORS; SCHEDULING;

APPLICATION SPECIFIC PROCESSORS; INSTRUCTION SET; LIFTING EQUIPMENTS; PROCESSOR SCHEDULING; RUNTIMES;

COMPUTER ARCHITECTURE;

EID: 3042692405     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACT.2002.1106004     Document Type: Conference Paper

References (19)

1. The ARCtangent-A4 Microprocessor Core. ARC International.
2. Xtensa Overview Handbook. Tensilica Inc.
3. CGN16100 Network Processor User Manual. Cognigine Corp., 2002.
4. S. Abraham, W. Meleis, and I. Baev. Efficient backtracking instruction schedulers. In Intl. Conf. on Parallel Architectures and Compilation Techniques, pages 301-308, October 2000.
5. D. Bernstein, M. Rodeh, and I. Gertner. On the complexity of scheduling problems for parallel/pipelined machines. IEEE Transaction on Computers, 38(9):1308-1313, September 1989.
6. R. Darkin. A tree search algorithm for mixed integer programming problems. Computer Journal, 8:250-255, 1965.
7. S. Davidson, D. Landskov, B. Shriver, and P. Mallett. Some experiments in local microcode compaction for horizontal machines. IEEE Transaction on Computers, C-30(7):460-477, July 1981.
8. G. Gao, J. Amaral, J. Dehnert, and R. Towle. The sgi pro64 compiler infrastructure. Tutorial, International Conference on Parallel Architectures and Compilation Techniques, October 2000.
9. J. Jonsson and K. Shin. A parameterized branch-and-bound strategy for scheduling precedence-constraint tasks on a multiprocessor system. In Proc. of the Int'l Conf. on Parallel Processing, pages 158-165. IEEE, August 1997.
10. M. Langevin and E. Cerny. A recursive technique for computing lower-bound performance of schedules. ACM Transactions on Design Automation of Electronic Systems, 1(4):443-456, October 1996.
11. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann, 1997.
12. M. Narasimhan and J. Ramanujam. A fast approach to computing exact solutions to the resource-constrained scheduling problem. ACM Transactions on Design Automation of Electronic Systems, 6(4):490-500, October 2001.
13. G. Nemhauser and L. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, Inc., 1988.
14. M. Rim and R. Jain. Lower-bound performance estimation for the high-level synthesis scheduling problem. IEEE Transactions on Computer-Aided Design, 13(4):451-458, April 1994.
15. S. Talla. Adaptive explicitly parallel instruction computing. PhD thesis, New York University, December 2000.
16. J. Wagner and R. Leupers. C compiler design for an industrial network processor. In Proceedings of the ACM SIG- PLAN Workshop on Languages, Compilers and Tools for Embedded Systems (LCTES 2001), June 2001.
17. K. Wilken, J. Liu, and M. Heffernan. Optimal instruction scheduling using integer programming. In Programming Language Design and Implementation, pages 121-133. ACM SIGPLAN, June 2000.
18. H. Williams. Model building in mathematical programming. John Wiley & Sons, Inc., 1993.
19. L. Wolesey. Integer Programming. John Wiley & Sons, Inc., 1998.