IMPORT, EXPORT, AND COPY MANAGEMENT FOR TIERED OBJECT STORAGE

    公开(公告)号:US20180373745A1

    公开(公告)日:2018-12-27

    申请号:US15633599

    申请日:2017-06-26

    Abstract: In one embodiment, a method includes receiving, at a centralized index operating in a cloud environment via a messaging bus, first events spawned by a first processor managing an object store accessible via the cloud environment. The method also includes receiving, at the centralized index, second events spawned by a second processor managing an archival store accessible via the cloud environment. Also, the method includes normalizing metadata in the first and second events. Moreover, the method includes indexing and storing the metadata in the centralized index. The object store and the archival store operate in different object subsystems of the cloud environment. Other systems, methods, and computer program products are described for managing import, export, and copy of data within a public tiered object storage environment in accordance with more embodiments.

    Clone file backup and restore
    35.
    发明授权

    公开(公告)号:US10049121B2

    公开(公告)日:2018-08-14

    申请号:US14672936

    申请日:2015-03-30

    Abstract: In an approach to backup and restore one or more clone file trees, one or more processors generate a clone management table. One or more processors record a clone management information in the clone management table about each clone file. To backup a clone file, one or more processors update the clone management information, and store one or more data blocks that are in the clone file trees. To restore a clone file, one or more processors analyze a clone management information and restore one or more data blocks in the clone file. To restore a clone file parent, one or more processors analyze a clone management information and restore one or more data blocks in the clone file parent. To restore a clone file tree, one or more processors analyze a clone management information and restore one or more data blocks in the clone file tree.

    COMPRESSED DATA LAYOUT WITH VARIABLE GROUP SIZE

    公开(公告)号:US20170177602A1

    公开(公告)日:2017-06-22

    申请号:US14970636

    申请日:2015-12-16

    CPC classification number: H03M7/3077

    Abstract: The embodiments described herein relate to managing compressed data to optimize file compression. A compression is performed on a first set of data to create a first set of compressed data partitions in a compression group. A partition table is constructed, and partition entries for the first data block are added to the table in conjunction with the first set. A current size of the compression group is assessed. In response to a compression ratio being greater than a target compression ratio and internal fragmentation of the compression group being smaller than a threshold, the compression group is dynamically completed. The dynamic completion decides a size for the compression group. The partition table is added to the compression group by assigning space within the first compression group for the table. The compression group is written to persistent storage.

    SCALABLE FILE MANAGEMENT FOR A SHARED FILE SYSTEM
    37.
    发明申请
    SCALABLE FILE MANAGEMENT FOR A SHARED FILE SYSTEM 有权
    用于共享文件系统的可扩展文件管理

    公开(公告)号:US20130086135A1

    公开(公告)日:2013-04-04

    申请号:US13685593

    申请日:2012-11-26

    CPC classification number: G06F17/3007 G06F17/30129 G06F17/30165

    Abstract: Managing a shared file system comprising a directory and files stored on a multiple storage devices shared by plural processing nodes, is provided. A plurality of parallel directory traversal records are partitioned into a plurality of ranges to allow for the records in each range to be written independently in parallel by plural processing nodes during parallel directory traversal. Parallel operations are performed comprising parallel directory traversal of all directory paths and files in the shared file system.

    Abstract translation: 提供了一种共享文件系统,包括目录和存储在多个处理节点共享的多个存储设备上的文件。 多个并行目录遍历记录被分割成多个范围,以允许在并行目录遍历期间由多个处理节点独立地并行写入每个范围中的记录。 执行并行操作,包括并行目录遍历共享文件系统中的所有目录路径和文件。

    Policy-based, multi-scheme data reduction for computer memory

    公开(公告)号:US11113245B2

    公开(公告)日:2021-09-07

    申请号:US16047322

    申请日:2018-07-27

    Abstract: Embodiments relate to policy-based, multi-scheme data reduction for a computer memory. An aspect includes receiving a plurality of policy rules by a policy engine of the computer memory, wherein a first policy rule specifies applying a first data reduction scheme to data in the computer memory based on the data matching first characteristics, wherein a second policy rule specifies applying a second data reduction scheme to data in the computer memory based on the data matching second characteristics, wherein the first data reduction scheme is different from the second data reduction scheme. Another aspect includes determining, by the policy engine, that first data in the computer memory matches the first characteristics, and that second data in the computer memory matches the second characteristics. Yet another aspect includes applying the first data reduction scheme to the first data, and applying the second data reduction scheme to the second data.

    Compressed data rearrangement to optimize file compression

    公开(公告)号:US10803018B2

    公开(公告)日:2020-10-13

    申请号:US14970592

    申请日:2015-12-16

    Abstract: The embodiments described herein relate to managing compressed data to optimize file compression. A first compression is performed on a first set of data to create first compressed data. The first compressed data is stored in one or more blocks of a first compression group. A size of free space of a last block of the first compression group is discovered and calculated. A second compression is performed on a second set of data to create second compressed data. At least a portion of the second compressed data is supplied to the first compression group for padding into the last block in response to determining that the size of the free space is sufficient. An unpadded portion of the second compressed data is stored in one or more blocks of a second compression group.

Patent Agency Ranking