知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

28 records (took 0.017 seconds)

    Node placement for replication groups
    11.
    发明授权
    Node placement for replication groups 有权

    公开(公告)号：US11150995B1

    公开(公告)日：2021-10-19

    申请号：US15264479

    申请日：2016-09-13

    Applicant: Amazon Technologies, Inc.

    Inventor： Surya Prakash Dhoolam ,  Haoyu Huang

    IPC: G06F16/00 ,  G06F11/14 ,  G06F16/901 ,  G06F16/9535

    Abstract: Data replication groups may be used to store data in a distributed computing environment. A data replication group may include a set of nodes executing a consensus protocol to maintain data durably. In order to increase efficiency and performance of the data replication group a placement system may be used to determine the placement of node of the data replication groups. The nodes may be executed by a set of host computer systems within a distributed computing environment. The placement system may determine the placement of the nodes within the set of host computer systems based at least in part on one or more constraints. A selection algorithm may be used to determine a set of node for a data replication group satisfying the one or more constraints.

    Dynamically switching between query and scan for optimizing table reads
    19.
    发明授权
    Dynamically switching between query and scan for optimizing table reads 有权

    公开(公告)号：US11093493B1

    公开(公告)日：2021-08-17

    申请号：US16147494

    申请日：2018-09-28

    Applicant: Amazon Technologies, Inc.

    Inventor： Shashanka Krishnaswamy ,  Surya Prakash Dhoolam ,  Bradley Nathaniel Burkett

    IPC: G06F7/00 ,  G06F17/30 ,  G06F16/2453 ,  G06F16/22 ,  G06F16/2458

    Abstract: Various embodiments of dynamically switching between query and scan for optimizing table reads are described. A particular client of a shared table can use various criteria in determining whether to query for individual entries in a table, or whether to scan the entire table. Criteria can be, in some embodiments, whether there are fewer than a threshold number of other clients accessing the same portion of the table as the particular client, or the size of the portion accessed by the client. If there are fewer than a threshold number of other clients accessing the same portion of the table, and the size of the portion is below a size threshold, for example, then querying individual entries in the table might be appropriate in those circumstances. By querying instead of scanning, for example, clients can reduce the total number of I/O operations per second on the shared table.

    Moving storage volumes for improved performance
    20.
    发明授权
    Moving storage volumes for improved performance 有权

    公开(公告)号：US10817325B2

    公开(公告)日：2020-10-27

    申请号：US16279980

    申请日：2019-02-19

    Applicant: Amazon Technologies, Inc.

    Inventor： Surya Prakash Dhoolam ,  Mitchell Gannon Flaherty ,  Christopher Magee Greenwood ,  Gary Michael Herndon, Jr. ,  Rahul Karnik ,  Sriram Venugopal

    IPC: G06F9/455 ,  G06F3/06

    Abstract: Data volumes hosted for customers in a multi-tenant environment can be moved advantageously throughout the environment to improve performance and reduce cost. A data volume can serve I/O for a virtual machine instance, and it can be advantageous for the virtual machine and the data volume to be in the same network locality, or share at least some of the same network state and interconnection. Since there is limited capacity in a network locality, data volumes not attached to virtual machines can be moved to other locations in the environment. This can include moving data volumes to other local network topologies or snapshotting data volumes and writing the snapshots to another storage service. If the data volume is again needed for I/O, the data volume can moved, allocated, or reattached as necessary.

Patent Agency Ranking