Extended Instruction Exploration for Multiple-Issue Architectures

被引:1
|
作者
Wu, I-Wei [1 ]
Shann, Jean Jyh-Jiun [1 ]
Hsu, Wei-Chung [2 ]
Chung, Chung-Ping [1 ]
机构
[1] Natl Chiao Tung Univ, Hsinchu, Taiwan
[2] Natl Taiwan Univ, Taipei, Taiwan
关键词
Algorithms; Design; Performance; Extended instruction (EI); instruction set extension (ISE); multiple-issue architecture; customizable processor; application-specific instruction-set processor (ASIP); GENERATION; PROCESSOR; SET; EXTENSION;
D O I
10.1145/2560039
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In order to satisfy the growing demand for high-performance computing in modern embedded devices, several architectural and microarchitectural enhancements have been implemented in processor architectures. Extended instruction (EI) is often used for architectural enhancement, while issuing multiple instructions is a common approach for microarchitectural enhancement. The impact of combining both of these approaches in the same design is not well understood. While previous studies have shown that EI can potentially improve performance in some applications on certain multiple-issue architectures, the algorithms used to identify EI for multiple-issue architectures yield only limited performance improvement. This is because not all arithmetic operations are suited for EI for multiple-issue architectures. To explore the full potential of EI for multiple-issue architectures, two important factors need to be considered: (1) the execution performance of an application is dominated by critical (located on the critical path) and highly resource-contentious (i.e., having a high probability of being delayed during execution due to hardware resource limitations) operations, and (2) an operation may become critical and/or highly resource contentious after some operations are added to the EI. This article presents an EI exploration algorithm for multiple-issue architectures that focuses on these two factors. Simulation results show that the proposed algorithm outperforms previously published algorithms.
引用
收藏
页数:28
相关论文
共 50 条
  • [1] Instruction set extension exploration in multiple-issue architecture
    Wu, I-Wei
    Chen, Zhi-Yuan
    Shann, Jyh-Jiun
    Chung, Chung-Ping
    2008 DESIGN, AUTOMATION AND TEST IN EUROPE, VOLS 1-3, 2008, : 680 - 685
  • [2] Non-sequential instruction cache prefetching for multiple-issue processors
    Veidenbaum, AV
    Zhao, QB
    Shameer, A
    INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 1999, 10 (01): : 115 - 140
  • [3] Optimal basic block instruction scheduling for multiple-issue processors using constraint programming
    Malik, Abid M.
    McInnes, Jim
    van Beek, Peter
    INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2008, 17 (01) : 37 - 54
  • [4] Optimal basic block instruction scheduling for multiple-issue processors using constraint programming
    Malik, Abid M.
    McInnes, Jim
    van Beek, Peter
    ICTAI-2006: EIGHTEENTH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, : 279 - +
  • [5] Cooperative procedures for multiple-issue negotiations
    Raith, MG
    OPERATIONS RESEARCH PROCEEDINGS 1999, 2000, : 220 - 225
  • [6] Multiple-issue bargaining and axiomatic solutions
    Ponsati, C
    Watson, J
    INTERNATIONAL JOURNAL OF GAME THEORY, 1997, 26 (04) : 501 - 524
  • [7] Multiple-issue bargaining and axiomatic solutions
    Clara Ponsati
    Joel Watson
    International Journal of Game Theory, 1997, 26 : 501 - 524
  • [8] MULTIPLE-ISSUE BALLOT IN SCHOOL TAX ELECTIONS
    WARDLE, OD
    PHI DELTA KAPPAN, 1977, 58 (05) : 426 - 426
  • [9] Concurrent multiple-issue negotiation for Internet-based services
    Dang, Jiangbo
    Huhns, Michael N.
    IEEE INTERNET COMPUTING, 2006, 10 (06) : 42 - 49
  • [10] An energy-efficient adaptive multiple-issue architecture
    Lan, M
    Biglari-Abhari, M
    PROCEEDINGS OF THE EUROMICRO SYSTEMS ON DIGITAL SYSTEM DESIGN, 2004, : 350 - 357