知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

23 records (took 0.023 seconds)

    SYSTEM AND METHOD FOR DATA REPLICATION USING A SINGLE MASTER FAILOVER PROTOCOL
    4.
    发明申请
    SYSTEM AND METHOD FOR DATA REPLICATION USING A SINGLE MASTER FAILOVER PROTOCOL 审中-公开
    使用单一主机故障转移协议进行数据复制的系统和方法

    公开(公告)号：US20150363124A1

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

    申请号：US14834392

    申请日：2015-08-24

    Applicant: Amazon Technologies, Inc.

    Inventor： TIMOTHY ANDREW RATH ,  JAKUB KULESZA ,  DAVID ALAN LUTZ

    IPC: G06F3/06 ,  H04L29/08

    CPC classification number: H04L41/0668 ,  G06F3/0617 ,  G06F3/0653 ,  G06F3/0659 ,  G06F3/0683 ,  G06F11/1425 ,  G06F11/1662 ,  G06F11/2028 ,  G06F11/2041 ,  G06F11/2048 ,  G06F11/2094 ,  G06F11/2097 ,  G06F2201/825 ,  H04L67/1097 ,  H04L67/16

    Abstract: A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of various partitions that are stored on respective computing nodes in the system. The system may employ a single master failover protocol, usable when a replica attempts to become the master replica for a replica group of which it is a member. Attempting to become the master replica may include acquiring a lock associated with the replica group, and gathering state information from the other replicas in the group. The state information may indicate whether another replica supports the attempt (in which case it is included in a failover quorum) or stores more recent data or metadata than the replica attempting to become the master (in which case synchronization may be required). If the failover quorum includes enough replicas, the replica may become the master.

    Abstract translation: 实现数据存储服务的系统可以代表存储服务客户端存储数据。 系统可以将数据保存在存储在系统中各个计算节点上的各种分区的多个副本中。 系统可以使用单个主故障切换协议，当副本尝试成为其所属的副本组的主副本时可用。 尝试成为主副本可能包括获取与副本组相关联的锁，以及从组中的其他副本收集状态信息。 状态信息可以指示另一个副本是否支持尝试（在这种情况下它被包括在故障切换仲裁中），或存储比尝试成为主机的副本更多的最新数据或元数据（在这种情况下可能需要同步）。 如果故障转移仲裁包含足够的副本，副本可能会成为主服务器。

    SYSTEM AND METHOD FOR ADJUSTING MEMBERSHIP OF A DATA REPLICATION GROUP
    5.
    发明申请
    SYSTEM AND METHOD FOR ADJUSTING MEMBERSHIP OF A DATA REPLICATION GROUP 审中-公开
    用于调整数据复制组成员的系统和方法

    公开(公告)号：US20150301901A1

    公开(公告)日：2015-10-22

    申请号：US14754564

    申请日：2015-06-29

    Applicant: Amazon Technologies, Inc.

    Inventor： TIMOTHY ANDREW RATH ,  JAKUB KULESZA ,  DAVID ALAN LUTZ

    IPC: G06F11/14 ,  G06F17/30

    CPC classification number: G06F11/1451 ,  G06F11/1425 ,  G06F11/2094 ,  G06F11/2097 ,  G06F17/30557 ,  G06F17/30575 ,  G06F17/30578

    Abstract: A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of partitions that are stored on respective computing nodes in the system. A master replica for a replica group may increment a membership version indicator for the group, and may propagate metadata (including the membership version indicator) indicating a membership change for the group to other members of the group. Propagating the metadata may include sending a log record containing the metadata to the other replicas to be appended to their respective logs. Once the membership change becomes durable, it may be committed. A replica attempting to become the master of a replica group may determine that another replica in the group has observed a more recent membership version, in which case logs may be synchronized or snipped, or the attempt may be abandoned.

    Abstract translation: 实现数据存储服务的系统可以代表存储服务客户端存储数据。 系统可以在存储在系统中的相应计算节点上的分区的多个副本中维护数据。 副本组的主副本可以增加组的成员版本指示符，并且可以向组的其他成员传播指示组的成员变化的元数据（包括成员版本指示符）。 传播元数据可以包括将包含元数据的日志记录发送到要附加到其各自日志的其他副本。 一旦成员变更变得持久，可能会被提交。 尝试成为副本组的主人的副本可能会确定组中的另一个副本已经观察到更新的成员身份版本，在这种情况下，日志可以被同步或剪切，或尝试可能被放弃。

    STATELESS DATASTORE-INDEPENDENT TRANSACTIONS
    7.
    发明申请
    STATELESS DATASTORE-INDEPENDENT TRANSACTIONS 有权
    无条件数据独立交易

    公开(公告)号：US20160070740A1

    公开(公告)日：2016-03-10

    申请号：US14482661

    申请日：2014-09-10

    Applicant: AMAZON TECHNOLOGIES, INC.

    Inventor： ALLAN HENRY VERMEULEN ,  TIMOTHY ANDREW RATH ,  TIMOTHY DANIEL COLE ,  KIRAN-KUMAR MUNISWAMY-REDDY

    IPC: G06F17/30

    CPC classification number: G06F17/30283 ,  G06F17/30348 ,  G06F17/30353 ,  G06F17/30368 ,  G06F17/30377 ,  G06F17/30545 ,  G06F17/30578 ,  G06F17/30958

    Abstract: At a client-side component of a storage group, a read descriptor generated in response to a read request directed to a first data store is received. The read descriptor includes a state transition indicator corresponding to a write that has been applied at the first data store. A write descriptor indicative of a write that depends on a result of the read request is generated at the client-side component. The read descriptor and the write descriptor are included in a commit request for a candidate transaction at the client-side component, and transmitted to a transaction manager.

    Abstract translation: 在存储组的客户端组件中，接收响应于针对第一数据存储的读请求而生成的读描述符。 读取描述符包括与在第一数据存储处应用的写入相对应的状态转换指示符。 在客户端组件处产生指示取决于读取请求的结果的写入的写入描述符。 读取描述符和写描述符被包括在客户端组件的候选事务的提交请求中，并被发送到事务管理器。

    STORAGE DEVICE SELECTION FOR DATABASE PARTITION REPLICAS
    8.
    发明申请
    STORAGE DEVICE SELECTION FOR DATABASE PARTITION REPLICAS 审中-公开
    存储设备选择数据库分区复制

    公开(公告)号：US20150269239A1

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

    申请号：US14733887

    申请日：2015-06-08

    Applicant: Amazon Technologies, Inc.

    Inventor： BJORN PATRICK SWIFT ,  WEI XIAO ,  STUART HENRY SEELYE MARSHALL ,  STEFANO STEFANI ,  TIMOTHY ANDREW RATH ,  DAVID ALAN LUTZ

    IPC: G06F17/30

    CPC classification number: G06F17/30584 ,  G06F17/30575

    Abstract: A system that implements a data storage service may store data in multiple replicated partitions on respective storage nodes. The selection of the storage nodes (or storage devices thereof) on which to store the partition replicas may be performed by administrative components that are responsible for partition management and resource allocation for respective groups of storage nodes (e.g., based on a global view of resource capacity or usage), or the selection of particular storage devices of a storage node may be determined by the storage node itself (e.g., based on a local view of resource capacity or usage). Placement policies applied at the administrative layer or storage layer may be based on the percentage or amount of provisioned, reserved, or available storage or IOPS capacity on each storage device, and particular placements (or subsequent operations to move partition replicas) may result in an overall resource utilization that is well balanced.

    Abstract translation: 实现数据存储服务的系统可以将数据存储在相应存储节点上的多个复制分区中。 存储分区副本的存储节点（或其存储设备）的选择可以由负责相应组的存储节点的分区管理和资源分配的管理组件执行（例如，基于资源的全局视图 容量或使用），或存储节点的特定存储设备的选择可以由存储节点本身（例如，基于资源容量或用途的本地视图）来确定。 在管理层或存储层应用的布局策略可以基于每个存储设备上的配置，保留或可用存储或IOPS容量的百分比或数量，以及特定的展示位置（或后续的移动分区副本的操作）可能导致 整体资源利用情况良好。

    SYSTEM AND METHOD FOR THROTTLING SERVICE REQUESTS USING WORK-BASED TOKENS
    9.
    发明申请
    SYSTEM AND METHOD FOR THROTTLING SERVICE REQUESTS USING WORK-BASED TOKENS 审中-公开
    使用基于工作的玩具来扭转服务要求的系统和方法

    公开(公告)号：US20150156123A1

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

    申请号：US14617671

    申请日：2015-02-09

    Applicant: Amazon Technologies, Inc.

    Inventor： WEI XIAO ,  DAVID ALAN LUTZ ,  TIMOTHY ANDREW RATH ,  MAXIMILIANO MACCANTI ,  MIGUEL MASCARENHAS FILIPE ,  DAVID CRAIG YANACEK

    IPC: H04L12/819 ,  H04L12/801

    CPC classification number: H04L47/215 ,  H04L47/12 ,  H04L67/327

    Abstract: A system that provides services to clients may receive and service requests, various ones of which may require different amounts of work. An admission control mechanism may manage requests based on tokens, each of which represents a fixed amount of work. The tokens may be added to a token bucket at rate that is dependent on a target work throughput rate while the number of tokens in the bucket does not exceed its maximum capacity. If at least a pre-determined minimum number of tokens is present in the bucket when a service request is received, it may be serviced. Servicing a request may include deducting an initial number of tokens from the bucket, determining that the amount of work performed in servicing the request is different than that represented by the initially deducted tokens, and deducting additional tokens from or replacing tokens in the bucket to reflect the difference.

    Abstract translation: 向客户端提供服务的系统可以接收和服务请求，其中各种可能需要不同的工作量。 准入控制机制可以管理基于令牌的请求，每个代表固定的工作量。 令牌可以以取决于目标工作吞吐率的速率添加到令牌桶中，而桶中的令牌数量不超过其最大容量。 如果当接收到服务请求时，至少在桶中存在至少一个预先确定的令牌，则可以对其进行维修。 服务请求可以包括从桶中扣除初始数量的令牌，确定在服务请求中执行的工作量与最初扣除的令牌所表示的工作量不同，并从桶中扣除额外的令牌或替换令牌以反映 区别。

    SYSTEM AND METHOD FOR SPLITTING A REPLICATED DATA PARTITION
    10.
    发明申请
    SYSTEM AND METHOD FOR SPLITTING A REPLICATED DATA PARTITION 审中-公开
    分离数据分段的系统和方法

    公开(公告)号：US20150120658A1

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

    申请号：US14589884

    申请日：2015-01-05

    Applicant: Amazon Technologies, Inc.

    Inventor： TIMOTHY ANDREW RATH ,  JAKUB KULESZA ,  DAVID ALAN LUTZ

    IPC: G06F17/30

    CPC classification number: G06F17/30584 ,  G06F17/30215 ,  G06F17/30575

    Abstract: A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of partitions that are stored on respective computing nodes in the system. The system may split a data partition into two new partitions, and may split the replica group that stored the original partitions into two new replica groups, each storing one of the new partitions. To split the replica group, the master replica may propagate membership changes to the other members of the replica group for adding members to the original replica group and for splitting the expanded replica group into two new replica groups. Subsequent to the split, replicas may attempt to become the master for the original replica group or for a new replica group. If an attempt to become master replica for the original replica group succeeds, the split may fail.

    Abstract translation: 实现数据存储服务的系统可以代表存储服务客户端存储数据。 系统可以在存储在系统中的相应计算节点上的分区的多个副本中维护数据。 系统可以将数据分区拆分成两个新的分区，并且可以将存储原始分区的副本组拆分成两个新的副本组，每个副本组存储一个新的分区。 要拆分副本组，主副本可能将成员身份更改传播到副本组的其他成员，以将成员添加到原始副本组，并将扩展副本组分成两个新的副本组。 分割后，副本可能会尝试成为原始副本组或新副本组的主节点。 如果尝试成为原始副本组的主副本成功，则拆分可能会失败。

Patent Agency Ranking