公开(公告)号：US09223713B2

公开(公告)日：2015-12-29

申请号：US13906291

申请日：2013-05-30

Applicant: Hewlett-Packard Development Company, L.P.

Inventor： Weimin Pan

IPC: G06F12/08

CPC classification number: G06F12/0873 ,  G06F2212/1024 ,  G06F2212/601

Abstract: A technique for allocating a write cache allowed data size of a write cache from a plurality of write caches to each of a plurality of storage volumes, calculating a write cache utilization of the write cache for each of the respective storage volumes, wherein the write cache utilization is based on a write cache dirty data size of the write cache allocated to the respective storage volume divided by the write cache allowed data size of the write cache allocated to the respective storage volume, and adjusting the write cache allowed data size of the write cache allocated to storage volumes based on the write cache utilization of the write cache of the storage volumes.

Abstract translation: 一种用于分配写高速缓存的技术，允许从多个写高速缓存到多个存储卷中的每一个的写高速缓存的数据大小，计算每个相应存储卷的写高速缓存的写高速缓存利用率，其中写缓存 利用率基于分配给相应存储卷的写缓存的写缓存脏数据大小除以分配给相应存储卷的写缓存的写高速缓存允许数据大小，并且调整写高速缓存允许写数据大小 基于存储卷的写缓存的写高速缓存利用率，缓存分配给存储卷。

公开(公告)号：US08990509B2

公开(公告)日：2015-03-24

申请号：US13625624

申请日：2012-09-24

Applicant: Hewlett-Packard Development Company

Inventor： Weimin Pan

IPC: G06F12/08

CPC classification number: G06F12/08 ,  G06F3/061 ,  G06F3/0658 ,  G06F3/0689

Abstract: Embodiments herein relate to selecting an accelerated path based on a number of write requests and a sequential trend. One of an accelerated path and a cache path is selected between a host and a storage device based on at least one of a number of write requests and a sequential trend. The cache path connects the host to the storage device via a cache. The number of write requests is based on a total number of random and sequential write requests from a set of outstanding requests from the host to the storage device. The sequential trend is based on a percentage of sequential read and sequential write requests from the set of outstanding requests.

Abstract translation: 本文的实施例涉及基于多个写入请求和顺序趋势来选择加速路径。 基于多个写入请求和顺序趋势中的至少一个，在主机和存储设备之间选择加速路径和高速缓存路径之一。 缓存路径通过缓存将主机连接到存储设备。 写入请求数是基于从主机到存储设备的一组未完成请求的随机和顺序写入请求的总数。 顺序趋势基于来自一组未完成请求的顺序读取和顺序写入请求的百分比。

公开(公告)号：US20140208155A1

公开(公告)日：2014-07-24

申请号：US13748923

申请日：2013-01-24

Applicant: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.

Inventor： Weimin Pan

IPC: G06F11/20

CPC classification number: G06F11/2087 ,  G06F11/004 ,  G06F11/1088 ,  G06F11/1092 ,  G06F11/2053 ,  G06F11/2094

Abstract: A method that includes identifying an inaccessible portion of a first disk drive. The method also includes regenerating data corresponding to the inaccessible portion of the first disk drive and storing the regenerated data to a second disk drive. The method also includes copying data from an accessible portion of the first disk drive to the second disk drive.

Abstract translation: 一种包括识别第一磁盘驱动器的不可访问部分的方法。 该方法还包括再生对应于第一磁盘驱动器的不可访问部分的数据，并将再生数据存储到第二磁盘驱动器。 该方法还包括将数据从第一磁盘驱动器的可访问部分复制到第二磁盘驱动器。

公开(公告)号：US09009526B2

公开(公告)日：2015-04-14

申请号：US13748923

申请日：2013-01-24

Applicant: Hewlett-Packard Development Company, L.P.

Inventor： Weimin Pan

IPC: G06F11/00 ,  G06F11/20 ,  G06F11/10

CPC classification number: G06F11/2087 ,  G06F11/004 ,  G06F11/1088 ,  G06F11/1092 ,  G06F11/2053 ,  G06F11/2094

Abstract: A method that includes identifying an inaccessible portion of a first disk drive. The method also includes regenerating data corresponding to the inaccessible portion of the first disk drive and storing the regenerated data to a second disk drive. The method also includes copying data from an accessible portion of the first disk drive to the second disk drive.

Abstract translation: 一种包括识别第一磁盘驱动器的不可访问部分的方法。 该方法还包括再生对应于第一磁盘驱动器的不可访问部分的数据，并将再生数据存储到第二磁盘驱动器。 该方法还包括将数据从第一磁盘驱动器的可访问部分复制到第二磁盘驱动器。

公开(公告)号：US20150081967A1

公开(公告)日：2015-03-19

申请号：US14030930

申请日：2013-09-18

Applicant: Hewlett-Packard Development Company, L.P.

Inventor： Weimin Pan

IPC: G06F3/06

CPC classification number: G06F3/0656 ,  G06F3/061 ,  G06F3/064 ,  G06F3/0659 ,  G06F3/0689

Abstract: A storage controller to receive from a host multiple read requests to read sets of data blocks from a data storage device. The storage controller to determine whether the read requests include non-continuous addresses associated with a set of non-requested data blocks between sets of requested data blocks and a gap of a number of non-requested data blocks is less than a pre-defined threshold. If the read requests have non-continuous addresses and a gap of a number of non-requested data blocks is less than the pre-defined threshold, then generate a single read request to retrieve from a storage device the non-requested and requested data blocks, and directly write the retrieved requested data blocks to a host buffer, and write the retrieved non-requested data blocks to a cache memory on a storage controller.

Abstract translation: 存储控制器，用于从主机接收多个读取请求以从数据存储设备读取数据块集合。 所述存储控制器确定所述读取请求是否包括与所请求的数据块的组之间的一组未请求的数据块相关联的非连续地址以及多个未请求的数据块的间隙是否小于预定阈值 。 如果读取请求具有非连续地址并且多个未请求的数据块的间隙小于预定义的阈值，则生成单个读取请求以从存储设备检索未请求和请求的数据块 并且将检索到的所请求的数据块直接写入主机缓冲器，并将检索到的非请求数据块写入存储控制器上的高速缓冲存储器。

公开(公告)号：US08972645B2

公开(公告)日：2015-03-03

申请号：US13622942

申请日：2012-09-19

Applicant: Hewlett-Packard Development Company

Inventor： Weimin Pan ,  Mark Lyndon Oelke

IPC: G06F13/36 ,  G06F13/00 ,  G06F13/28

CPC classification number: G06F12/0888 ,  G06F11/1076 ,  G06F11/3419 ,  G06F11/3433 ,  G06F11/3485 ,  G06F11/349 ,  G06F12/0868 ,  G06F2201/81 ,  G06F2201/885 ,  G06F2212/1024

Abstract: Embodiments herein relate to sending a request to a storage device based on a moving average. A threshold is determined based on a storage device type and a bandwidth of a cache bus connecting a cache to a controller. The moving average of throughput is measured between the storage device and a host. The request of the host to access the storage device is sent directly to the storage device, if the moving average is equal to the threshold.

Abstract translation: 本文的实施例涉及基于移动平均线向存储设备发送请求。 基于将缓存连接到控制器的高速缓存总线的存储设备类型和带宽来确定阈值。 在存储设备和主机之间测量吞吐量的移动平均值。 如果移动平均值等于阈值，则主机访问存储设备的请求被直接发送到存储设备。

公开(公告)号：US20140215147A1

公开(公告)日：2014-07-31

申请号：US13750896

申请日：2013-01-25

Applicant: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.

Inventor： Weimin Pan

IPC: G06F11/00

CPC classification number: G06F11/1092

Abstract: A storage management module configured to identify storage volumes to be rebuilt and remaining storage volumes that are not to be rebuilt, calculate rebuild priority information for the identified storage volumes to be rebuilt based on storage information of the identified storage volumes, and generate rebuild requests to rebuild the identified storage volumes to be rebuilt and process host requests directed to the remaining and to be rebuilt storage volumes based on the rebuild priority information and amount of host requests, wherein with relative high amount of host requests, generate relative less rebuild requests but not less than a minimum rebuild traffic percentage or more than a maximum rebuild traffic percentage.

Abstract translation: 存储管理模块，其被配置为识别要重建的存储卷和不被重建的剩余存储卷，基于所识别的存储卷的存储信息来计算要重建的所识别的存储卷的重建优先级信息，并且生成重建请求 重建要重建的已识别存储卷，并根据重建优先级信息和主机请求数量处理指向剩余和要重建的存储卷的主机请求，其中相对较高的主机请求量生成相对较少的重建请求但不生成 小于最小重建流量百分比或超过最大重建流量百分比。

公开(公告)号：US20160154743A1

公开(公告)日：2016-06-02

申请号：US14786474

申请日：2013-06-25

Applicant: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.

Inventor： Weimin Pan ,  Mark J. Thompson

IPC: G06F12/12 ,  G06F12/08

CPC classification number: G06F12/12 ,  G06F12/0804 ,  G06F12/0868 ,  G06F2212/1016

Abstract: Disclosed herein are a system, non-transitory computer readable medium, and method to reduce input and output transactions. It is determined whether a first set of dirty data, a second set of dirty data, and a number of data blocks therebetween can be flushed with one transaction.

Abstract translation: 本文公开了一种减少输入和输出事务的系统，非暂时计算机可读介质和方法。 确定第一组脏数据，第二组脏数据集和它们之间的数据块数是否可以用一次交易刷新。

公开(公告)号：US09317436B2

公开(公告)日：2016-04-19

申请号：US13923370

申请日：2013-06-21

Applicant: Hewlett-Packard Development Company, L P.

Inventor： Weimin Pan

IPC: G06F12/08

CPC classification number: G06F12/0871 ,  G06F12/0804 ,  G06F12/0868

Abstract: A technique for cache node processing that includes generating a cache node in response to a request to write data to storage devices. If logical block address (LBA) of the generated cache node is adjacent to LBA of cache nodes of a cache node list, then check if there are cache nodes that are sequential up to a predefined boundary. If there are cache nodes that are sequential up to the predefined boundary, then flush the data of the sequential cache nodes together as a group up to the predefined boundary.

Abstract translation: 一种用于缓存节点处理的技术，其包括响应于将数据写入存储设备的请求而产生高速缓存节点。 如果生成的高速缓存节点的逻辑块地址（LBA）与高速缓存节点列表的高速缓存节点的LBA相邻，则检查是否存在连续到预定边界的高速缓存节点。 如果存在连续到预定义边界的缓存节点，则将顺序高速缓存节点的数据作为一组清除到预定边界。

公开(公告)号：US20140379990A1

公开(公告)日：2014-12-25

申请号：US13923370

申请日：2013-06-21

Applicant: Hewlett-Packard Development Company, L.P.

Inventor： Weimin Pan

IPC: G06F12/08

CPC classification number: G06F12/0871 ,  G06F12/0804 ,  G06F12/0868

Abstract: A technique for cache node processing that includes generating a cache node in response to a request to write data to storage devices. If logical block address (LBA) of the generated cache node is adjacent to LBA of cache nodes of a cache node list, then check if there are cache nodes that are sequential up to a predefined boundary. If there are cache nodes that are sequential up to the predefined boundary, then flush the data of the sequential cache nodes together as a group up to the predefined boundary.

Abstract translation: 一种用于缓存节点处理的技术，其包括响应于将数据写入存储设备的请求而产生高速缓存节点。 如果生成的高速缓存节点的逻辑块地址（LBA）与高速缓存节点列表的高速缓存节点的LBA相邻，则检查是否存在连续到预定边界的高速缓存节点。 如果存在连续到预定义边界的缓存节点，则将顺序高速缓存节点的数据作为一组清除到预定边界。