An X86 load/store unit with aggressive scheduling of load/store operations
檔案
本條目沒有附加檔案。
日期
1998
類型
系所
期刊名稱
1998 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS
卷期與頁次
頁 496–503
ISBN
0-8186-8603-0
語言
英文
摘要
Because of register-memory instruction set architecture and limited register set, there are significant amounts of memory access instructions in x86 microprocessors. As the higher issue degree of superscalar microprocessor is provided, an aggressive scheduling policy of load/store operations becomes crucial. In this paper, we examine the scheduling policies of loads/stores on x86 superscalar microprocessors and propose a new aggressive scheduling policy called load speculation, which allows loads to precede the previous unsolved pending stores. Simulation results show that the load speculation achieves the higher performance in comparison with the traditional scheduling policies such as load bypassing and load forwarding. Furthermore, by reducing the pipeline stages, the load speculation can achieve even higher performance.
所屬典藏
會議論文引用此條目
Hwang, H., Shiu, R., & Shann, J. (1998). An X86 load/store unit with aggressive scheduling of load/store operations. 1998 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 496–503. https://ir.lib.nycu.edu.tw/handle/11536/19597
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/19597