Method, system, and product (using multiple data structures to manage data in cache)
    1.
    发明专利
    Method, system, and product (using multiple data structures to manage data in cache) 有权
    方法,系统和产品(使用多个数据结构来管理缓存中的数据)

    公开(公告)号:JP2008027444A

    公开(公告)日:2008-02-07

    申请号:JP2007186509

    申请日:2007-07-18

    CPC classification number: G06F12/124 G06F12/123

    Abstract: PROBLEM TO BE SOLVED: To provide a method, a system, and a program for using multiple data structures to manage data in cache. SOLUTION: A plurality of data structures each have entries identifying data from a first computer readable medium added to a second computer readable medium. A request is received for data in the first computer readable medium. A determination is made as to whether there is an entry for the requested data in one of the data structures. The requested data is retrieved from the first computer readable medium to store in the second computer readable medium in response to determining that there is no entry for the requested data in one of the data structures. One of the data structures is selected in response to determining that there is no entry for the requested data in one of the data structures and an entry for the retrieved data is added to the selected data structure. COPYRIGHT: (C)2008,JPO&INPIT

    Abstract translation: 要解决的问题:提供一种使用多个数据结构来管理缓存中的数据的方法,系统和程序。 解决方案:多个数据结构各自具有标识来自添加到第二计算机可读介质的第一计算机可读介质的数据的条目。 接收第一计算机可读介质中的数据的请求。 确定在数据结构之一中是否存在所请求的数据的条目。 响应于确定在数据结构之一中没有针对所请求的数据的条目,从第一计算机可读介质检索所请求的数据以存储在第二计算机可读介质中。 响应于确定在数据结构之一中没有针对所请求的数据的条目而选择数据结构中的一个,并且将所检索的数据的条目添加到所选择的数据结构。 版权所有(C)2008,JPO&INPIT

    Decoupling storage controller cache read replacement from write retirement
    2.
    发明专利
    Decoupling storage controller cache read replacement from write retirement 审中-公开
    解除存储控制器缓存从写入退款中读取替换

    公开(公告)号:JP2007141225A

    公开(公告)日:2007-06-07

    申请号:JP2006285563

    申请日:2006-10-19

    CPC classification number: G06F12/123 G06F12/0866 G06F12/127

    Abstract: PROBLEM TO BE SOLVED: To provide a system for more efficient cache management discard/destage policies.
    SOLUTION: In data storage, data are temporarily stored in a cache, with write data being stored in a first cache and a second cache and read data being stored in a second cache. When a list for holding entries for the first cache is full, the list is scanned to identify unmodified (read) data which can be discarded from the cache to make room for new data. Prior to or during the scan, modified (write) data entries are moved to the most recently used (MRU) end of the list, allowing the scans to proceed in an efficient manner and reducing the number of times the scan has to skip over modified entries. Optionally, a status bit may be linked with each modified data entry.
    COPYRIGHT: (C)2007,JPO&INPIT

    Abstract translation: 要解决的问题:提供一种更有效的缓存管理丢弃/流出策略的系统。 解决方案:在数据存储中,将数据临时存储在高速缓存中,其中写入数据存储在第一高速缓存和第二高速缓存中,读取数据被存储在第二高速缓存中。 当用于保存第一缓存的条目的列表已满时,扫描该列表以识别可以从高速缓存中丢弃的未修改(读取)数据,从而为新数据腾出空间。 在扫描之前或期间,修改(写入)数据条目移动到列表的最近使用(MRU)端,允许扫描以有效的方式继续进行,并减少扫描必须跳过修改的次数 条目。 可选地,状态位可以与每个修改的数据条目相关联。 版权所有(C)2007,JPO&INPIT

    Intelligent write caching for sequential tracks

    公开(公告)号:GB2513557A

    公开(公告)日:2014-11-05

    申请号:GB201306281

    申请日:2011-08-18

    Applicant: IBM

    Abstract: In a computing storage environment for destaging data from nonvolatile storage (NVS) to a storage unit, write caching for sequential tracks by a processor device is provided. When a first track is determined to be sequential, and an earlier track is also determined to be sequential, a temporal bit associated with the earlier track is cleared to allow for destage of data of the earlier track. If a temporal bit for one of a plurality of additional tracks in one of a plurality of strides in a modified cache is determined to be not set, a stride associated with the one of the plurality of additional tracks is selected for a destage operation. If the NVS exceeds a predetermined storage threshold, a predetermined one of the plurality of strides is selected for the destage operation.

Patent Agency Ranking