片上多处理器共享Cache的访存时间最优划分方法  

Optimal memory time Cache partitioning in chip-multiprocessors

作　　者：李浩[1] 谢伦国[1] 

机构地区：[1]国防科技大学计算机学院,湖南长沙410073

出　　处：《通信学报》2012年第4期136-142,共7页Journal on Communications

摘　　要：提出的访存时间最优Cache划分(OMTP,optimal memory time Cache partitioning)方法通过特征获取部件来获取不同应用程序的平均失效开销和Cache命中的路分布情况,以此作为划分依据来给竞争程序分配合适的Cache空间,达到优化程序整体执行性能的目的。实验结果表明,OMTP方法相比基于利用率的Cache划分(UCP)方法吞吐率平均提高3.1%,加权加速比平均提高1.3%,整体性能更优。Optimal memory time Cache partitioning（OMTP） was proposed.The OMTP can get the average access in-validation overheads of different application and Cache line distributation about Cache hit through the characteristic ob-tain unit.According to which the OMTP can allocate proper Cache capacity to competitive process,so the overall per-formance of the program can achieve optimizied.The experiment results showed that OMTP had higher miss rate com-pared with utility-based Cache partitioning（UCP）,but it had better IPC throughput and weighted speedup,OMTP im-proved throughput by average 3.1% and weighted speedup by average 1.3% over UCP.

关 键 词：片上多处理器 共享CACHE CACHE划分 访存时间最优划分 

分 类 号：TP302[自动化与计算机技术—计算机系统结构]