Grant A Mcalister

US Patent:

20120330954, Dec 27, 2012

Filed:

Jun 27, 2011

Appl. No.:

13/170031

Inventors:

Swaminathan Sivasubramanian - Seattle WA, US
Stefano Stefani - Issaquah WA, US
Chiranjeeb Buragohain - Seattle WA, US
Rande A. Blackman - Seattle WA, US
Timothy Andrew Rath - Seattle WA, US
Raymond S. Bradford - Seattle WA, US
Grant A.M. McAlister - Seattle WA, US
Jakub Kulesza - Bellevue WA, US
James Hamilton - Seattle WA, US
Luis Felipe Cabrera - Bellevue WA, US

International Classification:

G06F 17/30

US Classification:

707737, 707E17089

Abstract:

A system that implements a scalable data storage service may maintain tables in a non-relational data store on behalf of clients. The system may provide a Web services interface through which service requests are received, and an API usable to request that a table be created, deleted, or described; that an item be stored, retrieved, deleted, or its attributes modified; or that a table be queried (or scanned) with filtered items and/or their attributes returned. An asynchronous workflow may be invoked to create or delete a table. Items stored in tables may be partitioned and indexed using a simple or composite primary key. The system may not impose pre-defined limits on table size, and may employ a flexible schema. The service may provide a best-effort or committed throughput model. The system may automatically scale and/or re-partition tables in response to detecting workload changes, node failures, or other conditions or anomalies.

US Patent:

20210157692, May 27, 2021

Filed:

Nov 27, 2019

Appl. No.:

16/698811

Inventors:

- Seattle WA, US
Grant A. McAlister - Seattle WA, US

International Classification:

G06F 11/20
G06F 11/07
G06F 11/30
G06F 3/06

Abstract:

The first computing system may interface with an operator of the application and a plurality of hosts of the application distributed between different partitions. The second and third computing systems may host first and second portion of the application in first and second partitions, respectively. The second and third computing systems may poll the first computing system to identify first and second value, respectively, representing state conditions of the first and second partitions, respectively, wherein the first and second partition state conditions are the active state, the passive state, and the fenced state. The second and third computing systems may receive responses from the first computing system comprising the first and second values, respectively, and based on the respective values, initiate a transition to the corresponding partition state condition. The first computing system may assign one of the first and second values to indicate which is the active state.