中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

4 records (took 0.014 seconds)

    ERASURE CODING AND REPLICATION IN STORAGE CLUSTERS
    2.
    发明申请
    ERASURE CODING AND REPLICATION IN STORAGE CLUSTERS 有权
    存储集群中的擦除编码和复制

    公开(公告)号：US20150363269A1

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

    申请号：US14834017

    申请日：2015-08-24

    Applicant: Caringo, Inc.

    Inventor： Don BAKER ,  Paul R.M. CARPENTIER ,  Andrew KLAGER ,  Aaron PIERCE ,  Jonathan RING ,  Russell TURPIN ,  David YOAKLEY

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

    CPC classification number: G06F11/1076 ,  G06F3/0605 ,  G06F3/0619 ,  G06F3/0632 ,  G06F3/064 ,  G06F3/065 ,  G06F3/0667 ,  G06F3/067 ,  G06F3/0683 ,  G06F11/10 ,  G06F11/14 ,  H03M13/05 ,  H03M13/25 ,  H03M13/251 ,  H03M13/2707 ,  H03M13/353 ,  H03M13/356 ,  H03M13/373 ,  H03M13/3761 ,  H04L67/1095 ,  H04L67/1097

    Abstract: A cluster receives a request to store an object using replication or erasure coding. The cluster writes the object using erasure coding. A manifest is written that includes an indication of erasure coding and a unique identifier for each segment. The cluster returns a unique identifier of the manifest. The cluster receives a request from a client that includes a unique identifier. The cluster determines whether the object has been stored using replication or erasure coding. If using erasure coding, the method reads a manifest. The method identifies segments within the cluster using unique segment identifiers of the manifest. Using these unique segment identifiers, the method reconstructs the object. A persistent storage area of another disk is scanned to find a unique identifier of a failed disk. If using erasure coding, a missing segment previously stored on the disk is identified. The method locates other segments. Missing segments are regenerated.

    Abstract translation: 集群使用复制或擦除编码接收存储对象的请求。 集群使用擦除编码写入对象。 写入清单，其包括擦除编码的指示和每个段的唯一标识符。 集群返回清单的唯一标识符。 集群从包含唯一标识符的客户端接收请求。 集群确定对象是否已使用复制或擦除编码进行存储。 如果使用擦除编码，则该方法读取清单。 该方法使用清单的唯一段标识符来识别群集中的段。 使用这些唯一的段标识符，该方法重建对象。 扫描另一个磁盘的持久存储区域以找到故障磁盘的唯一标识符。 如果使用擦除编码，则会识别先前存储在磁盘上的缺失段。 该方法定位其他段。 缺少段重新生成。

    ADAPTIVE POWER CONSERVATION IN STORAGE CLUSTERS
    4.
    发明申请
    ADAPTIVE POWER CONSERVATION IN STORAGE CLUSTERS 有权
    存储群中的自适应功率保存

    公开(公告)号：US20150127967A1

    公开(公告)日：2015-05-07

    申请号：US14599312

    申请日：2015-01-16

    Applicant: Caringo, Inc.

    Inventor： James E. DUTTON ,  Laura ARBILLA ,  David YOAKLEY

    IPC: G06F1/32 ,  G06F1/08

    CPC classification number: G06F1/3296 ,  G06F1/08 ,  G06F1/32 ,  G06F1/3221 ,  G06F1/3268 ,  G06F1/3287 ,  G06F3/0625 ,  G06F3/0634 ,  G06F3/067 ,  Y02D10/154 ,  Y02D10/171

    Abstract: Each node and volume in a storage cluster makes a decision whether to reduce power consumption based on lack of requests from client applications and nodes over a time period. Node configuration parameters determine how long to wait until idling a node or volume, and how long to wait while idle before performing integrity checks. A bid value is calculated by each node and reflects how much it will cost for that node to write a file, read a file, or keep a copy. A node with the lowest bid wins, and nodes that are idle have a premium added to each bid to ensure that idle nodes are kept idle. In an archive mode, writes bids are reversed, nodes with less capacity submit lower bids, fuller nodes fill up faster and are then idled, while empty or near empty nodes may remain idle before winning a write bid.

    Abstract translation: 存储集群中的每个节点和卷决定是否根据客户端应用程序和节点在一段时间内的请求不足来降低功耗。 节点配置参数确定要等待多长时间才能空转节点或卷，以及在执行完整性检查之前空闲等待多长时间。 出价值由每个节点计算，并反映该节点写入文件，读取文件或保留副本所需的费用。 具有最低出价的节点获胜，并且空闲的节点对每个出价添加溢价，以确保空闲节点保持空闲。 在存档模式下，写入出价相反，容量较小的节点提交出价较低，更充分的节点填充更快，然后空闲，而空的或接近空的节点可能在赢得写出价之前保持空闲。

Patent Agency Ranking