English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 49633/84879 (58%)
造訪人次 : 7694301      線上人數 : 60
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/68451

    題名: Optimization on instruction reorganization
    作者: Lai, F.;李鴻璋;Lee, H. C.;Lee, C. L.
    貢獻者: 淡江大學資訊管理學系
    日期: 1990-11
    上傳時間: 2011-10-23 12:57:07 (UTC+8)
    出版者: IEEE
    摘要: A pipelined processor increases its performance by partitioning an instruction into several separate operation steps. Several instructions can be executed in the pipeline in different pipe stages at the same time. Because of the overlapped execution of instructions, the result of an instruction may be used before it is available. One way to solve this problem is to schedule instructions at compiler time, thus the codes generated will be free from interlocks. The scheduling algorithm presented by T. Gross (1983) and J. Hennessy and T. Gross (1983) had significantly reduced the pipeline interlocks. With some modifications to distinguish the conflict condition, the algorithm does better at the same cost.
    關聯: 1990 ACM & IEEE the 23rd international symposium and workshop on Microprogramming and Microarchitecture(Micro-23), pp.143-148
    DOI: 10.1109/MICRO.1990.151436
    顯示於類別:[資訊管理學系暨研究所] 會議論文





    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋