中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

8 records (took 0.019 seconds)

    MANAGEMENT OF STORAGE RESOURCE CAPACITY
    1.
    发明申请
    MANAGEMENT OF STORAGE RESOURCE CAPACITY 审中-公开
    存储资源容量管理

    公开(公告)号：WO2007071557A3

    公开(公告)日：2007-08-09

    申请号：PCT/EP2006069343

    申请日：2006-12-05

    Applicant: IBM ,  IBM UK ,  CHEN ZHIFENG ,  GONZALES CESAR ,  IYER BALAKRISHNA RAGHAVENDRA ,  POFF DAN ,  ROBINSON JOHN TIMOTHY

    Inventor： CHEN ZHIFENG ,  GONZALES CESAR ,  IYER BALAKRISHNA RAGHAVENDRA ,  POFF DAN ,  ROBINSON JOHN TIMOTHY

    IPC: G06F3/06

    CPC classification number: G06F3/0644 ,  G06F3/0608 ,  G06F3/0674

    Abstract: A method for increasing virtual storage capacity in on-demand storage systems utilizes data compression to selectively compress data stored in a storage resource to reduce the utilization of physical storage space whenever such physical resources have been over committed and the demand for physical storage exceeds its availability. In one exemplary embodiment, the utilization of the capacity of a shared storage resource is monitored and data is selected for compression based on the utilization. The compression of the selected data is triggered in response to the monitoring results. In addition, policies and rules are defined that determine which data is selected for compression. For example, the selection of data may be based on one or more of the following: a degree of utilization of said capacity of said shared storage resource, a volume size of said data, an indicator of compressibility of said data, a frequency of use of said data, a manual selection of said data, and a predefined priority of said data. The disclosed methods improve the operation of virtual allocation by further enhancing the availability of physical space through data compression. Virtual allocation and block-based data compression techniques are utilized to improve storage efficiency with a minimal risk to system availability and reliability and with a minimal impact to access time and latency.

    Abstract translation: 一种用于增加按需存储系统中的虚拟存储容量的方法利用数据压缩来选择性地压缩存储在存储资源中的数据，以便每当这样的物理资源被过度提交并且对物理存储的需求超过其可用性时减少物理存储空间的利用 。 在一个示例性实施例中，监视共享存储资源的容量利用率并基于利用率选择数据进行压缩。 响应监测结果触发选定数据的压缩。 另外，定义了确定选择哪些数据进行压缩的策略和规则。 例如，数据的选择可以基于以下中的一个或多个：所述共享存储资源的所述容量的利用程度，所述数据的卷大小，所述数据的可压缩性的指示符，使用频率 所述数据的手动选择，以及所述数据的预定优先级。 所公开的方法通过数据压缩进一步增强物理空间的可用性来改善虚拟分配的操作。 利用虚拟分配和基于块的数据压缩技术来提高存储效率，同时将系统可用性和可靠性风险降至最低，并且对访问时间和延迟的影响最小。

    5.
    发明专利
    未知

    公开(公告)号：DE69512459T2

    公开(公告)日：2000-05-04

    申请号：DE69512459

    申请日：1995-04-07

    Applicant: IBM

    Inventor： FRANASZEK PETER ANTHONY ,  ROBINSON JOHN TIMOTHY ,  THOMASIAN ALEXANDER

    IPC: G06F3/06 ,  G06F11/10 ,  G06F12/08

    Abstract: A system for writing data to a disk array includes a cache memory coupled to the disk array for storing data indicative of locations on the disk array and parity blocks associated with parity groups including the locations. Each of the parity blocks includes an identifier indicative of locations within a particular parity group which are protected by the parity data. Write logic reads the identifier from the parity block, and based thereon, determines whether a disk location is not protected by the parity data. The write logic also writes to the location and updates the parity data and the identifier associated with the parity block to include the location of the data block to indicate that the location is protected.

    6.
    发明专利
    未知

    公开(公告)号：DE69512459D1

    公开(公告)日：1999-11-04

    申请号：DE69512459

    申请日：1995-04-07

    Applicant: IBM

    Inventor： FRANASZEK PETER ANTHONY ,  ROBINSON JOHN TIMOTHY ,  THOMASIAN ALEXANDER

    IPC: G06F3/06 ,  G06F11/10 ,  G06F12/08

    Abstract: A system for writing data to a disk array includes a cache memory coupled to the disk array for storing data indicative of locations on the disk array and parity blocks associated with parity groups including the locations. Each of the parity blocks includes an identifier indicative of locations within a particular parity group which are protected by the parity data. Write logic reads the identifier from the parity block, and based thereon, determines whether a disk location is not protected by the parity data. The write logic also writes to the location and updates the parity data and the identifier associated with the parity block to include the location of the data block to indicate that the location is protected.

Patent Agency Ranking