PRUNING OF SERVER DUPLICATION INFORMATION FOR EFFICIENT CACHING
    1.
    发明申请
    PRUNING OF SERVER DUPLICATION INFORMATION FOR EFFICIENT CACHING 审中-公开
    对高效缓存服务器重用信息的修改

    公开(公告)号:US20150134625A1

    公开(公告)日:2015-05-14

    申请号:US14079549

    申请日:2013-11-13

    Applicant: NetApp, Inc.

    CPC classification number: G06F16/215 H04L67/2857

    Abstract: Technology is disclosed for improving the storage efficiency and communication efficiency for a storage client device by maximizing the cache hit rate and minimizing data requests to the storage server. The storage server provides a duplication list to the storage client device. The duplication list contains references (e.g. storage addresses) to data blocks that contain duplicate data content. The storage client uses the duplication list to improve the cache hit rate. The duplication list is pruned to contain references to data blocks relevant to the storage client device. The storage server can prune the duplication list based on a working set of storage objects for a client. Alternatively, the storage server can prune the duplication list based on content characteristics, e.g. duplication degree and access frequency. Duplicate blocks to which the client does not have access can be excluded from the duplication list.

    Abstract translation: 公开了用于通过最大化高速缓存命中率和最小化对存储服务器的数据请求来提高存储客户端设备的存储效率和通信效率的技术。 存储服务器向存储客户端设备提供复制列表。 复制列表包含对包含重复数据内容的数据块的引用(例如存储地址)。 存储客户端使用复制列表来提高缓存命中率。 复制列表被修剪以包含对与存储客户端设备相关的数据块的引用。 存储服务器可以根据客户机的一组存储对象来修剪复制列表。 或者,存储服务器可以基于内容特征修剪复制列表,例如, 重复度和访问频率。 客户端无法访问的重复块可以从复制列表中排除。

Patent Agency Ranking