Amazon Technologies, Inc.

Oracle International Corporation

Bea Systems, Inc.

Microsoft Technology Licensing, LLC

Vendia, Inc.

Timothy Allen Wagner

Marc John Brooker

Dylan Chandler Thomas

Sean Philip Reque

Ajay Nair

Derek Steven Manwaring

Philip Daniel Piwonka

Niall Mullen

Scott Daniel Wisniewski

Timothy Scott Hanson

Jesse Michael Garms

Bryan Nicholas Moffatt

Jess Garms

Niranjan Jayakar

Robison Rodrigues Dos Santos

Jonathan Paul Thompson

Mikhail Danilov

Holly Mesrobian

Hans-Philipp Anton Hussels

Bradley Nathaniel Burkett

Xin Zhao

Gary Horen

Izydor Gryko

Zachary L Anderson

Derek Steven Manwarin

Michael Kovaks

Systems and methods are disclosed for efficient creation of blocks on a blockchain by utilization of trusted cloud primitives. As opposed to inefficient mechanisms like proof-of-work or application-limited mechanisms like proof-of-stake, embodiments of the present disclosure implement a consensus algorithm by execution of verifiably immutable code on one or more hosted computing environments that are mutually trusted by participants to the blockchain. The code can be designated within a block of the blockchain, such that participants mutually trust the code, when executed, to properly implement the agreed-upon consensus algorithm. The consensus algorithm can operate to select transactions for inclusion in each block, and notify participants of the selection, removing a need for participants to trust one another with respect to block creation.

Efficient and secure blockchains using cloud resource primitives

A system for providing low latency computational capacity is provided. The system may be configured to maintain a pool of virtual machine instances, which may be assigned to users to service the requests associated with the users. The system may further be configured to receive a request to acquire compute capacity for executing a program code associated with a particular user, determine whether the pool of virtual machine instances includes a container that may be used to execute the program code therein, and cause the program code of the particular user to be executed in the container.

Low latency computational capacity provisioning

Systems and methods are described for providing auxiliary functions in an on-demand code execution system in a manner that enables efficient execution of code. A user may generate a task on the system by submitting code. The system may determine the auxiliary functions that the submitted code may require when executed on the system, and may provide these auxiliary functions by provisioning or configuring sidecar virtualized execution environments that work in conjunction with the main virtualized execution environment executing the submitted code. Sidecar virtualized execution environments may be identified and obtained from a library of preconfigured sidecar virtualized execution environments, or a sidecar agent that provides the auxiliary function may be identified from a library, and then a virtualized execution environment may be provisioned with the agent and/or configured to work in conjunction with the main virtualized execution environment.

Execution of auxiliary functions in an on-demand network code execution system

Systems and methods are described for enabling graceful recovery of network connections in a virtual machine instance that has been migrated or temporarily halted. To prevent the virtual machine instance from attempting to reuse open connections, which might fail due to migration or halting, a host device identifies open connections just prior to halting the virtual machine instance on the host, and transmits to the virtual machine instance termination signals for the open connections. The host device may further transmit termination signals to the other parties to such connections. Each termination signal may be formatted so as to appear to originate from the other party to the connection, causing both parties to synchronize their knowledge of the connection. On reactivation, the virtual machine instance can recovery the connections without errors associated with attempted utilization of broken connections.

Network connection recovery after virtual machine transition in an on-demand network code execution system

A service manages a plurality of virtual machine instances for low latency execution of user codes. The plurality of virtual machine instances can be configured based on a predetermined set of configurations. One or more containers may be created within the virtual machine instances. In response to a request to execute user code, the service identifies a pre-configured virtual machine instance suitable for executing the user code. The service can allocate the identified virtual machine instance to the user, create a new container within an instance already allocated to the user, or re-use a container already created for execution of the user code. When the user code has not been activated for a time-out period, the service can invalidate allocation of the virtual machine instance destroy the container. The time from receiving the request to beginning code execution is less than a predetermined duration, for example, 100 ms.

Threading as a service

A service manages a plurality of virtual machine instances for low latency execution of user codes. The service can provide the capability to execute user code in response to events triggered on an auxillary service to provide implicit and automatic rate matching and scaling between events being triggered on the auxiliary service and the corresponding execution of user code on various virtual machine instances. An auxiliary service may be configured as an event triggering service to detect events and generate event messages for execution of the user codes. The service can request, receive, or poll for event messages directly from the auxiliary service or via an intermediary message service. Event messages can be rapidly converted to requests to execute user code on the service. The time from processing the event message to initiating a request to begin code execution is less than a predetermined duration, for example, 100 ms.

Processing event messages for user requests to execute program code

A system for providing security mechanisms for secure execution of program code is described. The system may be configured to maintain a plurality of virtual machine instances. The system may be further configured to receive a request to execute a program code and allocate computing resources for executing the program code on one of the virtual machine instances. One mechanism involves executing program code according to a user-specified security policy. Another mechanism involves executing program code that may be configured to communicate or interface with an auxiliary service. Another mechanism involves splitting and executing program code in a plurality of portions, where some portions of the program code are executed in association with a first level of trust and some portions of the program code are executed with different levels of trust.

Security protocols for low latency execution of program code

A system for providing a stateful virtual compute system is provided. The system may be configured to maintain a plurality of virtual machine instances. The system may be further configured to receive a request to execute a program code and select a virtual machine instance to execute the program code on the selected virtual machine instance. The system may further associate the selected virtual machine instance with shared resources and allow program codes executed in the selected virtual machine instance to access the shared resources.

Stateful virtual compute system

A system for providing low-latency computational capacity from a virtual compute fleet is provided. The system may be configured to maintain a plurality of virtual machine instances on one or more physical computing devices, wherein the plurality of virtual machine instances comprises a first pool comprising a first sub-pool of virtual machine instances and a second sub-pool of virtual machine instances, and a second pool comprising virtual machine instances used for executing one or more program codes thereon. The first sub-pool and/or the second sub-pool may be associated with one or more users of the system. The system may be further configured to process code execution requests and execute program codes on the virtual machine instances of the first or second sub-pool.

Acquisition and maintenance of compute capacity

Systems and methods are described for providing an implementation of the MapReduce programming model utilizing tasks executing on an on-demand code execution system, utilizing a stream data processing system as an intermediary between map and reduce function. A map task implementing a map function can process portions of a data set, to generate outputs associated with different values for a measured attribute of the data set. Executions of the map task can publish outputs to a data stream on the stream data processing system, which stream is configured to utilize the measured attribute as a partition key for the stream. Based on the partition key, the stream data processing system can divide the stream into sub-streams, each containing a relevant subset of the outputs. The on-demand code execution system can execute a reduce task to apply the reduce function to the outputs of each sub-stream, thereby completing the MapReduce process.

Mapreduce implementation in an on-demand network code execution system and stream data processing system

Systems and methods are described for transforming a data set within a data source into a series of task calls to an on-demand code execution environment. The environment can utilize pre-initialized virtual machine instances to enable execution of user-specified code in a rapid manner, without delays typically caused by initialization of the virtual machine instances, and are often used to process data in near-real time, as it is created. However, limitations in computing resources may inhibit a user from utilizing an on-demand code execution environment to simultaneously process a large, existing data set. The present application provides a task generation system that can iteratively retrieve data items from an existing data set and generate corresponding task calls to the on-demand computing environment. The calls can be ordered to address dependencies of the data items, such as when a first data item depends on prior processing of a second data item.

Dependency-based process of pre-existing data sets at an on demand code execution environment

A system for providing automatic resource resizing is provided. The system may be configured to maintain a plurality of virtual machine instances. The system may be further configured to receive a request to execute a program code and allocate computing resources for executing the program code on one of the virtual machine instances. The amount of resources allocated for executing the program code may be specified by the request and adjusted as needed.

Automatic determination of resource sizing

Systems and methods are described for providing maintaining state information during processing of data sets via execution of code on an on-demand code execution system. Rather than requiring that execution environments of such a system to maintain state, an intermediary device is disclosed which retrieves calls to the system from a call queue and iteratively submits the calls to the system. Each call within the queue corresponds to a data item of the data set to be analyzed. As calls are submitted to the system, the intermediary device submits state information within the call reflecting a state of processing the data set. A response to the call includes state information updated based on processing of a data item in the call. Thus, state information is maintained for processing the data set, without requiring persistence of state information within individual execution environments.

Growing community of inventors

Seattle, WA, United States of America

Timothy Allen Wagner