Code execution request routing

Description

BACKGROUND

Generally described, computing devices utilize a communication network, or a series of communication networks, to exchange data. Companies and organizations operate computer networks that interconnect a number of computing devices to support operations or provide services to third parties. The computing systems can be located in a single geographic location or located in multiple, distinct geographic locations (e.g., interconnected via private or public communication networks). Specifically, data centers or data processing centers, herein generally referred to as a “data center,” may include a number of interconnected computing systems to provide computing resources to users of the data center. The data centers may be private data centers operated on behalf of an organization or public data centers operated on behalf, or for the benefit of, the general public.

To facilitate increased utilization of data center resources, virtualization technologies may allow a single physical computing device to host one or more instances of virtual machines that appear and operate as independent computing devices to users of a data center. With virtualization, the single physical computing device can create, maintain, delete, or otherwise manage virtual machines in a dynamic manner. In turn, users can request computer resources from a data center, including single computing devices or a configuration of networked computing devices, and be provided with varying numbers of virtual machine resources.

In some scenarios, virtual machine instances may be configured according to a number of virtual machine instance types to provide specific functionality. For example, various computing devices may be associated with different combinations of operating systems or operating system configurations, virtualized hardware resources and software applications to enable a computing device to provide different desired functionalities, or to provide similar functionalities more efficiently. These virtual machine instance type configurations are often contained within a device image, which includes static data containing the software (e.g., the OS and applications together with their configuration and data files, etc.) that the virtual machine will run once started. The device image is typically stored on the disk used to create or initialize the instance. Thus, a computing device may process the device image in order to implement the desired software configuration.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing aspects and many of the attendant advantages of this disclosure will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:

FIG. 1 is a block diagram depicting an illustrative environment for providing low latency compute capacity, according to an example aspect;

FIG. 2 depicts a general architecture of a computing device providing a routing manager for routing code execution requests, according to an example aspect;

FIG. 3 is a flow diagram illustrating a code execution request routing routine implemented by a routing manager, according to an example aspect;

FIG. 4 depicts an example mapping table illustrating the routing of requests to containers, according to an example aspect;

FIG. 5 is a flow diagram illustrating a code execution result caching routine implemented by a routing manager, according to an example aspect; and

FIG. 6 is a flow diagram illustrating a container lifecycle management routine implemented by a routing manager, according to an example aspect.

DETAILED DESCRIPTION

Companies and organizations no longer need to acquire and manage their own data centers in order to perform computing operations (e.g., execute code, including threads, programs, functions, software, routines, subroutines, processes, etc.). With the advent of cloud computing, storage space and compute power traditionally provided by hardware computing devices can now be obtained and configured in minutes over the Internet. Thus, developers can quickly purchase a desired amount of computing resources without having to worry about acquiring physical machines. Such computing resources are typically purchased in the form of virtual computing resources, or virtual machine instances. These instances of virtual machines are software implementations of physical machines (e.g., computers), which are hosted on physical computing devices, and may contain operating systems and applications that are traditionally provided on physical machines. These virtual machine instances are configured with a set of computing resources (e.g., memory, CPU, disk, network, etc.) that applications running on the virtual machine instances may request and can be utilized in the same manner as physical computers.

However, even when virtual computing resources are purchased, developers still have to decide how many and what type of virtual machine instances to purchase, and how long to keep them. For example, the costs of using the virtual machine instances may vary depending on the type and the number of hours they are rented. In addition, the minimum time a virtual machine may be rented is typically on the order of hours. Further, developers have to specify the hardware and software resources (e.g., type of operating systems and language runtimes, etc.) to install on the virtual machines. Other concerns that they might have include over-utilization (e.g., acquiring too little computing resources and suffering performance issues), under-utilization (e.g., acquiring more computing resources than necessary to run the codes, and thus overpaying), prediction of change in traffic (e.g., so that they know when to scale up or down), and instance and language runtime startup delay, which can take 3-10 minutes, or longer, even though users may desire computing capacity on the order of seconds or even milliseconds.

According to aspects of the present disclosure, by maintaining a pool of pre-initialized virtual machine instances that are ready for use as soon as a user request is received, and automatically managing the amount of capacity available in the pool to service incoming requests, delay (sometimes referred to as latency) associated with executing the user code (e.g., instance and language runtime startup time) can be significantly reduced, and utilization can be improved.

Generally described, systems and methods are disclosed which facilitate management of virtual machine instances in a virtual compute system. The virtual compute system maintains a pool of virtual machine instances that have one or more software components (e.g., operating systems, language runtimes, libraries, etc.) loaded thereon. Maintaining the pool of virtual machine instances may involve creating a new instance, acquiring a new instance from an external instance provisioning service, destroying an instance, assigning/reassigning an instance to a user, modifying an instance (e.g., containers or resources therein), etc. The virtual machine instances in the pool can be designated to service user requests to execute program codes. In the present disclosure, the phrases “program code,” “user code,” and “cloud function” may sometimes be interchangeably used. The program codes can be executed in isolated containers that are created on the virtual machine instances. Since the virtual machine instances in the pool have already been booted and loaded with particular operating systems and language runtimes by the time the requests are received, the delay associated with finding compute capacity that can handle the requests (e.g., by executing the user code in one or more containers created on the virtual machine instances) is significantly reduced.

In another aspect, a virtual compute system may create and manage a mapping between incoming code execution requests received by the virtual compute system and the compute capacity used to handle those code execution requests. The mapping may facilitate use and reuse of certain container-specific resources by multiple requests. For example, a given container may be associated with a cache that stores code execution results and may be accessed by any program code executed in the given container. Accordingly, once the code execution result associated with a request is stored in the cache, subsequent requests of the same type, if routed to the given container, may be handled more efficiently using the code execution results stored in the cache. Thus, by routing the requests to the appropriate containers running on the virtual compute system, latency gains may be achieved.

Specific embodiments and example applications of the present disclosure will now be described with reference to the drawings. These embodiments and example applications are intended to illustrate, and not limit, the present disclosure.

Illustrative Environment Including Virtual Compute System

With reference to FIG. 1, a block diagram illustrating an embodiment of a virtual environment 100 will be described. The example shown in FIG. 1 includes a virtual environment 100 in which users (e.g., developers, etc.) of user computing devices 102 may run various program codes using the virtual computing resources provided by a virtual compute system 110.

By way of illustration, various example user computing devices 102 are shown in communication with the virtual compute system 110, including a desktop computer, laptop, and a mobile phone. In general, the user computing devices 102 can be any computing device such as a desktop, laptop, mobile phone (or smartphone), tablet, kiosk, wireless device, and other electronic devices. In addition, the user computing devices 102 may include web services running on the same or different data centers, where, for example, different web services may programmatically communicate with each other to perform one or more techniques described herein. Further, the user computing devices 102 may include Internet of Things (IoT) devices such as Internet appliances and connected devices. The virtual compute system 110 may provide the user computing devices 102 with one or more user interfaces, command-line interfaces (CLI), application programing interfaces (API), and/or other programmatic interfaces for generating and uploading user codes, invoking the user codes (e.g., submitting a request to execute the user codes on the virtual compute system 110), scheduling event-based jobs or timed jobs, tracking the user codes, and/or viewing other logging or monitoring information related to their requests and/or user codes. Although one or more embodiments may be described herein as using a user interface, it should be appreciated that such embodiments may, additionally or alternatively, use any CLIs, APIs, or other programmatic interfaces.

The user computing devices 102 access the virtual compute system 110 over a network 104. The network 104 may be any wired network, wireless network, or combination thereof. In addition, the network 104 may be a personal area network, local area network, wide area network, over-the-air broadcast network (e.g., for radio or television), cable network, satellite network, cellular telephone network, or combination thereof. For example, the network 104 may be a publicly accessible network of linked networks, possibly operated by various distinct parties, such as the Internet. In some embodiments, the network 104 may be a private or semi-private network, such as a corporate or university intranet. The network 104 may include one or more wireless networks, such as a Global System for Mobile Communications (GSM) network, a Code Division Multiple Access (CDMA) network, a Long Term Evolution (LTE) network, or any other type of wireless network. The network 104 can use protocols and components for communicating via the Internet or any of the other aforementioned types of networks. For example, the protocols used by the network 104 may include Hypertext Transfer Protocol (HTTP), HTTP Secure (HTTPS), Message Queue Telemetry Transport (MQTT), Constrained Application Protocol (CoAP), and the like. Protocols and components for communicating via the Internet or any of the other aforementioned types of communication networks are well known to those skilled in the art and, thus, are not described in more detail herein.

The virtual compute system 110 is depicted in FIG. 1 as operating in a distributed computing environment including several computer systems that are interconnected using one or more computer networks. The virtual compute system 110 could also operate within a computing environment having a fewer or greater number of devices than are illustrated in FIG. 1. Thus, the depiction of the virtual compute system 110 in FIG. 1 should be taken as illustrative and not limiting to the present disclosure. For example, the virtual compute system 110 or various constituents thereof could implement various Web services components, hosted or “cloud” computing environments, and/or peer-to-peer network configurations to implement at least a portion of the processes described herein.

Further, the virtual compute system 110 may be implemented in hardware and/or software and may, for instance, include one or more physical or virtual servers implemented on physical computer hardware configured to execute computer executable instructions for performing various features that will be described herein. The one or more servers may be geographically dispersed or geographically co-located, for instance, in one or more data centers.

In the environment illustrated FIG. 1, the virtual environment 100 includes a virtual compute system 110, which includes a frontend 120, a warming pool manager 130, a worker manager 140, and a routing manager 150. In the depicted example, virtual machine instances (“instances”) 152, 154 are shown in a warming pool 130A managed by the warming pool manager 130, and instances 156, 157, 158, 159 are shown in an active pool 140A managed by the worker manager 140. In some embodiments, the term “virtual machine instance” may refer to an execution of software or other executable code that emulates hardware to provide an environment or platform on which software may execute (an “execution environment”). Virtual machine instances are generally executed by physical hardware devices, which may differ from the hardware emulated by the virtual machine instance. For example, a virtual machine may emulate a first type of processor and memory while being executed on a second type of processor and memory. Thus, virtual machines can be utilized to execute software intended for a first execution environment (e.g., a first operating system) on a physical device that is executing a second execution environment (e.g., a second operating system). In some instances, hardware emulated by a virtual machine instance may be the same or similar to hardware of an underlying device. For example, a device with a first type of processor may implement a plurality of virtual machine instances, each emulating an instance of that first type of processor. Thus, virtual machine instances can be used to divide a single device into a number of logical sub-devices (each referred to as a “virtual machine instance”). While virtual machine instances can generally provide a level of abstraction away from the hardware of an underlying physical device, this abstraction is not required. For example, assume a device implements a plurality of virtual machine instances, each of which emulate hardware identical to that provided by the device. Under such a scenario, each virtual machine instance may allow a software application to execute code on the underlying hardware without translation, while maintaining a logical separation between software applications running on other virtual machine instances. This process, which is generally referred to as “native execution,” may be utilized to increase the speed or performance of virtual machine instances. Other techniques that allow direct utilization of underlying hardware, such as hardware pass-through techniques, are known within the art.

The illustration of the various components within the virtual compute system 110 is logical in nature and one or more of the components can be implemented by a single computing device or multiple computing devices. For example, the instances 152, 154, 156, 157, 158, 159 can be implemented on one or more physical computing devices in different various geographic regions. Similarly, each of the frontend 120, the warming pool manager 130, the worker manager 140, and the routing manager 150 can be implemented across multiple physical computing devices. Alternatively, one or more of the frontend 120, the warming pool manager 130, the worker manager 140, and the routing manager 150 can be implemented on a single physical computing device. In some embodiments, the virtual compute system 110 may comprise multiple frontends, multiple warming pool managers, multiple worker managers, and/or multiple capacity managers. Although six virtual machine instances are shown in the example of FIG. 1, the embodiments described herein are not limited as such, and one skilled in the art will appreciate that the virtual compute system 110 may comprise any number of virtual machine instances implemented using any number of physical computing devices. Similarly, although a single warming pool and a single active pool are shown in the example of FIG. 1, the embodiments described herein are not limited as such, and one skilled in the art will appreciate that the virtual compute system 110 may comprise any number of warming pools and active pools.

In the example of FIG. 1, the virtual compute system 110 is illustrated as being connected to the network 104. In some embodiments, any of the components within the virtual compute system 110 can communicate with other components (e.g., the user computing devices 102 and auxiliary services 106, which may include monitoring/logging/billing services 107, storage service 108, an instance provisioning service 109, and/or other services that may communicate with the virtual compute system 110) of the virtual environment 100 via the network 104. In other embodiments, not all components of the virtual compute system 110 are capable of communicating with other components of the virtual environment 100. In one example, only the frontend 120 may be connected to the network 104, and other components of the virtual compute system 110 may communicate with other components of the virtual environment 100 via the frontend 120.

Users may use the virtual compute system 110 to execute user code thereon. For example, a user may wish to run a piece of code in connection with a web or mobile application that the user has developed. One way of running the code would be to acquire virtual machine instances from service providers who provide infrastructure as a service, configure the virtual machine instances to suit the user's needs, and use the configured virtual machine instances to run the code. Alternatively, the user may send a code execution request to the virtual compute system 110. The virtual compute system 110 can handle the acquisition and configuration of compute capacity (e.g., containers, instances, etc., which are described in greater detail below) based on the code execution request, and execute the code using the compute capacity. The virtual compute system 110 may automatically scale up and down based on the volume, thereby relieving the user from the burden of having to worry about over-utilization (e.g., acquiring too little computing resources and suffering performance issues) or under-utilization (e.g., acquiring more computing resources than necessary to run the codes, and thus overpaying).

Frontend

The frontend 120 processes all the requests to execute user code on the virtual compute system 110. In one embodiment, the frontend 120 serves as a front door to all the other services provided by the virtual compute system 110. The frontend 120 processes the requests and makes sure that the requests are properly authorized. For example, the frontend 120 may determine whether the user associated with the request is authorized to access the user code specified in the request.

The user code as used herein may refer to any program code (e.g., a program, routine, subroutine, thread, etc.) written in a specific program language. In the present disclosure, the terms “code,” “user code,” and “program code,” may be used interchangeably. Such user code may be executed to achieve a specific task, for example, in connection with a particular web application or mobile application developed by the user. For example, the user codes may be written in JavaScript (node.js), Java, Python, and/or Ruby. The request may include the user code (or the location thereof) and one or more arguments to be used for executing the user code. For example, the user may provide the user code along with the request to execute the user code. In another example, the request may identify a previously uploaded program code (e.g., using the API for uploading the code) by its name or its unique ID. In yet another example, the code may be included in the request as well as uploaded in a separate location (e.g., the storage service 108 or a storage system internal to the virtual compute system 110) prior to the request is received by the virtual compute system 110. The virtual compute system 110 may vary its code execution strategy based on where the code is available at the time the request is processed.

The frontend 120 may receive the request to execute such user codes in response to Hypertext Transfer Protocol Secure (HTTPS) requests from a user. Also, any information (e.g., headers and parameters) included in the HTTPS request may also be processed and utilized when executing the user code. As discussed above, any other protocols, including, for example, HTTP, MQTT, and CoAP, may be used to transfer the message containing the code execution request to the frontend 120. The frontend 120 may also receive the request to execute such user codes when an event is detected, such as an event that the user has registered to trigger automatic request generation. For example, the user may have registered the user code with an auxiliary service 106 and specified that whenever a particular event occurs (e.g., a new file is uploaded), the request to execute the user code is sent to the frontend 120. Alternatively, the user may have registered a timed job (e.g., execute the user code every 24 hours). In such an example, when the scheduled time arrives for the timed job, the request to execute the user code may be sent to the frontend 120. In yet another example, the frontend 120 may have a queue of incoming code execution requests, and when the user's batch job is removed from the virtual compute system's work queue, the frontend 120 may process the user request. In yet another example, the request may originate from another component within the virtual compute system 110 or other servers or services not illustrated in FIG. 1.

A user request may specify one or more third-party libraries (including native libraries) to be used along with the user code. In one embodiment, the user request is a ZIP file containing the user code and any libraries (and/or identifications of storage locations thereof). In some embodiments, the user request includes metadata that indicates the program code to be executed, the language in which the program code is written, the user associated with the request, and/or the computing resources (e.g., memory, etc.) to be reserved for executing the program code. For example, the program code may be provided with the request, previously uploaded by the user, provided by the virtual compute system 110 (e.g., standard routines), and/or provided by third parties. In some embodiments, such resource-level constraints (e.g., how much memory is to be allocated for executing a particular user code) are specified for the particular user code, and may not vary over each execution of the user code. In such cases, the virtual compute system 110 may have access to such resource-level constraints before each individual request is received, and the individual requests may not specify such resource-level constraints. In some embodiments, the user request may specify other constraints such as permission data that indicates what kind of permissions that the request has to execute the user code. Such permission data may be used by the virtual compute system 110 to access private resources (e.g., on a private network).

In some embodiments, the user request may specify the behavior that should be adopted for handling the user request. In such embodiments, the user request may include an indicator for enabling one or more execution modes in which the user code associated with the user request is to be executed. For example, the request may include a flag or a header for indicating whether the user code should be executed in a debug mode in which the debugging and/or logging output that may be generated in connection with the execution of the user code is provided back to the user (e.g., via a console user interface). In such an example, the virtual compute system 110 may inspect the request and look for the flag or the header, and if it is present, the virtual compute system 110 may modify the behavior (e.g., logging facilities) of the container in which the user code is executed, and cause the output data to be provided back to the user. In some embodiments, the behavior/mode indicators are added to the request by the user interface provided to the user by the virtual compute system 110. Other features such as source code profiling, remote debugging, etc. may also be enabled or disabled based on the indication provided in the request.

In some embodiments, the virtual compute system 110 may include multiple frontends 120. In such embodiments, a load balancer may be provided to distribute the incoming requests to the multiple frontends 120, for example, in a round-robin fashion. In some embodiments, the manner in which the load balancer distributes incoming requests to the multiple frontends 120 may be based on the state of the warming pool 130A and/or the active pool 140A. For example, if the capacity in the warming pool 130A is deemed to be sufficient, the requests may be distributed to the multiple frontends 120 based on the individual capacities of the frontends 120 (e.g., based on one or more load balancing restrictions). On the other hand, if the capacity in the warming pool 130A is less than a threshold amount, one or more of such load balancing restrictions may be removed such that the requests may be distributed to the multiple frontends 120 in a manner that reduces or minimizes the number of virtual machine instances taken from the warming pool 130A. For example, even if, according to a load balancing restriction, a request is to be routed to Frontend A, if Frontend A needs to take an instance out of the warming pool 130A to service the request but Frontend B can use one of the instances in its active pool to service the same request, the request may be routed to Frontend B.

Warming Pool Manager

The warming pool manager 130 ensures that virtual machine instances are ready to be used by the worker manager 140 when the virtual compute system 110 receives a request to execute user code on the virtual compute system 110. In the example illustrated in FIG. 1, the warming pool manager 130 manages the warming pool 130A, which is a group (sometimes referred to as a pool) of pre-initialized and pre-configured virtual machine instances that may be used to service incoming user code execution requests. In some embodiments, the warming pool manager 130 causes virtual machine instances to be booted up on one or more physical computing machines within the virtual compute system 110 and added to the warming pool 130A. In other embodiments, the warming pool manager 130 communicates with an auxiliary virtual machine instance service (e.g., the instance provisioning service 109 of FIG. 1) to create and add new instances to the warming pool 130A. In some embodiments, the warming pool manager 130 may utilize both physical computing devices within the virtual compute system 110 and one or more virtual machine instance services to acquire and maintain compute capacity that can be used to service code execution requests received by the frontend 120. In some embodiments, the virtual compute system 110 may comprise one or more logical knobs or switches for controlling (e.g., increasing or decreasing) the available capacity in the warming pool 130A. For example, a system administrator may use such a knob or switch to increase the capacity available (e.g., the number of pre-booted instances) in the warming pool 130A during peak hours. In some embodiments, virtual machine instances in the warming pool 130A can be configured based on a predetermined set of configurations independent from a specific user request to execute a user's code. The predetermined set of configurations can correspond to various types of virtual machine instances to execute user codes. The warming pool manager 130 can optimize types and numbers of virtual machine instances in the warming pool 130A based on one or more metrics related to current or previous user code executions.

As shown in FIG. 1, instances may have operating systems (OS) and/or language runtimes loaded thereon. For example, the warming pool 130A managed by the warming pool manager 130 comprises instances 152, 154. The instance 152 includes an OS 152A and a runtime 152B. The instance 154 includes an OS 154A. In some embodiments, the instances in the warming pool 130A may also include containers (which may further contain copies of operating systems, runtimes, user codes, etc.), which are described in greater detail below. Although the instance 152 is shown in FIG. 1 to include a single runtime, in other embodiments, the instances depicted in FIG. 1 may include two or more runtimes, each of which may be used for running a different user code. In some embodiments, the warming pool manager 130 may maintain a list of instances in the warming pool 130A. The list of instances may further specify the configuration (e.g., OS, runtime, container, etc.) of the instances.

In some embodiments, the virtual machine instances in the warming pool 130A may be used to serve any user's request. In one embodiment, all the virtual machine instances in the warming pool 130A are configured in the same or substantially similar manner. In another embodiment, the virtual machine instances in the warming pool 130A may be configured differently to suit the needs of different users. For example, the virtual machine instances may have different operating systems, different language runtimes, and/or different libraries loaded thereon. In yet another embodiment, the virtual machine instances in the warming pool 130A may be configured in the same or substantially similar manner (e.g., with the same OS, language runtimes, and/or libraries), but some of those instances may have different container configurations. For example, two instances may have runtimes for both Python and Ruby, but one instance may have a container configured to run Python code, and the other instance may have a container configured to run Ruby code. In some embodiments, multiple warming pools 130A, each having identically-configured virtual machine instances, are provided.

The warming pool manager 130 may pre-configure the virtual machine instances in the warming pool 130A, such that each virtual machine instance is configured to satisfy at least one of the operating conditions that may be requested or specified by the user request to execute program code on the virtual compute system 110. In one embodiment, the operating conditions may include program languages in which the potential user codes may be written. For example, such languages may include Java, JavaScript, Python, Ruby, and the like. In some embodiments, the set of languages that the user codes may be written in may be limited to a predetermined set (e.g., set of 4 languages, although in some embodiments sets of more or less than four languages are provided) in order to facilitate pre-initialization of the virtual machine instances that can satisfy requests to execute user codes. For example, when the user is configuring a request via a user interface provided by the virtual compute system 110, the user interface may prompt the user to specify one of the predetermined operating conditions for executing the user code. In another example, the service-level agreement (SLA) for utilizing the services provided by the virtual compute system 110 may specify a set of conditions (e.g., programming languages, computing resources, etc.) that user requests should satisfy, and the virtual compute system 110 may assume that the requests satisfy the set of conditions in handling the requests. In another example, operating conditions specified in the request may include: the amount of compute power to be used for processing the request; the type of the request (e.g., HTTP vs. a triggered event); the timeout for the request (e.g., threshold time after which the request may be terminated); security policies (e.g., may control which instances in the warming pool 130A are usable by which user); scheduling information (e.g., the time by which the virtual compute system is requested to execute the program code, the time after which the virtual compute system is requested to execute the program code, the temporal window within which the virtual compute system is requested to execute the program code, etc.), etc.

Worker Manager

The worker manager 140 manages the instances used for servicing incoming code execution requests. In the example illustrated in FIG. 1, the worker manager 140 manages the active pool 140A, which is a group (sometimes referred to as a pool) of virtual machine instances that are currently assigned to one or more users. Although the virtual machine instances are described here as being assigned to a particular user, in some embodiments, the instances may be assigned to a group of users, such that the instance is tied to the group of users and any member of the group can utilize resources on the instance. For example, the users in the same group may belong to the same security group (e.g., based on their security credentials) such that executing one member's code in a container on a particular instance after another member's code has been executed in another container on the same instance does not pose security risks. Similarly, the worker manager 140 may assign the instances and the containers according to one or more policies that dictate which requests can be executed in which containers and which instances can be assigned to which users. An example policy may specify that instances are assigned to collections of users who share the same account (e.g., account for accessing the services provided by the virtual compute system 110). In some embodiments, the requests associated with the same user group may share the same containers (e.g., if the user codes associated therewith are identical). In some embodiments, a request does not differentiate between the different users of the group and simply indicates the group to which the users associated with the requests belong.

In the example illustrated in FIG. 1, user codes are executed in isolated compute systems referred to as containers. Containers are logical units created within a virtual machine instance using the resources available on that instance. For example, the worker manager 140 may, based on information specified in the request to execute user code, create a new container or locate an existing container in one of the instances in the active pool 140A and assigns the container to the request to handle the execution of the user code associated with the request. In one embodiment, such containers are implemented as Linux containers. The virtual machine instances in the active pool 140A may have one or more containers created thereon and have one or more program codes associated with the user loaded thereon (e.g., either in one of the containers or in a local cache of the instance).

As shown in FIG. 1, instances may have operating systems (OS), language runtimes, and containers. The containers may have individual copies of the OS and the language runtimes and user codes loaded thereon. In the example of FIG. 1, the active pool 140A managed by the worker manager 140 includes the instances 156, 157, 158, 159. The instance 156 has containers 156A, 156B. The container 156A has OS 156A-1, runtime 156A-2, and code 156A-3 loaded therein. In the depicted example, the container 156A has its own OS, runtime, and code loaded therein. In one embodiment, the OS 156A-1 (e.g., the kernel thereof), runtime 156A-2, and/or code 156A-3 are shared among the containers 156A, 156B (and any other containers not illustrated in FIG. 1). In another embodiment, the OS 156A-1 (e.g., any code running outside the kernel), runtime 156A-2, and/or code 156A-3 are independent copies that are created for the container 156A and are not shared with other containers on the instance 156. In yet another embodiment, some portions of the OS 156A-1, runtime 156A-2, and/or code 156A-3 are shared among the containers on the instance 156, and other portions thereof are independent copies that are specific to the container 156A. The instance 157 includes containers 157A, 157B, 157C. The instance 158 includes containers 158A, 158B and resources 158C. The instance 159 includes a container 159A and resources 159A-1. The resources 158C may be instance-specific resources such as memory, disk storage, database, etc. that are accessible by any container (or any code executed therein) created thereon. The resources 159A-1 may be container-specific resources such as memory, disk storage, database, etc. that are accessible by any code executed therein.

In the example of FIG. 1, the sizes of the containers depicted in FIG. 1 may be proportional to the actual size of the containers. For example, the container 156A occupies more space than the container 156B on the instance 156. Similarly, the containers 157A, 157B, 157C may be equally sized, and the containers 158A and 158B may be equally sized. The dotted boxes labeled “C” shown in the instances 158, 159 indicate the space remaining on the instances that may be used to create new instances. In some embodiments, the sizes of the containers may be 64 MB or any multiples thereof. In other embodiments, the sizes of the containers may be any arbitrary size smaller than or equal to the size of the instances in which the containers are created. In some embodiments, the sizes of the containers may be any arbitrary size smaller than, equal to, or larger than the size of the instances in which the containers are created. By how much the sizes of the containers can exceed the size of the instance may be determined based on how likely that those containers might be utilized beyond the capacity provided by the instance.

Although the components inside the containers 156B, 157A, 157B, 157C, 158A, 158B, 159A are not illustrated in the example of FIG. 1, each of these containers may have various operating systems, language runtimes, libraries, and/or user code. In some embodiments, instances may have user codes loaded thereon (e.g., in an instance-level cache such as the resources 158C), and containers within those instances may also have user codes loaded therein. In some embodiments, the worker manager 140 may maintain a list of instances in the active pool 140A. The list of instances may further specify the configuration (e.g., OS, runtime, container, etc.) of the instances. In some embodiments, the worker manager 140 may have access to a list of instances in the warming pool 130A (e.g., including the number and type of instances). In other embodiments, the worker manager 140 requests compute capacity from the warming pool manager 130 without having knowledge of the virtual machine instances in the warming pool 130A.

After a request has been successfully processed by the frontend 120, the worker manager 140 finds capacity to service the request to execute user code on the virtual compute system 110. For example, if there exists a particular virtual machine instance in the active pool 140A that has a container with the same user code loaded therein (e.g., code 156A-3 shown in the container 156A), the worker manager 140 may assign the container to the request and cause the user code to be executed in the container. Alternatively, if the user code is available in the local cache of one of the virtual machine instances (e.g., stored on the instance 158 but does not belong to any individual containers), the worker manager 140 may create a new container on such an instance, assign the container to the request, and cause the user code to be loaded and executed in the container.

If the worker manager 140 determines that the user code associated with the request is not found on any of the instances (e.g., either in a container or the local cache of an instance) in the active pool 140A, the worker manager 140 may determine whether any of the instances in the active pool 140A is currently assigned to the user associated with the request and has compute capacity to handle the current request. If there is such an instance, the worker manager 140 may create a new container on the instance and assign the container to the request. Alternatively, the worker manager 140 may further configure an existing container on the instance assigned to the user, and assign the container to the request. For example, the worker manager 140 may determine that the existing container may be used to execute the user code if a particular library demanded by the current user request is loaded thereon. In such a case, the worker manager 140 may load the particular library and the user code onto the container and use the container to execute the user code.

If the active pool 140A does not contain any instances currently assigned to the user, the worker manager 140 pulls a new virtual machine instance from the warming pool 130A, assigns the instance to the user associated with the request, creates a new container on the instance, assigns the container to the request, and causes the user code to be downloaded and executed on the container.

In some embodiments, the virtual compute system 110 is adapted to begin execution of the user code shortly after it is received (e.g., by the frontend 120). A time period can be determined as the difference in time between initiating execution of the user code (e.g., in a container on a virtual machine instance associated with the user) and receiving a request to execute the user code (e.g., received by a frontend). The virtual compute system 110 is adapted to begin execution of the user code within a time period that is less than a predetermined duration. In one embodiment, the predetermined duration is 500 ms. In another embodiment, the predetermined duration is 300 ms. In another embodiment, the predetermined duration is 100 ms. In another embodiment, the predetermined duration is 50 ms. In another embodiment, the predetermined duration is 10 ms. In another embodiment, the predetermined duration may be any value chosen from the range of 10 ms to 500 ms. In some embodiments, the virtual compute system 110 is adapted to begin execution of the user code within a time period that is less than a predetermined duration if one or more conditions are satisfied. For example, the one or more conditions may include any one of: (1) the user code is loaded on a container in the active pool 140A at the time the request is received; (2) the user code is stored in the code cache of an instance in the active pool 140A at the time the request is received; (3) the active pool 140A contains an instance assigned to the user associated with the request at the time the request is received; or (4) the warming pool 130A has capacity to handle the request at the time the request is received. In some embodiments, instead of initiating the requested code execution as soon as the code execution request is received, the virtual compute system 110 may schedule the code execution according to the scheduling information provided by the request. For example, the request may specify a temporal window (e.g., between 3:00 AM to 4:00 AM next Monday) within which the virtual compute system 110 is requested to perform the code execution, and the virtual compute system 110 may schedule the code execution based on certain performance considerations (e.g., workload, latency, etc.).

The user code may be downloaded from an auxiliary service 106 such as the storage service 108 of FIG. 1. Data 108A illustrated in FIG. 1 may comprise user codes uploaded by one or more users, metadata associated with such user codes, or any other data utilized by the virtual compute system 110 to perform one or more techniques described herein. Although only the storage service 108 is illustrated in the example of FIG. 1, the virtual environment 100 may include other levels of storage systems from which the user code may be downloaded. For example, each instance may have one or more storage systems either physically (e.g., a local storage resident on the physical computing system on which the instance is running) or logically (e.g., a network-attached storage system in network communication with the instance and provided within or outside of the virtual compute system 110) associated with the instance on which the container is created. Alternatively, the code may be downloaded from a web-based data store provided by the storage service 108.

Once the worker manager 140 locates one of the virtual machine instances in the warming pool 130A that can be used to serve the user code execution request, the warming pool manager 130 or the worker manager 140 takes the instance out of the warming pool 130A and assigns it to the user associated with the request. The assigned virtual machine instance is taken out of the warming pool 130A and placed in the active pool 140A. In some embodiments, once the virtual machine instance has been assigned to a particular user, the same virtual machine instance cannot be used to service requests of any other user. This provides security benefits to users by preventing possible co-mingling of user resources. Alternatively, in some embodiments, multiple containers belonging to different users (or assigned to requests associated with different users) may co-exist on a single virtual machine instance. Such an approach may improve utilization of the available compute capacity. In some embodiments, the virtual compute system 110 may maintain a separate cache in which user codes are stored to serve as an intermediate level of caching system between the local cache of the virtual machine instances and a web-based network storage (e.g., accessible via the network 104).

After the user code has been executed, the worker manager 140 may tear down the container used to execute the user code to free up the resources it occupied to be used for other containers in the instance. Alternatively, the worker manager 140 may keep the container running to use it to service additional requests from the same user. For example, if another request associated with the same user code that has already been loaded in the container is received, the request can be assigned to the same container, thereby eliminating the delay associated with creating a new container and loading the user code in the container. In some embodiments, the worker manager 140 may tear down the instance in which the container used to execute the user code was created. Alternatively, the worker manager 140 may keep the instance running to use it to service additional requests from the same user. The determination of whether to keep the container and/or the instance running after the user code is done executing may be based on a threshold time, the type of the user, average request volume of the user, periodicity information (e.g., containers/instances in the active pool 140A not currently executing user code thereon can be (i) kept alive if the periodicity information indicates that additional requests are expected to arrive soon or (ii) terminated if the periodicity information indicates that additional requests are not likely to arrive soon enough to justify keeping the containers/instances alive), and/or other operating conditions. For example, after a threshold time has passed (e.g., 5 minutes, 30 minutes, 1 hour, 24 hours, 30 days, etc.) without any activity (e.g., running of the code), the container and/or the virtual machine instance is shutdown (e.g., deleted, terminated, etc.), and resources allocated thereto are released. In some embodiments, the threshold time passed before a container is torn down is shorter than the threshold time passed before an instance is torn down.

In some embodiments, the virtual compute system 110 may provide data to one or more of the auxiliary services 106 as it services incoming code execution requests. For example, the virtual compute system 110 may communicate with the monitoring/logging/billing services 107. The monitoring/logging/billing services 107 may include: a monitoring service for managing monitoring information received from the virtual compute system 110, such as statuses of containers and instances on the virtual compute system 110; a logging service for managing logging information received from the virtual compute system 110, such as activities performed by containers and instances on the virtual compute system 110; and a billing service for generating billing information associated with executing user code on the virtual compute system 110 (e.g., based on the monitoring information and/or the logging information managed by the monitoring service and the logging service). In addition to the system-level activities that may be performed by the monitoring/logging/billing services 107 (e.g., on behalf of the virtual compute system 110) as described above, the monitoring/logging/billing services 107 may provide application-level services on behalf of the user code executed on the virtual compute system 110. For example, the monitoring/logging/billing services 107 may monitor and/or log various inputs, outputs, or other data and parameters on behalf of the user code being executed on the virtual compute system 110. Although shown as a single block, the monitoring, logging, and billing services 107 may be provided as separate services.

In some embodiments, the worker manager 140 may perform health checks on the instances and containers managed by the worker manager 140 (e.g., those in the active pool 140A). For example, the health checks performed by the worker manager 140 may include determining whether the instances and the containers managed by the worker manager 140 have any issues of (1) misconfigured networking and/or startup configuration, (2) exhausted memory, (3) corrupted file system, (4) incompatible kernel, and/or any other problems that may impair the performance of the instances and the containers. In one embodiment, the worker manager 140 performs the health checks periodically (e.g., every 5 minutes, every 30 minutes, every hour, every 24 hours, etc.). In some embodiments, the frequency of the health checks may be adjusted automatically based on the result of the health checks. In other embodiments, the frequency of the health checks may be adjusted based on user requests. In some embodiments, the worker manager 140 may perform similar health checks on the instances and/or containers in the warming pool 130A. The instances and/or the containers in the warming pool 130A may be managed either together with those instances and containers in the active pool 140A or separately. In some embodiments, in the case where the health of the instances and/or the containers in the warming pool 130A is managed separately from the active pool 140A, the warming pool manager 130, instead of the worker manager 140, may perform the health checks described above on the instances and/or the containers in the warming pool 130A.

Routing Manager

The routing manager 150 creates and manages a mapping between incoming code execution requests received by the virtual compute system 110 and the compute capacity used to handle those code execution requests. The mapping may facilitate use and reuse of certain container-specific resources by multiple requests. For example, a given container may be associated with a cache that stores code execution results and may be accessed by any program code executed in the given container. Accordingly, once the code execution result associated with a request is stored in the cache, subsequent requests of the same type, if routed to the given container, may be handled more efficiently using the code execution results stored in the cache. Although the routing manager 150 is illustrated as a distinct component within the virtual compute system 110, part or all of the functionalities of the routing manager 150 may be performed by the frontend 120, the warming pool manager 130, and/or the worker manager 140. For example, the routing manager 150 may be implemented entirely within one of the other components of the virtual compute system 110 or in a distributed manner across the other components of the virtual compute system 110. In the example of FIG. 1, the routing manager 150 includes mapping data 150A. The mapping data 150A may include data indicating how the incoming code execution requests should be routed to the containers running on the virtual compute system 110. The mapping data 150A may also include any container/routing policies specified by the users or determined by the routing manager 150 for routing the incoming requests received by the virtual compute system 110. The mapping data 150A may be stored in a storage device internal to the virtual compute system 110 and/or stored in an external storage device (e.g., storage service 108) and periodically backed up.

The routing manager 150 may include a routing parameter determination unit for determining a routing parameter associated with a given code execution request, and a container lookup unit for determining the appropriate container to be used to handle the given code execution request based on the determined routing parameter. An example configuration of the routing manager 150 is described in greater detail below with reference to FIG. 2.

Maintaining Resources Associated With Containers

In some embodiments, containers running on the virtual compute system 110 may be associated with container-specific resources such as memory, disk storage, database, etc. that are accessible by any program code executed in the containers. For example, code execution results of a program code executed in a container may be cached in local memory associated with the container. The cached results may be utilized by the virtual compute system 110 to facilitate other code execution requests of the same type (e.g., requests associated with the same program code and the same set of arguments). In one example, a user may wish to provide a weather service that allows people to type in zip codes and view the weather information associated with those zip codes. Every time a zip code is entered, a request may be sent to the virtual compute system 110 to execute a weather information lookup function (e.g., in a container created on a virtual machine instance assigned to the user) using the entered zip code. The lookup function may retrieve the weather information from a weather database using the zip code and output the retrieved weather information. The retrieved weather information may also be stored in the memory associated with the container, so that any future code execution requests can utilize the stored information. For example, if another request having the same zip code is received (e.g., within a threshold time period), the weather information lookup function may simply return the cached result without going to the weather database, thereby achieving some latency gains. Even if the current weather information is cached, if the subsequent requests are routed to a different container that cannot access the cached information, the cached information would not be available to the weather information lookup function and the latency gains could not be achieved. Additionally, or alternatively, the virtual compute system 110 may have other resources such as memory, disk storage, database, etc. accessible at the instance level (e.g., accessible by any program code executed on the particular instance or any containers thereon) and/or at the account level (e.g., accessible by any program code executed on an instance associated with the user).

Mapping Between Requests and Specific Containers

In some embodiments, the routing manager 150 processes the incoming code execution requests and determines to which containers the requests should be routed. For example, when the virtual compute system 110 receives a request associated with a given program code for the first time, there may be no mapping that routes the request to a specific container running on the virtual compute system 110. Upon receiving such a request, an instance may be moved from the warming pool 130A to the active pool 140A and assigned to the user associated with the request. Then, the virtual compute system 110 can create a container on the instance, load the program code onto the container, and execute the program code in the container. Any information generated or obtained while executing the program code may be stored in one or more computing resources associated with the container. The computing resources may include local memory and/or disk storage accessible only by the container. The computing resources may also include a database that is maintained on the virtual compute system 110 or on an external service (e.g., auxiliary service 106). Upon storing the information generated or obtained while executing the program code in one or more computing resources, the routing manager 150 may update the mapping data 150A so that future requests that may benefit from utilizing the stored container-specific information would be routed to this specific container.

The routing manager 150 may utilize any known hashing schemes or other data structures to update and maintain the mapping data 150A. For example, the execution parameters included in the request may be hashed and mapped to the IDs of the containers. The mapping data 150A may include, for each program code execute on the virtual compute system 110, a table mapping various combinations of execution parameters to specific containers. The routing manager 150 may hash one or more of the execution parameters included in the request to determine a routing parameter, and use the routing parameter to determine a specific container to which the mapping data 150A maps the routing parameter. For example, if a first request requests execution of Function Foo with arguments “current temperature” and “90020,” the routing manager 150 may route the first request to a first container, and if a second request requests execution of Function Foo with arguments “current temperature” and “10012,” the routing manager 150 may route the second request to a second container. In another example, the requests may specify the name of the database that the requests are configured to manage or modify. In such an example, the database name may serve as the routing parameter that is mapped to specific containers (e.g., requests associated with database A mapped to container A, requests associated with database B mapped to containers B, C, and D, requests associated with databases C, D, and E mapped to container E, etc.).

In other embodiments, only a subset of the parameters are considered in generating the routing parameter. In such an example, each request associated with Function Foo and argument “current temperature” may be routed to the same container, regardless of other argument values. In yet another example, the mapping data 150A may provide that all requests associated with Function Foo are to be routed to a particular container. Although the example of routing to specific containers is used in some embodiments of the present disclosure, the techniques discussed herein may be applied to providing mapping data 150A that maps requests to particular instances, particular frontends, particular geographic locations, particular worker managers, etc. such that computing resources at the relevant level of granularity (e.g., instance-specific resources, account-specific resources, location-specific resources, etc.) may be utilized by the requests.

The mapping data 150A may be provided by the user, for example, via one or more UIs, CLIs, APIs, and/or other programmatic interfaces. The virtual compute system 110 may provide certain container information to the user, for example, when containers are created or terminated, so that the user can provide the mapping data with respect to specific containers. In some embodiments, the mapping data 150A may specify that a first group of requests (e.g., requests associated with Function Foo, requests containing a particular parameter specified by the user, requests receiving during certain hours, etc.) should be routed to one container and a second group of requests should be routed to another container. By providing an indication in the request that the request is to be handled using a specific container and/or by providing a mapping between parameter values (e.g., hash values) and specific containers, the user may control which requests are handled using which containers (and thus have access to which container-specific resources) and achieve reduced latencies associated with the requests by omitting costly operations using the container-specific resources (e.g., data locally stored within the container). The mapping data 150A may provide routing based on user account (e.g., requests associated with different user accounts routed to different containers), program code (e.g., requests associated with different program codes routed to different containers), time of day (e.g., requests received at different hours, days, months, years, etc. routed to different containers), geographic regions (e.g., requests associated with different geographic regions routed to different containers), function arguments (e.g., requests having different combinations of parameters or arguments routed to different containers), other request parameters or metadata, etc. In some embodiments, the portion of the mapping data 150A that would cause such requests to be routed to this specific container is deleted upon the termination of the container (e.g., due to lack of use).

Managing Backend Resources

In some embodiments, the routing manager 150 may monitor backend resources utilized in connection with incoming code execution requests. In some cases, third-party or user-owned resources (e.g., disk storage, database, network, etc.) may be used by program codes executed on the virtual compute system 110, and such resources may not scale as well as those managed by the virtual compute system 110 (e.g., handle large burst traffic), thereby creating an impedance mismatch. In such cases, the virtual compute system 110 may allow the users to specify the mapping between requests and containers such that the backend resources are utilized in a more controlled manner. For example, the mapping data 150A may provide that all requests utilizing a first backend resource should be routed to a first container, and all requests utilizing a second backend resource should be routed to any of a group of ten containers. In such an example, when a program code is being executed in the first container, the user can be sure that the program code is the only one accessing or managing the first backend resource and that the first backend resource is not overburdened by a large number of simultaneous requests.

User Customization of Compute Capacity

In some embodiments, the virtual compute system 110 may allow users to customize the instances that are used to handle their requests. For example, a user may specify, for example, via one or more UIs, CLIs, APIs, and/or other programmatic interfaces, that a specific version of the language runtime (or other software components) is provided on the instances servicing the code execution requests associated with the user. In response, the virtual compute system 110 may install the specified version of the language runtime when a new instance is assigned to the user such that any container created thereon can access the installed language runtime. In some embodiments, the routing manager 150 may update the mapping data 150A such that requests associated with the user are routed to one or more containers running on these customized instances so that, after the initial customization (and the associated latency hit), subsequent containers created on the customized instance can take advantage of the customization.

Frontend/Routing Manager Gossiping Routing Information

In some embodiments, the virtual compute system 110 may have multiple frontends 120 associated with different sets of warming pool managers 130 and worker managers 140. In such embodiments, the routing manager 150 may communicate with each of the frontends 120 to provide the routing information used to route incoming code execution requests to specific containers (or instances). In other embodiments, each frontend 120 may be associated with a different routing manager 150. In such embodiments, the frontends 120 and/or the routing managers 150 may gossip information to each other as soon as new routing information (e.g., mapping data 150A) becomes available so that incoming code execution requests can be routed to the appropriate containers. For example, as soon as one of the frontends 120 or the routing managers 150 obtains or determines new mapping information, the mapping information is shared with all of the frontends 120 or the routing managers 150 on the virtual compute system 110.

Account-, Instance-, Function-, and Container-Level Resources (11)

In some embodiments, the virtual compute system 110 maintains one or more computing resources at various levels. For example, the virtual compute system 110 may maintain one or more account-level resources (e.g., accessible by any code execution associated with the same account), one or more instance-level resources (e.g., accessible by any code execution on the same instance), one or more function-level resources (e.g., accessible by any code execution associated with the same function or program code), one or more container-level resources (e.g., accessible by any code execution in the same container), etc. The computing resources may include memory, disk storage, database, network, or any other resources that may be accessed during code execution.

External Services Controlling Container Lifecycle

In some embodiments, the virtual compute system 110 may allow third party services (e.g., application performance monitoring service, logging service, etc.) to exercise a certain amount of control over the lifecycle of the containers created on the virtual compute system 110. In some cases, these services may have the ability to ingest only at a specific rate or only a specific kind of data. In such cases, the virtual compute system 110 may allow these services to control the tempo at which the containers are created and/or terminated, for example, by allowing these services to perform one or more operations before/after containers are created or terminated. In one example, a logging service may perform certain logging operations at the end of a container's lifecycle to perform logging and cleanup operations. In another example, an external service may specify that only specific types of requests should be sent to the containers managed by the external service. In response, the routing manager 150 may update the mapping data 150A so that only the specified types of requests are routed to the containers managed by the external service.

Container Lifecycle Management

In some embodiments, the routing manager 150 may keep one or more containers alive by refraining from terminating them immediately or soon after code executions in the containers have been completed. For example, the routing manager 150 may cause certain containers to be kept alive even if the containers cannot be used to service any existing code execution requests. The decision of whether to keep such containers alive may be based on how frequently the requests that would be handled using the containers are expected to be received by the virtual compute system 110 and/or how much information has been stored in association with such containers in container-specific computing resources. The process of keeping the containers alive beyond their normal schedule is described in greater detail below with reference to FIG. 6.

Information Regarding Future Code Executions

In some embodiments, the routing manager 150 may maintain execution information regarding future code executions on the virtual compute system 110. For example, such information may provide that Function Y should be executed upon a successful execution of Function X, and that Function Z should be executed upon an unsuccessful execution of Function X. In such an example, the routing manager 150 may check the execution information after each attempted execution of program codes, to determine the next course of action. In another example, the routing manager 150 may maintain the execution information in one or more computing resources associated with the container in which the program code is executed, and check the execution information after a request has been routed to the container (e.g., just as the routing manager 150 would check the cached information to determine whether or how the program code should be executed).

Local Timer

In some embodiments, the routing manager 150 may maintain a local timer within individual containers. For example, a first container may maintain a local timer in a computing resource (e.g., memory, disk storage, etc.) associated with the first container, and any request routed to the first container may utilize the local timer for executing code in the first container. By maintaining a local timer that can be utilized by requests routed to the first container, the routing manager 150 eliminates the need to access certain external services (e.g., a scheduling service external to the virtual compute system 110) to monitor timing information (e.g., the requests can simply utilize the local timer), thereby achieving latency gains.

General Architecture of Routing Manager

FIG. 2 depicts a general architecture of a computing system (referenced as routing manager 150) that manages the virtual machine instances in the virtual compute system 110. The general architecture of the routing manager 150 depicted in FIG. 2 includes an arrangement of computer hardware and software modules that may be used to implement aspects of the present disclosure. The routing manager 150 may include many more (or fewer) elements than those shown in FIG. 2. It is not necessary, however, that all of these generally conventional elements be shown in order to provide an enabling disclosure. As illustrated, the routing manager 150 includes a processing unit 190, a network interface 192, a computer readable medium drive 194, an input/output device interface 196, all of which may communicate with one another by way of a communication bus. The network interface 192 may provide connectivity to one or more networks or computing systems. The processing unit 190 may thus receive information and instructions from other computing systems or services via the network 104. The processing unit 190 may also communicate to and from memory 180 and further provide output information for an optional display (not shown) via the input/output device interface 196. The input/output device interface 196 may also accept input from an optional input device (not shown).

The memory 180 may contain computer program instructions (grouped as modules in some embodiments) that the processing unit 190 executes in order to implement one or more aspects of the present disclosure. The memory 180 generally includes RAM, ROM and/or other persistent, auxiliary or non-transitory computer-readable media. The memory 180 may store an operating system 184 that provides computer program instructions for use by the processing unit 190 in the general administration and operation of the routing manager 150. The memory 180 may further include computer program instructions and other information for implementing aspects of the present disclosure. For example, in one embodiment, the memory 180 includes a user interface unit 182 that generates user interfaces (and/or instructions therefor) for display upon a computing device, e.g., via a navigation and/or browsing interface such as a browser or application installed on the computing device. In addition, the memory 180 may include and/or communicate with one or more data repositories (not shown), for example, to access user program codes and/or libraries.

In addition to and/or in combination with the user interface unit 182, the memory 180 may include a routing parameter determination unit 186 and a container lookup unit 188 that may be executed by the processing unit 190. In one embodiment, the user interface unit 182, routing parameter determination unit 186, and container lookup unit 188 individually or collectively implement various aspects of the present disclosure, e.g., maintaining routing information for routing requests to appropriate containers, processing incoming code execution requests, determining routing parameters associated with the requests, identifying containers to be used for handling the requests, etc. as described further below.

The routing parameter determination unit 186 determines a routing parameter associated with a given code execution request. For example, the routing parameter determination unit 186 processes the code execution request and extracts a routing parameter included in the request. Additionally or alternatively, the routing parameter determination unit 186 determines a routing parameter based on one or more of the account associated with the request, the program code associated with the request, the execution parameters included in the request, or other metadata associated with the request, such as the time of receipt, etc.

The container lookup unit 188 uses the determined routing parameter to look up the appropriate container to which the request should be routed. Any known hashing and/or lookup schemes may be used to associate routing parameters to specific containers and determine the appropriate container based on the routing parameter.

While the routing parameter determination unit 186 and the container lookup unit 188 are shown in FIG. 2 as part of the routing manager 150, in other embodiments, all or a portion of the routing parameter determination unit 186 and the container lookup unit 188 may be implemented, as a single unit, separate units, or in a distributed manner, by other components of the virtual compute system 110 and/or another computing device. For example, in certain embodiments of the present disclosure, another computing device in communication with the virtual compute system 110 may include several modules or components that operate similarly to the modules and components illustrated as part of the routing manager 150.

Example Routine for Routing Code Execution Requests

Turning now to FIG. 3, a routine 300 implemented by one or more components of the virtual compute system 110 (e.g., the routing manager 150) will be described. Although routine 300 is described with regard to implementation by the routing manager 150, one skilled in the relevant art will appreciate that alternative components may implement routine 300 or that one or more of the blocks may be implemented by a different component or in a distributed manner.

At block 302 of the illustrative routine 300, the routing manager 150 maintains a plurality of virtual machine instances. The plurality of virtual machine instances may include a warming pool (e.g., warming pool 130A) comprising virtual machine instances having one or more software components loaded thereon and waiting to be assigned to a user, and an active pool (e.g., active pool 140A) comprising virtual machine instances currently assigned to one or more users. The virtual machine instances in the active pool may have one or more containers created thereon for executing program codes therein.

At block 304, the routing manager 150 processes a request to execute a program code on the virtual compute system 110. The request may include a user indication that that the program code is to be executed based on one or more computing resources modified by a prior execution of the program code. For example, a prior execution of the program code may have caused certain data (e.g., key-value pairs stored in a database, function return values, etc.) to be retrieved (e.g., from an external database service in communication with the virtual compute system 110) or calculated and stored locally within the container in which the prior execution occurred, and any subsequent requests that may benefit from having access to the stored data or any subsequent requests that include user indications to use such stored data may be routed to the container in which the prior execution occurred so that the subsequent executions have access to the locally stored data. The request may also include user account information (e.g., identity of the account associated with a user), program code information (e.g., identity of the first program code to be executed) and one or more parameters (e.g., execution parameters, function arguments, etc.) to be used for executing the first program code.

At block 306, the routing manager 150 identifies, based on the user indication that that the program code is to be executed based on one or more computing resources modified by a prior execution of the program code, a container on a first virtual machine instance of the plurality of virtual machine instances that is associated with the one or more computing resources. For example, the routing manager 150 may calculate a hash value based on the user indication provided in the request, and perform a lookup of the hash value in a mapping table (e.g., mapping data 150A) maintained on the virtual compute system that maps hash values to specific containers. For example, the user indication (or the mapping data 150A maintained on the virtual compute system 110) may further provide that requests associated with the same parameters (e.g., zip code to be used to look up weather information) should be routed to the same container. Although the container is used as an example destination, the request or the mapping data 150A may indicate that the request should be routed to one of multiple containers or a group of containers.

At block 308, the routing manager 150 causes the program code to be executed in the container. In one example, the routing manager 150 (or another component of the virtual compute system 110 such as the worker manager 140) may determine whether a request of the same type has been processed in the container, and if so, determine whether one or more computer resources associated with the container contains information that can facilitate the execution of the program code. For example, prior execution results associated with the program code may have been stored in a memory associated with the container. In such a case, the current execution of the program code may output or return the prior execution results or omit certain computing operations (e.g., data retrieval, function invocation, data calculation, etc.) based on the availability of the prior execution results, thereby achieving a reduced latency.

While the routine 300 of FIG. 3 has been described above with reference to blocks 302-308, the embodiments described herein are not limited as such, and one or more blocks may be omitted, modified, or switched without departing from the spirit of the present disclosure.

Example Mapping Table

Turning now to FIG. 4, an example mapping table maintained either by the virtual compute system 110 or by an auxiliary service 106 of FIG. 1 will be described. As illustrated in FIG. 4, the table 400 includes incoming code execution requests labeled “Request A,” “Request B,” “Request C,” and “Request D,” each of which associated with a routing parameter and a container ID. For example, Request A has a routing parameter value of X and a container ID of 2, Request B has a routing parameter value of Y and a container ID of 7, Request C has a routing parameter value of C and a container ID of 2, and Request D has a routing parameter value of D and a container ID of 1. In the example of FIG. 4, it is assumed that Requests A-D are received by the virtual compute system 110 sequentially (e.g., A, then B, then C, and then D). The routing manager 150 may determine the routing parameter associated with Request A, either based on the routing parameter included in the request or based on the nature of the request (e.g., associated user account, function, etc.). The routing manager 150 determines the routing parameter of Request A to be “X” and identifies the container associated with the routing parameter X, which is the container having an ID value of 2. After Request A is processed, Request B is received and is routed to a container having an ID value of 7 based on the determined routing parameter value of “Y.” When Request C is received, the routing manager 150 determines that Request C has the same routing parameter value has a previously handled Request A. According to the mapping table 400, Request C is also handled using the container having an ID value of 2, potentially achieving some latency gains if Request C is able to utilize information processed by Request A and stored in association with the container having the ID value of 2. Then, Request D is received and is routed to a container having an ID value of 1 based on the determined routing parameter value of “Z.” In some embodiments, the routing parameter value may indicate the specific resources (e.g., resource ID identifying resources such as resources 158C and resources 159A-1 of FIG. 1) requested for executing the program codes. For example, requests requesting to use the same resource may be routed to the same container or the same group of containers.

The mapping table (or mapping data 150A) is not limited to the configuration shown in the example of FIG. 4, and may include any number of parameters that can be used for determining how the requests should be routed to which containers.

Example Routine for Caching Code Execution Results

Turning now to FIG. 5, a routine 500 implemented by one or more components of the virtual compute system 110 (e.g., the routing manager 150) will be described. Although routine 500 is described with regard to implementation by the routing manager 150, one skilled in the relevant art will appreciate that alternative components may implement routine 500 or that one or more of the blocks may be implemented by a different component or in a distributed manner.

At block 502 of the illustrative routine 500, the routing manager 150 routes a request to execute a program code to a container. The container to which the request is routed may have been identified according to the routine 300 described with reference to FIG. 3.

At block 504, the routing manager 150 determines whether a prior code execution data that may be utilized by the request is available in one of the resources (e.g., memory, disk storage, database, etc.) associated with the container. In some examples, the routing manager 150 may determine whether the computing resources associated with the container contains any information available for use in connection with the current request (e.g., code execution results, or other data, determinations, and/or calculations). If the routing manager 150 determines that a prior code execution data that may be utilized by the request is available, the routine proceeds to block 510, where the prior code execution data is presented to the program code. Otherwise, the routine 500 proceeds to block 506.

At block 506, the routing manager 150 causes the program code to be executed in the container. The program code may be executed using one or more parameters included in the request. In some embodiments, the cached data presented to the program code causes the program code to start at a different state than the program code would have without the cached data. The program code may omit certain computing operations (such as data retrieval or calculations) based on the availability of the cached data. Once the code execution is finished, the routing manager 150 may store any information that may facilitate the processing of future requests of the same or similar type in one or more computing resources associated with the container. At block 508, the routing manager 150 outputs the code execution result obtained from executing the program code. In some cases, the outputted code execution result may be identical to the cached data presented to the program code at block 510. In other cases, the program code further processes or modifies the cached data to produce a code execution result that is different from the cached data.

While the routine 500 of FIG. 5 has been described above with reference to blocks 502-510, the embodiments described herein are not limited as such, and one or more blocks may be omitted, modified, or switched without departing from the spirit of the present disclosure.

Example Routine for Managing Container Lifecycle

Turning now to FIG. 6, a routine 600 implemented by one or more components of the virtual compute system 110 (e.g., the routing manager 150) will be described. Although routine 600 is described with regard to implementation by the routing manager 150, one skilled in the relevant art will appreciate that alternative components may implement routine 600 or that one or more of the blocks may be implemented by a different component or in a distributed manner.

At block 602 of the illustrative routine 600, the routing manager 150 finishes executing a program code on a container. At block 604, the routing manager 150 updates one or more computing resources associated with the container based on the finished execution. The updated computing resources may include information that may facilitate the processing of future requests of the same or similar type, as discussed with reference to FIG. 5.

At block 606, the routing manager 150 determines whether one or more threshold criteria for keeping a container alive are satisfied. In some cases, a container may not be immediately shut down even if the virtual compute system 110 does not have any request that can be handled using the container, in anticipation that such a request may shortly arrive and utilize the information stored in association with the container. In such cases, if the performance gain achieved by keeping the container alive and handling a future request using the container outweighs the cost of keeping the container alive, the routing manager 150 may choose to keep the container alive for an extended period of time beyond the normal schedule. The threshold criteria may include a threshold frequency level at which requests of the same type are received. For example, if a container has cached information that can be utilized by a large number in the near future (e.g., expected to be received at a greater frequency than the threshold frequency level), the routing manager 150 may keep the container alive. The threshold criteria may include a threshold size of the information stored in association with the container. If the container has a lot of information (e.g., greater than the threshold amount) stored in a local memory or storage, the routing manager 150 may keep the container alive. If the routing manager 150 determines that the threshold criteria are not satisfied, the routine 600 proceeds to 610. Otherwise, the routine 600 proceeds to block 608.

At block 608, the routing manager 150 keeps the container running for handling future code execution requests. In some embodiments, the duration for which the containers are kept alive beyond their normal schedule is proportional to the size of the information stored in the containers or the frequency at which requests that would use the information stored in the containers are expected to be received. In other embodiments, the containers are kept alive for a fixed duration, and if the containers remain idle for the fixed duration, the containers are shut down.

At block 610, the routing manager 150 causes any cached data associated with the container to be presented to a shutdown program code (or shutdown hook) configured execute when the container is shut down. The shutdown program code may be used to perform any logging, monitoring, cleanup, or other operations associated with the container. At block 612, the routing manager 150 causes the shutdown program code to be executed in the container. At block 614, the routing manager 150 causes the container to be shut down. In some embodiments, the routing manager 150 may notify the container of the shutdown before the shutdown is performed, so that any data stored in the container-specific computing resources can be stored in permanent storage available even after shutting down the container.

While the routine 600 of FIG. 6 has been described above with reference to blocks 602-608, the embodiments described herein are not limited as such, and one or more blocks may be omitted, modified, or switched without departing from the spirit of the present disclosure. For example, in some embodiments, at block 614, the container is not shut down but instead reset or cleared.

Other Considerations

It will be appreciated by those skilled in the art and others that all of the functions described in this disclosure may be embodied in software executed by one or more physical processors of the disclosed components and mobile communication devices. The software may be persistently stored in any type of non-volatile storage.

Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.

Any process descriptions, elements, or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those skilled in the art. It will further be appreciated that the data and/or components described above may be stored on a computer-readable medium and loaded into memory of the computing device using a drive mechanism associated with a computer readable storage medium storing the computer executable components such as a CD-ROM, DVD-ROM, or network interface. Further, the component and/or data can be included in a single device or distributed in any manner. Accordingly, general purpose computing devices may be configured to implement the processes, algorithms, and methodology of the present disclosure with the processing and/or execution of the various data and/or components described above.

It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure and protected by the following claims.

Claims

1. A computer-implemented method, as implemented by one or more computing devices configured with specific computer-executable instructions, the computer-implemented method comprising: providing a plurality of virtual machine instances usable to execute program codes thereon;receiving a first request to execute a program code on one of the plurality of virtual machine instances;determining, based on at least one parameter associated with the first request, a routing parameter value associated with the first request for routing the first request to one of the plurality of virtual machine instances;identifying a first container associated with the routing parameter value, wherein the first container is created on a first virtual machine instance of the plurality of virtual machine instances; androuting the first request to the first container such that the program code is executed in the first container that was previously used to process a second request that had the same routing parameter as the first request.
2. The computer-implemented method of claim 1, further comprising identifying the first container using a mapping table storing a plurality of routing parameters values and a corresponding plurality of container identifiers.
3. The computer-implemented method of claim 1, wherein the execution of the program code in the first container utilizes information stored during a prior execution of the program code on behalf of the second request in the first container.
4. The computer-implemented method of claim 1, wherein the routing parameter value is included in the first request.
5. The computer-implemented method of claim 1, wherein the routing parameter value is determined based at least on a user account associated with the first request.
6. The computer-implemented method of claim 1, wherein the routing parameter value is determined based at least on the program code associated with the first request.
7. The computer-implemented method of claim 1, wherein the routing parameter value is determined based at least on a combination of the program code associated with the first request and one or more arguments to the program code such that code execution requests having two different sets of arguments can be routed to different containers despite being associated with the same program code.
8. A system, comprising: one or more processors; andone or more memories, the one or more memories having stored thereon instructions, which, when executed by the one or more processors, configure the one or more processors to: cause a plurality of virtual machine instances usable to execute program codes thereon to be provided;receive a first request to execute a program code on one of the plurality of virtual machine instances;determine, based on at least one parameter associated with the first request, a routing parameter value associated with the first request for routing the first request to one of the plurality of virtual machine instances;identify a first container associated with the routing parameter value, wherein the first container is created on a first virtual machine instance of the plurality of virtual machine instances; andcause the first request to be routed to the first container such that the program code is executed in the first container that was previously used to process a second request that had the same routing parameter as the first request.
9. The system of claim 8, wherein the instructions, when executed by the one or more processors, further configure the one or more processors to identify the first container using a mapping table storing a plurality of routing parameters values and a corresponding plurality of container identifiers.
10. The system of claim 8, wherein the execution of the program code in the first container utilizes information stored during a prior execution of the program code on behalf of the second request in the first container.
11. The system of claim 8, wherein the routing parameter value is included in the first request.
12. The system of claim 8, wherein the routing parameter value is determined based at least on a user account associated with the first request.
13. The system of claim 8, wherein the routing parameter value is determined based at least on the program code associated with the first request.
14. The system of claim 8, wherein the routing parameter value is determined based at least on a combination of the program code associated with the first request and one or more arguments to the program code such that code execution requests having two different sets of arguments can be routed to different containers despite being associated with the same program code.
15. Non-transitory physical computer storage storing instructions, which, when executed by one or more computing devices, configure the one or more computing devices to: cause a plurality of virtual machine instances usable to execute program codes thereon to be provided;receive a first request to execute a program code on one of the plurality of virtual machine instances;determine, based on at least one parameter associated with the first request, a routing parameter value associated with the first request for routing the first request to one of the plurality of virtual machine instances;identify a first container associated with the routing parameter value, wherein the first container is created on a first virtual machine instance of the plurality of virtual machine instances; andcause the first request to be routed to the first container such that the program code is executed in the first container that was previously used to process a second request that had the same routing parameter as the first request.
16. The non-transitory physical computer storage of claim 15, wherein the instructions, when executed by the one or more computing devices, further configure the one or more computing devices to identify the first container using a mapping table storing a plurality of routing parameters values and a corresponding plurality of container identifiers.
17. The non-transitory physical computer storage of claim 15, wherein the execution of the program code in the first container utilizes information stored during a prior execution of the program code on behalf of the second request in the first container.
18. The non-transitory physical computer storage of claim 15, wherein the routing parameter value is determined based at least on a user account associated with the first request.
19. The non-transitory physical computer storage of claim 15, wherein the routing parameter value is determined based at least on the program code associated with the first request.
20. The non-transitory physical computer storage of claim 15, wherein the routing parameter value is determined based at least on a combination of the program code associated with the first request and one or more arguments to the program code such that code execution requests having two different sets of arguments can be routed to different containers despite being associated with the same program code.

RELATED APPLICATION

This application is a continuation of U.S. application Ser. No. 15/912,273, filed Mar. 5, 2018 and titled “CODE EXECUTION REQUEST ROUTING,” which is a continuation of U.S. application Ser. No. 14/977,544, filed Dec. 21, 2015 and titled “CODE EXECUTION REQUEST ROUTING,” the disclosures of which are hereby incorporated by reference in their entireties.

US Referenced Citations (649)

Number	Name	Date	Kind
4949254	Shorter	Aug 1990	A
5283888	Dao et al.	Feb 1994	A
5970488	Crowe et al.	Oct 1999	A
6260058	Hoenninger et al.	Jul 2001	B1
6385636	Suzuki	May 2002	B1
6463509	Teoman et al.	Oct 2002	B1
6501736	Smolik et al.	Dec 2002	B1
6523035	Fleming et al.	Feb 2003	B1
6549936	Hirabayashi	Apr 2003	B1
6708276	Yarsa et al.	Mar 2004	B1
7036121	Casabona et al.	Apr 2006	B1
7590806	Harris et al.	Sep 2009	B2
7665090	Tormasov et al.	Feb 2010	B1
7707579	Rodriguez	Apr 2010	B2
7730464	Trowbridge	Jun 2010	B2
7774191	Berkowitz et al.	Aug 2010	B2
7823186	Pouliot	Oct 2010	B2
7831464	Nichols et al.	Nov 2010	B1
7870153	Croft et al.	Jan 2011	B2
7886021	Scheifler et al.	Feb 2011	B2
7949677	Croft et al.	May 2011	B2
7954150	Croft et al.	May 2011	B2
8010679	Low et al.	Aug 2011	B2
8010990	Ferguson et al.	Aug 2011	B2
8024564	Bassani et al.	Sep 2011	B2
8046765	Cherkasova et al.	Oct 2011	B2
8051180	Mazzaferri et al.	Nov 2011	B2
8051266	DeVal et al.	Nov 2011	B2
8065676	Sahai et al.	Nov 2011	B1
8065682	Baryshnikov et al.	Nov 2011	B2
8095931	Chen et al.	Jan 2012	B1
8127284	Meijer et al.	Feb 2012	B2
8146073	Sinha	Mar 2012	B2
8166304	Murase et al.	Apr 2012	B2
8171473	Lavin	May 2012	B2
8201026	Bornstein et al.	Jun 2012	B1
8209695	Pruyne et al.	Jun 2012	B1
8219987	Vlaovic et al.	Jul 2012	B1
8321554	Dickinson	Nov 2012	B2
8321558	Sirota et al.	Nov 2012	B1
8336079	Budko et al.	Dec 2012	B2
8352608	Keagy et al.	Jan 2013	B1
8387075	McCann et al.	Feb 2013	B1
8429282	Ahuja	Apr 2013	B1
8448165	Conover	May 2013	B1
8490088	Tang	Jul 2013	B2
8555281	Van Dijk et al.	Oct 2013	B1
8560699	Theimer et al.	Oct 2013	B1
8566835	Wang et al.	Oct 2013	B2
8601323	Tsantilis	Dec 2013	B2
8613070	Borzycki et al.	Dec 2013	B1
8615589	Adogla et al.	Dec 2013	B1
8631130	Jackson	Jan 2014	B2
8667471	Wintergerst et al.	Mar 2014	B2
8677359	Cavage et al.	Mar 2014	B1
8694996	Cawlfield et al.	Apr 2014	B2
8700768	Benari	Apr 2014	B2
8719415	Sirota et al.	May 2014	B1
8725702	Raman et al.	May 2014	B1
8756696	Miller	Jun 2014	B1
8769519	Leitman et al.	Jul 2014	B2
8799236	Azari et al.	Aug 2014	B1
8799879	Wright et al.	Aug 2014	B2
8806468	Meijer et al.	Aug 2014	B2
8819679	Agarwal et al.	Aug 2014	B2
8825863	Hansson et al.	Sep 2014	B2
8825964	Sopka et al.	Sep 2014	B1
8839035	Dimitrovich et al.	Sep 2014	B1
8850432	Mcgrath et al.	Sep 2014	B2
8869300	Singh et al.	Oct 2014	B2
8874952	Tameshige et al.	Oct 2014	B2
8904008	Calder et al.	Dec 2014	B2
8966495	Kulkarni	Feb 2015	B2
8997093	Dimitrov	Mar 2015	B2
9027087	Ishaya et al.	May 2015	B2
9038068	Engle et al.	May 2015	B2
9052935	Rajaa	Jun 2015	B1
9086897	Oh et al.	Jul 2015	B2
9086924	Barsness et al.	Jul 2015	B2
9092837	Bala et al.	Jul 2015	B2
9098528	Wang	Aug 2015	B2
9110732	Forschmiedt et al.	Aug 2015	B1
9110770	Raju et al.	Aug 2015	B1
9111037	Nalis et al.	Aug 2015	B1
9112813	Jackson	Aug 2015	B2
9141410	Leafe et al.	Sep 2015	B2
9146764	Wagner	Sep 2015	B1
9152406	De et al.	Oct 2015	B2
9164754	Pohlack	Oct 2015	B1
9183019	Kruglick	Nov 2015	B2
9208007	Harper et al.	Dec 2015	B2
9218190	Anand et al.	Dec 2015	B2
9223561	Orveillon et al.	Dec 2015	B2
9223966	Satish et al.	Dec 2015	B1
9250893	Blahaerath et al.	Feb 2016	B2
9268586	Voccio et al.	Feb 2016	B2
9298633	Zhao et al.	Mar 2016	B1
9317689	Aissi	Apr 2016	B2
9323556	Wagner	Apr 2016	B2
9361145	Wilson et al.	Jun 2016	B1
9413626	Reque et al.	Aug 2016	B2
9436555	Dornemann et al.	Sep 2016	B2
9461996	Hayton et al.	Oct 2016	B2
9471775	Wagner et al.	Oct 2016	B1
9483335	Wagner et al.	Nov 2016	B1
9489227	Oh et al.	Nov 2016	B2
9497136	Ramarao et al.	Nov 2016	B1
9501345	Lietz et al.	Nov 2016	B1
9514037	Dow et al.	Dec 2016	B1
9537788	Reque et al.	Jan 2017	B2
9575798	Terayama et al.	Feb 2017	B2
9588790	Wagner et al.	Mar 2017	B1
9594590	Hsu	Mar 2017	B2
9596350	Dymshyts et al.	Mar 2017	B1
9600312	Wagner et al.	Mar 2017	B2
9613127	Rus et al.	Apr 2017	B1
9628332	Bruno, Jr. et al.	Apr 2017	B2
9635132	Lin et al.	Apr 2017	B1
9652306	Wagner et al.	May 2017	B1
9652617	Evans et al.	May 2017	B1
9654508	Barton et al.	May 2017	B2
9661011	Van Horenbeeck et al.	May 2017	B1
9678773	Wagner et al.	Jun 2017	B1
9678778	Youseff	Jun 2017	B1
9703681	Taylor et al.	Jul 2017	B2
9715402	Wagner et al.	Jul 2017	B2
9727725	Wagner et al.	Aug 2017	B2
9733967	Wagner et al.	Aug 2017	B2
9760387	Wagner et al.	Sep 2017	B2
9760443	Tarasuk-Levin et al.	Sep 2017	B2
9767271	Ghose	Sep 2017	B2
9785476	Wagner et al.	Oct 2017	B2
9787779	Frank et al.	Oct 2017	B2
9811363	Wagner	Nov 2017	B1
9811434	Wagner	Nov 2017	B1
9817695	Clark	Nov 2017	B2
9830175	Wagner	Nov 2017	B1
9830193	Wagner et al.	Nov 2017	B1
9830449	Wagner	Nov 2017	B1
9864636	Patel et al.	Jan 2018	B1
9910713	Wisniewski et al.	Mar 2018	B2
9921864	Singaravelu et al.	Mar 2018	B2
9928108	Wagner et al.	Mar 2018	B1
9929916	Subramanian et al.	Mar 2018	B1
9930103	Thompson	Mar 2018	B2
9930133	Susarla et al.	Mar 2018	B2
9952896	Wagner et al.	Apr 2018	B2
9977691	Marriner et al.	May 2018	B2
9979817	Huang et al.	May 2018	B2
10002026	Wagner	Jun 2018	B1
10013267	Wagner et al.	Jul 2018	B1
10042660	Wagner et al.	Aug 2018	B2
10048974	Wagner et al.	Aug 2018	B1
10061613	Brooker et al.	Aug 2018	B1
10067801	Wagner	Sep 2018	B1
10102040	Marriner et al.	Oct 2018	B2
10108443	Wagner et al.	Oct 2018	B2
10139876	Lu et al.	Nov 2018	B2
10140137	Wagner	Nov 2018	B2
10146635	Chai et al.	Dec 2018	B1
10162672	Wagner et al.	Dec 2018	B2
10162688	Wagner	Dec 2018	B2
10203990	Wagner et al.	Feb 2019	B2
10248467	Wisniewski et al.	Apr 2019	B2
10277708	Wagner et al.	Apr 2019	B2
10303492	Wagner et al.	May 2019	B1
10353678	Wagner	Jul 2019	B1
10353746	Reque et al.	Jul 2019	B2
10365985	Wagner	Jul 2019	B2
10387177	Wagner et al.	Aug 2019	B2
10402231	Marriner et al.	Sep 2019	B2
10437629	Wagner et al.	Oct 2019	B2
10445140	Sagar et al.	Oct 2019	B1
10503626	Idicula et al.	Dec 2019	B2
10528390	Brooker et al.	Jan 2020	B2
10552193	Wagner et al.	Feb 2020	B2
10564946	Wagner et al.	Feb 2020	B1
10572375	Wagner	Feb 2020	B1
10592269	Wagner et al.	Mar 2020	B2
10623476	Thompson	Apr 2020	B2
10649749	Brooker et al.	May 2020	B1
10691498	Wagner	Jun 2020	B2
10713080	Brooker et al.	Jul 2020	B1
10725752	Wagner et al.	Jul 2020	B1
10725826	Sagar et al.	Jul 2020	B1
10733085	Wagner	Aug 2020	B1
10754701	Wagner	Aug 2020	B1
10776171	Wagner et al.	Sep 2020	B2
20010044817	Asano et al.	Nov 2001	A1
20020120685	Srivastava et al.	Aug 2002	A1
20020172273	Baker et al.	Nov 2002	A1
20030071842	King et al.	Apr 2003	A1
20030084434	Ren	May 2003	A1
20030149801	Kushnirskiy	Aug 2003	A1
20030191795	Bernardin et al.	Oct 2003	A1
20030229794	James, II et al.	Dec 2003	A1
20040003087	Chambliss et al.	Jan 2004	A1
20040019886	Berent et al.	Jan 2004	A1
20040044721	Song et al.	Mar 2004	A1
20040049768	Matsuyama et al.	Mar 2004	A1
20040098154	Mccarthy	May 2004	A1
20040158551	Santosuosso	Aug 2004	A1
20040205493	Simpson et al.	Oct 2004	A1
20040249947	Novaes et al.	Dec 2004	A1
20040268358	Darling et al.	Dec 2004	A1
20050027611	Wharton	Feb 2005	A1
20050044301	Vasilevsky et al.	Feb 2005	A1
20050120160	Plouffe et al.	Jun 2005	A1
20050132167	Longobardi	Jun 2005	A1
20050132368	Sexton et al.	Jun 2005	A1
20050149535	Frey et al.	Jul 2005	A1
20050193113	Kokusho et al.	Sep 2005	A1
20050193283	Reinhardt et al.	Sep 2005	A1
20050237948	Wan et al.	Oct 2005	A1
20050257051	Richard	Nov 2005	A1
20060080678	Bailey et al.	Apr 2006	A1
20060123066	Jacobs et al.	Jun 2006	A1
20060129684	Datta	Jun 2006	A1
20060155800	Matsumoto	Jul 2006	A1
20060168174	Gebhart et al.	Jul 2006	A1
20060184669	Vaidyanathan et al.	Aug 2006	A1
20060200668	Hybre et al.	Sep 2006	A1
20060212332	Jackson	Sep 2006	A1
20060242647	Kimbrel et al.	Oct 2006	A1
20060248195	Toumura et al.	Nov 2006	A1
20060288120	Hoshino et al.	Dec 2006	A1
20070033085	Johnson	Feb 2007	A1
20070050779	Hayashi	Mar 2007	A1
20070094396	Takano et al.	Apr 2007	A1
20070101325	Bystricky et al.	May 2007	A1
20070130341	Ma	Jun 2007	A1
20070174419	O'Connell et al.	Jul 2007	A1
20070180449	Croft et al.	Aug 2007	A1
20070180450	Croft et al.	Aug 2007	A1
20070180493	Croft et al.	Aug 2007	A1
20070186212	Mazzaferri et al.	Aug 2007	A1
20070192082	Gaos et al.	Aug 2007	A1
20070192329	Croft et al.	Aug 2007	A1
20070198656	Mazzaferri et al.	Aug 2007	A1
20070199000	Shekhel et al.	Aug 2007	A1
20070220009	Morris et al.	Sep 2007	A1
20070226700	Gal et al.	Sep 2007	A1
20070240160	Paterson-Jones	Oct 2007	A1
20070255604	Seelig	Nov 2007	A1
20080028409	Cherkasova et al.	Jan 2008	A1
20080052401	Bugenhagen et al.	Feb 2008	A1
20080052725	Stoodley et al.	Feb 2008	A1
20080082977	Araujo et al.	Apr 2008	A1
20080104247	Venkatakrishnan et al.	May 2008	A1
20080104608	Hyser et al.	May 2008	A1
20080115143	Shimizu et al.	May 2008	A1
20080126110	Haeberle et al.	May 2008	A1
20080126486	Heist	May 2008	A1
20080127125	Anckaert et al.	May 2008	A1
20080147893	Marripudi et al.	Jun 2008	A1
20080189468	Schmidt et al.	Aug 2008	A1
20080195369	Duyanovich et al.	Aug 2008	A1
20080201568	Quinn et al.	Aug 2008	A1
20080201711	Amir Husain	Aug 2008	A1
20080209423	Hirai	Aug 2008	A1
20080244547	Wintergerst et al.	Oct 2008	A1
20090006897	Sarsfield	Jan 2009	A1
20090013153	Hilton	Jan 2009	A1
20090025009	Brunswig et al.	Jan 2009	A1
20090055810	Kondur	Feb 2009	A1
20090055829	Gibson	Feb 2009	A1
20090070355	Cadarette et al.	Mar 2009	A1
20090077569	Appleton et al.	Mar 2009	A1
20090125902	Ghosh et al.	May 2009	A1
20090158275	Wang et al.	Jun 2009	A1
20090177860	Zhu et al.	Jul 2009	A1
20090183162	Kindel et al.	Jul 2009	A1
20090193410	Arthursson et al.	Jul 2009	A1
20090198769	Keller et al.	Aug 2009	A1
20090204960	Ben-yehuda et al.	Aug 2009	A1
20090204964	Foley et al.	Aug 2009	A1
20090222922	Sidiroglou et al.	Sep 2009	A1
20090271472	Scheifler et al.	Oct 2009	A1
20090288084	Astete et al.	Nov 2009	A1
20090300151	Friedman et al.	Dec 2009	A1
20090300599	Piotrowski	Dec 2009	A1
20100023940	Iwamatsu et al.	Jan 2010	A1
20100031274	Sim-Tang	Feb 2010	A1
20100031325	Maigne et al.	Feb 2010	A1
20100036925	Haffner	Feb 2010	A1
20100058342	Machida	Mar 2010	A1
20100058351	Yahagi	Mar 2010	A1
20100064299	Kacin et al.	Mar 2010	A1
20100070678	Zhang et al.	Mar 2010	A1
20100070725	Prahlad et al.	Mar 2010	A1
20100083048	Calinoiu et al.	Apr 2010	A1
20100094816	Groves, Jr. et al.	Apr 2010	A1
20100106926	Kandasamy et al.	Apr 2010	A1
20100114825	Siddegowda	May 2010	A1
20100115098	De Baer et al.	May 2010	A1
20100122343	Ghosh	May 2010	A1
20100131936	Cheriton	May 2010	A1
20100131959	Spiers et al.	May 2010	A1
20100186011	Magenheimer	Jul 2010	A1
20100198972	Umbehocker	Aug 2010	A1
20100199285	Medovich	Aug 2010	A1
20100257116	Mehta et al.	Oct 2010	A1
20100257269	Clark	Oct 2010	A1
20100269109	Cartales	Oct 2010	A1
20100312871	Desantis et al.	Dec 2010	A1
20100325727	Neystadt et al.	Dec 2010	A1
20100329149	Singh et al.	Dec 2010	A1
20110010690	Howard et al.	Jan 2011	A1
20110010722	Matsuyama	Jan 2011	A1
20110029970	Arasaratnam	Feb 2011	A1
20110029984	Norman et al.	Feb 2011	A1
20110040812	Phillips	Feb 2011	A1
20110055378	Ferris et al.	Mar 2011	A1
20110055396	DeHaan	Mar 2011	A1
20110055683	Jiang	Mar 2011	A1
20110078679	Bozek et al.	Mar 2011	A1
20110099204	Thaler	Apr 2011	A1
20110099551	Fahrig et al.	Apr 2011	A1
20110131572	Elyashev et al.	Jun 2011	A1
20110134761	Smith	Jun 2011	A1
20110141124	Halls et al.	Jun 2011	A1
20110153727	Li	Jun 2011	A1
20110153838	Belkine et al.	Jun 2011	A1
20110154353	Theroux et al.	Jun 2011	A1
20110179162	Mayo et al.	Jul 2011	A1
20110184993	Chawla et al.	Jul 2011	A1
20110225277	Freimuth et al.	Sep 2011	A1
20110231680	Padmanabhan et al.	Sep 2011	A1
20110247005	Benedetti et al.	Oct 2011	A1
20110265067	Schulte et al.	Oct 2011	A1
20110265164	Lucovsky	Oct 2011	A1
20110271276	Ashok et al.	Nov 2011	A1
20110276945	Chasman et al.	Nov 2011	A1
20110276963	Wu et al.	Nov 2011	A1
20110314465	Smith et al.	Dec 2011	A1
20110321033	Kelkar et al.	Dec 2011	A1
20110321051	Rastogi	Dec 2011	A1
20120011496	Shimamura	Jan 2012	A1
20120011511	Horvitz et al.	Jan 2012	A1
20120016721	Weinman	Jan 2012	A1
20120041970	Ghosh et al.	Feb 2012	A1
20120054744	Singh	Mar 2012	A1
20120072762	Atchison et al.	Mar 2012	A1
20120072914	Ota	Mar 2012	A1
20120072920	Kawamura	Mar 2012	A1
20120079004	Herman	Mar 2012	A1
20120096271	Ramarathinam et al.	Apr 2012	A1
20120096468	Chakravorty et al.	Apr 2012	A1
20120102307	Wong	Apr 2012	A1
20120102333	Wong	Apr 2012	A1
20120102481	Mani et al.	Apr 2012	A1
20120102493	Allen et al.	Apr 2012	A1
20120110155	Adlung et al.	May 2012	A1
20120110164	Frey et al.	May 2012	A1
20120110570	Jacobson et al.	May 2012	A1
20120110588	Bieswanger et al.	May 2012	A1
20120131379	Tameshige et al.	May 2012	A1
20120144290	Goldman et al.	Jun 2012	A1
20120166624	Suit et al.	Jun 2012	A1
20120192184	Burckart et al.	Jul 2012	A1
20120197795	Campbell et al.	Aug 2012	A1
20120197958	Nightingale et al.	Aug 2012	A1
20120198442	Kashyap et al.	Aug 2012	A1
20120204164	Castanos et al.	Aug 2012	A1
20120222038	Katragadda et al.	Aug 2012	A1
20120233464	Miller et al.	Sep 2012	A1
20120324236	Srivastava et al.	Dec 2012	A1
20120331113	Jain et al.	Dec 2012	A1
20130014101	Ballani et al.	Jan 2013	A1
20130042234	DeLuca et al.	Feb 2013	A1
20130054804	Jana et al.	Feb 2013	A1
20130054927	Raj et al.	Feb 2013	A1
20130055262	Lubsey et al.	Feb 2013	A1
20130061208	Tsao et al.	Mar 2013	A1
20130061212	Krause et al.	Mar 2013	A1
20130061220	Gnanasambandam et al.	Mar 2013	A1
20130067484	Sonoda et al.	Mar 2013	A1
20130067494	Srour et al.	Mar 2013	A1
20130080641	Lui et al.	Mar 2013	A1
20130097601	Podvratnik et al.	Apr 2013	A1
20130111032	Alapati et al.	May 2013	A1
20130111469	B et al.	May 2013	A1
20130124807	Nielsen et al.	May 2013	A1
20130132942	Wang	May 2013	A1
20130132953	Chuang et al.	May 2013	A1
20130139152	Chang et al.	May 2013	A1
20130139166	Zhang et al.	May 2013	A1
20130151587	Takeshima et al.	Jun 2013	A1
20130151648	Luna	Jun 2013	A1
20130152047	Moorthi et al.	Jun 2013	A1
20130167147	Corrie et al.	Jun 2013	A1
20130179574	Calder et al.	Jul 2013	A1
20130179881	Calder et al.	Jul 2013	A1
20130179894	Calder et al.	Jul 2013	A1
20130179895	Calder et al.	Jul 2013	A1
20130185719	Kar et al.	Jul 2013	A1
20130185729	Vasic et al.	Jul 2013	A1
20130191924	Tedesco	Jul 2013	A1
20130198319	Shen et al.	Aug 2013	A1
20130198743	Kruglick	Aug 2013	A1
20130198748	Sharp et al.	Aug 2013	A1
20130198763	Kunze et al.	Aug 2013	A1
20130205092	Roy et al.	Aug 2013	A1
20130219390	Lee et al.	Aug 2013	A1
20130227097	Yasuda et al.	Aug 2013	A1
20130227534	Ike et al.	Aug 2013	A1
20130227563	McGrath	Aug 2013	A1
20130227641	White et al.	Aug 2013	A1
20130227710	Barak et al.	Aug 2013	A1
20130232480	Winterfeldt et al.	Sep 2013	A1
20130239125	Iorio	Sep 2013	A1
20130262556	Xu et al.	Oct 2013	A1
20130263117	Konik et al.	Oct 2013	A1
20130274006	Hudlow et al.	Oct 2013	A1
20130275376	Hudlow et al.	Oct 2013	A1
20130275958	Ivanov et al.	Oct 2013	A1
20130275969	Dimitrov	Oct 2013	A1
20130275975	Masuda et al.	Oct 2013	A1
20130283176	Hoole et al.	Oct 2013	A1
20130290538	Gmach et al.	Oct 2013	A1
20130291087	Kailash et al.	Oct 2013	A1
20130297964	Hegdal et al.	Nov 2013	A1
20130298183	McGrath et al.	Nov 2013	A1
20130311650	Brandwine et al.	Nov 2013	A1
20130326506	McGrath et al.	Dec 2013	A1
20130339950	Ramarathinam et al.	Dec 2013	A1
20130346470	Obstfeld et al.	Dec 2013	A1
20130346946	Pinnix	Dec 2013	A1
20130346952	Huang et al.	Dec 2013	A1
20130346964	Nobuoka et al.	Dec 2013	A1
20130346987	Raney et al.	Dec 2013	A1
20130346994	Chen et al.	Dec 2013	A1
20130347095	Barjatiya et al.	Dec 2013	A1
20140007097	Chin et al.	Jan 2014	A1
20140019523	Heymann et al.	Jan 2014	A1
20140019735	Menon et al.	Jan 2014	A1
20140019965	Neuse et al.	Jan 2014	A1
20140019966	Neuse et al.	Jan 2014	A1
20140040343	Nickolov et al.	Feb 2014	A1
20140040857	Trinchini et al.	Feb 2014	A1
20140040880	Brownlow et al.	Feb 2014	A1
20140058871	Marr et al.	Feb 2014	A1
20140059209	Alnoor	Feb 2014	A1
20140059226	Messerli et al.	Feb 2014	A1
20140059552	Cunningham et al.	Feb 2014	A1
20140068568	Wisnovsky	Mar 2014	A1
20140068608	Kulkarni	Mar 2014	A1
20140068611	McGrath et al.	Mar 2014	A1
20140073300	Leeder et al.	Mar 2014	A1
20140081984	Sitsky et al.	Mar 2014	A1
20140082165	Marr et al.	Mar 2014	A1
20140082201	Shankari et al.	Mar 2014	A1
20140101643	Inoue	Apr 2014	A1
20140101649	Kamble et al.	Apr 2014	A1
20140108722	Lipchuk et al.	Apr 2014	A1
20140109087	Jujare et al.	Apr 2014	A1
20140109088	Dournov et al.	Apr 2014	A1
20140129667	Ozawa	May 2014	A1
20140130040	Lemanski	May 2014	A1
20140137110	Engle et al.	May 2014	A1
20140173614	Konik et al.	Jun 2014	A1
20140173616	Bird et al.	Jun 2014	A1
20140180862	Certain et al.	Jun 2014	A1
20140189677	Curzi et al.	Jul 2014	A1
20140201735	Kannan et al.	Jul 2014	A1
20140207912	Thibeault	Jul 2014	A1
20140214752	Rash et al.	Jul 2014	A1
20140215073	Dow et al.	Jul 2014	A1
20140229221	Shih et al.	Aug 2014	A1
20140245297	Hackett	Aug 2014	A1
20140279581	Devereaux	Sep 2014	A1
20140280325	Krishnamurthy et al.	Sep 2014	A1
20140282418	Wood et al.	Sep 2014	A1
20140282559	Verduzco et al.	Sep 2014	A1
20140282615	Cavage et al.	Sep 2014	A1
20140282629	Gupta et al.	Sep 2014	A1
20140283045	Brandwine et al.	Sep 2014	A1
20140289286	Gusak	Sep 2014	A1
20140298295	Overbeck	Oct 2014	A1
20140304698	Chigurapati et al.	Oct 2014	A1
20140304815	Maeda	Oct 2014	A1
20140317617	O'Donnell	Oct 2014	A1
20140344457	Bruno, Jr. et al.	Nov 2014	A1
20140344736	Ryman et al.	Nov 2014	A1
20140359093	Raju et al.	Dec 2014	A1
20140372533	Fu et al.	Dec 2014	A1
20140380085	Rash et al.	Dec 2014	A1
20150033241	Jackson et al.	Jan 2015	A1
20150039891	Ignatchenko et al.	Feb 2015	A1
20150040229	Chan et al.	Feb 2015	A1
20150046926	Kenchammana-Hosekote et al.	Feb 2015	A1
20150052258	Johnson et al.	Feb 2015	A1
20150058914	Yadav	Feb 2015	A1
20150067019	Balko	Mar 2015	A1
20150067830	Johansson et al.	Mar 2015	A1
20150074659	Madsen et al.	Mar 2015	A1
20150074661	Kothari et al.	Mar 2015	A1
20150074662	Saladi et al.	Mar 2015	A1
20150081885	Thomas et al.	Mar 2015	A1
20150106805	Melander et al.	Apr 2015	A1
20150120928	Gummaraju et al.	Apr 2015	A1
20150121391	Wang	Apr 2015	A1
20150134626	Theimer et al.	May 2015	A1
20150135287	Medeiros et al.	May 2015	A1
20150142747	Zou	May 2015	A1
20150142952	Bragstad et al.	May 2015	A1
20150143381	Chin et al.	May 2015	A1
20150163231	Sobko et al.	Jun 2015	A1
20150178110	Li et al.	Jun 2015	A1
20150186129	Apte et al.	Jul 2015	A1
20150188775	Van Der Walt et al.	Jul 2015	A1
20150199218	Wilson et al.	Jul 2015	A1
20150205596	Hiltegen et al.	Jul 2015	A1
20150227598	Hahn et al.	Aug 2015	A1
20150229645	Keith et al.	Aug 2015	A1
20150235144	Gusev et al.	Aug 2015	A1
20150242225	Muller et al.	Aug 2015	A1
20150254248	Burns et al.	Sep 2015	A1
20150256621	Node et al.	Sep 2015	A1
20150261578	Greden et al.	Sep 2015	A1
20150269494	Kardes et al.	Sep 2015	A1
20150289220	Kim et al.	Oct 2015	A1
20150309923	Iwata et al.	Oct 2015	A1
20150319160	Ferguson et al.	Nov 2015	A1
20150324174	Bromley et al.	Nov 2015	A1
20150324182	Barros et al.	Nov 2015	A1
20150324229	Valine	Nov 2015	A1
20150332048	Mooring et al.	Nov 2015	A1
20150332195	Jue	Nov 2015	A1
20150334173	Coulmeau et al.	Nov 2015	A1
20150350701	Lemus et al.	Dec 2015	A1
20150356294	Tan et al.	Dec 2015	A1
20150363181	Alberti et al.	Dec 2015	A1
20150370560	Tan et al.	Dec 2015	A1
20150371244	Neuse et al.	Dec 2015	A1
20150378762	Saladi et al.	Dec 2015	A1
20150378764	Sivasubramanian et al.	Dec 2015	A1
20150378765	Singh et al.	Dec 2015	A1
20150379167	Griffith et al.	Dec 2015	A1
20160011901	Hurwitz et al.	Jan 2016	A1
20160012099	Tuatini et al.	Jan 2016	A1
20160019081	Chandrasekaran et al.	Jan 2016	A1
20160019082	Chandrasekaran et al.	Jan 2016	A1
20160019536	Ortiz et al.	Jan 2016	A1
20160026486	Abdallah	Jan 2016	A1
20160048606	Rubinstein et al.	Feb 2016	A1
20160070714	D'Sa et al.	Mar 2016	A1
20160072727	Leafe et al.	Mar 2016	A1
20160077901	Roth et al.	Mar 2016	A1
20160092320	Baca	Mar 2016	A1
20160092493	Ko et al.	Mar 2016	A1
20160098285	Davis et al.	Apr 2016	A1
20160100036	Lo et al.	Apr 2016	A1
20160103739	Huang et al.	Apr 2016	A1
20160117163	Fukui et al.	Apr 2016	A1
20160117254	Susarla et al.	Apr 2016	A1
20160124665	Jain et al.	May 2016	A1
20160124978	Nithrakashyap et al.	May 2016	A1
20160140180	Park et al.	May 2016	A1
20160191420	Nagarajan et al.	Jun 2016	A1
20160203219	Hoch et al.	Jul 2016	A1
20160212007	Alatorre et al.	Jul 2016	A1
20160285906	Fine et al.	Sep 2016	A1
20160292016	Bussard et al.	Oct 2016	A1
20160294614	Searle et al.	Oct 2016	A1
20160306613	Busi et al.	Oct 2016	A1
20160350099	Suparna et al.	Dec 2016	A1
20160357536	Firlik et al.	Dec 2016	A1
20160364265	Cao et al.	Dec 2016	A1
20160364316	Bhat et al.	Dec 2016	A1
20160371127	Antony et al.	Dec 2016	A1
20160371156	Merriman	Dec 2016	A1
20160378449	Khazanchi et al.	Dec 2016	A1
20160378547	Brouwer et al.	Dec 2016	A1
20160378554	Gummaraju et al.	Dec 2016	A1
20170041309	Ekambaram et al.	Feb 2017	A1
20170060615	Thakkar et al.	Mar 2017	A1
20170060621	Whipple et al.	Mar 2017	A1
20170068574	Cherkasova et al.	Mar 2017	A1
20170075749	Ambichl et al.	Mar 2017	A1
20170083381	Cong et al.	Mar 2017	A1
20170085447	Chen et al.	Mar 2017	A1
20170085591	Ganda et al.	Mar 2017	A1
20170093684	Jayaraman et al.	Mar 2017	A1
20170093920	Ducatel et al.	Mar 2017	A1
20170134519	Chen et al.	May 2017	A1
20170177391	Wagner et al.	Jun 2017	A1
20170206116	Reque et al.	Jul 2017	A1
20170230262	Sreeramoju et al.	Aug 2017	A1
20170230499	Mumick et al.	Aug 2017	A1
20170249130	Smiljamic et al.	Aug 2017	A1
20170272462	Kraemer et al.	Sep 2017	A1
20170286143	Wagner et al.	Oct 2017	A1
20170286187	Chen et al.	Oct 2017	A1
20170329578	Iscen	Nov 2017	A1
20170346808	Anzai et al.	Nov 2017	A1
20170371703	Wagner et al.	Dec 2017	A1
20170371720	Basu et al.	Dec 2017	A1
20170371724	Wagner et al.	Dec 2017	A1
20170372142	Bilobrov	Dec 2017	A1
20180004555	Ramanathan et al.	Jan 2018	A1
20180004572	Wagner et al.	Jan 2018	A1
20180039506	Wagner et al.	Feb 2018	A1
20180046453	Nair et al.	Feb 2018	A1
20180046482	Karve et al.	Feb 2018	A1
20180060221	Yim et al.	Mar 2018	A1
20180067841	Mahimkar	Mar 2018	A1
20180081717	Li	Mar 2018	A1
20180095738	Dürkop et al.	Apr 2018	A1
20180121245	Wagner et al.	May 2018	A1
20180143865	Wagner et al.	May 2018	A1
20180150339	Pan et al.	May 2018	A1
20180157568	Wagner	Jun 2018	A1
20180192101	Bilobrov	Jul 2018	A1
20180203717	Wagner et al.	Jul 2018	A1
20180210760	Wisniewski et al.	Jul 2018	A1
20180239636	Arora et al.	Aug 2018	A1
20180253333	Gupta	Sep 2018	A1
20180275987	Vandeputte	Sep 2018	A1
20180285101	Yahav et al.	Oct 2018	A1
20180309819	Thompson	Oct 2018	A1
20180341504	Kissell	Nov 2018	A1
20190050271	Marriner et al.	Feb 2019	A1
20190072529	Andrawes et al.	Mar 2019	A1
20190073234	Wagner et al.	Mar 2019	A1
20190102231	Wagner	Apr 2019	A1
20190108058	Wagner et al.	Apr 2019	A1
20190140831	De Lima Junior et al.	May 2019	A1
20190155629	Wagner et al.	May 2019	A1
20190171470	Wagner	Jun 2019	A1
20190179725	Mital et al.	Jun 2019	A1
20190180036	Shukla	Jun 2019	A1
20190196884	Wagner	Jun 2019	A1
20190205171	Brooker et al.	Jul 2019	A1
20190235848	Swiecki et al.	Aug 2019	A1
20190250937	Thomas et al.	Aug 2019	A1
20190286475	Mani	Sep 2019	A1
20190303117	Kocberber et al.	Oct 2019	A1
20190361802	Li et al.	Nov 2019	A1
20190384647	Reque et al.	Dec 2019	A1
20190391834	Mullen et al.	Dec 2019	A1
20190391841	Mullen et al.	Dec 2019	A1
20200026527	Xu et al.	Jan 2020	A1
20200057680	Marriner et al.	Feb 2020	A1
20200104198	Hussels et al.	Apr 2020	A1
20200104378	Wagner et al.	Apr 2020	A1
20200110691	Bryant et al.	Apr 2020	A1
20200142724	Wagner et al.	May 2020	A1
20200192707	Brooker et al.	Jun 2020	A1

Foreign Referenced Citations (34)

Number	Date	Country
2663052	Nov 2013	EP
2002287974	Oct 2002	JP
2006-107599	Apr 2006	JP
2007-538323	Dec 2007	JP
2010-026562	Feb 2010	JP
2011-233146	Nov 2011	JP
2011257847	Dec 2011	JP
2013-156996	Aug 2013	JP
2014-525624	Sep 2014	JP
2017-534107	Nov 2017	JP
2017-534967	Nov 2017	JP
2018-503896	Feb 2018	JP
2018-512087	May 2018	JP
2018-536213	Dec 2018	JP
WO 2008114454	Sep 2008	WO
WO 2009137567	Nov 2009	WO
WO 2012039834	Mar 2012	WO
WO 2012050772	Apr 2012	WO
WO 2013106257	Jul 2013	WO
WO 2015078394	Jun 2015	WO
WO 2015108539	Jul 2015	WO
WO 2016053950	Apr 2016	WO
WO 2016053968	Apr 2016	WO
WO 2016053973	Apr 2016	WO
WO 2016090292	Jun 2016	WO
WO 2016126731	Aug 2016	WO
WO 2016164633	Oct 2016	WO
WO 2016164638	Oct 2016	WO
WO 2017059248	Apr 2017	WO
WO 2017112526	Jun 2017	WO
WO 2017172440	Oct 2017	WO
WO 2018098445	May 2018	WO
WO 2020005764	Jan 2020	WO
WO 2020069104	Apr 2020	WO

Non-Patent Literature Citations (84)

Entry
Anonymous: “Docker run reference”, Dec. 7, 2015, XP055350246, Retrieved from the Internet: URL:https://web.archive.org/web/20151207111702/https:/docs.docker.com/engine/reference/run/ [retrieved on Feb. 28, 2017].
Adapter Pattern, Wikipedia, https://en.wikipedia.org/w/index.php?title=Adapter_pattern&oldid=654971255, [retrieved May 26, 2016], 6 pages.
Amazon, “AWS Lambda: Developer Guide”, Retrieved from the Internet, Jun. 26, 2016, URL : http://docs.aws.amazon.com/lambda/ latest/dg/lambda-dg.pdf, 346 pages.
Amazon, “AWS Lambda: Developer Guide”, Retrieved from the Internet, 2019, URL : http://docs.aws.amazon.com/lambda/ latest/dg/lambda-dg.pdf, 521 pages.
Balazinska et al., Moirae: History-Enhanced Monitoring, Published: 2007, 12 pages.
Ben-Yehuda et al., “Deconstructing Amazon EC2 Spot Instance Pricing”, ACM Transactions on Economics and Computation 1.3, 2013, 15 pages.
Bhadani et al., Performance evaluation of web servers using central load balancing policy over virtual machines on cloud, Jan. 2010, 4 pages.
Czajkowski, G., and L. Daynes, Multitasking Without Compromise: A Virtual Machine Evolution 47(4a):60-73, ACM SIGPLAN Notices—Supplemental Issue, Apr. 2012.
Das et al., Adaptive Stream Processing using Dynamic Batch Sizing, 2014, 13 pages.
Deis, Container, 2014, 1 page.
Dombrowski, M., et al., Dynamic Monitor Allocation in the Java Virtual Machine, JTRES '13, Oct. 9-11, 2013, pp. 30-37.
Espadas, J., et al., A Tenant-Based Resource Allocation Model for Scaling Software-as-a-Service Applications Over Cloud Computing Infrastructures, Future Generation Computer Systems, vol. 29, pp. 273-286, 2013.
Han et al., Lightweight Resource Scaling for Cloud Applications, 2012, 8 pages.
Hoffman, Auto scaling your website with Amazon Web Services (AWS)—Part 2, Cardinalpath, Sep. 2015, 15 pages.
Kamga et al., Extended scheduler for efficient frequency scaling in virtualized systems, Jul. 2012, 8 pages.
Kazempour et al., AASH: an asymmetry-aware scheduler for hypervisors, Jul. 2010, 12 pages.
Kraft et al., 10 performance prediction in consolidated virtualized environments, Mar. 2011, 12 pages.
Krsul et al., “VMPlants: Providing and Managing Virtual Machine Execution Environments for Grid Computing”, Supercomputing, 2004. Proceedings of the ACM/IEEESC 2004 Conference Pittsburgh, PA, XP010780332, Nov. 6-12, 2004, 12 pages.
Meng et al., Efficient resource provisioning in compute clouds via VM multiplexing, Jun. 2010, 10 pages.
Merkel, “Docker: Lightweight Linux Containers for Consistent Development and Deployment”, Linux Journal, vol. 2014 Issue 239, Mar. 2014, XP055171140, 16 pages.
Monteil, Coupling profile and historical methods to predict execution time of parallel applications. Parallel and Cloud Computing, 2013, <hal-01228236, pp. 81-89.
Nakajima, J., et al., Optimizing Virtual Machines Using Hybrid Virtualization, SAC '11, Mar. 21-25, 2011, TaiChung, Taiwan, pp. 573-578.
Qian, H., and D. Medhi, et al., Estimating Optimal Cost of Allocating Virtualized Resources With Dynamic Demand, ITC 2011, Sep. 2011, pp. 320-321.
Sakamoto, et al. “Platform for Web Services using Proxy Server”; Research Report from Information Processing Society, Mar. 22, 2002, vol. 2002, No. 31.
Shim (computing), Wikipedia, https://en.wikipedia.org/w/index.php?title+Shim_(computing)&oldid+654971528, [retrieved on May 26, 2016], 2 pages.
Stack Overflow, Creating a database connection pool, 2009, 4 pages.
Tan et al., Provisioning for large scale cloud computing services, Jun. 2012, 2 pages.
Vaghani, S.B., Virtual Machine File System, ACM SIGOPS Operating Systems Review 44(4):57-70, Dec. 2010.
Vaquero, L., et al., Dynamically Scaling Applications in the cloud, ACM SIGCOMM Computer Communication Review 41(1):45-52, Jan. 2011.
Wu et al., HC-Midware: A Middleware to Enable High Performance Communication System Simulation in Heterogeneous Cloud, Association for Computing Machinery, Oct. 20-22, 2017, 10 pages.
Yamasaki et al. “Model-based resource selection for efficient virtual cluster deployment”, Virtualization Technology in Distributed Computing, ACM, Nov. 2007, pp. 1-7.
Yue et al., AC 2012-4107: Using Amazon EC2 in Computer and Network Security Lab Exercises: Design, Results, and Analysis, 2012, American Society for Engineering Education 2012.
Zheng, C., and D. Thain, Integrating Containers into Workflows: A Case Study Using Makeflow, Work Queue, and Docker, VTDC '15, Jun. 15, 2015, Portland, Oregon, pp. 31-38.
International Search Report and Written Opinion in PCT/US2015/052810 dated Dec. 17, 2015.
International Preliminary Report on Patentability in PCT/US2015/052810 dated Apr. 4, 2017.
Extended Search Report in European Application No. 15846932.0 dated May 3, 2018.
International Search Report and Written Opinion in PCT/US2015/052838 dated Dec. 18, 2015.
International Preliminary Report on Patentability in PCT/US2015/052838 dated Apr. 4, 2017.
Extended Search Report in European Application No. 15847202.7 dated Sep. 9, 2018.
International Search Report and Written Opinion in PCT/US2015/052833 dated Jan. 13, 2016.
International Preliminary Report on Patentability in PCT/US2015/052833 dated Apr. 4, 2017.
Extended Search Report in European Application No. 15846542.7 dated Aug. 27, 2018.
International Search Report and Written Opinion in PCT/US2015/064071 dated Mar. 16, 2016.
International Preliminary Report on Patentability in PCT/US2015/064071 dated Jun. 6, 2017.
International Search Report and Written Opinion in PCT/US2016/016211 dated Apr. 13, 2016.
International Preliminary Report on Patentability in PCT/US2016/016211 dated Aug. 17, 2017.
International Search Report and Written Opinion in PCT/US2016/026514 dated Jun. 8, 2016.
International Preliminary Report on Patentability in PCT/US2016/026514 dated Oct. 10, 2017.
International Search Report and Written Opinion in PCT/US2016/026520 dated Jul. 5, 2016.
International Preliminary Report on Patentability in PCT/US2016/026520 dated Oct. 10, 2017.
International Search Report and Written Opinion in PCT/US2016/054774 dated Dec. 16, 2016.
International Preliminary Report on Patentability in PCT/US2016/054774 dated Apr. 3, 2018.
International Search Report and Written Opinion in PCT/US2016/066997 dated Mar. 20, 2017.
International Preliminary Report on Patentability in PCT/US2016/066997 dated Jun. 26, 2018.
International Search Report and Written Opinion in PCT/US/2017/023564 dated Jun. 6, 2017.
International Preliminary Report on Patentability in PCT/US/2017/023564 dated Oct. 2, 2018.
International Search Report and Written Opinion in PCT/US2017/040054 dated Sep. 21, 2017.
International Preliminary Report on Patentability in PCT/US2017/040054 dated Jan. 1, 2019.
International Search Report and Written Opinion in PCT/US2017/039514 dated Oct. 10, 2017.
International Preliminary Report on Patentability in PCT/US2017/039514 dated Jan. 1, 2019.
Dynamic HTML, Wikipedia page from date Mar. 27, 2015, retrieved using the WayBackMachine, from https://web.archive.org/web/20150327215418/https://en.wikipedia.org/wiki/Dynamic_HTML, 2015, 6 pages.
Kato, et al. “Web Service Conversion Architecture of the Web Application and Evaluation”; Research Report from Information Processing Society, Apr. 3, 2006 with Machine Translation.
Wang et al., “Improving utilization through dynamic VM resource allocation in hybrid cloud environment”, Parallel and Distributed V Systems (ICPADS), IEEE, 2014. Retrieved on Feb. 14, 2019, Retrieved from the internet: URL<https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7097814, 8 pages.
CodeChef ADMIN discussion web page, retrieved from https://discuss.codechef.com/t/what-are-the-memory-limit-and-stack-size-on-codechef/14159, 2019.
CodeChef IDE web page, Code, Compile & Run, retrieved from https://www.codechef.com/ide, 2019.
Ha et al., A Concurrent Trace-based Just-In-Time Compiler for Single-threaded JavaScript, utexas.edu (Year: 2009).
http://discuss.codechef.com discussion web page from date Nov. 11, 2012, retrieved using the WayBackMachine, from https://web.archive.org/web/20121111040051/http://discuss.codechef.com/questions/2881 /why-are-simple-java-programs-using-up-so-much-space, 2012.
https://www.codechef.com code error help page from Jan. 2014, retrieved from https://www.codechef.com/JAN14/status/ERROR,va123, 2014.
http://www.codechef.com/ide web page from date Apr. 5, 2015, retrieved using the WayBackMachine, from https://web.archive.org/web/20150405045518/http://www.codechef.com/ide, 2015.
Huang, Zhe, Danny HK Tsang, and James She. “A virtual machine consolidation framework for mapreduce enabled computing clouds.” 2012 24th International Teletraffic Congress (ITC 24). IEEE, 2012. (Year: 2012).
Lagar-Cavilla, H. Andres, et al. “Snowflock: Virtual machine cloning as a first-class cloud primitive.” ACM Transactions on Computer Systems (TOCS) 29.1 (2011): 1-45. (Year: 2011).
Tange, “GNU Parallel: The Command-Line Power Tool”, vol. 36, No. 1, Jan. 1, 1942, pp. 42-47.
Wikipedia “API” pages from date Apr. 7, 2015, retrieved using the WayBackMachine from https://web.archive.org/web/20150407191158/https://en .wikipedia.org/wiki/Application_programming_interface.
Wikipedia List_of_HTTP status_codes web page, retrieved from https://en.wikipedia.org/wiki/List_of_HTTP status_codes, 2019.
Wikipedia Recursion web page from date Mar. 26, 2015, retrieved using the WayBackMachine, from https://web.archive.org/web/20150326230100/https://en .wikipedia.org/wiki/Recursion_(computer_science), 2015.
Wikipedia subroutine web page, retrieved from https://en.wikipedia.org/wiki/Subroutine, 2019.
Wood, Timothy, et al. “Cloud Net: dynamic pooling of cloud resources by live WAN migration of virtual machines.” ACM Sigplan Notices 46.7 (2011): 121-132. (Year: 2011).
Zhang et al., VMThunder: Fast Provisioning of Large-Scale Virtual Machine Clusters, IEEE Transactions on Parallel and Distributed Systems, vol. 25, No. 12, Dec. 2014, pp. 3328-3338.
Extended Search Report in European Application No. 19199402.9 dated Mar. 6, 2020.
Office Action in Canadian Application No. 2,962,633 dated May 21, 2020.
Office Action in Canadian Application No. 2,962,631 dated May 19, 2020.
Extended European Search Report in application No. 17776325.7 dated Oct. 23, 2019.
Office Action in European Application No. 17743108.7 dated Jan. 14, 2020.
International Search Report for Application No. PCT/US2019/038520 dated Aug. 14, 2019.

Related Publications (1)

	Number	Date	Country
	20190227849 A1	Jul 2019	US

Continuations (2)

	Number	Date	Country
Parent	15912273	Mar 2018	US
Child	16372108		US
Parent	14977544	Dec 2015	US
Child	15912273		US

Code execution request routing

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

CPC

International Classifications

Disclaimer

Term Extension

Abstract