会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 8. 发明申请
    • METHOD AND SYSTEM FOR MAXIMUM RESIDENCY REPLACEMENT OF CACHE MEMORY
    • 用于缓存存储器最大容量替换的方法和系统
    • WO2007137141A2
    • 2007-11-29
    • PCT/US2007/069188
    • 2007-05-17
    • QUALCOMM INCORPORATEDAHMED, Muhammad
    • AHMED, Muhammad
    • G06F12/123G06F12/0859G06F12/126G06F12/128Y02D10/13
    • Techniques for use in CDMA-based products and services, including replacing cache memory allocation so as to maximize residency of a plurality of set ways following a tag-miss allocation. Herein, steps forming a first-in, first-out (FIFO) replacement listing of victim ways for the cache memory, wherein the depth of the FIFO replacement listing approximately equals the number of ways in the cache set. The method and system place a victim way on the FIFO replacement listing only in the event that a tag-miss results in a tag-miss allocation, the victim way is placed at the tail of the FIFO replacement listing after any previously selected victim way. Use of a victim way on the FIFO replacement listing is prevented in the event of an incomplete prior allocation of the victim way by, for example, stalling a reuse request until such initial allocation of the victim way completes or replaying a reuse request until such initial allocation of the victim way completes.
    • 在基于CDMA的产品和服务中使用的技术,包括替换高速缓存存储器分配,以便在标签错失分配之后最大化多个设置路径的驻留。 这里,形成用于高速缓冲存储器的受害方式的先入先出(FIFO)替换列表的步骤,其中FIFO替换列表的深度近似等于高速缓存集中的路数。 只有在标签错失导致标签错失分配的情况下,该方法和系统才会将受害者的方式置于FIFO替换列表中,受害者的方式将放置在先前选择的受害方式之后的FIFO替换列表的尾部。 在受害者方式的不完整的先前分配的情况下,通过停止重用请求直到受害方的初始分配完成或重放重用请求直到这样的初始化 受害方的分配完成。