知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

8 records (took 0.019 seconds)

    Best-effort key affinity workload sharding
    1.
    发明授权
    Best-effort key affinity workload sharding 有权

    公开(公告)号：US10346217B1

    公开(公告)日：2019-07-09

    申请号：US15357927

    申请日：2016-11-21

    Applicant: Amazon Technologies, Inc.

    Inventor： Timothy William Bray ,  Mustafa Ugur Torun ,  Soydan Bilgin

    IPC: G06F9/46 ,  G06F9/50 ,  G06F9/48

    Abstract: Devices and processes may perform best-effort key affinity workload sharding. Requests including keys are received at a key based workload manager that applies a consistent sharding algorithm to the keys to select a shard to process the request. For selected shards that are associated with a heavy workload various techniques are performed to iterate though a selection of shards until another shard without a heavy workload is selected. For example, techniques are provided such that for a given request a different shard is selected for each iteration, and shards are selected in the same order for repeated requests with the same key. For keys associated with heavy workloads, shards may be reserved solely for that key. If the techniques fail to find a shard without a heavy workload, a fallback provision may select the shard with the least amount of workload, even if that workload is considered heavy.

    Freshness-sensitive message delivery
    2.
    发明授权
    Freshness-sensitive message delivery 有权

    公开(公告)号：US09973306B2

    公开(公告)日：2018-05-15

    申请号：US14853884

    申请日：2015-09-14

    Applicant: Amazon Technologies, Inc.

    Inventor： Timothy William Bray ,  Benjamin Warren Mercier ,  Christopher Lee Kubera Harasemchuk

    IPC: H04L1/08 ,  H04L1/18 ,  H04L12/24

    CPC classification number: H04L1/1887 ,  H04L1/1877 ,  H04L41/069

    Abstract: Methods, systems, and computer-readable media for implementing freshness-sensitive message delivery are disclosed. A stream of events including an earlier event and a later event is received. A first attempt is performed to deliver a message indicative of the earlier event. The first attempt to deliver the message is unsuccessful. One or more additional attempts are scheduled to deliver the message indicative of the earlier event. The additional attempts are scheduled over a period of time following the first attempt. An attempt is performed to deliver an additional message indicative of the later event. The attempt to deliver the additional message is not delayed by the additional attempts to deliver the message.

    Event-stream searching using compiled rule patterns
    3.
    发明授权
    Event-stream searching using compiled rule patterns 有权

    公开(公告)号：US11068487B2

    公开(公告)日：2021-07-20

    申请号：US14847962

    申请日：2015-09-08

    Applicant: Amazon Technologies, Inc.

    Inventor： Timothy William Bray

    IPC: G06F16/2455

    Abstract: Methods, systems, and computer-readable media for implementing event-stream searching using compiled rule patterns are disclosed. A rule base is compiled based at least in part on one or more rule patterns. The field names are sorted within the rule patterns. The rule patterns comprise one or more field names and one or more field values. The rule base represents a finite-state machine comprising a plurality of states. A plurality of events are received. The events comprise field names and field values describing events associated with resources in a provider network. The field names are sorted within the events. The rule patterns are evaluated against the events using the rule base. In determining a matched rule pattern for one of the events, the finite-state machine transitions between at least two of the states for the matched rule pattern.

    Anything-but matching using finite-state machines
    4.
    发明授权
    Anything-but matching using finite-state machines 有权

    公开(公告)号：US10990887B1

    公开(公告)日：2021-04-27

    申请号：US15841134

    申请日：2017-12-13

    Applicant: Amazon Technologies, Inc.

    Inventor： Timothy William Bray ,  Long Zhang

    IPC: G06N5/04 ,  G06N5/02

    Abstract: Methods, systems, and computer-readable media for anything-but matching using finite-state machines are disclosed. A rule base is compiled based at least in part on one or more rule patterns, including an anything-but rule pattern. The rule patterns comprise one or more field values. The rule base represents one or more finite-state machines comprising a plurality of states and encode a specified value for the anything-but rule pattern. A plurality of events are received comprising field values describing resources in a provider network. The rule patterns are evaluated against the events using the rule base. Events matching the specified value using the rule base are excluded from a set of events matching the anything-but rule pattern.

Patent Agency Ranking