-
公开(公告)号：US11418345B2
公开(公告)日：2022-08-16
申请号：US16446512
申请日：2019-06-19
Applicant: Amazon Technologies, Inc.
Inventor： Tate Andrew Certain , Benjamin Nelson Glowney , Allan Henry Vermeulen
Abstract: A database management system stores an entry in a journal. Upon storage of the entry, the journal comprises a plurality of threaded leaf nodes and a hierarchy of interior nodes comprising hash values computed from the threaded leaf nodes. A first set of hash values is provided to prove that the entry is stored in a first version of the journal. A second set is provided to prove that the entries stored in the first version of the journal are unmodified and stored in a second version of the journal.
-
公开(公告)号：US11314717B1
公开(公告)日：2022-04-26
申请号：US15632266
申请日：2017-06-23
Applicant: Amazon Technologies, Inc.
Inventor： Tate Andrew Certain , Anshul Gupta , Vaibhav Jain , Sharatkumar Nagesh Kuppahally , Alexander Richard Keyes , Rajaprabhu Thiruchi Loganathan , Ravi Math , Adam Douglas Morley , Lokendra Singh Panwar , Krishnan Seshadrinathan , James Christopher Sorenson, III , Stefano Stefani , Wei Xiao
Abstract: Scalable architecture for propagating updates may be implemented for data replicated from a data set. A node may receive updates to items in a data set that have been committed to the data set. The node may determine whether the update should be applied to a replicated portion of the data set. For updates that should be applied, the node may identify another node that hosts the replicated portion of the data set and send a request to the other node to perform a conditional atomic operation to apply the update to the item in the replicated portion of the data set. The condition may compare a version identifier associated with an update and a current version identifier for the item at the other node. If the condition evaluates true, then the update to the item in the replicated portion may be performed.
-
23.发明申请公开(公告)号：US20190392061A1
公开(公告)日：2019-12-26
申请号：US16014890
申请日：2018-06-21
Applicant: Amazon Technologies, Inc.
Inventor： Douglas Brian Terry , Tate Andrew Certain , Amit Gupta , Rishabh Jain , Vaibhav Jain , Alexander Richard Keyes , Somasundaram Perianayagam , Nathan Pellegrom Riley , Akshat Vig , Ming-Chuan Wu
Abstract: Transaction requests may be ordered in a distributed database according to an independently assigned sequence. Different distributed system nodes, such as a transaction coordinator and a storage node may independently assign sequence numbers to requests to access a distributed database. A storage node may receive the request from a transaction coordinator with an assigned sequence number and another request to which the storage node may assign a sequence number. The storage node can then order performance of the requests based on the sequence numbers.
-
公开(公告)号：US20190158419A1
公开(公告)日：2019-05-23
申请号：US16166929
申请日：2018-10-22
Applicant: Amazon Technologies, Inc.
Inventor： Tate Andrew Certain , Roland Paterson-Jones , James R. Hamilton , Sachin Jain , Matthew S. Garman , David N. Sunderland , Danny Wei , Fiorenzo Cattaneo
IPC: H04L12/911 , H04L29/08 , G06Q10/00 , G06Q30/02 , G06Q30/04
Abstract: Commitments against various resources can be dynamically adjusted for customers in a shared-resource environment. A customer can provision a data volume with a committed rate of Input/Output Operations Per Second (IOPS) and pay only for that commitment (plus any overage), for example, as well as the amount of storage requested. The customer can subsequently adjust the committed rate of IOPS by submitting an appropriate request, or the rate can be adjusted automatically based on any of a number of criteria. Data volumes for the customer can be migrated, split, or combined in order to provide the adjusted rate. The interaction of the customer with the data volume does not need to change, independent of adjustments in rate or changes in the data volume, other than the rate at which requests are processed.
-
公开(公告)号：US10193819B2
公开(公告)日：2019-01-29
申请号：US15454958
申请日：2017-03-09
Applicant: Amazon Technologies, Inc.
Inventor： Tate Andrew Certain , James R. Hamilton
IPC: G06F15/173 , H04L12/911 , H04L12/801 , H04L12/24 , H04L12/26 , G06F9/00
Abstract: Customers of shared resources in a multi-tenant environment can have token buckets allocated that have an associated depth and fill rate, with each token enabling the customer to obtain an amount of work from a shared resource. A resource management system can monitor one or more system or output metrics, and can adjust a global fill rate based at least in part upon values of the monitored metrics. Such an approach can provide a fair distribution of work among the customers, while ensuring that the metrics stay within acceptable ranges and there are no drastic changes in performance levels of the system. The fill rate can update dynamically with changes in the monitored parameters, such that the system can float near an equilibrium point. Commitments for specific minimum service levels also can be met.
-
Patent Agency Ranking
公开(公告)号：US10031935B1
公开(公告)日：2018-07-24
申请号：US14833003
申请日：2015-08-21
Applicant: Amazon Technologies, Inc.
Inventor： Timothy Daniel Cole , John Michael Morkel , Tate Andrew Certain , Christopher Richard Jacques De Kadt , Artem Danilov , Andrew Wayne Ross , Allan Henry Vermeulen
Abstract: A materialization configuration request is received via a programmatic interface from a client of a journal-based multi-data-store database. The request indicates a partitioning rule to be used to select, for respective writes indicated in committed transaction entries of a journal, the materialization node at which the writes are to be stored. A control plane component of the database verifies that a set of materialization nodes corresponding to the partitioning rule has been established, and initiates the propagation of writes from the journal to the materialization nodes by respective write appliers.
-
公开(公告)号：US09906598B1
公开(公告)日：2018-02-27
申请号：US15354904
申请日：2016-11-17
Applicant: Amazon Technologies, Inc.
Inventor： Marc J. Brooker , Madhuvanesh Parthasarathy , Tate Andrew Certain , Kerry Q. Lee
CPC classification number: H04L67/1097 , G06F3/061 , G06F3/0617 , G06F3/0662 , G06F3/067 , G06F9/45558 , G06F17/30194 , G06F17/30233 , G06F17/30283 , H04L67/02 , H04L67/32 , H04L67/42
Abstract: A storage controller is implemented for controlling a storage system. The storage controller may be implemented using a distributed computer system and may include components for servicing client data requests based on the characteristics of the distributed computer system, the client, or the data requests. The storage controller is scalable independently of the storage system it controls. All components of the storage controller, as well as the client, may be virtual or hardware-based instances of a distributed computer system.
-
公开(公告)号：US20170180254A1
公开(公告)日：2017-06-22
申请号：US15454958
申请日：2017-03-09
Applicant: Amazon Technologies, Inc.
Inventor： Tate Andrew Certain , James R. Hamilton
IPC: H04L12/801 , H04L29/08
CPC classification number: H04L47/70 , G06F9/00 , H04L41/5009 , H04L41/5025 , H04L41/5035 , H04L43/00 , H04L43/0817 , H04L43/0852 , H04L47/10
Abstract: Customers of shared resources in a multi-tenant environment can have token buckets allocated that have an associated depth and fill rate, with each token enabling the customer to obtain an amount of work from a shared resource. A resource management system can monitor one or more system or output metrics, and can adjust a global fill rate based at least in part upon values of the monitored metrics. Such an approach can provide a fair distribution of work among the customers, while ensuring that the metrics stay within acceptable ranges and there are no drastic changes in performance levels of the system. The fill rate can update dynamically with changes in the monitored parameters, such that the system can float near an equilibrium point. Commitments for specific minimum service levels also can be met.
-
公开(公告)号：US09483407B2
公开(公告)日：2016-11-01
申请号：US14468270
申请日：2014-08-25
Applicant: Amazon Technologies, Inc.
Inventor： Swaminathan Sivasubramanian , Bradley Eugene Marshall , Tate Andrew Certain , Nicholas J. Maniscalco
CPC classification number: G06F12/0862 , G06F9/38 , G06F9/3832 , G06F9/3863 , G06F12/0866 , G06F2212/6026
Abstract: Patterns of access and/or behavior can be analyzed and persisted for use in pre-fetching data from a physical storage device. In at least some embodiments, data can be aggregated across volumes, instances, users, applications, or other such entities, and that data can be analyzed to attempt to determine patterns for any of those entities. The patterns and/or analysis can be persisted such that the information is not lost in the event of a reboot or other such occurrence. Further, aspects such as load and availability across the network can be analyzed to determine where to send and/or store data that is pre-fetched from disk or other such storage in order to reduce latency while preventing bottlenecks or other such issues with resource availability.
-
公开(公告)号：US09413680B1
公开(公告)日：2016-08-09
申请号：US13627278
申请日：2012-09-26
Applicant: Amazon Technologies, Inc.
Inventor： Norbert P. Kusters , Kerry Q. Lee , Raghav Vijay Pisolkar , Tate Andrew Certain
IPC: G06F15/173 , H04L12/923
CPC classification number: H04L47/762 , H04L12/1403 , H04L41/08 , H04L63/10 , H04L67/146 , H04L69/321 , H04L69/325 , H04M15/765 , H04M15/7652 , H04M15/7655 , H04M15/83 , H04M15/85 , H04M15/853 , H04M15/854
Abstract: An opportunistic throttling approach can be used for customers of shared resources in a multi-tenant environment. Each customer can have a respective token bucket with a guaranteed fill rate. When a request is received for an amount of work to be performed by a resource, the corresponding number of tokens are obtained from, or charged against, a global token bucket. If the global bucket has enough tokens, and if the customer has not exceeded a maximum work rate or other such metric, the customer can charge less than the full number of tokens against the customer's token bucket, in order to reduce the number of tokens that need to be taken from the customer bucket. Such an approach can enable the customer to do more work and enable the customer's bucket to fill more quickly as fewer tokens are charged against the customer bucket for the same amount of work.
Abstract translation: 可以在多租户环境中为共享资源的客户使用机会主义的节制方法。 每个客户可以有一个具有保证填充率的相应令牌桶。 当接收到要由资源执行的工作量的请求时，相应数量的令牌从全局令牌桶中获取或收取。 如果全局桶具有足够的令牌，并且如果客户没有超过最大工作率或其他此类度量，则客户可以针对客户的令牌桶收取少于令牌的全部令牌，以便减少令牌数量 需要从客户桶中取出。 这样一种方法可以使客户能够进行更多的工作，并使得客户的桶可以更快地填充，因为对于相同数量的工作，较少的令牌被针对客户桶收取。
-
-
-
-
-
-
-
-
-
Search Results
116
records
(took 0.036 seconds)
