| 指令Cache的替换策略 |
| |
| 引用本文： | 邢二保,周兴铭.指令Cache的替换策略[J].计算机学报,1993,16(6):424-430. |
| |
| 作者姓名： | 邢二保 周兴铭 |
| |
| 作者单位： | 国防科学技术大学计算机科学系，国防科学技术大学计算机科学系 长沙 410073，长沙 410073 |
| |
| 摘 要： | 本文用理论分析和程序模拟的方法分析了指令Cache的替换策略和组织,用程序的循环模式研究了Cache的替换策略和组织,得出随机替换策略优于LRU和FIFO策略,在一定条件下,直接相联和组相联优于全相联映象算法,分析指令踪迹模拟结果表明,循环模式是Cache行为的较好的解释。
|
| 关 键 词： | Cache 指令 替换策略 |
INSTRUCTION CACHE REPLACEMENT POLICIES |
| |
| Xing Erbao and Zhou XingmingDept,of Computer Science,National University of Defence Technology,Changsha.INSTRUCTION CACHE REPLACEMENT POLICIES[J].Chinese Journal of Computers,1993,16(6):424-430. |
| |
| Authors: | Xing Erbao and Zhou XingmingDept of Computer Science National University of Defence Technology Changsha |
| |
| Affiliation: | Xing Erbao and Zhou XingmingDept,of Computer Science,National University of Defence Technology,Changsha 410073 |
| |
| Abstract: | Instruction cache replacement policies and organization are analyzed both theoretically and experimentally.A loop modol of program is used to study replacement policies and cache organization.It is concluded theoretically that random replacement is better than LRU and FIFO,and under certain circumstances,a direct-mapped or set-associative cache may perform better than a fully-associative cache organization.Experimental results using instruction trace data are then given and analyzed.The experimental results indicate that the loop model provides a good explanation for observed cache performance. |
| |
| Keywords: | Cache memory replacement algorithms direct-mapped fully associative set-associative |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
