Amazon Technologies, Inc.

AndyGibb Halim

Swapneel Patil

Gustavo Eduardo Lopez

Jeremy Stephen Hynoski

Vinoo Vasudevan

Jason Aaron McMahon

Eugene Chang

Sudharsan Sampath

Pradipta Biswas

Clifford A Cancelosi

Sayali Subhash Degaonkar

Amiya Kishor Chakraborty

Hector Cura

Venkata Harish Mandala

Ajay Avinash Kulkarni

Shahinaz S Azazy

Techniques and systems can process data of a dataset to determine when a portion of data is comprised in the data of the dataset. An output generated from processing the data of the dataset can be evaluated, where the output can signify that processing the data of the dataset was unable to locate the portion of data in the data of the dataset. Based on evaluating the output, the data of the dataset can be automatically reprocessed to determine the portion of data is in the data of the dataset. A result can then be generated from the portion of data determined to be in the data of the dataset.

Processing and validating of data

A timer service receives timer creation requests from clients and fires those timers upon their expiration by returning to the requesting clients payloads provided with the timer creation requests. A timer creation request includes a client identifier, a timer expiration time, and a payload. The timer service queues timer creation requests, a creation worker adds timer records to a timer store in response to requests and manages partitions of the timer store, and sweeper workers, one per partition, sweep timers into a second queue. A firing worker reads timer index records from the second queue, determines the timers referenced in those timer index records and executes the payloads of those timers. The timer store can be tiered, with partitions different storage priorities based on the timer expirations of the timers in the partitions.

Partitioning for delayed queues in a distributed network

A timer service receives timer creation requests from clients and fires those timers upon their expiration by returning to the requesting clients payloads provided with the timer creation requests. A timer creation request includes a client identifier, a timer expiration time, and a payload. The timer service queues timer creation requests, a creation worker adds timer records to a timer store in response to requests and manages virtual partitions of the timer store, and sweeper workers, one per virtual partition, sweep timers into a second queue. A firing worker reads timer index records from the second queue, determines the timers referenced in those timer index records and executes the payloads of those timers. The timer store can be tiered, with virtual partitions different storage priorities based on the timer expirations of the timers in the virtual partitions.

Dynamic virtual partitioning for delayed queues

A subscription management service utilizes a timer service to maintain timers corresponding to subscription events. The subscription management service exposes an interface through which clients can define new subscriptions that are then created and managed by the subscription management service. The subscription management service can charge subscribers on an appropriate billing period, and cancel or automatically renew subscriptions at the end of a contract period. The subscription management service can also provide notifications to clients, to subscribers, and/or to other components. The subscription management service might also perform other types of actions with regard to the subscriptions on behalf of the clients. The timer service receives payloads from clients, such as the subscription management service, and provides the payloads back to the clients at a specified time. The timer service might also utilize a jitter threshold to compute the time at which payloads should be provided to clients.

Subscription management service

A distributed work processing system for processing computational tasks is scalable and fault-tolerant without requiring centralized control. Worker processes running on worker hosts are organized into a logical group and worker coordinators running on worker coordinator hosts coordinate tasks assigned to worker processes. A task store might hold a collection of tasks to be performed by the logical group. A lock database can be used for locking the logical group for coordination by one worker coordinator process at a time. A membership store contains mappings of worker processes to logical groups, and an assignment store indicates which tasks are assigned to which workers. The worker coordinator process has a scanner process to deal with unassigned tasks and deduplicating duplicate assignments. If a worker coordinator does not see enough worker processes, it can instantiate more. If a worker process does not see a worker coordinator, it can instantiate one.

Contention and selection of controlling work coordinator in a distributed computing environment

A distributed work processing system for processing computational tasks IS scalable and fault-tolerant without requiring centralized control. Worker processes running on worker hosts and worker coordinators running on worker coordinator hosts interact with a task store that holds a collection of tasks to be performed by a logical group of worker processes, a lock database used for locking the logical group for coordination by one worker coordinator process at a time, a membership store that contains mappings of worker processes to logical groups, and an assignment store indicating which tasks are assigned to which workers. The worker coordinator process has a scanner process to deal with unassigned tasks and deduplicating duplicate assignments. If a worker coordinator does not see enough worker processes, it can instantiate more. If a worker process does not see a worker coordinator, it can instantiate one.

Some examples provide for issuing identifiers to clients of a distributed identifier generation system. A request for a unique identifier may be received by a host. The host may generate an identifiers based at least in part on a host identifier issued to the generating host and a value of a counter operated by the generating host. The identifiers may be unique within the distributed identifier generation system.

Distributed identifier generation system

Disclosed are various embodiments for self-service provisioning of multi-channel applications. A self-service provisioning of a channel application is implemented on at least one server for a merchant based on channel configuration data supplied by a merchant client, at least a portion of the provisioning being performed automatically, the channel application being associated with a channel of commerce and becoming operable to facilitate a customer interaction for the merchant through the channel of commerce. There is communication with at least one channel client to perform the customer interaction according to merchant data stored on the at least one server.

Growing community of inventors

Redmond, WA, United States of America

AndyGibb Halim