RELOCATING INFREQUENTLY-ACCESSED DYNAMIC RANDOM ACCESS MEMORY (DRAM) DATA TO NON-VOLATILE STORAGE
    1.
    发明申请
    RELOCATING INFREQUENTLY-ACCESSED DYNAMIC RANDOM ACCESS MEMORY (DRAM) DATA TO NON-VOLATILE STORAGE 审中-公开
    将非常接触的动态随机存取存储器(DRAM)数据转移到非易失存储器

    公开(公告)号:US20150206574A1

    公开(公告)日:2015-07-23

    申请号:US14160618

    申请日:2014-01-22

    CPC classification number: G11C14/0018 G06F13/1636 G11C11/406 Y02D10/14

    Abstract: A method includes emptying a first region of a dynamic random access memory of data by moving data from the first region to a non-volatile memory and reducing a refresh rate of the dynamic random access memory responsive to emptying the first region of data. A system includes a memory controller to refresh a dynamic random access memory based on a configurable refresh rate, the dynamic random access memory having a plurality of regions, each region having an associated minimum refresh rate, and a processing unit to empty a first region of the plurality of regions of the dynamic random access memory by moving data from the first region to a non-volatile memory and to reduce the configurable refresh rate responsive to emptying the first region.

    Abstract translation: 一种方法包括通过将数据从第一区域移动到非易失性存储器来清空数据的动态随机存取存储器的第一区域,并且响应于排空第一数据区域而减小动态随机存取存储器的刷新率。 一种系统包括:存储器控制器,用于基于可配置刷新速率来刷新动态随机存取存储器,所述动态随机存取存储器具有多个区域,每个区域具有相关联的最小刷新率;以及处理单元, 动态随机存取存储器的多个区域通过将数据从第一区域移动到非易失性存储器并且响应于排空第一区域而减小可配置的刷新率。

    Cache miss predictor
    2.
    发明授权

    公开(公告)号:US11860787B2

    公开(公告)日:2024-01-02

    申请号:US17490739

    申请日:2021-09-30

    Abstract: Methods, devices, and systems for retrieving information based on cache miss prediction. A prediction that a cache lookup for the information will miss a cache is made based on a history table. The cache lookup for the information is performed based on the request. A main memory fetch for the information is begun before the cache lookup completes, based on the prediction that the cache lookup for the information will miss the cache. In some implementations, the prediction includes comparing a first set of bits stored in the history table with a second set of bits stored in the history table. In some implementations, the prediction includes comparing at least a portion of an address of the request for the information with a set of bits in the history table.

Patent Agency Ranking