知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

52 records (took 0.053 seconds)

    LOCATING FILE DATA FROM A MAPPING FILE
    22.
    发明申请
    LOCATING FILE DATA FROM A MAPPING FILE 有权
    从映射文件定位文件数据

    公开(公告)号：US20150088882A1

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

    申请号：US14542760

    申请日：2014-11-17

    Applicant: HITACHI DATA SYSTEMS ENGINEERING UK LIMITED

    Inventor： David Stephen HARTMAN ,  Thomas Andrew GLASS ,  Shantanu SINHA ,  Ben BERNHARD ,  Oleg KISELEV ,  James MATTLY

    IPC: G06F17/30 ,  H04L29/08

    CPC classification number: G06F17/30194 ,  G06F9/45533 ,  G06F9/4881 ,  G06F9/50 ,  G06F9/5005 ,  G06F9/5027 ,  G06F9/5038 ,  G06F9/5072 ,  G06F17/30091 ,  H04L12/1881 ,  H04L29/08 ,  H04L29/08117 ,  H04L29/08135 ,  H04L41/0803 ,  H04L61/2007 ,  H04L67/1097

    Abstract: In some examples, a distributed system may include a plurality of nodes with a file stored in a file system across the plurality of nodes. One of the nodes may receive a request for location data corresponding to a part of the file. For instance, the location data may be included in a mapping file, and the request may specify an offset of the mapping file. The mapping file may include locations of nodes storing parts of the file in the file system across the plurality of nodes, and the mapping file may have a plurality of parts corresponding to the parts of the file. In response to the request, the node may access the mapping file and send location data corresponding to the offset of the mapping file. The location data may indicate at least one of the nodes storing the part of the file.

    Abstract translation: 在一些示例中，分布式系统可以包括具有存储在跨越多个节点的文件系统中的文件的多个节点。 节点中的一个可以接收对应于文件的一部分的位置数据的请求。 例如，位置数据可以被包括在映射文件中，并且该请求可以指定映射文件的偏移。 映射文件可以包括在多个节点之间存储文件系统中的文件的部分的节点的位置，并且映射文件可以具有与文件的部分相对应的多个部分。 响应于该请求，节点可以访问映射文件并发送与映射文件的偏移相对应的位置数据。 位置数据可以指示存储文件的一部分的节点中的至少一个。

    Apparatus for Managing a Plurality of Root Nodes for File Systems
    23.
    发明申请
    Apparatus for Managing a Plurality of Root Nodes for File Systems 有权
    用于管理文件系统的多个根节点的设备

    公开(公告)号：US20140074808A1

    公开(公告)日：2014-03-13

    申请号：US14079162

    申请日：2013-11-13

    Applicant: Hitachi Data Systems Engineering UK Limited

    Inventor： Geoffrey S. Barrall ,  Simon L. Benham ,  Trevor E. Willis ,  Christopher J. Aston

    IPC: G06F17/30

    CPC classification number: G06F12/0246 ,  G06F17/30088 ,  G06F17/30203 ,  G06F17/3023 ,  Y10S707/99945 ,  Y10S707/99948

    Abstract: Apparatus for managing a plurality of root nodes may include a file server coupled to a storage device, wherein a first root node is operable to identify a previous version of an object of a file system and to relate to a plurality of data blocks forming a portion of the object, a second root node is operable to identify a current version of the object and to relate to a data block of the plurality of data blocks and a new data block of the object, and the storage device is operable to store the plurality of data blocks and the new data block. Apparatus for managing a plurality of root nodes alternatively may include a file system board operable to manage a plurality of root nodes, a first root node being operable to identify the a previous version of a file system and to relate to a plurality of data blocks of the file system, and a second root node being operable to identify the a current version of the file system and to relate to a data block of the plurality of data blocks and a new data block of the file system.

    Abstract translation: 用于管理多个根节点的装置可以包括耦合到存储装置的文件服务器，其中第一根节点可操作以识别文件系统的对象的先前版本，并且涉及形成部分的多个数据块 所述第二根节点可操作以识别所述对象的当前版本并涉及所述多个数据块中的数据块和所述对象的新数据块，并且所述存储设备可操作以存储所述多个数据块 的数据块和新的数据块。 用于管理多个根节点的装置可以包括可操作以管理多个根节点的文件系统板，第一根节点可操作以识别文件系统的先前版本，并且涉及多个数据块 所述文件系统和第二根节点可操作以识别所述文件系统的当前版本并涉及所述多个数据块中的数据块和所述文件系统的新数据块。

    System for queue based object cloning
    25.
    发明授权
    System for queue based object cloning 有权

    公开(公告)号：US10311152B2

    公开(公告)日：2019-06-04

    申请号：US15105196

    申请日：2013-12-20

    Applicant: HITACHI DATA SYSTEMS ENGINEERING UK LIMITED

    Inventor： Neil Berrington ,  Hoc D Ngo

    IPC: G06F17/30

    Abstract: A file cloning process allows for quickly cloning files within a filesystem, such as when a user makes a copy of a directory containing files and subdirectories of files. A priority based main queue is filled by a depth first traversal of the directory to be copied with work items corresponding to files and subdirectories. Worker threads refer to the main queue for file cloning, subdirectory copying and directory traversal. Files that have not been modified since a most recent checkpoint are cloned without issuing a checkpoint request. Files that have been modified since the most recent checkpoint are moved to a delay queue. Once a checkpoint of the file system completes, the files in the delay queue are then moved to the main queue to retry cloning thereof. A secondary queue is also provided to prevent worker threads from becoming deadlocked in the main queue.

    Object-level replication of cloned objects in a data storage system
    26.
    发明授权
    Object-level replication of cloned objects in a data storage system 有权

    公开(公告)号：US10311151B2

    公开(公告)日：2019-06-04

    申请号：US14768317

    申请日：2013-02-21

    Applicant: Hitachi Data Systems Engineering UK Limited

    Inventor： Zahra Tabaaloute ,  James Gibbs ,  Daniel Picken ,  Jonathan Teh

    IPC: G06F17/30 ,  H04L29/08 ,  G06F11/20

    Abstract: Object-level replication of cloned objects from a source file system to a target file system in a data storage system maintains relationships between related objects including shared data blocks so that storage requirements in the target file system match storage requirements of the source file system. Specialized processing may be used to scan an indirection object that refers to other file system objects such that objects requiring replication can be identified on an incremental basis based on checkpoint numbers. Checkpoints in the target file system are managed so that checkpoint number requirements for replicated clone objects are enforced in the target file system.

    Method and Apparatus to Enable Finer-Grained, Scalable Allocation of Storage in a Data Storage System
    30.
    发明申请
    Method and Apparatus to Enable Finer-Grained, Scalable Allocation of Storage in a Data Storage System 审中-公开
    方法和装置，使数据存储系统中存储的细粒度，可扩展的分配

    公开(公告)号：US20150370823A1

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

    申请号：US14764648

    申请日：2013-02-01

    Applicant: HITACHI DATA SYSTEMS ENGINEERING UK LIMITED

    Inventor： Mark Stephen Laker

    IPC: G06F17/30 ,  G06F3/06

    Abstract: In one aspect, the invention is directed to a method of expanding storage for filesystems in a fine-grained, scalable manner. The method includes determining, by a file server, a run bias for a span, wherein the run bias indicates a number of contiguous chunks of memory associated with an entry in an address translation table for a filesystem. The method includes receiving, by the file server, a request for an expansion of memory for the filesystem. The method includes scoring, by the chunk allocator, each stripe set in a group of stripe sets based at least in part on a number of unused chunks on the stripeset and a number of chunks on the stripeset being used by the filesystem. The method includes allocating, by the chunk allocator, a chunk on the stripeset with the highest score, wherein the allocated chunk lies outside of runs reserved for other filesystems.

    Abstract translation: 一方面，本发明涉及一种以细粒度，可扩展的方式扩展文件系统的存储的方法。 该方法包括由文件服务器确定跨度的运行偏差，其中运行偏移指示与文件系统的地址转换表中的条目相关联的多个连续的存储器块的数量。 该方法包括由文件服务器接收对文件系统的存储器的扩展请求。 该方法包括至少部分地基于条带集上的多个未使用的块和文件系统正在使用的条带上的多个块的数量，通过块分配器对一组条带集中的每个条带集进行评分。 所述方法包括由所述块分配器分配具有最高分数的条带上的块，其中所分配的块位于为其他文件系统预留的运行之外。

Patent Agency Ranking