Aggressive scheduling for memory accesses of CISC superscalar microprocessors
檔案
- 000171597200006.pdf (5.10 MB, Adobe PDF)
日期
2001-09-01
類型
系所
期刊名稱
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING
卷期與頁次
第 17 卷第 5 期,頁 787–803
ISSN
1016-2364
語言
英文
摘要
For CISC microprocessors, the proportion of memory access instructions is relatively high, and a specific address is likely to be accessed repeatedly in a short period of time because of register-to-memory or memory-to-memory instruction set architectures and limited register sets. As superscalar architectures advance, an aggressive scheduling policy for memory access becomes crucial. In this paper, we examine the scheduling policies of loads/stores on CISC superscalar processors and develop an aggressive scheduling policy called preload. The preload scheduling policy allows loads to precede the earlier unsolved pending stores, and delays the checking of conflict and forwarding of data until the data is loaded, thereby allowing greater tolerance of the latency for address generation. Because of its popularity, we focus our attention on the x86 instruction set. Simulation results show that the preload achieves a higher performance in comparison with the traditional scheduling policies such as load bypassing and load forwarding. Furthermore, by reducing the pipeline stages, the preload can achieve even higher performance.
所屬典藏
期刊論文引用此條目
Shiu, R., Hwang, H., & Shann, J. (2001). Aggressive scheduling for memory accesses of CISC superscalar microprocessors. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 17(5), 787–803. https://ir.lib.nycu.edu.tw/handle/11536/29446
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/29446