標題: AN OPTIMAL INSTRUCTION SCHEDULER FOR SUPERSCALAR PROCESSOR
作者: CHOU, HC
CHUNG, CP
交大名義發表
資訊科學與工程研究所
National Chiao Tung University
Institute of Computer Science and Engineering
關鍵字: PIPELINE PROCESSORS;SEQUENCING AND SCHEDULING;OPTIMIZATION;PRUNE AND SEARCH;AND NP-COMPLETENESS
公開日期: 1-三月-1995
摘要: Performance in superscalar processing strongly depends on the compiler's ability to generate codes that can be executed by hardware in an optimal or near optimal order, Generating optimal code is an NP-complete problem. However, there is a need for highly optimized code, such as in superscalar or real-time systems, In this paper, an instruction scheduling scheme for optimizing a program trace is proposed. Optimized code can be arrived at without much redundant work, if some important features in code are well explored and utilized in scheduling. To formalize the task, two abstract models, one for a superscalar processor and the other for a program trace, are given, These two models reflect most of the characteristics of the scheduling problem. The interrelations between instructions and partial schedules are thoroughly studied, and dominance and equivalence relations on them are defined, These relations are then used to reduce the solution space and eventually help to produce optimal schedules. The results of experiments that show the promise of the proposed scheme are also presented.
URI: http://dx.doi.org/10.1109/71.372778
http://hdl.handle.net/11536/2014
ISSN: 1045-9219
DOI: 10.1109/71.372778
期刊: IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
Volume: 6
Issue: 3
起始頁: 303
結束頁: 313
顯示於類別:期刊論文


文件中的檔案:

  1. A1995QM58100006.pdf