Application gateways in an on-demand network code execution system

Information

  • Patent Grant
  • 11861386
  • Patent Number
    11,861,386
  • Date Filed
    Friday, March 22, 2019
    5 years ago
  • Date Issued
    Tuesday, January 2, 2024
    4 months ago
Abstract
Systems and methods are described for providing an application-level gateway to an on-demand network code execution system. An on-demand network code execution system may allow users to submit code to be executed in a serverless environment, and may provide an interface for executing the user-submitted code on demand. The interface may require that users authenticate, provide input in a particular format, or meet other criteria when sending a request to execute the code. An application-level gateway may thus provide an interface that implements these functions, thereby allowing computing devices to interact with the code as though it were running on a server (e.g., by using HTTP). The application-level gateway may also use on-demand code execution to provide load balancing for servers that are running the user-submitted code, and seamlessly provide access to code that runs on both server-based and serverless environments.
Description
BACKGROUND

Generally described, computing devices can utilize 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, hosted computing environments or data processing centers, generally referred to herein as “data centers,” 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 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 computing resources from a data center, such as single computing devices or a configuration of networked computing devices, and be provided with varying numbers of virtual machine resources.


In some scenarios, a user can request that a data center provide computing resources to execute a particular task. The task may correspond to a set of computer-executable instructions, which the data center may then execute on behalf of the user. The data center may thus further facilitate increased utilization of data center resources.





BRIEF DESCRIPTION OF THE DRAWINGS

Throughout the drawings, reference numbers may be re-used to indicate correspondence between referenced elements. The drawings are provided to illustrate example embodiments described herein and are not intended to limit the scope of the disclosure.



FIG. 1 is a block diagram depicting an illustrative environment in which an on-demand code execution gateway facilitates access to an on-demand code execution system in accordance with aspects of the present disclosure.



FIG. 2 depicts a general architecture of a computing device providing the on-demand code execution gateway depicted in FIG. 1.



FIGS. 3A and 3B are flow diagrams depicting illustrative interactions for using an on-demand code execution gateway to allow an on-demand code execution system to fulfill requests for network resources in accordance with aspects of the present disclosure.



FIG. 4 is a flow chart depicting an illustrative routine for facilitating interactions between an on-demand code execution system and a client computing device that is not configured to access the on-demand code execution system, in accordance with aspects of the present disclosure.



FIG. 5 is a flow chart depicting an illustrative routine for using an on-demand code execution gateway to manage server resources in a hosted computing environment that includes an on-demand code execution system.





DETAILED DESCRIPTION

Generally described, aspects of the present disclosure relate to an on-demand code execution system. The on-demand code execution system enables rapid execution of code, which may be supplied by users of the on-demand code execution system. More specifically, embodiments of the present disclosure relate to an on-demand code-execution gateway, which facilitates access to the on-demand code execution system. As described in detail herein, the on-demand code execution system may provide a network-accessible service enabling users to submit or designate computer-executable code to be executed by isolated execution environments on the on-demand code execution system. Each set of code on the on-demand code execution system may define a “task,” and implement specific functionality corresponding to that task when executed on an execution environment, such as a virtual machine instance, of the on-demand code execution system. Individual implementations of the task on the on-demand code execution system may be referred to as an “execution” of the task (or a “task execution”). The on-demand code execution system can further enable users to trigger execution of a task based on a variety of potential events, such as detecting new data at a network-based storage system, transmission of an application programming interface (“API”) call to the on-demand code execution system, or transmission of a specially formatted hypertext transport protocol (“HTTP”) packet to the on-demand code execution system. Thus, users may utilize the on-demand code execution system to execute any specified executable code “on-demand,” without requiring configuration or maintenance of the underlying hardware or infrastructure on which the code is executed. Further, the on-demand code execution system may be configured to execute tasks in a rapid manner (e.g., in under 100 milliseconds [ms]), thus enabling execution of tasks in “real-time” (e.g., with little or no perceptible delay to an end user).


The on-demand code execution system may thus allow users to execute code in a “serverless” environment (e.g., one in which the underlying server is not under user control), but may require that user requests to execute code in the environment meet criteria that would not otherwise be applicable. For example, the on-demand code execution system may require that code execution requests be authenticated with a cryptographic signature, submitted in a particular format, submitted via an API, or meet other requirements. In some aspects, satisfying these criteria may require computing resources that a computing device does not have. For example, an “Internet of Things” (“IoT”) device may have limited processing power or memory, and thus may not have sufficient computing resources to generate a cryptographic signature or convert a request to a particular format. Additionally, in some aspects, the on-demand code execution system may provide output in a particular format, and a computing device with limited computing resources may not understand the format or have the resources to translate it.


An on-demand code execution gateway may thus provide an interface that allows computing devices to interact with an on-demand code execution system regardless of whether the computing devices are capable of providing input in the format expected by the system or parsing output in the format provided by the system. The on-demand code execution gateway may thus allow computing devices to interact with code executing in the serverless on-demand environment as though the code were executing on a conventional server, and may thereby allow the on-demand code execution system to be utilized more efficiently. In some embodiments, computing devices may request a network resource or service, such as access to a web page, web-based application, database, file, image, media content, data stream, or the like. The on-demand code execution gateway may determine whether to fulfill the request by sending it to a server specifically configured to handle the request, or by generating and sending a request for on-demand code execution and then processing the resulting output.


The term “serverless environment,” as used herein, is intended to refer to an environment in which responsibility for managing generation, configuration, and state of an underlying execution environment is abstracted away from a user, such that the user need not, for example, create the execution environment, install an operating system within the execution environment, or manage a state of the environment in order to execute desired code in the environment. Similarly, the term “server-based environment” is intended to refer to an environment in which a user is at least partly responsible for managing generation, configuration, or state of an underlying execution environment in addition to executing desired code in the environment. One skilled in the art will thus appreciate that “serverless” and “server-based” may indicate the degree of user control over execution environments in which code is executed, rather than the actual absence or presence of a server.


In some embodiments, a user who submits a task to an on-demand code execution system may register the task with the on-demand code execution gateway or otherwise configure the gateway to invoke the on-demand code execution system. For example, the user may provide credentials that the on-demand code execution gateway may use to authenticate itself to the on-demand code execution system and submit a request to execute a task. As a further example, the user may specify one or more uniform resource locators (“URLs”) corresponding to requests that the gateway can fulfill by invoking on-demand code execution of a specified task. The on-demand code execution gateway may thus identify requests that can be fulfilled by invoking on-demand code execution of a user-submitted task.


As will be appreciated by one of skill in the art in light of the present disclosure, the embodiments disclosed herein improves the ability of computing systems, such as on-demand code execution systems, to execute code in an efficient manner. Moreover, the presently disclosed embodiments address technical problems inherent within computing systems; specifically, the problem of devices with limited computing resources being unable to utilize on-demand code execution systems due to computationally expensive requirements for providing input and output to these systems. These technical problems are addressed by the various technical solutions described herein, including the provisioning of an on-demand code execution gateway. Thus, the present disclosure represents an improvement on existing data processing systems and computing systems in general.


As described in more detail below, the on-demand code execution system may include a worker manager configured to receive user code (threads, programs, etc., composed in any of a variety of programming languages) and execute the code in a highly scalable, low latency manner, without requiring user configuration of a virtual machine instance. Specifically, the worker manager can, prior to receiving the user code and prior to receiving any information from a user regarding any particular virtual machine instance configuration, create and configure virtual machine instances according to a predetermined set of configurations, each corresponding to any one or more of a variety of run-time environments. Thereafter, the worker manager receives user-initiated requests to execute code, and identifies a pre-configured virtual machine instance to execute the code based on configuration information associated with the request. The worker manager can further allocate the identified virtual machine instance to execute the user's code at least partly by creating and configuring containers inside the allocated virtual machine instance, and provisioning the containers with code of the task as well as an dependency code objects. Various embodiments for implementing a worker manager and executing user code on virtual machine instances is described in more detail in U.S. Pat. No. 9,323,556, entitled “PROGRAMMATIC EVENT DETECTION AND MESSAGE GENERATION FOR REQUESTS TO EXECUTE PROGRAM CODE,” and filed Sep. 30, 2014 (the “'556 Patent”), the entirety of which is hereby incorporated by reference.


As used herein, the term “virtual machine instance” is intended to 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 hardware devices, which may differ from the physical 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 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, may be used as well.


While a virtual machine executing an operating system is described herein as one example of an execution environment, other execution environments are also possible. For example, tasks or other processes may be executed within a software “container,” which provides a runtime environment without itself providing virtualization of hardware. Containers may be implemented within virtual machines to provide additional security, or may be run outside of a virtual machine instance.


Embodiments of the disclosure will now be described with reference to the accompanying figures, wherein like numerals refer to like elements throughout. The terminology used in the description presented herein is not intended to be interpreted in any limited or restrictive manner, simply because it is being utilized in conjunction with a detailed description of certain specific embodiments of the invention. Furthermore, embodiments of the invention may include several novel features, no single one of which is solely responsible for its desirable attributes or which is essential to practicing the inventions herein described.



FIG. 1 is a block diagram of an illustrative operating environment 100 in which an on-demand code execution gateway 170 may operate based on communications with an on-demand code execution system 110, web servers 180, computing devices 102, auxiliary services 106, and network-based data storage services 108. In general, the computing devices 102 can be any computing device such as a desktop, laptop or tablet computer, personal computer, wearable computer, server, personal digital assistant (PDA), hybrid PDA/mobile phone, mobile phone, electronic book reader, set-top box, voice command device, camera, digital media player, and the like. The on-demand code execution gateway 170 may provide the computing devices 102 with one or more user interfaces for invoking user-provided code (e.g., submitting a request to execute the user code on the on-demand code execution system 110). In some embodiments, the on-demand code execution gateway 170 may provide the computing devices 102 with an interface that allows the on-demand code execution gateway 170 to determine whether requests to execute code will be fulfilled by the on-demand code execution system 110 or one or more web servers 180. For example, the on-demand code execution gateway 170 may provide an interface that accepts input in a format understood by the web servers 180 (e.g., an HTTP “POST” method), and may determine whether to pass this input to the web servers 180 or translate it into a format understood by the on-demand code execution system 110.


The on-demand code execution gateway 170 includes a load balancer 174, which implements aspects of the present disclosure including, for example, providing an interface to the on-demand code execution system 110 that allows computing devices 102 to request execution of code on the system 110 without performing such actions as authenticating the request, generating the request into a format expected by the system 110, buffering and serializing the request, and other actions as described in more detail below. The on-demand code execution gateway 170 further includes a request serializer 172, which may serialize input and de-serialize output of the system 110 to facilitate communication between the system 110 and the computing devices 102. In some embodiments, the request serializer 172 may manage connections to the on-demand code execution system 110. For example, the request serializer 172 may maintain a connection to a frontend 120 to reduce the overhead costs associated with setting up and tearing down connections on a per-request basis.


In some embodiments, the load balancer 174 may interact with and distribute requests between a number of web servers 180. In further embodiments, as described in more detail below, the load balancer 174 may distribute requests to the on-demand code execution system 110 based on the workload of the web servers 180 or other criteria. The on-demand code execution gateway 170 may thus receive requests that can be fulfilled by the web servers 180, and the load balancer 174 may determine that the request should instead be fulfilled by the on-demand code execution system 110.


In some embodiments, the on-demand code execution system 110 may provide one or more user interfaces, command-line interfaces (CLIs), application programing interfaces (APIs), and/or other programmatic interfaces for generating and uploading user-executable code (e.g., including metadata identifying dependency code objects for the uploaded code), invoking the user-provided code (e.g., submitting a request directly to the on-demand code execution system 110, in a format understood by that system, to execute user-submitted code), scheduling event-based jobs or timed jobs, tracking the user-provided code, and/or viewing other logging or monitoring information related to their requests and/or user code. 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 illustrative environment 100 further includes one or more network-based data storage services 108, configured to enable the on-demand code execution system 110 to store and retrieve data from one or more persistent or substantially persistent data sources. Illustratively, the network-based data storage services 108 may enable the on-demand code execution system 110 to store information corresponding to a task, such as code or metadata, to store additional code objects representing dependencies of tasks, to retrieve data to be processed during execution of a task, and to store information (e.g., results) regarding that execution. The network-based data storage services 108 may represent, for example, a relational or non-relational database. In another example, the network-based data storage services 108 may represent a network-attached storage (NAS), configured to provide access to data arranged as a file system. The network-based data storage services 108 may further enable the on-demand code execution system 110 to query for and retrieve information regarding data stored within the on-demand code execution system 110, such as by querying for a number of relevant files or records, sizes of those files or records, file or record names, file or record creation times, etc. In some instances, the network-based data storage services 108 may provide additional functionality, such as the ability to separate data into logical groups (e.g., groups associated with individual accounts, etc.). While shown as distinct from the auxiliary services 106, the network-based data storage services 108 may in some instances also represent a type of auxiliary service 106.


The computing devices 102, auxiliary services 106, and network-based data storage services 108 may communicate with the on-demand code execution gateway 170 via a network 104, which may include any wired network, wireless network, or combination thereof. For example, 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. As a further 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. In some embodiments, the on-demand code execution gateway 170 may communicate with the web servers 180 or the on-demand code execution system 110 via the network 104 or another network.


The on-demand code execution system 110, on-demand code execution gateway 170, and web servers 180 are depicted in FIG. 1 as operating in a distributed computing environment including several computer systems that are interconnected using one or more computer networks (not shown in FIG. 1). The system 110, gateway 170, and servers 180 could also operate within a computing environment having more or fewer devices than are illustrated in FIG. 1. Additionally, while shown as separate systems, the system 110, gateway 170, and servers 180 (or any combination thereof) may in some embodiments be implemented as a single system. Thus, the depictions of the system 110, gateway 170, and servers 180 in FIG. 1 should be taken as illustrative and not limiting to the present disclosure. For example, the on-demand code execution system 110, the gateway 170, and/or the servers 180 (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 on-demand code execution system 110, the on-demand code execution gateway 170, and the web servers 180 may be implemented directly in hardware or software executed by hardware devices 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 some instances, the one or more servers may operate as part of a system of rapidly provisioned and released computing resources, often referred to as a “cloud computing environment.”


In some embodiments, any of the components within the on-demand code execution system 110 can communicate with other components of the on-demand code execution system 110 via the network 104. In other embodiments, not all components of the on-demand code execution system 110 are capable of communicating with other components of the environment 100. In one example, only the frontend 120 (which may in some instances represent multiple frontends 120) may be connected to the gateway 170 or the network 104, and other components of the on-demand code execution system 110 may communicate with other components of the environment 100 via the frontends 120.


The on-demand code execution system 110 includes one or more frontends 120, which enable interaction with the on-demand code execution system 110. In an illustrative embodiment, the frontends 120 serve as an interface allowing the on-demand code execution gateway 170 to request execution of user-submitted code. In some embodiments, the frontends 120 also serve as a “front door” to other services provided by the on-demand code execution system 110, enabling users to, for example provide computer executable code. The frontends 120 include a variety of components to enable interaction between the on-demand code execution system 110 and other computing devices. For example, each frontend 120 may include a request interface providing computing devices 102 with the ability to upload or otherwise communicate user-specified code to the on-demand code execution system 110, and may enable computing devices 102 that are capable of doing so to request execution of that code without going through the gateway 170. In one embodiment, the request interface communicates with external computing devices (e.g., computing devices 102, auxiliary services 106, etc.) via a graphical user interface (GUI), CLI, or API. The frontends 120 process the requests and makes sure that the requests are properly authorized. For example, the frontends 120 may determine whether the user associated with the request is authorized to access the user code specified in the request. In the illustrated embodiment of FIG. 1, the frontends 120 may determine whether the on-demand code execution gateway 170 has been authorized to access the user code specified in a request.


References to 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 function, for example, in connection with a particular web application or mobile application developed by the user. As noted above, individual collections of user code (e.g., to achieve a specific function) are referred to herein as “tasks,” while specific executions of that code (including, e.g., compiling code, interpreting code, or otherwise making the code executable) are referred to as “task executions” or simply “executions.” Tasks may be written, by way of non-limiting example, in JavaScript (e.g., node.js), Java, Python, and/or Ruby (and/or another programming language). Tasks may be “triggered” for execution on the on-demand code execution system 110 in a variety of manners. In one embodiment, a user or other computing device may transmit a request to execute a task may, which can generally be referred to as “call” to execute of the task. Such calls may include the user code (or the location thereof) to be executed and one or more arguments to be used for executing the user code. For example, a call may provide the user code of a task along with the request to execute the task. In another example, a call may identify a previously uploaded task by its name or an identifier. In yet another example, code corresponding to a task may be included in a call for the task, as well as being uploaded in a separate location (e.g., storage of an auxiliary service 106 or a storage system internal to the on-demand code execution system 110) prior to the request being received by the on-demand code execution system 110. As noted above, the code for a task may reference additional code objects maintained at the on-demand code execution system 110 by use of identifiers of those code objects, such that the code objects are combined with the code of a task in an execution environment prior to execution of the task. The on-demand code execution system 110 may vary its execution strategy for a task based on where the code of the task is available at the time a call for the task is processed. A request interface of the frontend 120 may receive calls to execute tasks as 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 a task. As discussed above, any other protocols, including, for example, HTTP, MQTT, and CoAP, may be used to transfer the message containing a task call to the request interface.


To manage requests for code execution, the frontend 120 can include an execution queue (not shown in FIG. 1), which can maintain a record of requested task executions. Illustratively, the number of simultaneous task executions by the on-demand code execution system 110 is limited, and as such, new task executions initiated at the on-demand code execution system 110 (e.g., via an API call, via a call from an executed or executing task, etc.) may be placed on the execution queue and processed, e.g., in a first-in-first-out order. In some embodiments, the on-demand code execution system 110 may include multiple execution queues, such as individual execution queues for each user account. For example, users of the on-demand code execution system 110 may desire to limit the rate of task executions on the on-demand code execution system 110 (e.g., for cost reasons). Thus, the on-demand code execution system 110 may utilize an account-specific execution queue to throttle the rate of simultaneous task executions by a specific user account. In some instances, the on-demand code execution system 110 may prioritize task executions, such that task executions of specific accounts or of specified priorities bypass or are prioritized within the execution queue. In other instances, the on-demand code execution system 110 may execute tasks immediately or substantially immediately after receiving a call for that task, and thus, the execution queue may be omitted.


The frontend 120 can further include an output interface (not shown in FIG. 1) configured to output information regarding the execution of tasks on the on-demand code execution system 110. Illustratively, the output interface may transmit data regarding task executions (e.g., results of a task, errors related to the task execution, or details of the task execution, such as total time required to complete the execution, total data processed via the execution, etc.) to the on-demand code execution gateway 170, computing devices 102, or to auxiliary services 106, which may include, for example, billing or logging services. The output interface may further enable transmission of data, such as service calls, to auxiliary services 106. For example, the output interface may be utilized during execution of a task to transmit an API request to an external service 106 (e.g., to store data generated during execution of the task).


To execute tasks, the on-demand code execution system 110 includes one or more worker managers 140 that manage the instances used for servicing incoming calls to execute tasks. In the example illustrated in FIG. 1, each worker manager 140 manages an active pool of virtual machine instances 154A-B, which are currently assigned to one or more users and are implemented by one or more physical host computing devices 150. The physical host computing devices 150 and the virtual machine instances 154A-B may further implement one or more containers 158A-C, which may contain and execute one or more user-submitted codes 160A-G. Containers are logical units created within a virtual machine instance, or on a host computing device, using the resources available on that instance or device. For example, each worker manager 140 may, based on information specified in a call to execute a task, create a new container or locate an existing container 158A-C and assign the container to handle the execution of the task.


The containers 156A-C, virtual machine instances 154A-B, and host computing devices 150 may further include language runtimes, code libraries, or other supporting functions (not depicted in FIG. 1) that facilitate execution of user-submitted code 160A-C. The physical computing devices 150 and the virtual machine instances 154A-B may further include operating systems 152 and 156A-B. In various embodiments, operating systems 152 and 156A-B may be the same operating system, variants of the same operating system, different operating systems, or combinations thereof.


Although the virtual machine instances 154A-B are described here as being assigned to a particular user, in some embodiments, an instance 154A-B 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 task in a container on a particular instance after another member's task has been executed in another container on the same instance does not pose security risks. Similarly, the worker managers 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 on-demand code execution 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 task does not differentiate between the different users of the group and simply indicates the group to which the users associated with the task belong.


Once a triggering event to execute a task has been successfully processed by a frontend 120, the frontend 120 passes a request to a worker manager 140 to execute the task. In one embodiment, each frontend 120 may be associated with a corresponding worker manager 140 (e.g., a worker manager 140 co-located or geographically nearby to the frontend 120) and thus the frontend 120 may pass most or all requests to that worker manager 140. In another embodiment, a frontend 120 may include a location selector configured to determine a worker manager 140 to which to pass the execution request. In one embodiment, the location selector may determine the worker manager 140 to receive a call based on hashing the call, and distributing the call to a worker manager 140 selected based on the hashed value (e.g., via a hash ring). Various other mechanisms for distributing calls between worker managers 140 will be apparent to one of skill in the art. In accordance with embodiments of the present disclosure, the worker manager 140 can determine a host computing device 150 or a virtual machine instance 154A-B for executing a task.


As shown in FIG. 1, various combinations and configurations of host computing devices 150, virtual machine instances 154A-B, and containers 158A-C may be used to facilitate execution of user submitted code 160A-C. In the illustrated example, the host computing device 150 implements two virtual machine instances 154A and 154B. Virtual machine instance 154A, in turn, implements two containers 158A and 158B, which contain user-submitted code 160A and 160B respectively. Virtual machine instance 154B implements a single container 158C, which contains user-submitted code 160C. It will be understood that these embodiments are illustrated for purposes of example, and that many other embodiments are within the scope of the present disclosure.


While some functionalities are generally described herein with reference to an individual component of the on-demand code execution system 110, other components or a combination of components may additionally or alternatively implement such functionalities. For example, a worker manager 140 may operate to provide functionality associated with execution of user-submitted code as described herein with reference to an on-demand code execution gateway 170.



FIG. 2 depicts a general architecture of a computing system (referenced as on-demand code execution gateway 170) that operates to provide an interface to the on-demand code execution system 110. The general architecture of the on-demand code execution gateway 170 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 hardware modules may be implemented with physical electronic devices, as discussed in greater detail below. The on-demand code execution gateway 170 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. Additionally, the general architecture illustrated in FIG. 2 may be used to implement one or more of the other components illustrated in FIG. 1. As illustrated, the on-demand code execution gateway 170 includes a processor 202, input/output device interfaces 204, a network interface 206, and a data store 208, all of which may communicate with one another by way of a communication bus. The network interface 206 may provide connectivity to one or more networks or computing systems. The processor 202 may thus receive information and instructions from other computing systems or services via the network 104. The processor 202 may also communicate to and from a memory 220 and further provide output information for an optional display (not shown) via the input/output device interfaces 204. The input/output device interfaces 204 may also accept input from an optional input device (not shown).


The memory 220 may contain computer program instructions (grouped as modules in some embodiments) that the processor 202 executes in order to implement one or more aspects of the present disclosure. The memory 220 generally includes random access memory (RAM), read only memory (ROM) and/or other persistent, auxiliary or non-transitory computer readable media. The memory 220 may store an operating system 222 that provides computer program instructions for use by the processor 202 in the general administration and operation of the on-demand code execution gateway 170. The memory 220 may further include computer program instructions and other information for implementing aspects of the present disclosure. For example, in one embodiment, the memory 220 includes a user interface module 224 that generates interfaces (and/or instructions therefor) that enable access to the on-demand code execution server 110. In addition, the memory 220 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 module 224, the memory 220 may include a request serializer 172 and a load balancer 174 that may be executed by the processor 202. In one embodiment, the request serializer 172 and load balancer 174 individually or collectively implement various aspects of the present disclosure, e.g., processing request for network resources and serializing them into a format understood by an on-demand code execution server 110, as described further below.


While the request serializer 172 and load balancer 174 are shown in FIG. 2 as part of the on-demand code execution gateway 170, in other embodiments, all or a portion of the request serializer 172 and load balancer 174 may be implemented by other components of the on-demand code execution system 110 and/or another computing device. For example, in certain embodiments of the present disclosure, another computing device in communication with the on-demand code execution system 110 may include several modules or components that operate similarly to the modules and components illustrated as part of the on-demand code execution gateway 170.


The memory 220 may further include user requests 226, which may be loaded into memory in conjunction with a user-submitted request that can be fulfilled by executing a task on the on-demand code execution system 110. The memory 220 may further include execution output 228, which may be received from the on-demand code execution system 110 after a task has been executed.


In some embodiments, the on-demand code execution gateway 170 may further include components other than those illustrated in FIG. 2. For example, the memory 220 may further include information regarding various user-submitted codes that are available for execution, authentication information for accessing various user-submitted codes, or metadata or other information that was submitted with the request. FIG. 2 is thus understood to be illustrative but not limiting.



FIGS. 3A and 3B depict illustrative interactions for fulfilling requests for computing resources, such as requests to access a web page or a web-based application, via an on-line code execution gateway. With reference now to FIG. 3A, at (1), a computing device 102 requests a network resource. Illustratively, the request may be in the form of a Uniform Resource Locator (“URL”), which may be transmitted by the computing device to the load balancer 174. At (2), in some embodiments, the load balancer 174 assesses the current workloads of the servers it balances (which are not depicted in FIG. 3A) to determine whether any of these servers have capacity to fulfill the request. In some embodiments, the load balancer 174 may obtain server load information from the servers in the form of processor utilization metrics, memory usage, and other such measurements. In other embodiments, the load balancer 174 may determine server load based on the volume and frequency of requests that it has assigned.


In some embodiments, the load balancer 174 determines that one of its servers has sufficient capacity to fulfill the request, and assigns the request to the server. In other embodiments, at (3), the load balancer 174 determines that none of its servers currently have sufficient capacity to fulfill the request, and thus determines to fulfill the request using on-demand execution. In some embodiments, the load balancer 174 may determine to use on-demand execution for reasons other than server load. For example, the load balancer 174 may determine that on-demand code execution will make better use of computing resources, will provide better performance (e.g., faster results), provide lower latency for certain requests, or apply other criteria to make the determination to use on-demand execution. Having made such a determination, at (4), the load balancer 174 then passes the request to the request serializer 172.


In some embodiments, the load balancer 174 may act as a firewall that prevents malformed or malicious requests from reaching an on-demand code execution system and/or other servers. For example, the load balancer 174 may authenticate a request it receives by, e.g., exchanging tokens or otherwise verifying the source of the request. In further embodiments, the load balancer 174 may throttle requests to the on-demand code execution system or otherwise protect the integrity of the on-demand code execution system.


In some embodiments, the load balancer 174 may determine that the numbers of servers in its server pool should be increased based on the number of requests that the servers are unable to fulfill due to load, or may determine the number of servers may be decreased if few or no requests are being fulfilled via on-demand code execution. The load balancer 174 may analyze the quantity and timing of the requests it receives, and may assess the cost-benefit tradeoff of instantiating additional servers. For example, the load balancer 174 may determine that it is experiencing a temporary “spike” or increase in traffic, and that the spike will be over before it can bring additional servers online. As a further example, the load balancer 174 may determine that few or no requests are being fulfilled via on-demand code execution, and server workloads are such that the number of servers can be reduced. In some embodiments, the number of servers may be reduced to zero (e.g., a determination may be made that all requests should be fulfilled via on-demand code execution). In some embodiments, the load balancer 174 or another component of the on-demand code execution gateway 170 may perform a cost-benefit analysis of adding or removing a server, and may consider factors such as request response times, idle capacity, costs associated with on-demand code execution, costs associated with maintaining a server, and other factors.


At (4), the load balancer 174 may pass the request for a network resource to the request serializer 172, which may encode the request into a format accepted by an on-demand code execution system. Illustratively, the on-demand code execution system may require that requests be in a particular format. For example, the system may require that a request include certain headers or other metadata in a particular format, or that the body of the request be formatted as a base64-encoded JavaScript Object Notation (“JSON”) string or blog.


At (5), the request serializer 172 serializes the request. Illustratively, the request may be serialized by converting it to a format that is accepted by an on-demand code execution system, or by generating a “blank” request in an accepted format and populating it with information from the originally received request. In some embodiments, the request serializer 172 may generate a hash key, signature, token, or other identifier to allow the on-demand code execution system to authenticate the request. The request serializer 172 may also provide other information that is absent from the originally received request but required by the on-demand code execution system, such as information identifying the particular task or user-submitted code that may be executed to fulfill the request. In some embodiments, the request serializer 172 or the load balancer 174 may determine the appropriate task to execute based on characteristics of the request, such as an originating IP address, destination IP address, information contained in a URL string or in HTTP headers, or other characteristics.


In some embodiments, as described above, the request for a network resource may not be received all at once. For example, the request may be to process an image, data file, or other binary object, and the body of the request may include the object and may be distributed across multiple packets or messages. The request serializer 172 may thus buffer portions of the request until a complete request has been received, so that the entire request can be signed and provided to the on-demand code execution system.


At (6), the serialized request, which may also be referred to herein as an “encoded input,” is transmitted to a frontend 120 of an on-demand code execution system. The frontend 120 processes the serialized request, identifies a suitable worker manager 140, and at (7) requests that the worker manager 140 assign a worker to execute the requested code. At (8), the worker manager 140 identifies a host computing device 150 that can instantiate a “worker” execution environment (e.g., a virtual machine instance or a container within a virtual machine instance) to execute the task, and assigns the task to the execution environment on the host computing device 150. In some embodiments, the worker manager 140 may identify an existing execution environment to execute the task and assign the task accordingly. At (9), the execution environment on the host computing device 150 executes the task.


In some embodiments, the load balancer 174 or the request serializer 172 may interact with multiple frontends 120 or multiple code on-demand code execution systems, and may assign requests to different frontends, different on-demand code execution systems, or different tasks within an on-demand code execution system. For example, the load balancer 174 may assign requests to be fulfilled by a high-performance task that consumes more computing resources when load on the on-demand code execution system is low, and may assign requests to be fulfilled by a task that consumes fewer resources but still produces acceptable results when load is high. The load balancer 174 or the request serializer 172 may, in some embodiments, perform a periodic or demand-driven health check on the frontends 120, on-demand code execution systems, or executing tasks, and may fail over to a different frontend 120, on-demand code execution system, or task if the health check indicates a problem with task execution.


With reference now to FIG. 3B, at (10), the host computing device 150 provides the output of executing the task to the worker manager 140, who at (11) reports the output to the frontend 120. At (12), the frontend 120 provides the output to the request serializer 172. In some embodiments, the host computing device 150 or the worker manager 140 may communicate directly with the request serializer 172, and some or all of the interactions at (10), (11), and (12) may be combined. In some embodiments, the output may be encoded or serialized. For example, the output may be in a format that corresponds to the encoded input, such as a response to an API call, or may have headers or metadata that correspond to headers or metadata in the encoded input.


At (13), the request serializer 172 de-serializes the output. Illustratively, de-serializing the output may convert the output to a format expected by the computing device 102, such as an HTTP response that corresponds to the original request. In some embodiments, the request serializer 172 may remove or convert metadata associated with the output. For example, the request serializer 172 may move metadata into optional HTTP headers, or may make the output similar or identical to the output that a server-based application would have generated. In some embodiments, the output may include status messages or error messages that are specific to the on-demand code execution system, which may be translated or converted into status or error messages in another format (e.g., into the equivalent message that would have been generated by a server-based application), or may be retained in the converted output as indications that the request was fulfilled by an on-demand code execution system. At (14), the request serializer provides the decoded or de-serialized output to the load balancer 174, when at (15) provides the output to the requesting computing device 102 as a response to the original request.


In some embodiments, the ordering and implementation of operations described above may be modified, or these interactions may be carried out by additional or alternative elements of the on-demand code execution gateway 170. For example, in some embodiments, the interactions at (2) and (3) may be omitted and the load balancer 174 may fulfill all requests by utilizing the on-demand code execution system. As a further example, in some embodiments, the request serializer 172 may bypass the frontend 120 and communicate directly with the worker manager 140. The interactions depicted in FIGS. 3A-3B are thus understood to be illustrative and not limiting.



FIG. 4 is a flow diagram of an illustrative routine 400 for processing requests for computing resources by using an on-demand code execution gateway. The routine 400 may be carried out, for example, by the on-demand code execution gateway 170 depicted in FIG. 1 or various components thereof. At block 402, at least part of a request for a network resource may be obtained. Illustratively, the request may be to access web content, interact with an application, read or write to a storage volume, or access other resources. In various embodiments, as described above, the request may be received in its entirety or received in stages or portions.


At decision block 404, a determination may be made as to whether a complete request has been obtained. If not, then the routine 400 branches to block 406, where the portions of the request that have been obtained thus far are stored in a memory buffer until the rest of the request is received. The routine 400 then returns to block 402 and awaits further portions of the request. In some embodiments, the routine 400 may process multiple requests in parallel, and may determine which request is associated with the portion received at block 402 and whether the portion completes that request. Additionally, in some embodiments, the size of a complete request may exceed the size of the memory buffer for storing requests. If so, then in various embodiments the routine 400 may reject the request, truncate the request, assign the request to a web server (e.g., the web server(s) 180 as depicted in FIG. 1), stream all or part of the request to an on-demand code execution system, divide the request into smaller requests, or otherwise process the request.


If the determination at decision block 404 is that a complete request has been obtained, then the routine 400 branches to block 408, where the complete request may be serialized. As described above, all or part of the request may be serialized by converting or encoding the request into a format accepted by the on-demand code execution system. The request may, for example, be converted into a JSON object or objects, an HTTP method, an API call, or otherwise encoded into another format or notation.


At block 410, the serialized request may be provided as encoded input to an on-demand code execution system, and at block 412 the resulting encoded output may be obtained in a serialized format. Illustratively, as described above, the routine 400 may include authentication information as part of the request, or in some embodiments may authenticate separately from submitting a request to execute the task. For example, the routine 400 may provide credentials that confirm the user who submitted the code has authorized access via an on-demand code execution gateway. In other embodiments, the routine 400 may authenticate the request itself by signing the request or including a hash key as part of the request.


At block 414, the output from executing the task may be de-serialized and converted into a format understood by the requesting computing device. For example, the output may be converted from a JSON object or objects into an HTTP response, or all or part of the output may be converted from base64 notation into a binary notation. In some embodiments, the output may be made similar or identical to output that a server would provide if executing the task or an analogous task. In other embodiments, information indicating that the request was fulfilled by an on-demand code execution may be included in the output. At block 416, the de-serialized output may be provided in response to the original request.



FIG. 5 if a flow diagram of an illustrative routine 500 for utilizing an on-demand code execution system to provide load balancing. Offloading requests to an on-demand code execution system may allow more efficient management of computing resources. For example, on-demand code execution may be utilized to address portions of a workload that exceed the capacity of a pool of servers, but that are not sufficient to justify increasing the size of the pool. As further examples, on-demand code execution may be utilized to allow underused servers to be removed from the pool, or to handle a sudden increase in requests when servers cannot be added to the pool quickly enough.


At block 502, a request for a computing resource may be obtained as described above. At block 504, information regarding the current load of servers that can fulfill the request may be obtained. In some embodiments, as described above, server load information may be obtained from the servers themselves as metrics representing resource utilization or consumption. In other embodiments, server load may be determined or estimated based on the number and rate at which previous iterations of the routine 500 have assigned requests to the servers.


At decision block 506, a determination may be made as to whether a server is available to fulfill the request. In some embodiments, the incremental workload that the request represent may be determined, and the determination may be as to whether a server can accept the incremental workload and still meet performance targets (e.g., response times or resource utilization targets). In other embodiments, the capacity of each server may be determined or predetermined as a number of requests that can be processed in parallel, and this threshold may be compared to the number of requests that a server is currently processing. If the determination is that a server is available, then at block 508 the request is assigned to the server. At block 510, server load information may be compared to historical server load information, and an assessment may be made as to whether the servers are underutilized or whether it would be more efficient to fulfill more requests using on-demand code execution.


At decision block 512, a determination may be made as to whether server workloads and utilization of on-demand code execution are such that the number of servers should be reduced. If so, then at block 514 one or more servers may be released. Illustratively, a server may be released by deactivating a virtual machine instance, de-allocating physical hardware that has been allocated to a resource pool, or otherwise removing computing resources from the server pool. If the determination is that the number of servers should not be reduced, then the routine 500 ends without taking further action. In some embodiments, the routine 500 is executed continuously and instead branches to block 502 to await further requests for resources.


If the determination at decision block 506 is that no web server has sufficient available capacity to fulfill the request, then the routine 500 branches to block 516. In some embodiments, the determination at decision block 506 may be based on criteria other than the available capacity of the servers. For example, a determination may be made that on-demand code execution is likely to provide a faster response given the current server workloads, or that the characteristics of a particular request make on-demand code execution preferable. For example, on-demand code execution may be faster (or may provide acceptable performance) for certain types of requests, while other types of requests may require server resources. In further embodiments, the code that is executed by the on-demand code execution service may differ from the code executed by the servers, and may provide different results under certain conditions. The determination at decision block 506 may therefore be as to whether the conditions are met.


At block 516, the request may be assigned to an on-demand code execution server and fulfilled by executing user-submitted code, as described above. At block 518, usage of the on-demand code execution server may be analyzed relative to historical usage of on-demand code execution or usage of the servers. In some embodiments, the server load information obtained at block 504 may be analyzed.


At decision block 520, a determination may be made as to whether the usage of the on-demand code execution server is such that the size of the server pool should be increased. Illustratively, the determination may be that the usage exceeds a threshold for a specified time interval, or that the usage trend is increasing at a threshold rate. If the determination is that adding a server or server(s) to the pool is justified, then at block 522 one or more servers are added. If not, then the routine 500 ends (or in some embodiments returns to block 502 and awaits further input).


The blocks of the routines described above may vary in embodiments of the present disclosure. For example, in some embodiments of the routine 400, block 414 may be omitted and the output of the on-demand code execution may be provided in a serialized format. As a further example, blocks 510-514 and 516-522 of the routine 500 may be carried out independently of obtaining a request for a computing resource. For example, these blocks may be carried out periodically or in response to detecting that server loads are above or below a threshold. The routines may further include additional blocks, or the blocks of the routines may be rearranged or combined, according to various embodiments. In further embodiments, all or part of the routines may be combined.


It is to be understood that not necessarily all objects or advantages may be achieved in accordance with any particular embodiment described herein. Thus, for example, those skilled in the art will recognize that certain embodiments may be configured to operate in a manner that achieves or optimizes one advantage or group of advantages as taught herein without necessarily achieving other objects or advantages as may be taught or suggested herein.


All of the processes described herein may be embodied in, and fully automated via, software code modules, including one or more specific computer-executable instructions, that are executed by a computing system. The computing system may include one or more computers or processors. The code modules may be stored in any type of non-transitory computer-readable medium or other computer storage device. Some or all the methods may be embodied in specialized computer hardware.


Many other variations than those described herein will be apparent from this disclosure. For example, depending on the embodiment, certain acts, events, or functions of any of the algorithms described herein can be performed in a different sequence, can be added, merged, or left out altogether (e.g., not all described acts or events are necessary for the practice of the algorithms). Moreover, in certain embodiments, acts or events can be performed concurrently, e.g., through multi-threaded processing, interrupt processing, or multiple processors or processor cores or on other parallel architectures, rather than sequentially. In addition, different tasks or processes can be performed by different machines and/or computing systems that can function together.


The various illustrative logical blocks and modules described in connection with the embodiments disclosed herein can be implemented or performed by a machine, such as a processing unit or processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A processor can be a microprocessor, but in the alternative, the processor can be a controller, microcontroller, or state machine, combinations of the same, or the like. A processor can include electrical circuitry configured to process computer-executable instructions. In another embodiment, a processor includes an FPGA or other programmable device that performs logic operations without processing computer-executable instructions. A processor can also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration. Although described herein primarily with respect to digital technology, a processor may also include primarily analog components. A computing environment can include any type of computer system, including, but not limited to, a computer system based on a microprocessor, a mainframe computer, a digital signal processor, a portable computing device, a device controller, or a computational engine within an appliance, to name a few.


Conditional language such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, are otherwise understood within the context as used in general 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.


Disjunctive language such as the phrase “at least one of X, Y, or Z,” unless specifically stated otherwise, is otherwise understood with the context as used in general to present that an item, term, etc., may be either X, Y, or Z, or any combination thereof (e.g., X, Y, and/or Z). Thus, such disjunctive language is not generally intended to, and should not, imply that certain embodiments require at least one of X, at least one of Y, or at least one of Z to each be present.


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 elements 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.


Unless otherwise explicitly stated, articles such as “a” or “an” should generally be interpreted to include one or more described items. Accordingly, phrases such as “a device configured to” are intended to include one or more recited devices. Such one or more recited devices can also be collectively configured to carry out the stated recitations. For example, “a processor configured to carry out recitations A, B, and C” can include a first processor configured to carry out recitation A working in conjunction with a second processor configured to carry out recitations B and C.

Claims
  • 1. A system comprising: a non-transitory data store storing executable code for individual user-submitted tasks that are executable on an on-demand code execution system, wherein the on-demand code execution system receives requests to execute user-submitted tasks and manages, on a per-request basis, generating and provisioning an execution environment and executing the executable code for a requested user-submitted task; anda gateway computing device in communication with a first computing device and the on-demand code execution system, the gateway computing device configured to: receive, from the first computing device, a first portion of a network resource request for a first network resource;identify, based at least in part on the first portion of the network resource request, a user-submitted task that generates output from which the first network resource can be generated;receive, from the first computing device, a second portion of the network resource request, wherein the second portion completes the network resource request;generate, based at least in part on the network resource request, a serialized request to execute the user-submitted task on the on-demand code execution system, wherein to generate the serialized request, the gateway computing device is configured to: generate cryptographic authentication information to be used by the on-demand code execution system to authenticate the first computing device as a source of the network resource request, wherein the cryptographic authentication information has not been transmitted or requested by the first computing device, andconvert the network resource request into readable input processable by the on-demand code execution system;transmit the serialized request including the cryptographic authentication information and the readable input to the on-demand code execution system, wherein the on-demand code execution system (i) authenticates the first computing device as the source of the network resource request based at least in part on the cryptographic authentication information, and (ii) initiates an execution of the user-submitted task on at least a portion of the readable input included in the serialized request;receive, from the on-demand code execution system, output from the execution of the user-submitted task;generate the first network resource based at least in part on the output received from the on-demand code execution system; andtransmit the first network resource to the first computing device.
  • 2. The system of claim 1, wherein the first computing device is associated with a user who submitted the user-submitted task to the on-demand code execution system.
  • 3. The system of claim 1, wherein the readable input comprises an application programming interface (“API”) call.
  • 4. The system of claim 3, wherein the cryptographic authentication information comprises a hash key.
  • 5. A computer-implemented method implemented by a gateway computing device, the computer-implemented method comprising: receiving, from a first computing device, a network resource request for a network resource;determining, based at least in part on the network resource request, to fulfill the network resource request by executing a user-submitted task on an on-demand code execution system;generating, based at least in part on the network resource request, a serialized request to execute the user-submitted task on the on-demand code execution system, wherein generating the serialized request comprises: generating cryptographic authentication information to be used by the on-demand code execution system to authenticate the first computing device as a source of the network resource request, wherein the cryptographic authentication information has not been transmitted or requested by the first computing device, andconverting the network resource request into a readable format processable by the on-demand code execution system;transmitting the serialized request including the cryptographic authentication information and the network resource request converted into the readable format to the on-demand code execution system, wherein the on-demand code execution system (i) authenticates the first computing device as the source of the network resource request based at least in part on the cryptographic authentication information and (ii) initiates an execution of the user-submitted task on at least a portion of the network resource request converted into the readable format included in the serialized request;receiving, from the on-demand code execution system, an output generated by the on-demand code execution system executing the user-submitted task in response to the serialized task execution request;generating, based at least in part on the output received from the on-demand code execution system, the network resource requested by the first computing device; andtransmitting the network resource that is generated to the first computing device.
  • 6. The computer-implemented method of claim 5, wherein the network resource request comprises a uniform resource locator (“URL”).
  • 7. The computer-implemented method of claim 5, wherein the readable format processable by the on-demand code execution system includes a JavaScript Object Notation (“JSON”) blob.
  • 8. The computer-implemented method of claim 5 wherein receiving the network resource request comprises receiving a first portion of the network resource request and a second portion of the network resource request.
  • 9. The computer-implemented method of claim 8 further comprising storing the first portion of the network resource request in a memory buffer until the second portion is received.
  • 10. The computer-implemented method of claim 5 wherein receiving the output generated by the on-demand code execution system comprises receiving a first portion of the output and a second portion of the output.
  • 11. The computer-implemented method of claim 10 further comprising storing the first portion of the output in a memory buffer until the second portion is received.
  • 12. The computer-implemented method of claim 5, wherein transmitting the serialized request to the on-demand code execution system causes the on-demand code execution system to instantiate a virtual machine instance for executing the user-submitted task.
  • 13. The computer-implemented method of claim 5, wherein transmitting the serialized request comprises transmitting the serialized request via a previously established connection to the on-demand code execution system.
  • 14. A non-transitory computer-readable medium including computer-executable instructions that, when executed by a gateway computing device, cause the gateway computing device to: determine, based at least in part on a network resource request for a network resource received from a first computing device, to fulfill the network resource request at least in part by executing a user-submitted task on an on-demand code execution system;generate, based at least in part on the network resource request, a serialized task execution request to execute the user-submitted task on the on-demand code execution system, wherein to generate the serialized task execution request, the computer-executable instructions, when executed by a gateway computing device, cause the gateway computing device to: generate cryptographic authentication information to be used by the on-demand code execution system to authenticate a source of the network resource request, wherein the cryptographic authentication information has not been transmitted or requested by the first computing device,convert the network resource request into a readable format processable by the on-demand code execution system, andcombine (i) the network resource request that is converted by the gateway computing device, and (ii) the cryptographic authentication information that is generated by the gateway computing device and that has not been transmitted or requested by the first computing device, to form the serialized task execution request;transmit the serialized task execution request including the cryptographic authentication information to the on-demand code execution system, wherein the on-demand code execution system authenticates the first computing device as the source of the network resource request based at least in part on the cryptographic authentication information;generate the network resource based at least in part on an output obtained by executing the user-submitted task on at least a portion of the network resource request that is converted into the readable format by the gateway computing device on the on-demand code execution system in response to the serialized task execution request; andtransmit the network resource that is generated to the first computing device in response to the network resource request.
  • 15. The non-transitory computer-readable medium of claim 14 including further computer-executable instructions that, when executed by the gateway computing device, cause the gateway computing device to periodically monitor execution of the user-submitted task on the on-demand code execution system.
  • 16. The non-transitory computer-readable medium of claim 14, wherein the network resource request comprises a hypertext transport protocol (“HTTP”) method, and wherein the network resource that is generated comprises an HTTP response.
  • 17. The non-transitory computer-readable medium of claim 14, wherein the serialized task execution request comprises a first serialized JSON string, and wherein the output by executing the user-submitted task on the on-demand code execution system comprises a second serialized JSON string.
  • 18. The non-transitory computer-readable medium of claim 14, wherein the source of the network resource request is at least one of the first computing device or the gateway computing device.
  • 19. The non-transitory computer-readable medium of claim 14, wherein the on-demand code execution system authenticates the source of the network resource request based at least in part on the cryptographic authentication information.
US Referenced Citations (958)
Number Name Date Kind
4949254 Shorter Aug 1990 A
5283888 Dao et al. Feb 1994 A
5835764 Platt et al. Nov 1998 A
5970488 Crowe et al. Oct 1999 A
5983197 Enta Nov 1999 A
6237005 Griffin May 2001 B1
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
7308463 Taulbee et al. Dec 2007 B2
7340522 Basu et al. Mar 2008 B1
7360215 Kraiss et al. Apr 2008 B2
7558719 Donlin Jul 2009 B1
7577722 Khandekar et al. Aug 2009 B1
7590806 Harris et al. Sep 2009 B2
7640574 Kim Dec 2009 B1
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
8296267 Cahill et al. Oct 2012 B2
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
8392558 Ahuja et al. Mar 2013 B1
8402514 Thompson et al. Mar 2013 B1
8417723 Lissack et al. Apr 2013 B1
8429282 Ahuja Apr 2013 B1
8448165 Conover May 2013 B1
8479195 Adams et al. Jul 2013 B2
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
8713093 Upadhyay Apr 2014 B1
8719415 Sirota et al. May 2014 B1
8725702 Raman et al. May 2014 B1
8756322 Lynch Jun 2014 B1
8756696 Miller Jun 2014 B1
8763091 Singh et al. Jun 2014 B1
8769519 Leitman et al. Jul 2014 B2
8793676 Quinn et al. Jul 2014 B2
8799236 Azari et al. Aug 2014 B1
8799879 Wright et al. Aug 2014 B2
8806266 Qu et al. Aug 2014 B1
8806468 Meijer et al. Aug 2014 B2
8806644 McCorkendale et al. Aug 2014 B1
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
8949457 Theroux et al. Feb 2015 B1
8966495 Kulkarni Feb 2015 B2
8972980 Banga et al. Mar 2015 B2
8990807 Wu et al. Mar 2015 B2
8997093 Dimitrov Mar 2015 B2
9002871 Bulkowski et al. Apr 2015 B2
9021501 Li et al. Apr 2015 B2
9026658 Xu et al. May 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
9104477 Kodialam et al. 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
9116733 Banga et al. Aug 2015 B2
9130900 Tran Sep 2015 B2
9141410 Leafe et al. Sep 2015 B2
9146764 Wagner Sep 2015 B1
9152406 De et al. Oct 2015 B2
9154955 Bertz Oct 2015 B1
9164754 Pohlack Oct 2015 B1
9176871 Serlet Nov 2015 B1
9183019 Kruglick Nov 2015 B2
9189778 Sh. Al-Rashidi Nov 2015 B1
9195520 Turk 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
9405582 Fuller et al. Aug 2016 B2
9411645 Duan et al. Aug 2016 B1
9413626 Reque et al. Aug 2016 B2
9417918 Chin et al. Aug 2016 B2
9430290 Gupta et al. Aug 2016 B1
9436555 Dornemann et al. Sep 2016 B2
9461996 Hayton et al. Oct 2016 B2
9471775 Wagner et al. Oct 2016 B1
9471776 Gu et al. Oct 2016 B2
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
9563613 Dinkel Feb 2017 B1
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
9626204 Banga 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
9720661 Gschwind et al. Aug 2017 B2
9720662 Gschwind et al. Aug 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
9798831 Chattopadhyay et al. Oct 2017 B2
9799017 Vermeulen et al. Oct 2017 B1
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
9898393 Moorthi et al. Feb 2018 B2
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
9983982 Kumar May 2018 B1
10002026 Wagner Jun 2018 B1
10002036 Fuchs et al. Jun 2018 B2
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
10162655 Tuch et al. Dec 2018 B2
10162672 Wagner et al. Dec 2018 B2
10162688 Wagner Dec 2018 B2
10191861 Steinberg Jan 2019 B1
10193839 Tandon et al. Jan 2019 B2
10198298 Bishop et al. Feb 2019 B2
10203990 Wagner et al. Feb 2019 B2
10248467 Wisniewski et al. Apr 2019 B2
10255090 Tuch et al. Apr 2019 B2
10277708 Wagner et al. Apr 2019 B2
10303492 Wagner May 2019 B1
10331462 Varda et al. Jun 2019 B1
10346625 Anderson et al. Jul 2019 B2
10353678 Wagner Jul 2019 B1
10353746 Reque et al. Jul 2019 B2
10360025 Foskett et al. Jul 2019 B2
10360067 Wagner Jul 2019 B1
10365985 Wagner Jul 2019 B2
10387177 Wagner et al. Aug 2019 B2
10402231 Marriner et al. Sep 2019 B2
10423158 Hadlich Sep 2019 B1
10437629 Wagner et al. Oct 2019 B2
10445140 Sagar et al. Oct 2019 B1
10459822 Gondi Oct 2019 B1
10496547 Naenko et al. Dec 2019 B1
10503626 Idicula et al. Dec 2019 B2
10528390 Brooker et al. Jan 2020 B2
10531226 Wang Jan 2020 B1
10552193 Wagner et al. Feb 2020 B2
10552442 Lusk et al. Feb 2020 B1
10564946 Wagner et al. Feb 2020 B1
10572375 Wagner Feb 2020 B1
10592269 Wagner et al. Mar 2020 B2
10608973 Kuo et al. Mar 2020 B2
10615984 Wang Apr 2020 B1
10623476 Thompson Apr 2020 B2
10637817 Kuo et al. Apr 2020 B2
10649749 Brooker et al. May 2020 B1
10649792 Kulchytskyy May 2020 B1
10650156 Anderson et al. May 2020 B2
10652350 Wozniak May 2020 B2
10686605 Chhabra et al. Jun 2020 B2
10691498 Wagner Jun 2020 B2
10713080 Brooker et al. Jul 2020 B1
10719367 Kim et al. Jul 2020 B1
10725752 Wagner et al. Jul 2020 B1
10725826 Sagar et al. Jul 2020 B1
10732951 Jayanthi et al. Aug 2020 B2
10733085 Wagner Aug 2020 B1
10754701 Wagner Aug 2020 B1
10776091 Wagner et al. Sep 2020 B1
10776171 Wagner et al. Sep 2020 B2
10817331 Mullen et al. Oct 2020 B2
10824484 Wagner et al. Nov 2020 B2
10831898 Wagner Nov 2020 B1
10846117 Steinberg Nov 2020 B1
10853112 Wagner et al. Dec 2020 B2
10853115 Mullen et al. Dec 2020 B2
10884722 Brooker et al. Jan 2021 B2
10884787 Wagner et al. Jan 2021 B1
10884802 Wagner et al. Jan 2021 B2
10884812 Brooker et al. Jan 2021 B2
10891145 Wagner et al. Jan 2021 B2
10915371 Wagner et al. Feb 2021 B2
10942795 Yanacek et al. Mar 2021 B1
10949237 Piwonka et al. Mar 2021 B2
10956185 Wagner Mar 2021 B2
11010188 Brooker et al. May 2021 B1
11016815 Wisniewski et al. May 2021 B2
11099870 Brooker et al. Aug 2021 B1
11099917 Hussels et al. Aug 2021 B2
11115404 Siefker et al. Sep 2021 B2
11119809 Brooker et al. Sep 2021 B1
11119813 Kasaragod Sep 2021 B1
11119826 Yanacek et al. Sep 2021 B2
11126469 Reque et al. Sep 2021 B2
11132213 Wagner et al. Sep 2021 B1
11146569 Brooker et al. Oct 2021 B1
11159528 Siefker et al. Oct 2021 B2
11188391 Sule Nov 2021 B1
11190609 Siefker et al. Nov 2021 B2
11231955 Shahane et al. Jan 2022 B1
11243819 Wagner Feb 2022 B1
11243953 Wagner et al. Feb 2022 B2
11263034 Wagner et al. Mar 2022 B2
11354169 Marriner et al. Jun 2022 B2
11360793 Wagner et al. Jun 2022 B2
11392497 Brooker et al. Jul 2022 B1
11461124 Wagner et al. Oct 2022 B2
11467890 Wagner Oct 2022 B2
11550713 Piwonka et al. Jan 2023 B1
11561811 Wagner Jan 2023 B2
11593270 Brooker et al. Feb 2023 B1
20010044817 Asano et al. Nov 2001 A1
20020083012 Bush et al. Jun 2002 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
20030177186 Goodman Sep 2003 A1
20030191795 Bernardin et al. Oct 2003 A1
20030208569 O'Brien et al. Nov 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
20050262183 Colrain et al. Nov 2005 A1
20050262512 Schmidt et al. Nov 2005 A1
20060010440 Anderson et al. Jan 2006 A1
20060015740 Kramer Jan 2006 A1
20060031448 Chu et al. Feb 2006 A1
20060036941 Neil Feb 2006 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
20060218601 Michel Sep 2006 A1
20060242647 Kimbrel et al. Oct 2006 A1
20060242709 Seinfeld et al. Oct 2006 A1
20060248195 Toumura et al. Nov 2006 A1
20060259763 Cooperstein et al. Nov 2006 A1
20060282330 Frank Dec 2006 A1
20060288120 Hoshino et al. Dec 2006 A1
20070033085 Johnson Feb 2007 A1
20070050779 Hayashi Mar 2007 A1
20070067321 Bissett et al. Mar 2007 A1
20070076244 Suzuki Apr 2007 A1
20070094396 Takano et al. Apr 2007 A1
20070101325 Bystricky et al. May 2007 A1
20070112864 Ben-Natan 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
20070300297 Dawson Dec 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
20080178278 Grinstein Jul 2008 A1
20080184340 Nakamura Jul 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
20080288940 Adams et al. Nov 2008 A1
20080307098 Kelly Dec 2008 A1
20090006897 Sarsfield Jan 2009 A1
20090013153 Hilton Jan 2009 A1
20090018892 Grey et al. Jan 2009 A1
20090025009 Brunswig et al. Jan 2009 A1
20090034537 Colrain et al. Feb 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
20090158407 Nicodemus 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
20090307430 Bruening et al. 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
20100037031 DeSantis et al. 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
20100083248 Wood 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
20100146004 Sim-Tang Jun 2010 A1
20100169477 Stienhans et al. Jul 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
20100298011 Pelley Nov 2010 A1
20100299541 Ishikawa et al. Nov 2010 A1
20100312871 Desantis et al. Dec 2010 A1
20100325727 Neystadt et al. Dec 2010 A1
20100329149 Singh et al. Dec 2010 A1
20100329643 Kuang Dec 2010 A1
20110004687 Takemura Jan 2011 A1
20110010690 Howard et al. Jan 2011 A1
20110010722 Matsuyama Jan 2011 A1
20110023026 Oza Jan 2011 A1
20110029970 Arasaratnam Feb 2011 A1
20110029984 Norman et al. Feb 2011 A1
20110035785 Mihara 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
20110153541 Koch et al. Jun 2011 A1
20110153727 Li Jun 2011 A1
20110153838 Belkine et al. Jun 2011 A1
20110154353 Theroux et al. Jun 2011 A1
20110173637 Brandwine et al. Jul 2011 A1
20110179162 Mayo et al. Jul 2011 A1
20110184993 Chawla et al. Jul 2011 A1
20110208866 Marmolejo-Meillon Aug 2011 A1
20110225277 Freimuth et al. Sep 2011 A1
20110231680 Padmanabhan et al. Sep 2011 A1
20110247005 Benedetti et al. Oct 2011 A1
20110258603 Wisnovsky et al. Oct 2011 A1
20110265067 Schulte et al. Oct 2011 A1
20110265069 Fee 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
20110296412 Banga et al. Dec 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 et al. Mar 2012 A1
20120060207 Mardikar et al. 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
20120110603 Kaneko May 2012 A1
20120124563 Chung 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
20120173709 Li et al. Jul 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
20120198514 McCune et al. Aug 2012 A1
20120204164 Castanos et al. Aug 2012 A1
20120209947 Glaser et al. Aug 2012 A1
20120222038 Katragadda et al. Aug 2012 A1
20120233464 Miller et al. Sep 2012 A1
20120254193 Chattopadhyay et al. Oct 2012 A1
20120324052 Paleja et al. Dec 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
20130091387 Bohnet et al. Apr 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
20130132283 Hayhow 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
20130145354 Bruening et al. Jun 2013 A1
20130151587 Takeshima et al. Jun 2013 A1
20130151648 Luna Jun 2013 A1
20130151684 Forsman et al. 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
20130205114 Badam 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
20130232190 Miller Sep 2013 A1
20130232480 Winterfeldt et al. Sep 2013 A1
20130239125 Iorio Sep 2013 A1
20130246944 Pandiyan 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
20130283141 Stevenson 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
20130326507 McGrath et al. Dec 2013 A1
20130332660 Talagala 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
20140047437 Wu 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
20140164551 Resch et al. Jun 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
20140189704 Narvaez 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
20140229942 Wiseman et al. Aug 2014 A1
20140245297 Hackett Aug 2014 A1
20140258777 Cheriton Sep 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
20140304246 Helmich et al. Oct 2014 A1
20140304698 Chigurapati et al. Oct 2014 A1
20140304815 Maeda Oct 2014 A1
20140317617 O'Donnell Oct 2014 A1
20140330936 Factor Nov 2014 A1
20140331222 Zheng Nov 2014 A1
20140337953 Banatwala Nov 2014 A1
20140344457 Bruno, Jr. et al. Nov 2014 A1
20140344736 Ryman et al. Nov 2014 A1
20140351674 Grube et al. Nov 2014 A1
20140359093 Raju et al. Dec 2014 A1
20140359608 Tsirkin et al. Dec 2014 A1
20140365781 Dmitrienko et al. Dec 2014 A1
20140372489 Jaiswal et al. Dec 2014 A1
20140372533 Fu et al. Dec 2014 A1
20140380085 Rash et al. Dec 2014 A1
20150006487 Yang et al. Jan 2015 A1
20150025989 Dunstan Jan 2015 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
20150046971 Huh 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
20150074675 Qi et al. Mar 2015 A1
20150081885 Thomas et al. Mar 2015 A1
20150095822 Feis Apr 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
20150143374 Banga et al. May 2015 A1
20150143381 Chin et al. May 2015 A1
20150146716 Olivier et al. May 2015 A1
20150154046 Farkas et al. Jun 2015 A1
20150161384 Gu et al. Jun 2015 A1
20150163231 Sobko et al. Jun 2015 A1
20150178019 Hegdal 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
20150206139 Lea Jul 2015 A1
20150212818 Gschwind 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
20150256514 Laivand Sep 2015 A1
20150256621 Noda et al. Sep 2015 A1
20150261578 Greden et al. Sep 2015 A1
20150264014 Budhani et al. Sep 2015 A1
20150269494 Kardes et al. Sep 2015 A1
20150271073 Saladi et al. Sep 2015 A1
20150271280 Zhang 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
20150319174 Hayton Nov 2015 A1
20150324174 Bromley et al. Nov 2015 A1
20150324182 Barros et al. Nov 2015 A1
20150324210 Carlson 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
20150363304 Nagamalla Dec 2015 A1
20150370560 Tan et al. Dec 2015 A1
20150370591 Tuch et al. Dec 2015 A1
20150370592 Tuch 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
20160021112 Katieb 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
20160072781 Zhang 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
20160110188 Verde et al. Apr 2016 A1
20160117163 Fukui et al. Apr 2016 A1
20160117254 Susarla et al. Apr 2016 A1
20160119289 Jain Apr 2016 A1
20160124665 Jain et al. May 2016 A1
20160124978 Nithrakashyap et al. May 2016 A1
20160140180 Park et al. May 2016 A1
20160150053 Janczuk May 2016 A1
20160188367 Zeng Jun 2016 A1
20160191420 Nagarajan et al. Jun 2016 A1
20160198235 Liu Jul 2016 A1
20160203219 Hoch et al. Jul 2016 A1
20160212007 Alatorre et al. Jul 2016 A1
20160226955 Moorthi et al. Aug 2016 A1
20160282930 Ramachandran et al. Sep 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
20160315910 Kaufman Oct 2016 A1
20160350099 Suparna et al. Dec 2016 A1
20160350124 Gschwind 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
20160378525 Bjorkengren Dec 2016 A1
20160378547 Brouwer et al. Dec 2016 A1
20160378554 Gummaraju et al. Dec 2016 A1
20170004169 Merrill Jan 2017 A1
20170032000 Sharma Feb 2017 A1
20170041144 Krapf Feb 2017 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
20170085502 Biruduraju Mar 2017 A1
20170085591 Ganda et al. Mar 2017 A1
20170091235 Yammine et al. Mar 2017 A1
20170091296 Beard 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
20170142099 Hinohara May 2017 A1
20170147656 Choudhary et al. May 2017 A1
20170149740 Mansour May 2017 A1
20170153965 Nitta et al. Jun 2017 A1
20170161059 Wood Jun 2017 A1
20170177266 Doerner et al. Jun 2017 A1
20170177441 Chow Jun 2017 A1
20170177854 Gligor et al. Jun 2017 A1
20170188213 Nirantar Jun 2017 A1
20170192825 Biberman et al. Jul 2017 A1
20170221000 Anand Aug 2017 A1
20170230262 Sreeramoju et al. Aug 2017 A1
20170230499 Mumick et al. Aug 2017 A1
20170249130 Smiljamic et al. Aug 2017 A1
20170264681 Apte Sep 2017 A1
20170272462 Kraemer et al. Sep 2017 A1
20170286143 Wagner et al. Oct 2017 A1
20170286187 Chen et al. Oct 2017 A1
20170288878 Lee Oct 2017 A1
20170308520 Beahan, Jr. Oct 2017 A1
20170315163 Wang Nov 2017 A1
20170329578 Iscen Nov 2017 A1
20170346808 Anzai et al. Nov 2017 A1
20170353851 Gonzalez Dec 2017 A1
20170364345 Fontoura 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
20180004556 Marriner et al. Jan 2018 A1
20180004572 Wagner Jan 2018 A1
20180004575 Marriner et al. Jan 2018 A1
20180032410 Kang et al. Feb 2018 A1
20180046453 Nair et al. Feb 2018 A1
20180046482 Karve et al. Feb 2018 A1
20180060132 Maru et al. Mar 2018 A1
20180060221 Yim et al. Mar 2018 A1
20180060318 Yang et al. Mar 2018 A1
20180067841 Mahimkar Mar 2018 A1
20180067873 Pikhur et al. Mar 2018 A1
20180069702 Ayyadevara et al. Mar 2018 A1
20180081717 Li Mar 2018 A1
20180089232 Spektor Mar 2018 A1
20180095738 Dürkop et al. Apr 2018 A1
20180113770 Hasanov et al. Apr 2018 A1
20180121245 Wagner et al. May 2018 A1
20180121665 Anderson et al. May 2018 A1
20180129684 Wilson May 2018 A1
20180143865 Wagner et al. May 2018 A1
20180144263 Saxena et al. May 2018 A1
20180150339 Pan et al. May 2018 A1
20180152401 Tandon et al. May 2018 A1
20180152405 Kuo et al. May 2018 A1
20180152406 Kuo et al. May 2018 A1
20180192101 Bilobrov Jul 2018 A1
20180225096 Mishra et al. Aug 2018 A1
20180227300 Nakic Aug 2018 A1
20180239636 Arora et al. Aug 2018 A1
20180253333 Gupta Sep 2018 A1
20180268130 Ghosh et al. Sep 2018 A1
20180275987 Vandeputte Sep 2018 A1
20180285101 Yahav et al. Oct 2018 A1
20180300111 Bhat et al. Oct 2018 A1
20180314845 Anderson et al. Nov 2018 A1
20180316552 Subramani Nadar et al. Nov 2018 A1
20180341504 Kissell Nov 2018 A1
20180365422 Callaghan et al. Dec 2018 A1
20180367517 Tus Dec 2018 A1
20180375781 Chen et al. Dec 2018 A1
20190004866 Du et al. Jan 2019 A1
20190018715 Behrendt et al. Jan 2019 A1
20190028552 Johnson, II et al. Jan 2019 A1
20190034095 Singh et al. Jan 2019 A1
20190043231 Uzgin Feb 2019 A1
20190072529 Andrawes et al. Mar 2019 A1
20190073430 Webster Mar 2019 A1
20190079751 Foskett et al. Mar 2019 A1
20190102231 Wagner Apr 2019 A1
20190102278 Gahlin et al. Apr 2019 A1
20190108058 Wagner et al. Apr 2019 A1
20190140831 De Lima Junior et al. May 2019 A1
20190141015 Nellen May 2019 A1
20190147085 Pal May 2019 A1
20190147515 Hurley May 2019 A1
20190155629 Wagner et al. May 2019 A1
20190171423 Mishra et al. Jun 2019 A1
20190171470 Wagner Jun 2019 A1
20190179678 Banerjee et al. Jun 2019 A1
20190179725 Mital et al. Jun 2019 A1
20190180036 Shukla Jun 2019 A1
20190188288 Holm Jun 2019 A1
20190196884 Wagner Jun 2019 A1
20190227849 Wisniewski et al. Jul 2019 A1
20190235848 Swiecki et al. Aug 2019 A1
20190238590 Talukdar et al. Aug 2019 A1
20190250937 Thomas et al. Aug 2019 A1
20190268152 Sandoval et al. Aug 2019 A1
20190278938 Greene et al. Sep 2019 A1
20190286475 Mani Sep 2019 A1
20190286492 Gulsvig Wood et al. Sep 2019 A1
20190303117 Kocberber et al. Oct 2019 A1
20190311115 Lavi et al. Oct 2019 A1
20190318312 Foskett et al. Oct 2019 A1
20190324813 Bogineni et al. Oct 2019 A1
20190339955 Kuo et al. Nov 2019 A1
20190361802 Li et al. Nov 2019 A1
20190363885 Schiavoni Nov 2019 A1
20190370113 Zhang et al. Dec 2019 A1
20190384647 Reque et al. Dec 2019 A1
20190391834 Mullen et al. Dec 2019 A1
20190391841 Mullen et al. Dec 2019 A1
20200007456 Greenstein et al. Jan 2020 A1
20200026527 Xu et al. Jan 2020 A1
20200028936 Gupta Jan 2020 A1
20200034471 Danilov et al. Jan 2020 A1
20200057680 Marriner et al. Feb 2020 A1
20200065079 Kocberber et al. Feb 2020 A1
20200073770 Mortimore, Jr. et al. Mar 2020 A1
20200073987 Perumala et al. Mar 2020 A1
20200081745 Cybulski et al. Mar 2020 A1
20200104198 Hussels et al. Apr 2020 A1
20200104378 Wagner et al. Apr 2020 A1
20200110691 Bryant et al. Apr 2020 A1
20200120120 Cybulski Apr 2020 A1
20200136933 Raskar Apr 2020 A1
20200153798 Liebherr May 2020 A1
20200153897 Mestery et al. May 2020 A1
20200167208 Floes et al. May 2020 A1
20200192646 Yerramreddy et al. Jun 2020 A1
20200192707 Brooker et al. Jun 2020 A1
20200213151 Srivatsan et al. Jul 2020 A1
20200327236 Pratt et al. Oct 2020 A1
20200341741 Brooker et al. Oct 2020 A1
20200341799 Wagner et al. Oct 2020 A1
20200349067 Syamala et al. Nov 2020 A1
20200366587 White et al. Nov 2020 A1
20200401455 Church et al. Dec 2020 A1
20200412707 Siefker et al. Dec 2020 A1
20200412720 Siefker et al. Dec 2020 A1
20200412825 Siefker et al. Dec 2020 A1
20210019056 Mangione-Tran Jan 2021 A1
20210081233 Mullen et al. Mar 2021 A1
20210117534 Maximov et al. Apr 2021 A1
20210157645 Yanacek et al. May 2021 A1
20210232415 Wagner et al. Jul 2021 A1
20210389963 Wagner Dec 2021 A1
20220004423 Brooker et al. Jan 2022 A1
20220012083 Brooker et al. Jan 2022 A1
20220391238 Wagner Dec 2022 A1
Foreign Referenced Citations (84)
Number Date Country
2975522 Aug 2016 CA
1341238 Mar 2002 CN
101002170 Jul 2007 CN
101267334 Sep 2008 CN
101345757 Jan 2009 CN
101496005 Jul 2009 CN
101627388 Jan 2010 CN
101640700 Feb 2010 CN
101764824 Jun 2010 CN
102171712 Aug 2011 CN
102365858 Feb 2012 CN
102420846 Apr 2012 CN
102761549 Oct 2012 CN
103098027 May 2013 CN
103140828 Jun 2013 CN
103384237 Nov 2013 CN
103731427 Apr 2014 CN
104111848 Oct 2014 CN
104243479 Dec 2014 CN
104903854 Sep 2015 CN
105122243 Dec 2015 CN
108885568 Nov 2018 CN
109478134 Mar 2019 CN
109564525 Apr 2019 CN
112513813 Mar 2021 CN
2663052 Nov 2013 EP
3201762 Aug 2017 EP
3254434 Dec 2017 EP
3356938 Aug 2018 EP
3201768 Dec 2019 EP
3811209 Apr 2021 EP
3814895 May 2021 EP
3857375 Aug 2021 EP
4064052 Sep 2022 EP
2002287974 Oct 2002 JP
2006-107599 Apr 2006 JP
2007-080161 Mar 2007 JP
2007-538323 Dec 2007 JP
2010-026562 Feb 2010 JP
2011-065243 Mar 2011 JP
2011-233146 Nov 2011 JP
2011257847 Dec 2011 JP
2012-078893 Apr 2012 JP
2012-104150 May 2012 JP
2013-156996 Aug 2013 JP
2014-525624 Sep 2014 JP
2016-507100 Mar 2016 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
7197612 Dec 2022 JP
7210713 Jan 2023 JP
10-357850 Oct 2002 KR
10-2021-0019533 Feb 2021 KR
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 2015149017 Oct 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 2018005829 Jan 2018 WO
WO 2018098443 May 2018 WO
WO 2018098445 May 2018 WO
WO 2020005764 Jan 2020 WO
WO 2020006081 Jan 2020 WO
WO 2020069104 Apr 2020 WO
WO 2020123439 Jun 2020 WO
WO 2020264431 Dec 2020 WO
WO 2021108435 Jun 2021 WO
WO 2021108435 Jun 2021 WO
Non-Patent Literature Citations (148)
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.
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.
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.
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.
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.
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.
Kamga et al., Extended scheduler for efficient frequency scaling in virtualized systems, Jul. 2012, 8 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.
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.
Tange, “GNU Parallel: The Command-Line Power Tool”, vol. 36, No. 1, Jan. 1, 1942, pp. 42-47.
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.
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.
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.
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.
Extended Search Report in European Application No. 19199402.9 dated Mar. 6, 2020.
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.
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.
Bebenita et al., “Trace-Based Compilation in Execution Environments without Interpreters,” ACM, Copyright 2010, 10 pages.
Fan et al., Online Optimization of VM Deployment in laaS Cloud, 2012, 6 pages.
Ha et al., A Concurrent Trace-based Just-In-Time Compiler for Single-threaded JavaScript, utexas.edu (Year: 2009).
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).
Search Query Report from IP.com, performed Dec. 2, 2020.
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.
Office Action in Canadian Application No. 2,962,633 dated May 21, 2020.
Office Action in Japanese Application No. 2017-516160 dated Jan. 15, 2018.
Notice of Allowance in Japanese Application No. 2017-516160 dated May 8, 2018.
Office Action in Canadian Application No. 2,962,631 dated May 19, 2020.
Office Action in Japanese Application No. 2017-516168 dated Mar. 26, 2018.
Office Action in Indian Application No. 201717019903 dated May 18, 2020.
Office Action in Australian Application No. 2016215438 dated Feb. 26, 2018.
Notice of Allowance in Australian Application No. 2016215438 dated Nov. 19, 2018.
Office Action in Canadian Application No. 2,975,522 dated Jun. 5, 2018.
Notice of Allowance in Canadian Application No. 2,975,522 dated Mar. 13, 2020.
Office Action in Indian Application No. 201717027369 dated May 21, 2020.
First Examination Report for Indian Application No. 201717034806 dated Jun. 25, 2020.
Office Action in European Application No. 16781265.0 dated Jul. 13, 2020.
Office Action in European Application No. 201817013748 dated Nov. 20, 2020.
International Search Report and Written Opinion dated Oct. 15, 2019 for International Application No. PCT/US2019/039246 in 16 pages.
International Search Report for Application No. PCT/US2019/038520 dated Aug. 14, 2019.
International Search Report and Written Opinion in PCT/US2019/053123 dated Jan. 7, 2020.
International Search Report for Application No. PCT/US2019/065365 dated Mar. 19, 2020.
International Search Report for Application No. PCT/US2020/039996 dated Oct. 8, 2020.
Office Action in Indian Application No. 201717013356 dated Jan. 22, 2021.
Office Action in European Application No. 17743108.7 dated Dec. 22, 2020.
International Preliminary Report on Patentability dated Dec. 29, 2020 for International Application No. PCT/US2019/039246 in 8 pages.
International Preliminary Report on Patentability for Application No. PCT/US2019/038520 dated Dec. 29, 2020.
Amazon, “AWS Lambda: Developer Guide”, Jun. 26, 2016 Retrieved from the Internet, URL:http://docs.aws.amazon.com/lambda/latest/dg/lambda-dg.pdf, [retrieved on Aug. 30, 2017], 314 pages.
Bryan Liston, “Ad Hoc Big Data Processing Made Simple with Serverless Map Reduce”, Nov. 4, 2016, Amazon Web Services <https :/laws. amazon .com/bl ogs/compute/ad-hoc-big-data-processi ng-made-si mple-with-serverless-mapred uce >.
Dean et al, “MapReduce: Simplified Data Processing on Large Clusters”, ACM, 2008, pp. 107-113.
Ekanayake et al, “Twister: A Runtime for Iterative MapReduce”, ACM, 2010, pp. 810-818.
Hammoud et al, “Locality-Aware Reduce Task Scheduling for MapReduce”, IEEE, 2011, pp. 570-576.
Kim et al, “MRBench: A Benchmark for Map-Reduce Framework”, IEEE, 2008, pp. 11-18.
Lin, “MR-Apriori: Association Rules Algorithm Based on MapReduce”, IEEE, 2014, pp. 141-144.
Search Query Report from IP.com, performed May 27, 2021.
Yang, The Application of MapReduce in the Cloud Computing:, IEEE, 2011, pp. 154-156.
Office Action in Chinese Application No. 202110268031.5, dated Sep. 3, 2021.
Office Action in Canadian Application No. 2,962,633 dated Jun. 18, 2021.
Office Action in European Application No. 19199402.9 dated Mar. 23, 2021.
Office Action in Canadian Application No. 2,962,631 dated May 31, 2021.
Office Action in Chinese Application No. 2016800207682 dated May 14, 2021.
Office Action in Chinese Application No. 2016800562398 dated Jun. 18, 2021.
Office Action in Chinese Application No. 201680072794X dated Jun. 22, 2021.
Office Action in European Application No. 16823419.3 dated Mar. 12, 2021.
Office Action in Chinese Application No. 201780022789.2 dated Apr. 28, 2021.
Office Action in European Application No. 17776325.7 dated Apr. 12, 2021.
Office Action in Chinese Application No. 2017800451968 dated May 26, 2021.
Office Action in European Application No. 17740533.9 dated May 4, 2021.
International Preliminary Report on Patentability and Written Opinion in PCT/US2019/053123 dated Mar. 23, 2021.
International Preliminary Report on Patentability for Application No. PCT/US2019/065365 dated Jun. 8, 2021.
International Search Report for Application No. PCT/US2020/062060 dated Mar. 5, 2021.
Dornemann et al., “On-Demand Resource Provisioning for BPEL Workflows Using Amazon's Elastic Compute Cloud”, 9th IEEE/ACM International Symposium on Cluster Computing and the Grid, 2009, pp. 140-147.
Ryden et al., “Nebula: Distributed Edge Cloud for Data-Intensive Computing”, IEEE, 2014, pp. 491-492.
Office Action in European Application No. 19199402.9 dated Dec. 3, 2021 in 4 pages.
Office Action in Chinese Application No. 201680020768.2 dated Sep. 24, 2021 in 20 pages.
Decision to refuse a European Patent Application in European Patent Application No. 16716797.2 dated Dec. 20, 2021 in 20 pages.
Office Action in Chinese Application No. 2017800451968 dated Dec. 3, 2021 in 20 pages.
Office Action in Japanese Application No. 2020-572441 dated Dec. 22, 2021 in 8 pages.
International Preliminary Report on Patentability for Application No. PCT/US2020/039996 dated Jan. 6, 2022.
Anonymous: “Amazon Elastic Compute Cloud User Guide for Linux Instances—first 400 pages of 795,” Apr. 8, 2016 (Apr. 8, 2016_, XP055946665, Retrieved from the Internet: URL:https://web.archive.org/web/20160408211543if_/http://docs.aws.amazon.com/AWSEC2/latest/UserGuide/ec2-ug.pdf (retrieved on Jul. 27, 2022] 795 pages.
Anonymous: “Amazon Simple Workflow Service Developer Guide API Version Jan. 25, 2012,” Jun. 11, 2016 (Jun. 11, 2016), XP055946928, Retrieved from the Internet: URL:https://web.archive.org/web/20160111075522if_/http://docs.aws.amazon.com/amazonswf/latest/developerguide/swf-dg.pdf [retrieved on Jul. 28, 2022] in 197 pages.
Anonymous: “AWS Flow Framework for Java,” Apr. 7, 2016 (Apr. 7, 2016), XP055946535, Retrieved from the Internet: URL:https://web.archive.org/web/20160407214715if_/http://docs.aws.amazon.com/amazonswf/latest/awsflowguide/swf-aflow.pdf, [retrieved Jul. 27, 2022] in 139 pages.
Abebe et al., “EC-Store: Bridging the Gap Between Storage and Latency in Distribute Erasure Coded Systems”, IEEE 38th International Conference on Distributed Computing Systems, 2018, pp. 255-266.
Huang et al., “Erasure Coding in Windows Azure Storege”, USENIX, 2012 in 12 pages.
Rashmi et al., “EC-Cache: Load-Balance, Low-Latency Cluster Caching with Online Erasure Coding”, USENIX, 2016, pp. 401-417.
Office Action/Oral Summuns in European Application No. 17776325.7 dated Dec. 15, 2022.
Office Action in European Application No. 17740533.9 dated Jan. 16, 2023.
International Preliminary Report on Patentability for Application No. PCT/US2020/062060 dated Jun. 9, 2022 in 9 pages.