检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科学技术大学计算机学院,长沙410073
出 处:《计算机工程》2012年第24期228-234,共7页Computer Engineering
基 金:国家"973"计划基金资助项目(2007CB310901);国家自然科学基金资助项目(60803041;60873212)
摘 要:在线程级猜测中进行数据依赖相关检测时,存在Cache一致性协议无法容忍线程切换引起的Cache块替换等问题。为此,通过分析推测线程数据管理模型,结合推测线程切概率低的特点,提出一种分布-共享式恢复缓冲区结构。该结构在进行Cache一致性检验时结合作废向量和版本优先级寄存器进行数据依赖检测,利用L2 Cache进行推测数据缓冲和恢复以支持推测线程切换。修改SESC模拟器以验证和评估该存储体系结构。实验结果表明,在保持模拟器理想加速比的情况下,该存储体系结构可以较好地支持推测线程切换。In order to remove the restrictions that the global arbiter is hard to implement and Thread-level Speculation(TLS) runtime can not swap speculative threads out of their host processors when using Cache coherence protocol.By analyzing the speculative data management policy in TLS,it is found that the buffer for modified data for each speculative thread is small and the possibility of speculative threads being swapped out of their host cores is so small that can be neglected.This paper designs a shared-distributed memory system.The proposed memory system uses invalidation vectors and speculation version priority registers for data dependence checking when doing cache coherence checking.A flat of memory in the L2 Cache is reserved to buffer and restore the data modified by the speculative threads,which makes speculative swapping possible.The paper modifies the SESC simulator to confirm the performance and correctness of the proposed memory system.Experimental results show that when keeping the ideal speedups,the proposed memory system can support speculative thread swapping very well.
关 键 词:线程级猜测 CACHE一致性协议 存储系统设计 缓冲区恢复 作废向量 版本优先级寄存器
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117