首页> 外国专利> Mechanism and apparatus allowing an N-way set associative cache, implementing a hybrid pseudo-LRU replacement algorithm, to have N L1 miss fetch requests simultaneously inflight regardless of their congruence class

Mechanism and apparatus allowing an N-way set associative cache, implementing a hybrid pseudo-LRU replacement algorithm, to have N L1 miss fetch requests simultaneously inflight regardless of their congruence class

机译:允许实现混合伪LRU替换算法的N路集关联高速缓存同时进行N L1个未命中提取请求的机制和装置,无论其同等类如何

摘要

A method, system, and computer program product for supporting multiple fetch requests to the same congruence class in an n-way set associative cache. Responsive to receiving an incoming fetch instruction at a load/store unit, outstanding valid fetch entries in the n-way set associative cache that have the same cache congruence class as the incoming fetch instruction are identified. SetIDs in used by these identified outstanding valid fetch entries are determined. A resulting setID is assigned to the incoming fetch instruction based on the identified setIDs, wherein the resulting setID assigned is a setID not currently in use by the outstanding valid fetch entries. The resulting setID for the incoming fetch instruction is written in a corresponding entry in the n-way set associative cache.
机译:一种方法,系统和计算机程序产品,用于在n路集关联缓存中支持对同一同等类的多个获取请求。响应于在加载/存储单元处接收到传入的提取指令,在n路集合关联缓存中识别出与传入的提取指令具有相同的缓存一致性类的未完成的有效提取条目。确定这些已标识的未完成有效获取条目使用的SetID。基于所标识的setID,将结果setID分配给传入的提取指令,其中,分配的结果setID是未完成的有效获取条目当前未使用的setID。传入的提取指令的结果setID被写入n路集关联缓存中的相应条目中。

著录项

相似文献

  • 专利
  • 外文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号