Generating data streams from pre-existing data sets

Description

BACKGROUND

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 to provide services to third parties. The computing systems can be located in a single geographic location or located in multiple, distinct geographic locations (e.g., interconnected via private or public communication networks). Specifically, data centers or data processing centers, herein generally referred to as a “data center,” may include a number of interconnected computing systems to provide computing resources to users of the data center. The data centers may be private data centers operated on behalf of an organization or public data centers operated on behalf, or for the benefit of, the general public.

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

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

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram depicting an illustrative environment in which a task generation system can interact with data sources and an on-demand code execution environment to generate a stream of requests to the on-demand code execution environment based on data within the data source;

FIG. 2 depicts a general architecture of a computing device providing the task generation system;

FIG. 3 is a flow diagram depicting illustrative interactions for utilizing data within a data source to generate requests to an on-demand code execution environment;

FIG. 4 is a flow diagram depicting illustrative interactions for processing data within a data source according to a demarcation time;

FIGS. 5A and 5B depict flow charts showing illustrative routines for utilizing data within a data store to generate a stream of task calls to an on-demand code execution environment;

FIG. 6 depicts a flow chart showing an illustrative routine for utilizing a data source to concurrently process both new and backlogged data items, defined according to a demarcation point; and

FIG. 7 depicts a flow chart showing an illustrative routine for ordering task calls to an on-demand code execution environment based on dependency criteria for data items within a data source.

DETAILED DESCRIPTION

Generally described, aspects of the present disclosure relate to utilizing a set of data items within a data store to generate and submit task executions to an on-demand code execution environment. As described in detail herein, an on-demand code execution environment may provide a network-accessible service enabling users to submit or designate computer-executable code to be executed by virtual machine instances of the on-demand code execution environment. Each set of code on the on-demand code execution environment may define a “task,” and implement specific functionality corresponding to that task when executed on the on-demand code execution environment. Individual implementations of the task on the on-demand code execution environment may be referred to as an “execution” of the task. Generally, the on-demand code execution environment may operate by executing tasks in response to user-specified events, which may also be referred to as “triggering” events, such as transmission of an application programming interface (“API”) call or a specially formatted hypertext transport protocol (“HTTP”) packet. Such execution can enable users to utilize the on-demand code execution environment to execute any specified executable code, without requiring configuration or maintenance of the underlying hardware or infrastructure on which the code is executed. Often, triggering events correspond to changes in data at a remote data store, such as the uploading of a new document or photograph, or posting of a news item. This triggering event results in execution of code at the on-demand code execution environment to process the recently changed data (e.g., by transforming the data according to the specifications of the user). Thus, the on-demand code execution environment provides a mechanism for executing tasks based on “streams” of data, where incremental changes to a data source occur over time. However, in some instances, users may also wish to utilize the on-demand code execution environment to process existing data, such as historical records of documents or photographs previously submitted to a data store. Where this existing data is relatively small, the user may simply submit each item of data to the on-demand code execution environment for processing via a defined task. However, in the case where existing data is large (e.g., where a large number of past documents, photographs, or news items exist within a database), it may be impossible or impractical to simultaneously execute tasks to process all data items from an existing data set (e.g., due to constrains in speed of communication between the data store and the on-demand execution environment or due to limitations in computing power in either the data store or the on-demand code execution environment). Problems associated with processing of large existing data sets may be particularly prevalent with respect to new users of such systems, as such users may be required to migrate data sets previously organized or processed according to other systems. These problems may therefore inhibit adoption of an on-demand code execution environment by users. Embodiments of the present disclosure address this issue by providing a request generating system that enables data items from an existing data set to be submitted for processing on the on-demand code execution environment over time. Illustratively, the task generation system can utilize data items from an existing data set to generate a “stream” of calls to the on-demand code execution environment, effectively transforming a generally static set of existing data into a format similar to the dynamic data sets typically processed by the on-demand code execution environment.

In some instances, data items within an existing data set may be static and uniquely identified. Thus, the task generation system disclosed herein may iteratively retrieve data items from a data source (e.g., a network-accessible data store), generate task calls to the on-demand code execution environment to process the data items, and confirm that called tasks have executed successfully, until all data items have been processed at the on-demand code execution environment. However, in other instances, data items within an existing data set may not be entirely static, or may not be uniquely identified. The task generation system disclosed herein may therefore operate to ensure that each data item within an existing data set is processed at least once, and to detect and appropriately handle data items that are changed within a data source during processing of the data set at the on-demand code execution environment.

To ensure that each data item within an existing data set is processed at least once, the task generation system disclosed herein may generate or obtain a unique identifier for each data item, and utilize that unique identifier to track the status of a task on the on-demand code execution environment with respect to that data item. Illustratively, the task generation system may maintain a listing of data items that have not yet been submitted for processing to the on-demand code execution environment, a listing of data items that have been submitted for processing at the on-demand code execution environment but not yet processed, and a listing of data items that have been processed at the on-demand code execution environment. When a data item is read from a data source, the task generation system may compare a unique identifier for the data item against the above-noted listings of data items, to ensure that the data item has not already been or is not already being processed. The task generation system can then continue to query the data source for data items until all data items have been read and verified as processed or in-process at the task generation system. Further, the task generation system can interact with the on-demand code execution environment to ensure that processing for individual data items is successful, and if it is not successful, to either resubmit the individual data item for processing at the on-demand code execution environment or to record the data item as unable to be processed successfully. Thus, the task generation system can operate to ensure that each data item within a data source is processed (either successfully or unsuccessfully) at the on-demand code execution environment.

Where a unique identifier for each data item within a data set (e.g., a database key) is unavailable, the task generation system may function to generate a unique identifier for the data item. Illustratively, the task generation system may pass all or a portion of the data corresponding to a data item through a hash function (examples of which are known in the art) to transform the data into a hash value, and may thereafter utilize the hash value as a unique identifier for the data item. In another embodiment, the task generation system may utilize a combination of attributes from a data item, such as a combination of last edited time and the first 128 bytes of the data item, as a unique identifier for the data item. As noted above, this unique identifier can then be utilized throughout the task generation system to track whether the data item has been processed at the on-demand code execution environment. As used herein, the term “unique” is used with respect to identifiers to indicate an acceptable statistical likelihood that the identifier uniquely identifies the data item, and not necessarily to indicate that an absolute uniqueness of the identifier. For example, the task generation system may utilize a hash function to transform data from a data item into a hash value, and utilize that hash value as a unique identifier, despite the fact that a collision of two hash values is possible but statistically unlikely. The “uniqueness” of an identifier required for its use by the task generation system may be varied according to the requirements of the system. For example, more unique identifiers may be more computationally difficult to calculate, but provide a greater likelihood that no overlap between identifiers occurs. Conversely, less unique identifiers may require less computing power to generate, but increase the likelihood of an overlap in identifiers (which may result, for example, in data items not being processed by the on-demand code execution environment).

While data items within a data set may generally be static, in some instances one or more data items may be modified after initially being read by the task generation system. The task generation system may therefore by configured to detect modified data items, and to handle such modifications in a manner prescribed by an administrator of the task generation system or by a user who has requested that a set of data items be processed at the on-demand code execution environment. Modified data items may be detected in a number of ways, including detecting a change to a specific attribute of the data item (e.g., a “time modified” attribute), or a change to the underlying data within a data item (e.g., as represented by a hash value generated by passing the underlying data through a hash function). In some instances, modified data items may be treated by the task generation system as a new data item, and may be used to generate a new call to a task at the on-demand code execution environment. Additionally or alternatively, modified data items may be reported to a user of the task generation system. In yet other instances, modified data items may be used to generate a call to a different task on the on-demand code execution environment, such as a task corresponding to user-defined executable code that processes the modified data item while overwriting or deprecating the results of any past tasks executed with respect to prior versions of the data item. Accordingly, the task generation system may be configured to transform an existing set of data items into a “stream” of calls to an on-demand code execution environment, even when some data items from the set are modified during that transformation.

In some instances, a user may wish to both process existing data items within a data source and to continue to process data items in the data source as they are added (thus creating a “stream” of input from the data source). However, it may be undesirable to process all items in the data store sequentially, such that newly added data items are processed only after processing for all existing data items has completed. This may be especially undesirable with respect to data stores holding thousands or millions of pre-existing items, such that processing all pre-existing items would take a relatively long period of time (e.g., hours, days, weeks, etc.). Accordingly, the present disclosure may enable a data source to simultaneously be viewed as both a “backlog” of pre-existing data items, as well as a stream of “new” data items. Further, embodiments of the present disclosure may process both “new” and “backlogged” data items simultaneously, enabling real-time (or substantially real-time) processing of new data items while still enabling backlogged data items to eventually be processed.

To enable simultaneous processing of both new and backlogged data items, embodiments of the present disclosure may establish a demarcation point, which establishes one or more criteria designating some data items within a data source as “backlogged” and others as “new.” The demarcation point may be a point in time, such that data items created or modified prior to the point in time are considered backlogged, while data items created or modified after (or potentially at) the point in time are considered new. In some instances, the task generation system may establish a demarcation point based on when processing of a data source begins (e.g., such that any data item created or modified after processing has begun would be considered a new data item). However, in other instances, it may be desirable to consider at least some pre-existing data items within a data source as “new” for the purposes of processing a data source. Illustratively, if the on-demand task execution environment is able to process data items at a higher rate than data items are added to the data source, designating some pre-existing data items as “new” may not significantly affect the ability of the environment to rapidly process later-added data items. Further, where such pre-existing data items were recently added to the data source, it may be desirable to process those data items rapidly, because users may be more likely to execute newly introduced functionality (e.g., corresponding to tasks executed on the on-demand code execution environment) with respect to recently submitted items than with respect to older data items. Accordingly, embodiments of the present disclosure may establish a demarcation time to include at least some pre-existing data items within a data source. Illustratively, the demarcation time may be established such that processing of “new” data items (e.g., on or after the demarcation time) “catches up” to creation of data items on the data source within a threshold period after processing begins (e.g., such that after “catching up,” newly added or modified data items may be processed immediately). This threshold period may be established, for example, by an operator of the task generation system, or within one or more processing criteria submitted by a user. For example, a user may request that a demarcation time be established such that processing of data items after the demarcation time “catches up” to newly added or modified data items within a relatively short period, such as five to ten minutes. Illustratively, the task generation system may retrieve historical information from a data source to determine an estimate rate that data items are created or modified within the data source, and utilize that estimated rate to determine how quickly the task processing system may catch up to newly added data items, and thus, how long in the past the demarcation time can be set.

In some embodiments, the task generation system may process “new” data items (e.g., after a demarcation point) in a different manner than “backlogged” data items. For example, “new” data items may be processed immediately, while “backlogged” data items may be processed at a slower rate, or at a rate that varies based on the processing rate for “new” data items. In some instances, the speed at which “backlogged” data items are processed may vary based on the state of a data source, the task generation system, or the on-demand code execution system (e.g., to utilize excess capacity within these systems, or ensure that the rate of data item retrieval, submission, or processing in those systems does not exceed a threshold value). For example, the task generation system may vary a speed at which “backlogged” data items are processed according to a rate at which new tasks occur at the on-demand code execution environment, regardless of whether the tasks are galled by the task generation system or due to some other cause. As a further example, “new” data items may be processed in chronological order, while “backlogged” data items may be processed according to an alternative ordering (e.g., reverse chronological order). Processing for “new” data items and “backlogged” data items may occur concurrently, such that a data source can be viewed by the task generation system as both a dynamic stream of data items and a static source of backlogged data items.

While examples are provided herein with respect to a single demarcation time, embodiments of the present disclosure may enable the use of multiple demarcation times, such as times dividing data items within a data source into “new,” “backlogged,” and “archived” data items. Some or all of such demarcation times may be specified manually by a user of the task generation system. Additionally or alternatively, some or all of such demarcation times may be automatically determined by the task generation system. For example, as described above, a demarcation time between “new” and “backlogged” data items may be established to cause the task generation system to “catch up” to newly added data items within a threshold period. Similarly, a demarcation time between “backlogged” and “archived” data items may be established such that processing of the “backlogged” data items is expected to occur within a second threshold period (e.g., longer than the threshold for “new” data items). The task generation system may include any number of such demarcation times, dividing a data source into any number of data streams, which may be processed serially, in parallel, or by a combination of serial and parallel processing. Furthermore, in some instances, the task generation system may decline to process one or more sets of data within a data source (e.g., “archived” data items).

Data items may in some instances be processed by the on-demand code execution environment independently or “statelessly,” without depending on the status of the on-demand code execution environment in processing other data items from the data source. However, in other instances, processing of a first data item within a data source may be dependent on processing a second data item. For example, where the on-demand code execution environment is utilized to generate collage images from larger images within the data source, a first task that generates a collage from thumbnail images may be dependent on a number of prior tasks resizing large images into thumbnail size. Moreover, processing of a given set of data items may be dependent on common information, such that the processing occurs more efficiently when conducted concurrently (e.g., on a common machine). For example, where a batch of data items is encrypted with a common encryption key, it may be more efficient to process each data item in the batch on a single virtual machine instance than it would be to divide processing of the batch among many virtual machine instances. Accordingly, aspects of the present disclosure can enable data items to be submitted to an on-demand code execution environment in an ordering determined based on dependency information. For example, where processing of a first data item is dependent on processing of a second data item, the first data item may be submitted to the on-demand code execution environment only after successful processing of the second data item, even if the first data item is retrieved from a data source prior to the second data item. As a further example, where a shared dependency exists to process multiple data items (e.g., a shared dependency on an encryption key or other information), the multiple data items may be submitted to the on-demand task execution environment as a batch, such that execution of the data items occurs efficiently.

The execution of tasks on the on-demand code execution environment will now be discussed. Specifically, to execute tasks, the on-demand code execution environment described herein may maintain a pool of pre-initialized virtual machine instances that are ready for use as soon as a user request is received. Due to the pre-initialized nature of these virtual machines, delay (sometimes referred to as latency) associated with executing the user code (e.g., instance and language runtime startup time) can be significantly reduced, often to sub-100 millisecond levels. Illustratively, the on-demand code execution environment may maintain a pool of virtual machine instances on one or more physical computing devices, where each virtual machine instance has one or more software components (e.g., operating systems, language runtimes, libraries, etc.) loaded thereon. When the on-demand code execution environment receives a request to execute the program code of a user, which specifies one or more computing constraints for executing the program code of the user, the on-demand code execution environment may select a virtual machine instance for executing the program code of the user based on the one or more computing constraints specified by the request and cause the program code of the user to be executed on the selected virtual machine instance. The program codes can be executed in isolated containers that are created on the virtual machine instances. Since the virtual machine instances in the pool have already been booted and loaded with particular operating systems and language runtimes by the time the requests are received, the delay associated with finding compute capacity that can handle the requests (e.g., by executing the user code in one or more containers created on the virtual machine instances) is significantly reduced.

The on-demand code execution environment may include a virtual machine instance 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 virtual machine instance 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 virtual machine instance manager receives user-initiated requests to execute code, and identify a pre-configured virtual machine instance to execute the code based on configuration information associated with the request. The virtual machine instance 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. Various embodiments for implementing a virtual machine instance manager and executing user code on virtual machine instances is described in more detail in U.S. patent application Ser. No. 14/502,648, entitled “PROGRAMMATIC EVENT DETECTION AND MESSAGE GENERATION FOR REQUESTS TO EXECUTE PROGRAM CODE” and filed Sep. 30, 2014 (“the '648 Application), 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 emulates 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.

As will be appreciated by one skilled in the art, the embodiments described herein function to improve the functioning of computing devices by enabling existing data sets to be processed within an on-demand code execution environment. Thus, the embodiments described herein expand the benefits of such an on-demand code execution environment (e.g., scalability, flexibility, efficiency, etc.) to existing data sets. Moreover, embodiments of the present application address challenges that occur when attempting to process existing data sets, and particularly large existing data sets, within an on-demand code execution environment, including limitations on the speed at which data items can be read from the data set or processed at the on-demand code execution environment and the potential that data items within the data set are not associated with unique identifiers or are subject to change during processing. Thus, the embodiments described herein solve technical problems related to the limited speed at which computing devices can communicate and process large data sets. The embodiments described herein solve such technical problems by use of a technical solution, namely, the use of a task generation system that may transform data items from a data set into a corresponding “stream” of calls to an on-demand code execution environment, while maintaining information enabling the task generation system to ensure that each data item from the data set is processed at the on-demand code execution environment. Thus, one skilled in the art will appreciate by virtue of the present disclosure that the embodiments described herein represent a substantial contribution to the technical field of data processing and to computing devices in general.

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

FIG. 1 is a block diagram of an illustrative operating environment 100 in which a task generation system 170 may operate to read data items from a set of data items stored at a data source 160, and to submit corresponding calls to an on-demand code execution environment 110 to execute tasks based on those data items. Criteria for operation of the task generation system 170, including identification of the data source 160, data items within the data source 160, and tasks to execute at the on-demand code execution environment based on the data items, may be provided by a user utilizing a user computing device 102. By way of illustration, various example user computing devices 102 are shown in communication with the on-demand code execution environment 110, including a desktop computer, laptop, and a mobile phone. In general, the user computing devices 102 can be any computing device such as a desktop, laptop 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 task generation system 170 may provide the user computing devices 102 with one or more user interfaces, command-line interfaces (CLI), application programming interfaces (API), and/or other programmatic interfaces for interacting with the task generation system 170 to specify one or more processing criteria for operation of the task generation system 170 and receive results of such operation. Further, the on-demand code execution environment 110 may provide the user computing devices 102 with one or more user interfaces, command-line interfaces (CLI), application programming interfaces (API), and/or other programmatic interfaces for generating and uploading user-executable code, invoking the user-provided code (e.g., submitting a request to execute the user codes on the on-demand code execution environment 110), 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 codes. Although one or more embodiments may be described herein as using a user interface, it should be appreciated that such embodiments may, additionally or alternatively, use any CLIs, APIs, or other programmatic interfaces.

The data sources 160 can correspond to network-connected computing devices, such as servers, which generate data accessible to the one-demand code execution environment 110, the task generation system 170, or both. For example, the data sources 160 can include web services (e.g., associated with the user computing devices 102, with the on-demand code execution environment 110, or with third parties), databases, really simple syndication (“RSS”) services or readers, social networking sites, or any other source of network-accessible service or data source. In some instances, data sources 160 actively transmit information, such as API calls or other task-triggering information, to the on-demand code execution environment 110 as that information is entered to the data source 160. In other instances, data sources 160 may be passive, such that data is made available for access by the on-demand code execution environment 110 as it is entered into the data source 160. As described below, components of the on-demand code execution environment 110 may periodically poll such passive data sources, and trigger execution of tasks within the on-demand code execution environment 110 based on the data provided. Further, an in accordance with embodiments of the present disclosure, the data sources 160 may include pre-existing data sets that are too large to simultaneously submit to the on-demand code execution environment for processing, and thus may be processed at the task generation system 170. While depicted in FIG. 1 as distinct from the user computing devices 102, the on-demand code execution environment 110, and the task generation system 170, in some embodiments, various data sources 160 may be implemented by the respective user computing devices 102, task generation system, or on-demand code execution environment 110.

The various elements of FIG. 1, including the user computing devices 102, data sources 160, task generation system 170, and -demand code execution environment 110, may communicate 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.

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

Further, the on-demand code execution environment 110 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 the example of FIG. 1, the on-demand code execution environment 110 is illustrated as connected to the network 104. In some embodiments, any of the components within the on-demand code execution environment 110 can communicate with other components of the on-demand code execution environment 110 via the network 104. In other embodiments, not all components of the on-demand code execution environment 110 are capable of communicating with other components of the virtual environment 100. In one example, only the frontend 120 may be connected to the network 104, and other components of the on-demand code execution environment 110 may communicate with other components of the virtual environment 100 via the frontend 120.

In FIG. 1, users, by way of user computing devices 102, may interact with the on-demand code execution environment 110 to provide executable code, and establish rules or logic defining when and how such code should be executed on the on-demand code execution environment 110. For example, a user may wish to run a piece of code in connection with a web or mobile application that the user has developed. One way of running the code would be to acquire virtual machine instances from service providers who provide infrastructure as a service, configure the virtual machine instances to suit the user's needs, and use the configured virtual machine instances to run the code. In order to avoid the complexity of this process, the user may alternatively provide the code to the on-demand code execution environment 110, and request that the on-demand code execution environment 110 execute the code using one or more pre-established virtual machine instances. The on-demand code execution environment 110 can handle the acquisition and configuration of compute capacity (e.g., containers, instances, etc., which are described in greater detail below) based on the code execution request, and execute the code using the compute capacity. The on-demand code execution environment 110 may automatically scale up and down based on the volume, thereby relieving the user from the burden of having to worry about over-utilization (e.g., acquiring too little computing resources and suffering performance issues) or under-utilization (e.g., acquiring more computing resources than necessary to run the codes, and thus overpaying).

To enable interaction with the on-demand code execution environment 110, the environment 110 includes a frontend 120, which enables interaction with the on-demand code execution environment 110. In an illustrative embodiment, the frontend 120 serves as a “front door” to the other services provided by the on-demand code execution environment 110, enabling users (via user computing devices 102) to provide, request execution of, and view results of computer executable code. The frontend 120 can include a variety of components to enable interaction between the on-demand code execution environment 110 and other computing devices. For example, while not shown in FIG. 1, the frontend 120 can include a request interface, a job queue, a distribution manager, a polling interface, and an output interface. The request interface may provide user computing devices 102 with the ability to upload or otherwise communication user-specified code to the on-demand code execution environment 110, and to thereafter request execution of that code. In one embodiment, the request interfaces communicates with external computing devices (e.g., user computing devices 102, auxiliary services 106, etc.) via a graphical user interface (GUI), CLI, or API. The frontend 120 processes the requests and makes sure that the requests are properly authorized. For example, the frontend 120 may determine whether the user associated with the request is authorized to access the user code specified in the request.

The user code as used herein may refer to any program code (e.g., a program, routine, subroutine, thread, etc.) written in a specific program language. In the present disclosure, the terms “code,” “user code,” and “program code,” may be used interchangeably. Such user code may be executed to achieve a specific 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 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 environment 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 environment 110) prior to the request being received by the on-demand code execution environment 110. The on-demand code execution environment 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.

The request interface 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.

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

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

To manage requests for code execution, the frontend can further include an execution queue, which can maintain a record of user-requested task executions. Illustratively, the number of simultaneous task executions by the on-demand code execution environment 110 is limited, and as such, new task executions initiated at the on-demand code execution environment 110 (e.g., via an API call) 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 environment 110 may include multiple execution queues, such as individual execution queues for each user account. For example, users of the on-demand code execution environment 110 may desire to limit the rate of task executions on the on-demand code execution environment 110 (e.g., for cost reasons). Thus, the on-demand code execution environment 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 environment 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 environment 110 may execute tasks immediately or substantially immediately after receiving a call for that task, and thus, the execution queue may be omitted.

As noted above, tasks may be triggered for execution at the on-demand code execution environment 110 based on explicit calls from user computing devices 102 (e.g., as received at the request interface 120). Alternatively or additionally, tasks may be triggered for execution at the on-demand code execution environment 110 based on data retrieved from one or more data sources 160. To facilitate interaction with data sources 160, the frontend 120 can include a polling interface, which operates to poll data sources 160 for newly available data. Illustratively, the polling interface may periodically transmit a request to one or more user-specified data sources 160 to retrieve any newly available data (e.g., social network “posts,” news articles, etc.), and to determine whether that data corresponds to a user-established criteria triggering execution a task on the on-demand code execution environment 110. Illustratively, criteria for execution of a task may include, but is not limited to, whether new data is available at the data sources 160, the type or content of the data, or timing information corresponding to the data.

In addition to tasks executed based on explicit user calls and data from data sources 160, the on-demand code execution environment 110 may in some instances operate to trigger execution of tasks independently. For example, the on-demand code execution environment 110 may operate (based on instructions from a user) to trigger execution of a task at each of a number of specified time intervals (e.g., every 10 minutes).

The frontend 120 can further include an output interface configured to output information regarding the execution of tasks on the on-demand code execution environment 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 user computing devices 102, to data sources 160, or to billing or logging services (not shown in FIG. 1). The output interface may further enable transmission of data, such as service calls, to data sources 160. For example, the output interface may be utilized during execution of a task to transmit an API request to a data source 160 (e.g., to store data generated during execution of the task).

To execute tasks, the on-demand code execution environment 110 includes a warming pool manager 130, which “pre-warms” (e.g., initializes) virtual machine instances to enable tasks to be executed quickly, without the delay caused by initialization of the virtual machines. The on-demand code execution environment 110 further includes a worker manager 140, which manages active virtual machine instances (e.g., currently assigned to execute tasks in response to task calls).

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

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

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

The warming pool manager 130 may pre-configure the virtual machine instances in the warming pool 130A, such that each virtual machine instance is configured to satisfy at least one of the operating conditions that may be requested or specified by a user when defining a task. In one embodiment, the operating conditions may include program languages in which the potential user code of a task may be written. For example, such languages may include Java, JavaScript, Python, Ruby, and the like. In some embodiments, the set of languages that the user code of a task may be written in may be limited to a predetermined set (e.g., set of 4 languages, although in some embodiments sets of more or less than four languages are provided) in order to facilitate pre-initialization of the virtual machine instances that can satisfy calls to execute the task. For example, when the user is configuring a task via a user interface provided by the on-demand code execution environment 110, the user interface may prompt the user to specify one of the predetermined operating conditions for executing the task. In another example, the service-level agreement (SLA) for utilizing the services provided by the on-demand code execution environment 110 may specify a set of conditions (e.g., programming languages, computing resources, etc.) that tasks should satisfy, and the on-demand code execution environment 110 may assume that the tasks satisfy the set of conditions in handling the requests. In another example, operating conditions specified by a task may include: the amount of compute power to be used for executing the task; the type of triggering event for a task (e.g., an API call, HTTP packet transmission, detection of a specific data at an auxiliary service 106); the timeout for the task (e.g., threshold time after which an execution of the task may be terminated); and security policies (e.g., may control which instances in the warming pool 130A are usable by which user), among other specified conditions.

The worker manager 140 manages the instances used for servicing incoming calls to execute tasks. In the example illustrated in FIG. 1, the worker manager 140 manages the active pool 140A, which is a group (sometimes referred to as a pool) of virtual machine instances, implemented by one or more physical host computing devices, that are currently assigned to one or more users. Although the virtual machine instances are described here as being assigned to a particular user, in some embodiments, the instances may be assigned to a group of users, such that the instance is tied to the group of users and any member of the group can utilize resources on the instance. For example, the users in the same group may belong to the same security group (e.g., based on their security credentials) such that executing one member's 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 manager 140 may assign the instances and the containers according to one or more policies that dictate which requests can be executed in which containers and which instances can be assigned to which users. An example policy may specify that instances are assigned to collections of users who share the same account (e.g., account for accessing the services provided by the on-demand code execution environment 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.

As shown in FIG. 1, instances may have operating systems (OS), language runtimes, and containers. The containers may have individual copies of the OS, the runtimes, and user codes corresponding to various tasks loaded thereon. In the example of FIG. 1, the active pool 140A managed by the worker manager 140 includes the instances 156, 158. The instance 156 has an OS 156A, runtimes 156B, 156C, and containers 156D, 156E. The container 156D includes a copy of the OS 156A, a copy of the runtime 156B, and a copy of a code 156D-1. The container 156E includes a copy of the OS 156A, a copy of the runtime 156C, and a copy of a code 156E-1. The instance 158 has an OS 158A, runtimes 158B, 158C, 158E, 158F, a container 158D, and codes 158G, 158H. The container 158D has a copy of the OS 158A, a copy of the runtime 158B, and a copy of a code 158D-1. As illustrated in FIG. 1, instances may have user codes loaded thereon, and containers within those instances may also have user codes loaded therein. In some embodiments, the worker manager 140 may maintain a list of instances in the active pool 140A. The list of instances may further specify the configuration (e.g., OS, runtime, container, etc.) of the instances. In some embodiments, the worker manager 140 may have access to a list of instances in the warming pool 130A (e.g., including the number and type of instances). In other embodiments, the worker manager 140 requests compute capacity from the warming pool manager 130 without having knowledge of the virtual machine instances in the warming pool 130A.

In the example illustrated in FIG. 1, tasks are executed in isolated on-demand code execution environments referred to as containers (e.g., containers 156D, 156E, 158D). Containers are logical units created within a virtual machine instance using the resources available on that instance. For example, the worker manager 140 may, based on information specified in a call to execute a task, create a new container or locate an existing container in one of the instances in the active pool 140A and assigns the container to the call to handle the execution of the task. In one embodiment, such containers are implemented as Linux containers.

Once a triggering event to execute a task has been successfully processed by the frontend 120, the worker manager 140 finds capacity to execute a task on the on-demand code execution environment 110. For example, if there exists a particular virtual machine instance in the active pool 140A that has a container with the user code of the task already loaded therein (e.g., code 156D-1 shown in the container 156D), the worker manager 140 may assign the container to the task and cause the task to be executed in the container. Alternatively, if the user code of the task is available in the local cache of one of the virtual machine instances (e.g., codes 158G, 158H, which are stored on the instance 158 but do not belong to any individual containers), the worker manager 140 may create a new container on such an instance, assign the container to the task, and cause the user code of the task to be loaded and executed in the container.

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

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

In some embodiments, the on-demand code execution environment 110 is adapted to begin execution of a task shortly after it is received (e.g., by the frontend 120). A time period can be determined as the difference in time between initiating execution of the task (e.g., in a container on a virtual machine instance associated with the user) and detecting an event that triggers execution of the task (e.g., a call received by the frontend 120). The on-demand code execution environment 110 is adapted to begin execution of a task within a time period that is less than a predetermined duration. In one embodiment, the predetermined duration is 500 ms. In another embodiment, the predetermined duration is 300 ms. In another embodiment, the predetermined duration is 100 ms. In another embodiment, the predetermined duration is 50 ms. In another embodiment, the predetermined duration is 10 ms. In another embodiment, the predetermined duration may be any value chosen from the range of 10 ms to 500 ms. In some embodiments, the on-demand code execution environment 110 is adapted to begin execution of a task within a time period that is less than a predetermined duration if one or more conditions are satisfied. For example, the one or more conditions may include any one of: (1) the user code of the task is loaded on a container in the active pool 140 at the time the request is received; (2) the user code of the task is stored in the code cache of an instance in the active pool 140 at the time the call to the task is received; (3) the active pool 140A contains an instance assigned to the user associated with the call at the time the call is received; or (4) the warming pool 130A has capacity to handle the task at the time the event triggering execution of the task is detected.

Once the worker manager 140 locates one of the virtual machine instances in the warming pool 130A that can be used to execute a task, the warming pool manager 130 or the worker manger 140 takes the instance out of the warming pool 130A and assigns it to the user associated with the request. The assigned virtual machine instance is taken out of the warming pool 130A and placed in the active pool 140A. In some embodiments, once the virtual machine instance has been assigned to a particular user, the same virtual machine instance cannot be used to execute tasks of any other user. This provides security benefits to users by preventing possible co-mingling of user resources. Alternatively, in some embodiments, multiple containers belonging to different users (or assigned to requests associated with different users) may co-exist on a single virtual machine instance. Such an approach may improve utilization of the available compute capacity.

In some embodiments, the on-demand code execution environment 110 may maintain a separate cache in which code of tasks are stored to serve as an intermediate level of caching system between the local cache of the virtual machine instances and a web-based network storage (e.g., not shown in FIG. 1). The various scenarios that the worker manager 140 may encounter in servicing the call are described in greater detail within the '648 application, incorporated by reference above (e.g., at FIG. 4 of the '648 application).

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

In some embodiments, the on-demand code execution environment 110 may provide data to one or more of the auxiliary services (not shown in FIG. 1) as it executes tasks in response to triggering events. For example, the frontend 120 may communicate with monitoring/logging/billing services. The monitoring/logging/billing services may include: a monitoring service for managing monitoring information received from the on-demand code execution environment 110, such as statuses of containers and instances on the on-demand code execution environment 110; a logging service for managing logging information received from the on-demand code execution environment 110, such as activities performed by containers and instances on the on-demand code execution environment 110; and a billing service for generating billing information associated with executing user code on the on-demand code execution environment 110 (e.g., based on the monitoring information and/or the logging information managed by the monitoring service and the logging service). In addition to the system-level activities that may be performed by the monitoring/logging/billing services (e.g., on behalf of the on-demand code execution environment 110), the monitoring/logging/billing services may provide application-level services on behalf of the tasks executed on the on-demand code execution environment 110. For example, the monitoring/logging/billing services may monitor and/or log various inputs, outputs, or other data and parameters on behalf of the tasks being executed on the on-demand code execution environment 110.

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

The worker manager 140 may include an instance allocation unit for finding compute capacity (e.g., containers) to service incoming code execution requests and a user code execution unit for facilitating the execution of user codes on those containers. An example configuration of the worker manager 140 is described in greater detail within the '648 application, incorporated by reference above (e.g., within FIG. 2 of the '648 application). Illustratively, the instance allocation unit may interact with a dynamically allocated network storage service (not shown in FIG. 1) to increase the amount of data storage available to virtual machine instances.

In the depicted example, virtual machine instances (“instances”) 152, 154 are shown in a warming pool 130A managed by the warming pool manager 130, and instances 156, 158 are shown in an active pool 140A managed by the worker manager 140. The illustration of the various components within the on-demand code execution environment 110 is logical in nature and one or more of the components can be implemented by a single computing device or multiple computing devices. For example, the instances 152, 154, 156, 158 can be implemented on one or more physical computing devices in different various geographic regions. Similarly, each of the frontend 120, the warming pool manager 130, and the worker manager 140 can be implemented across multiple physical computing devices. Alternatively, one or more of the frontend 120, the warming pool manager 130, and the worker manager 140 can be implemented on a single physical computing device. In some embodiments, the on-demand code execution environment 110 may comprise multiple frontends, multiple warming pool managers, and/or multiple worker managers. Although four virtual machine instances are shown in the example of FIG. 1, the embodiments described herein are not limited as such, and one skilled in the art will appreciate that the on-demand code execution environment 110 may comprise any number of virtual machine instances implemented using any number of physical computing devices. Similarly, although a single warming pool and a single active pool are shown in the example of FIG. 1, the embodiments described herein are not limited as such, and one skilled in the art will appreciate that the on-demand code execution environment 110 may comprise any number of warming pools and active pools.

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

In accordance with embodiments of the present disclosure, operating environment 100 of FIG. 1 further includes a task generation system 170 configured to utilize a pre-existing set of data items within one or more data sources 160 to generate a stream of task execution calls to the on-demand code execution environment. As shown in FIG. 1, the task generation system 170 includes a user interface 171, a data inspector 172, a call generator 174, an in-process cache 176, and a results cache 178, each of which is described in more detail below. The illustration of the various components within the task generation system 170 is logical in nature and one or more of the components can be implemented by a single computing device or multiple computing devices. For example, each of the user interface 171, data inspector 172, call generator 174, in-process cache 176, and results cache 178 can be implemented on multiple physical computing devices in different various geographic regions, which computing devices may operate collectively to implement a single instance of the respective user interface 171, data inspector 172, call generator 174, in-process cache 176, or results cache 178, or operate independently to implement distinct instances of the user interface 171, data inspector 172, call generator 174, in-process cache 176, or results cache 178. Moreover, while the task generation system 170 is illustratively depicted in FIG. 1 as distinct from the on-demand code execution environment 110, the task generation system 170 may in some instances be integrated with the on-demand code execution environment 110 as a single (potentially distributed) system.

The user interface 171 of the task generation system 170 provides one or more interfaces (e.g., including GUIs, CLIs, APIs, etc.) through which user, using user computing devices 102, may instruct the task generation system 170 to utilize data items within a data source 160 to generate calls to the on-demand code execution environment 110. The user interface 171 can illustratively enable a user computing device 102 to submit one or more processing criteria regarding operation of the task generation system 170, including, for example, one or more data sources 160 from which to access data items, the specific data items (e.g., forming a set of data items) to use to generate corresponding calls to the on-demand code execution environment 110, parameters for accessing the data sources 160 (e.g., speed of access, protocol, credentials, etc.), tasks on the on-demand code execution environment 110 to call based on the data items within the data source 160, parameters for calling for execution of tasks on the on-demand code execution environment 110 (e.g., frequency of task call, mechanism for making task calls, credentials, etc.), processes for handling modifications to data items or errors that occur during processing, and processes for reporting results of the processing.

After receiving a request from a user computing device 102 to generate calls to the on-demand code execution environment 120 based on data items within a data source 160, the task generation system 170 can utilize a data inspector 172 to access data items within the data source 160, ensure that the data items have not previously been processed by the task generation system 170, and enqueue the data item for use in generating a task call to the on-demand code execution environment. Illustratively, data items may be enqueued within the in-process cache 176, which may maintain a listing of data items read by the data inspector 172 but for which a corresponding task at the on-demand code execution environment 110 has not yet successfully completed.

The task generation system 170 can further utilize a call generator 174, which may read data items from the in-process cache 176, and generate a call to the on-demand code execution environment 110 for each data item from the in-process cache 176. The call generator 174 may further interact with the on-demand code execution environment 110 to determine the results of a call corresponding to a data item, and to record that result in the results cache 178. In some instances, the call generator 174 may be configured to determine when a call to the on-demand code execution environment 110 fails with respect to a data item, and either resubmit the call, return that data item to the in-process cache 176, or record an error in the results cache 178 with respect to the data item.

While the in-process cache 176 and the results cache 178 are shown in FIG. 1 as elements of the task generation system 170, in some instances these caches may be physically distinct from the task generation system 170. For example, where the task generation system 170 has the ability to write data to a data source 160, the in-process cache 176 and/or the results cache 178 may be implemented on the data source 160, and thus omitted from physical inclusion within the task generation system 170.

The various elements of the task generation system 170 may operate serially (e.g., in temporal order according to the description above), or may operate at least partially in parallel. For example, the data inspector 172 (or multiple instances of the data inspector 172) may read data items from a data source 160 continuously, while enqueuing those data items in the in-process cache 176. At the same time, the call generator 174 (or multiple instances of the call generator 176) may operate to dequeue data items from the in-process cache 176 and submit a task call corresponding to the data item to the on-demand code execution environment 110. The data inspector 172 and call generator 174 may continue to operate in this manner until no unread data items are seen at the data source 160, at which point the user interface 171 may report to a user computing device 102 that processing of the data source 160 is complete (e.g., along with results of the processing, as stored in the results cache 178).

FIG. 2 depicts a general architecture of a computing system that may implement the task generation system 170. The general architecture of the task generation system 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 task generation system 170 may include many more (or fewer) elements than those shown in FIG. 2. As illustrated, task generation system 170 includes a processing unit 202, a network interface 204, a computer readable medium drive 206, and an input/output device interface 208, all of which may communicate with one another by way of a communication bus. The network interface 204 may provide connectivity to one or more networks or computing systems. The processing unit 200 may thus receive information and instructions from other computing systems or services via the network 104. The processing unit 200 may also communicate to and from memory 210 and further provide output information for an optional display (not shown) via the input/output device interface 208. The input/output device interface 208 may also accept input from an optional input device (not shown). Additionally, the processing unit 200 may communicate with one or more data stores 220, which may correspond to any persistent or substantially persistent data storage, such as a hard drive (HDD), a solid state drive (SDD), network attached storage (NAS), a tape drive, or any combination thereof. Illustratively, the data stores 220 may be utilized to implement the in-process cache 176 and results cache 178.

The memory 210 may contain computer program instructions (grouped as modules in some embodiments) that the processing unit 202 executes in order to implement one or more aspects of the present disclosure. The memory 210 generally includes RAM, ROM and/or other persistent, auxiliary or non-transitory computer readable media. The memory 210 may store an operating system 214 that provides computer program instructions for use by the processing unit 200 in the general administration and operation of the task generation system 170. The memory 210 may further include computer program instructions and other information for implementing aspects of the present disclosure. For example, in one embodiment, the memory 210 includes data inspector software 186 that corresponds to computer-executable instructions that, when executed by the task generation system 170, implement the functions described above with respect to the data inspector 172, as well as call generator software 218 that, when executed by the task generation system 170, implement the functions described above with respect to the call generator 174. While the data inspector software 216 and call generator software 218 is shown in FIG. 2 as part of the task generation system 170, in other embodiments, all or a portion of the data inspector 172 and the call generator 174 may be implemented by other components of the on-demand code execution environment 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 environment 110 may include several modules or components that operate similarly to the modules and components illustrated as part of the task generation system 170.

While the computing device of FIG. 2 is described as implementing the task generation system 170, the same or a similar computing device may additionally or alternatively be utilized to implement other components of FIG. 1, including components of the on-demand code execution environment 110. For example, such a computing device may be utilized, independently or in conjunction with other components (e.g., data stores) to implement the warming pool manager 130 or worker manager 140 of FIG. 1. The software or computer-executable instructions placed within the memory 180 may be modified to enable execution of the functions described herein with respect to the warming pool manager 130 or worker manager 140.

With reference to FIG. 3, illustrative interactions are depicted for utilizing data within one or more data sources 160 to generate corresponding task calls to the on-demand code execution environment 110. The interactions of FIG. 3 begin at (1), where a user computing device 102 transmits instructions to the task generation system 170 (e.g., via the user interface 171) to generate task calls to the on-demand code execution environment 110 based on data items within a data source 160. As noted above, the user computing device 102 may provide one or more criteria regarding operation of the task generation system 170 that, by way of non-limiting example, may include one or more data sources 160 from which to access data items, the specific data items (e.g., forming a set of data items) to use to generate corresponding calls to the on-demand code execution environment 110, parameters for accessing the data sources 160 (e.g., speed of access, protocol, credentials, etc.), tasks on the on-demand code execution environment 110 to call based on the data items within the data source 160, parameters for calling for execution of tasks on the on-demand code execution environment 110 (e.g., frequency of task call, mechanism for making task calls, credentials, etc.), processes for handling modifications to data items or errors that occur during processing, and processes for reporting results of the processing. While the one or more criteria provided by a user computing device 102 may identify any number of distinct data sources 106 (e.g., logically different collections of data, such as different databases, services, physical servers, etc.), FIG. 3 will be described with respect to processing of data items from a single data source 160.

Thereafter, at (2), the task generation system 170 (e.g., via the data inspector 172) can begin to retrieve the relevant data items from the data source 160 specified by the user computing device 102. While data items may be retrieved from multiple data sources, the interactions of FIG. 3 will be described with respect to a single data source, for simplicity. As noted above, some benefits of the task generation system 170 may be realized primarily when the number of relevant data items within the data source 160 is too large to permit simultaneous task calls for each data item to be made to the on-demand code execution environment 110. Thus, the task generation system 170 may retrieve data items from the data source 160 in sets or batches. Each batch may include one or more data items within the data source 160, identified based on one or more criteria provided by the user computing device 102 (e.g., data items associated with an account on the data source corresponding to the user computing device 102). The specific data items within a batch may vary according to the abilities of the data source 160. For example, where the data source 160 permits access according to attributes of the data items, the task generation system 170 may determine an attribute that designates a subset of all relevant data items, and request that those data items be returned to the task generation system 170. Illustratively, where the user computing device 102 has requested that a task on the on-demand code execution environment 110 be completed for all data items created between Jan. 1, 2000 and Jan. 1, 2015, the task generation system 170 may retrieve data items from the data source according to their month of creation (e.g., with each batch containing data items created during a given month within the relevant time period). As a further illustration, where the user computing device 102 has requested that a task on the on-demand code execution environment 110 be completed for data items with identifiers in a specific range, the task generation system 170 may retrieve data items from the data source according to their identifiers, with each batch including a subset of data items in the specified range of identifiers. In instances where the data source 160 does not permit access according to attributes of the data items, or where those attributes are not known, the task generation system 170 may attempt to retrieve batches of data items according to any criteria available at the data source 160. For example, the task generation system 170 may attempt to retrieve data items according to an ordering imposed by the data source (e.g., data items 1-100, 101-200, etc.), or randomly. In some instances, the task generation system 170 may attempt to control the number of data items, e.g., to reduce the computing resources required at the task generation system 170, the data source 160, or on the network 104. In one embodiment, an expected number of data items within a batch may be specified by the user computing device 102. In another embodiment, an expected number of data items within a batch may be automatically determined by the task generation system 170, such that computing resources required on the task generation system 170, the data source 160, or the network 104 fall under a threshold limit, and such that errors (e.g., due to timeouts of requests) are reduced or minimized. The expected number of data items within a batch may be varied during operation of the task generation system 170 to maintain computing resource usage under a threshold level while minimizing error rates.

Thereafter, at (3), the task generation system 170 (e.g., via the data inspector) verifies that the retrieved data items have not yet been processed or are not in-process at the task generation system 170. Illustratively, the task generation system 170 may compare an identifier of each data item to a set of identifiers within the in-process cache 176 and the results cache 178 to determine whether the data item is currently being or has previously been processed at the task generation system 170. If the data item has not been and is not being processed, the task generation system 170 may, at (4), enqueue the data item into the in-process cache 176 for later use in generating a task call to the on-demand code execution environment 110. Identifiers for data items may be obtained in whole or in part from the data source 160, for example, by retrieving a primary database key assigned to the data item at the data source 160. Additionally or alternatively, identifiers for data items may be generated by the task generation system 170, for example, by combining attributes of the data item or by processing information regarding the data item (or the entirety of the data item) according to a hash function.

Thereafter, at (5), the task generation system 170 (e.g., utilizing the call generator 174) may submit a task call to the on-demand code execution environment 110 for each data item within the in-process cache 176. The parameters of the task call may be specified at least in part by the one or more criteria provided by the user computing device 102. In one embodiment, the user computing device 102 may specify the entirety of the task call. For example, the user computing device 102 may specify a particular HTTP request to make, with a portion of the HTTP request varying based on the data item used to generate the task call. In another embodiment, the user computing device 102 may simply specify a particular task on the on-demand code execution environment 110 to call based on a data item, and further specify that the data item should be passed to the task for processing. In some embodiments, the particular task called in response to a data item may vary based on the data item itself. For example, the user computing device 102 may specify that for data items meeting a first set of criteria, a first task should be called, and that for data items meeting a second set of criteria, a second task should be called. As a further example, the user computing device 102 may vary the task called with respect to a data item based on whether that data item has been modified at the data source 160 since the task generation system 170 began retrieving data items from the data source 160. For example, where a data item is retrieved that shares some attributes with a previously retrieved data item (e.g., a database key), but does not share the same unique identifier (e.g., generated by hashing data of the data item), the user computing device 102 may request that the data item be used to call a distinct task on the on-demand code execution environment, such as a task that processes the new data item while also overwriting or deprecating results of a prior task called based on a prior version of the data item. Thus, the parameters of task calls made based on data items may be customized according to the needs of a user. In some instances, the task generation system 170 may modify an entry for the data item within the in-process cache 176 to indicate that a task call for the data item has been made to the on-demand code execution environment 110, but that the task call has not yet completed. Such modification may be advantageous, for example, where the task generation system 170 utilizes multiple instances of the call generator 174, to avoid different instances of the call generator 174 from submitting redundant task calls to the on-demand code execution environment 110.

At (6), the task generation system may obtain results from task calls made to the on-demand code execution environment 110 with respect to data items. The task generation system 170 can then further process the data items according to the results, at (7). In the instance that the task call completed successfully, the task generation system 170 can remove the data item from the in-process cache 176, and indicate the results of the task call within the results cache 178 (e.g., that the task call completed successfully, outputs of the task call, details regarding execution of tasks at the on-demand code execution environment 110, etc.). In the instance that the task call did not complete successfully, the task generation system 170 may either attempt to resubmit the task call to the on-demand code execution system 110 (e.g., where prior failures were caused by throttling or other temporary conditions at the on-demand code execution environment 110) or record a failure of the task call for the data item in the results cache 178. Where a high (e.g., over a threshold) number of task calls do not complete successfully, the task generation system 170 may in some instances modify the rate at which task calls are submitted in order to reduce or eliminate unsuccessful calls.

Thereafter, interactions (2)-(7), as described above, may be repeated until task calls for all relevant data items within the data source 160 have been completed. In one embodiment, the data source 160 may be configured such that the task generation system 170 can accurately determine when all relevant data items at the data source 160 (e.g., including data items modified since initiation of the interactions) have been processed, and thus, the interactions may end at that point. In another embodiment, the task generation system 170 may continue to retrieve items from the data source 160 until no new data items (e.g., with new unique identifiers) are seen at the task generation system 170. In yet another embodiment, the task generation system 170 may continue to retrieve data items from the data source 160 for a period (e.g., specified in absolute time, number of data items, number of batches, etc.) after no new data items are seen, to ensure that the presence of new data items at the data source 160 is unlikely. Thereafter, results of processing the data source can be returned to the user computing device 102.

While the interactions of FIG. 3 are described sequentially, one or more of the interactions may occur simultaneously. For example, interactions (2)-(4) may be repeatedly performed by the data inspector 172, while interactions (5)-(7) are simultaneously and repeatedly performed by the call generator 174. Moreover, the task generation system 170 may in some embodiments utilize multiple instances of either or both the data inspector 172 or call generator 174, and thus, any of interactions (2)-(7) may be performed multiple times concurrently. Accordingly, any temporal association of the interactions described above should be viewed as illustrative and not limiting with respect to the present disclosure.

In some instances, it may be desirable for different elements within the task generation system 170 to interact to control the speed at which data items are retrieved from the data source 160, tasks are called at the on-demand code execution environment 110, or both. Illustratively, where the data inspector 172 acts to retrieve data items from a data source 160 at a rate considerably higher than the rate at which the call generator 174 makes calls to the on-demand code execution environment 174, the number of data items in the in-process cache 176 may grow beyond a threshold limit. In such instances, the call generator 174 may increase the rate at which task calls are generated, the data inspector 172 may reduce the rate at which data items are retrieved from a data source 160, or both, to maintain a number of data items within the in-process cache 176 below the threshold limit. In addition, maximum rates of retrieval from the data source 160 or rates of task calls to the on-demand code execution environment 110 may be specified by the user computing device 102 as one or more criteria regarding operation of the task generation system 170.

While the interactions of FIG. 3 may involve transmission of data items themselves (e.g., to retrieve the data item from the data source 160, enqueue the data item in the in-process cache 176, submit the data item to the on-demand code execution environment 110, etc.), embodiments of the present disclosure may additionally or alternatively utilize references to data items, in place of the data item itself. For example, rather than retrieving the actual content of a data item from the data source 160, the task generation system 170 may instead retrieve a reference to the data item, along with any information required to implement the functionalities described above (e.g., attributes of the data item). Thereafter, rather than submitting a data item itself to the on-demand code execution environment 110, the task generation system 170 may pass a reference to the data item, such that the on-demand code execution environment 110 can thereafter interact with the data source 160 to retrieve relevant information pertaining to the data item. Similarly, while data items are described above as enqueued or stored within different elements of the task generation system 170 (e.g., the in-process cache 176 and the results cache 178), embodiments of the present disclosure may utilize pointers or other references to the data item (e.g., as stored within the data source 160 or in a general data store of the task generation system 176) to list the data item as logically included within these elements, thus reducing or eliminating a need to actually copy the data item between various elements.

As noted above, in some instances it may be desirable to view data items within a data source as both a “stream” of new data items and as a static (or relatively static) set of pre-existing data items, and to process such sets separately. Illustrative interactions for utilizing a data source to concurrently process such a stream of new data items and set of static data items will be described with reference to FIG. 4. More specifically, illustrative interactions will be described for establishing a demarcation time usable to different “new” data items (e.g., to be processed immediately as a data stream) from “backlogged” data items (e.g., to be processed separately as “static” data). For the purposes of description of FIG. 4, it will be assumed that a user computing device has previously submitted criteria to the task generation system 170 for processing a data source 160 (e.g., an identifier of the data source 160, credentials for accessing the data source 160, a task on the on-demand code execution environment 110 by which to process data items from the data source 160, etc.), and thus, interactions for receiving such criteria will not be re-described with respect to FIG. 4. The interactions of FIG. 4 therefore begin at (1), where the task generation system 170 retrieves time information for data items within the data source 160. Such time information may include, for example, times at which each data item (or a subset of data items) within the data source 160 was added or times at which each data item (or a subset of data items) was modified. Generally, the retrieved time information may include any information usable by the task generation system 170 to determine an estimated frequency of updates to the data source 160, which can then be utilized to establish a demarcation time for the data source 160. Accordingly, especially where the data source 160 holds a large number of data items, the task generation system 160 may retrieve time information for only a subset of recently created or modified data items (e.g., the top n most recently created or modified data items, data items created or modified in the last n minutes, hours, days, etc.). Thereafter, at (2), the task generation system 170 can process the retrieved time information to determine an estimated update frequency for the data source 160. Illustratively, the estimated update frequency may be determined by using time information for previously created or modified data items to extrapolate future times at which data items will be created or modified. For example, where data items have previously been added or modified in the data source 160 at an average of one data item per second, the task generation system may estimate the update frequency as one data item per second. In addition to simply averaging, many statistical techniques for using a series of data to extrapolate future values are known in the art, and may be applied to determine an update frequency from time information of previously stored data items.

Thereafter, at (3), the task generation system establishes a demarcation time for the data source 160. For the purposes of description with respect to FIG. 4, the task generation system 170 can utilize both the retrieved time information and the determined updated frequency to establish a demarcation time, such that submission of tasks to the on-demand code execution environment 110 is expected to “catch up” or synchronize with creation or modification of data items in the data source 160 within a threshold period of time. For example, the task generation system 170 may determine, for any given demarcation time, how many pre-existing data items in the data source 160 were added or modified after the demarcation time. The task generation system 170 may further determine, based on an anticipated rate of task processing at the on-demand code execution environment, when processing of those post-demarcation time data items would be expected to complete. Similarly, the task generation system 170 can determine how many new data items are excepted to be added to the data source 160 during processing of the those post-demarcation time data items, when processing of those new data items is expected to complete, etc., until the task generation system 170 determines an expected time at which new data items added into the data source 160 may be immediately processed (thus “catching up” or synchronizing the task generation system 170 with new modifications or additions at the data source 160). The task generation system 170 can then establish the demarcation time such that this expected synchronization time falls within a threshold value (e.g., five minutes, one hour, etc.). While establishment of a demarcation time based on an expected synchronization time is described with respect to FIG. 3, other embodiments of the task generation system 170 may establish demarcation times in other manners. For example, the task generation system 170 may establish a demarcation time as the time at which instructions were received from a user computing device 102 to process a data source 160.

Thereafter, at (4′) and (4″), the task generation system 170 can retrieve both “new” data items (e.g., data items created or modified on or after the demarcation time) and “backlogged” data items (e.g., data items created or modified prior to the demarcation time) from the data source 170. Similarly, at (5′) and (5″), the task generation system 170 can begin concurrently processing both new and backlogged data items by making calls to the on-demand code execution environment 110 corresponding to the respective new and backlogged data items. Thus, establishment of a demarcation time can enable a task generation system 170 to utilize a given data source 160 as two distinct sets of data.

While not shown in FIG. 4, processing of either or both “new” or “backlogged” data items may occur according to the various embodiments described herein. For example, “new” or “backlogged” data items may be enqueued within the in-process cache 176 prior to a call to the on-demand code execution environment 110, subjected to verification by the task generation system 170 that the items are unprocessed, and enqueued into a results cache 178 after completion of a call (as described, e.g., with respect to FIG. 3, above). Moreover, the task generation system 170 may retrieve or process “new” and “backlogged” data items in different manners. For example, “new” data items may be retrieved and processed substantially immediately, such that calls to the on-demand code execution environment 110 occur as soon as practically possible after detection of the “new” data item. Conversely, “backlogged” data items may be retrieved and processed at a limited rate, to reduce the computing resources required to retrieve and process those data items. In one embodiment, the rate at which “backlogged” data items are retrieved or processed may be based at least partially on the estimated or actual rate at which “new” data items are retrieved and processed (e.g., in an inverse relationship). Further, while “new” data items may be retrieved and processed chronologically (e.g., in the order that they are created or modified on the data source 160), “backlogged” data items may be processed according to other orderings, such as in reverse chronological order. Thus, by dividing data items in a data source 160 according to a demarcation point, distinct sets of data items may be logically created, and each set may be processed independently.

With reference to FIGS. 5A and 5B, flow charts showing an illustrative routine 500 for utilizing data within a data source to generate task calls to an on-demand code execution environment will be described. The routine 500 may be implemented, for example, by the task generation system 170. The routine 500 begins at block 502, where the task generation system 170 obtains one or more criteria for processing a data source in order to generate task calls to the on-demand code execution environment based on relevant data items within the data source. The criteria may be specified by a user utilizing a user computing device, and may include, by way of non-limiting example, one or more data sources 160 from which to access data items, the specific data items (e.g., forming a set of data items) to use to generate corresponding calls to the on-demand code execution environment 110, parameters for accessing the data sources 160 (e.g., speed of access, protocol, credentials, etc.), tasks on the on-demand code execution environment 110 to call based on the data items within the data source 160, parameters for calling for execution of tasks on the on-demand code execution environment 110 (e.g., frequency of task call, mechanism for making task calls, credentials, etc.), processes for handling modifications to data items or errors that occur during processing, and processes for reporting results of the processing.

Thereafter, at block 506, the task generation system 170 begins to retrieve data items from the data source, according to the criteria previously obtained. For the purposes of description, it will be assumed that data items are retrieved in “batches” of one more data items. However, data items may also be retrieved continuously (which may be described as retrieving “batches” of single data items at a constant rate). As discussed above, where the data source 160 enables retrieval of data items according to specific attributes, such as a unique identifier of the data item or a creation time of the data item, the task generation system 170 may specify those attributes to the data source 160, such that data items are retrieved at a preferred rate. The preferred rate may be specified by a user (e.g., as part of the obtained criteria), or may be automatically determined at the task generation system 170 (e.g., based on error rates in communicating with the data source 160, based on computing resources available at the task generation system 170, based on the number of data items included in the in-process data cache 176, etc.). Where the data source 160 does not enable retrieval of data items according to specific attributes, the task generation system 170 may request that n additional data items be provided in each batch, where n is indicated by the preferred rate.

At block 508, the task generation system 170 enqueues any unprocessed data items from within the retrieved set (e.g., data items not previously processed or currently being processed) in the in-process data cache 172. Enqueuing of an individual unprocessed data items is described in more detail with respect to sub-routine 510 of FIG. 5A. Sub-routine 510 begins at block 512, where an identifier for the data item is obtained 512. In one embodiment, the identifier may be obtained from the data source 160, for example, by retrieving a key corresponding to the data item used by the data source 160. Additionally or alternatively, an identifier may be obtained by combining or concatenating attributes of the data item to generate a unique identifier, or by passing the data item (e.g., including attributes of the data item) through a hash function to generate a unique identifier. Thereafter, at block 514, the task generation system 170 determines whether the identifier for the data item is currently being processed or has previously been processed at the task generation system 170. In one embodiment, the task generation system 170 (e.g., via the data inspector 172) may compare the identifier of the data item to a listing of identifiers within the in-process data cache 174 as well as a listing of identifiers in the results cache 176, to determine whether the identifier exists in either cache (and thus has either previously been processed or is in-process). If the result of the evaluation at block 514 is positive, the sub-routine 510 may end at block 518. If the result of the evaluation at block 514 is negative, the sub-routine 510 continues at block 516, where the data item is placed in a queue for generation of a corresponding call to the on-demand code execution environment 110. The queue may be maintained, for example, within the in-process data cache 174. The sub-routine 510 then ends at block 518.

After enqueing unprocessed data items at block 508, the routine 500 continues at block 520, where the task generation system 170 determines whether all relevant data items at the data source 160 have been retrieved by the task generation system 170. In some instances, the data source 160 may be configured such that the task generation system 170 can accurately determine when all relevant data items at the data source 160 (e.g., including data items modified since initiation of the interactions) have been processed, and thus, implementation of block 520 may include querying the data source as to whether any relevant data items have not yet been retrieved (and/or whether a previously retrieved data item has been modified since retrieval). In another embodiment, the task generation system 170 may continue to retrieve items from the data source 160 until no new data items (e.g., with new unique identifiers) are seen at the task generation system 170. Thus, implementation of block 520 may include determining whether any data items retrieved at a previously implementation of block 506 included unprocessed data items. In yet another embodiment, the task generation system 170 may continue to retrieve data items from the data source 160 for a period (e.g., specified in absolute time, number of data items, number of batches, etc.) after no new data items are seen, to ensure that the presence of new data items at the data source 160 is unlikely. Thus, implementation of block 520 may include determining that at least at least the period has elapsed without any new data items being retrieved. In the instance that the result of the evaluation at block 520 is negative, the routine 500 returns to block 506 and proceeds as described above. In the instance that the result of the evaluation at block 520 is positive, the routine 500 proceeds to through connector ‘A’ to blocks 522 through 542, which are shown on FIG. 5B.

As shown in FIG. 5B, the routine 500 continues through connector ‘A’ to block 522, where the task generation system 170 retrieves a batch of one or more data items from the in-process queue. Illustratively, such retrieval may include determining one or more identifiers for data items that are listed in the in-process queue, and modifying the listings for such data items to indicate that a task call to the on-demand code execution environment 110 is “in-flight” for the data item. The routine 500 then continues to block 225, where a task call for each data item retrieved from the in-process queue is generated at the task generation system 170. The process for generating task call for a data item is described in more detail within subroutine 526. Sub-routine 526 begins at block 528, where a call to a task corresponding to the data item is submitted to the on-demand code execution environment 110. Illustratively, the call may include an API call or HTTP packet formatted according to the parameters of the on-demand code execution environment 110 to specify a particular task (e.g., corresponding to a set of user-defined code requested to be executed at the on-demand code execution environment 110), as well as parameters to pass to the task. In one embodiment, the parameters may include the data item itself, or a reference to the data item (e.g., at the data source 160). In another embodiment, the parameters may include data derived from the data item (e.g., a portion of the data item, attributes of the data item, etc.). Because execution of a task can correspond to execution of any of a variety of user-specified code, implementation of block 528 may enable nearly any computer-implemented processing to occur with respect to the data item. For example, where the data item is a photograph, that photograph could be compressed or reformatted for use on a particular platform (e.g., as a ‘thumbnail’ image). As a further example, where the data item is a news posting, the posting could be analyzed for the occurrence of specific words or phrases, and the results of such analysis may be provided to a third party service. Many additional examples may be contemplated by one skilled in the art. After submitting a task call, the sub-routine 526 proceeds to block 530, where the task generation system 170 determines whether the task call should be retried. Illustratively, block 530 may evaluate positively where a task call completed successfully, or completed with an error occurred with respect to the task call that is not temporal in nature. For example, block 530 may evaluate positively where a task call resulted in either completion of the task without error or with an error related to the content of the data item. Conversely, block 530 may evaluate negatively when a task call results in a “time out” error, or an error indicating that task calls are being submitted to the on-demand code execution environment 110 at too high of a rate. In the instance block 530 is evaluated positively, the sub-routine 526 proceeds to block 534, where the task generation system 170 marks the data item used to generate the task call as a candidate for re-processing by retrying the task call. Illustratively, implementation of block 534 may include removing an “in-flight” indicator for the data item within the in-process queue, such that future implementations of block 522 may retrieve the data item from the in-process queue. Implementation of block 534 may further include appending other indicators to the data item within the in-process queue, such as a “delay” indicator indicating that a subsequent task call for the data item should only be generated after an appropriate delay (e.g., specified by an administrator of the task generation system 170, within criteria specified by a user, etc.). In the instance block 530 is evaluated negatively, the sub-routine 526 proceeds to block 532, where the task generation system 170 records the results of the call. Illustratively, the task generation system 170 may record a return indicator of the task call (e.g., that the call resulted in a successful execution of a task), as well as any data regarding execution of the task call (e.g., a result of the execution of the task). In one embodiment, the task generation system 170 may indicate that the task call executed successfully by recording an identifier of the data item used to generate the task call within the results cache 178. After implementation of either block 532 or block 534, the sub-routine 526 ends at block 536.

Returning to the routine 500, after implementation of block 524 (e.g., via implementation of sub-routine 526), the routine 500 continues at block 538, where the task generation system 170 determines whether any further data items exist in the in-process queue. If so, the routine 500 returns to block 522, and repeats until all data items have been utilized to generate task calls to the on-demand code execution environment 110 (e.g., and have resulted either in a successful completion of the task or an error that is not likely to be alleviated by retrying the task call). If no further data items exist in the in-process queue, the routine 500 proceeds to block 540, where results of the routine 500 are returned to the user at the user computing device 102. Illustratively, such results may be an indication that the data items within the data source have been processed, specific results with respect to individual data items (e.g., results of a task call generated for the data item, errors incurred with respect to the data item, etc.), or information pertaining to the overall processing of the data items (e.g., total time taken, number of requests to the on-demand code execution environment 110, etc.). The routine 500 can then end at block 542.

While the routine 500 is described above sequentially, the routine 500 may in some instances be implemented at least partially in parallel, either by an individual computing device or by multiple computing devices. For example, the loop shown with respect to blocks 506 through 520 may be repeated simultaneously with the loop shown with respect to blocks 522 through 538, such that data items continue to be retrieved from a data source while task calls for previously retrieved data items are generated at the task generation system 170. Moreover, multiple instances of the sub-routines 510 and 526 may be implemented concurrently by the same or different computing devices, such that multiple data items may be placed into an in-process queue (with respect to sub-routine 510) and multiple task calls may be generated from data items within that queue (with respect to sub-routine 526) simultaneously or contemporaneously. Moreover, the routine 500 may be altered based on the requirements of the task generation system 170, the on-demand code execution environment 110, or data sources 160. For example, the routine 500 may be modified to include additional blocks that provide for additional exchanges of information between the task generation system 170, the on-demand code execution environment 110, and data sources 160, such as negotiations as to the rate of data transmission. In some embodiments, one or more portions of the routine 500 may be carried out by other systems or devices, including systems or devices within the on-demand code execution environment 110.

With reference to FIG. 6, a flow chart showing an illustrative routine 600 for utilizing a data source to concurrently process both new and backlogged data items, defined according to a demarcation point, will be described. The routine 600 may be implemented, for example, by the task generation system 170. For the purposes of description of FIG. 6, it will be assumed that a user computing device has previously submitted criteria to the task generation system 170 for processing a data source 160 (e.g., an identifier of the data source 160, credentials for accessing the data source 160, a task on the on-demand code execution environment 110 by which to process data items from the data source 160, etc.), and thus, receiving such criteria will not be re-described with respect to FIG. 6. The routine 600 of FIG. 6 therefore begins at block 602, where the task generation system 170 retrieves time information for one or more data items within a data source 160. Generally described, the retrieved time information may include any information usable by the task generation system 170 to determine an estimated frequency of updates to the data source 160, which can then be utilized to establish a demarcation time for the data source 160. Accordingly, the task generation system 160 may retrieve time information for the top n most recently created or modified data items, data items created or modified in the last n minutes, hours, days, etc. Thereafter, at block 604, the task generation system 170 processes the retrieved time information to determine an estimated update frequency for the data source 160. Illustratively, the estimated update frequency may be determined by using time information for previously created or modified data items to extrapolate future times at which data items will be created or modified. For example, where data items have previously been added or modified in the data source 160 at an average of one data item per second, the task generation system may estimate the update frequency as one data item per second. In addition to simply averaging, many statistical techniques for using a series of data to extrapolate future values are known in the art, and may be applied to determine an update frequency from time information of previously stored data items.

At block 606, the task generation system 170 establishes a demarcation time for the data source 160. Illustratively, the demarcation time can be set such that submission of tasks to the on-demand code execution environment 110 is expected to “catch up” or synchronize with creation or modification of data items in the data source 160 within a threshold period of time. For example, the task generation system 170 may determine, for any given demarcation time, how many pre-existing data items in the data source 160 were added or modified after the demarcation time. The task generation system 170 may further determine, based on an anticipated rate of task processing at the on-demand code execution environment, when processing of those post-demarcation time data items would be expected to complete. Similarly, the task generation system 170 can determine how many new data items are excepted to be added to the data source 160 during processing of the those post-demarcation time data items, when processing of those new data items is expected to complete, etc., until the task generation system 170 determines an expected time at which new data items added into the data source 160 may be immediately processed (thus “catching up” or synchronizing the task generation system 170 with new modifications or additions at the data source 160). The task generation system 170 can then establish the demarcation time such that this expected synchronization time falls within a threshold value (e.g., five minutes, one hour, etc.).

Based on the establishment of a demarcation time, the task generation system 170 can thereafter begin to process both “new” data items (e.g., data items created or modified on or after the demarcation time) and “backlogged” data items (e.g., data items created or modified prior to the demarcation time) concurrently. Accordingly, at block 608, the task generation system 170 can begin processing “new” data items as a dynamic data stream. For example, the task generation system 170 can incrementally processes each “new” data item until no more “new” data items exist. Thereafter, the task generation system 170 may periodically monitor the data source 160 for any “new” data items, and process such data items immediately or substantially immediately, thus providing real-time (or substantially real-time) processing of data items as they are added to the data source 160. Concurrently, at block 610, the task generation system 170 can begin processing backlogged data items. Illustratively, processing of backlogged data items may occur according to the routine 500 described with respect to FIGS. 5A and 5B. In some instances, the processing of backlogged data items may occur according to a reverse chronological order (as opposed to the chronological ordering at which new data items are processed). Further, at block 612, the task generation system 612 can modify how backlogged data items are processed, based on activity of the “stream” of new data items. For example, the task generation system 612 can vary a rate at which backlogged data items are processed, based on a rate at which new data items are processed. Illustratively, the processing rate of backlogged data items may be modified such that the total rate of data items processed (e.g., both new and backlogged) satisfies a threshold value. In addition or alternatively to modifying a rate of backlog processing based on processing new data items, the task generation system 170 may in some instances vary the previously established demarcation time to account for variations in the stream of new data items. For example, where data items are added to the data source at a higher than expected rate, the demarcation time may be moved forward in time, such that the “catch up” time remains at or near a threshold value. Conversely, where data items are added to the data source at a lower than expected rate, the demarcation time may be moved backward, such that more data items are included in the “new” data stream.

Thereafter, the routine 600 ends at block 614. Thus, by implementation of the routine 600, the task generation system 170 may be configured to quickly “catch up” to processing new data items, and continue to process new data items substantially immediately, while ensuring that backlogged data items are eventually processed.

While the routine 600 is described above as a single routine 600, the routine 600 may also be executed as a collection of sub-routines or related routines. For example, block 608 may be implemented as a first independent routine, while blocks 610 and 612 are implemented as a second independent routine. While the routine 600 is described as implemented by the task generation system 170, in some embodiments, one or more portions of the routine 600 may be carried out by other systems or devices, including systems or devices within the on-demand code execution environment 110.

As noted above, in some instances it may be desirable to control the ordering in which data items are processed at an on-demand code execution environment, such as in instances where processing of a first data item depends on prior processing of a second data item, or in instances where the processing of multiple data items shares a common dependency (e.g., a decryption key). FIG. 7 includes a flow chart depicting one illustrative routine 700 for submitted data items from a data source to an on-demand code execution environment in an order controlled based on dependency information for the data items. The routine 600 may be implemented, for example, by the task generation system 170.

The routine 700 of FIG. 7 begins at block 702, where the task generation system 170 obtains data source processing and dependency criteria. The data source processing criteria, as further described above, may include one or more items of information such as the identity of a data sources 160 from which to access data items, parameters for accessing the data sources, tasks on the on-demand code execution environment to call for processing of the data items, etc. Dependency criteria may generally include any information identifying dependencies in the processing of data items from the data source. In one embodiment, dependency criteria may identify dependencies between individual data items within the data store, such that a task for processing a first data item is dependent on or successful execution of a task for processing a second data item. In another embodiment, dependency information may indicate a shared dependency of multiple data items on a common piece of information, such that it is desirable (e.g., for efficiency purposes) to process the multiple data items together. In yet another embodiment, the dependency information may include other criteria for the ordering or grouping of tasks to process data items, such as a desired number of data items to process concurrently, a desired time of day to submit data items for processing, etc. The data source processing and dependency criteria may be obtained, for example, from a user or other source identified by the user, via a user interfaces, programmatic interfaces, APIs, CLIs, GUIs, etc.

At block 704, the task generation system 170 retrieves and enqueues unprocessed data items from the data source, as described in more detail in FIG. 5A (e.g., at blocks 506-520). While retrieval and enqueuing of data items is described as a distinct process in FIG. 7 for ease of description, implementation of block 704 may occur iteratively, such that data items are continuously retrieved and enqueued during implementation of the routine 700.

At block 706, the task generation system 170 processes the enqueued data items according to the obtained dependency information, to determine whether criteria for submission of tasks to the on-demand code execution environment has been satisfied at block 708. In one embodiment, submission criteria may establish which enqueued data items are available to be submitted to the on-demand code execution environment for processing. For example, where processing of a first data item depends on processing of a second data item, the task generation system 170 may utilize the dependency information for the first data item to establish submission criteria for the first data item, such that the first data item may be submitted for processing to the on-demand code execution environment only after successful processing of the second data item. In some instances, submission criteria may also require that at least a threshold number of data items are available to be submitted for processing to the on-demand code execution environment. For example, where dependency information indicates that a set of data items are associated with a shared dependency, the task generation system 170 may establish submission criteria such that data items, within the set of data items, are submitted to the on-demand code execution environment for processing only when a threshold number of data items are available to be submitted, or when no more data items will become available (e.g., based on retrieval from the data source, execution of other tasks, etc.). Such a threshold number may be set, for example, based on the number of data items that may be simultaneously processed by a task, or by a common computing device implementing multiple tasks. In some instances, implementation of block 706 may include the task generation system generating an ordering for data items within the cache based on the dependency data, such that data items are submitted according to the ordering as they satisfy the submission criteria. On subsequent implementations of block 706, the task generation system may reorder the initial ordering to account for any changes in the known data items (e.g., successful processing of one or more data items or the addition of new data items into the queue, which causes those or other data items to satisfy the submission criteria).

In the instance that the submission criteria are not satisfied, the routine 700 returns to block 704, where additional data items are retrieved from the data source and enqueued. Alternatively, where the submission criteria are satisfied, the routine 700 continues to block 710, where the task generation system 710 submits one or more tasks to the on-demand code execution environment corresponding to the data items available for submission, as determined in block 708. The call may include an API call or HTTP packet formatted according to the parameters of the on-demand code execution environment to specify a particular task (e.g., corresponding to a set of user-defined code requested to be executed at the on-demand code execution environment), as well as parameters to pass to the task, which may include the data item itself, or a reference to the data item (e.g., at the data source). In some instances, the specific task that is called on the on-demand code execution environment may vary based on the data item or parameters of the data item (e.g., such that data items of a first type are processed via a first task, and data items of a second type are processed according to a second task). Further, the specific task may in some instances vary based on a group of data items known to the task generation system, including both unprocessed and processed data items. For example, a user may provide task criteria to the task generation system may enabling the task generation system to vary a task based on previously processed data items (e.g., such that a first task is used for processing the first n data items, a second task is used for processing the second n data items, etc.) or based on enqueued data items (e.g., such that the task used varies based on the number of data items in the queue, attributes of those data items, etc.). Still further, the specific task may in some instances vary based on the dependencies associated with any given data item. For example, where processing a data item is not dependent on processing any other data item, a first task may be used to process the data item. Where no other data item is dependent on processing a data item, a second task may be used to process the data item. Where processing a data item is dependent on processing other data items, and where other data items depend on processing the data item, a third task may be used to process the data item, etc. As a further example, dependency information may be mapped as a graph, and the shape of the graph may be used to determine tasks to call in processing individual data items (e.g., forming nodes within the graph). Illustratively, a first task could be used to process data items within a broad dependency graph (e.g., wider than it is tall), while a second task could be used to process data items within a tall dependency graph (e.g., taller than it is wide). Additional or alternative factors may be used to modify the tasks on the on-demand code execution environment according to the needs of the task generation system.

At block 712, the task generation system 712 determines whether all data items from the data source have been processed by submission of tasks to the on-demand code execution environment. If all data items have not yet been processed, the routine 700 returns to block 704, where additional unprocessed data items (if any) are retrieved from the data source and enqueued at the task generation system 712 for processing. The routine 700 then continues, as described above, until all data items have been processed (e.g., a task has completed, or in some instances failed to complete, for each data item). The routine 700 then proceeds to block 714, where results of the routine 700 are returned to the user at the user computing device 102. Such results may indicate, for example, that the data items within the data source have been processed, specific results with respect to individual data items (e.g., results of a task call generated for the data item, errors incurred with respect to the data item, etc.), or information pertaining to the overall processing of the data items (e.g., total time taken, number of requests to the on-demand code execution environment 110, etc.). The routine 700 then ends at block 716.

While the routine 600 is described above as a single routine 700, the routine 700 may also be executed as a collection of sub-routines or related routines. For example, block 704 may be implemented as a first independent routine, while blocks 706 and 714 are implemented as a second independent routine. While the routine 700 is described as implemented by the task generation system 170, in some embodiments, one or more portions of the routine 700 may be carried out by other systems or devices, including systems or devices within the on-demand code execution environment 110.

All of the methods and processes described above may be embodied in, and fully automated via, software code modules executed by one or more general purpose 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 of the methods may alternatively be embodied in specialized computer hardware.

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

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.

Any routine 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 routine. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, or executed out of order from that shown or discussed, including substantially synchronously or in reverse order, depending on the functionality involved as would be understood by those skilled in the art.

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

Claims

1. A system for processing data items within a data source via an on-demand code execution environment, the system comprising: a non-transitory data store configured to implement a backlog cache indicating data items, from the data source, that have been identified for processing at the on-demand code execution environment as backlog items;one or more processors, in communication with the non-transitory data store, configured to: retrieve, for a set of data items within the data source, time data indicating points in time at which individual data items from the set of data items were created or modified within the data source;determine, from the time data, an estimated modification frequency for the data source, the estimated modification frequency indicating an estimated frequency at which data items within the data source are created or modified;obtaining a threshold period of time;utilize the estimated modification frequency for the data source, the time data, and an anticipated rate of processing of data items at the on-demand code execution system to establish a demarcation time for the data source that is expected to result in a completion, within the threshold period of time, of processing of data items created or modified in the data source after the demarcation time, wherein data items created or modified in the data source prior to the demarcation time are considered backlogged data items, and wherein the set of data items includes at least one data item created or modified in the data source after the demarcation time;enqueue within the backlog cache a first set of data items, from the data store, that were created or modified in the data source prior to the demarcation time;iteratively submit data stream calls to the on-demand code execution environment, the data stream calls requesting that the demand code execution environment process, by execution of a task, data items from the data source that were created or modified after the demarcation time;while data stream calls are submitted the on-demand code execution environment, submit backlog calls to the on-demand code execution environment, the backlog calls requesting that the demand code execution environment process, by execution of the task, data items from the backlog cache.
2. The system of claim 1, wherein the one or more processers are further configured to vary a rate at which backlog calls are submitted to the on-demand code execution environment according to at least one of a rate at which data stream calls are submitted to the on-demand code execution environment or a rate at which tasks corresponding to the data stream calls are completed by the on-demand code execution environment.
3. The system of claim 2, wherein the one or more processers are further configured to vary a rate at which backlog calls are submitted to the on-demand code execution environment according to at least a rate at which calls occur at the on-demand code execution environment.
4. The system of claim 1, further comprising one or more processors configured to implement a user interface subsystem that obtains, from a user computing device, information identifying the data source and the task, on the on-demand code execution environment, to utilize in processing data items from the data source.
5. The system of claim 1, wherein the data source corresponds to a plurality of distinct data sources.
6. The system of claim 1, wherein the task corresponds to a plurality of tasks, and wherein the information obtained from the user computing device further comprises information for determining an individual task, from the plurality of tasks, to call for processing a given data item from the plurality of data items.
7. The system of claim 1, wherein the one or more processers are further configured to determine that the first set of data items have not been previously processed by the system based at least in part on identifiers for the set of data items.
8. A computer-implemented method to process data items within a data source via an on-demand code execution environment, the computer-implemented method comprising: retrieving, for a set of data items within the data source, time data indicating points in time at which individual data items from the set of data items were created or modified within the data source;determining, from the time data, an estimated modification frequency for the data source, the estimated modification frequency indicating an estimated frequency at which data items within the data source are created or modified;obtaining a threshold period of time;utilizing the time data, the estimated modification frequency for the data source, and an anticipated rate of processing of data items at the on-demand code execution system to establish a demarcation time for the data source that is expected to result in a completion, within the threshold period of time, of processing of data items created or modified in the data source after the demarcation time, wherein data items created or modified in the data source prior to the demarcation time are considered backlogged data items, and wherein the set of data items includes at least one data item created or modified in the data source after the demarcation time;enqueuing within a backlog cache a first set of data items, from the data store, that were created or modified in the data source prior to the demarcation time;iteratively submitting data stream calls to the on-demand code execution environment, the data stream calls requesting that the demand code execution environment process, by execution of a task, data items from the data source that were created or modified after the demarcation time;while data stream calls are submitted the on-demand code execution environment, submitting backlog calls to the on-demand code execution environment, the backlog calls requesting that the demand code execution environment process, by execution of the task, data items from the backlog cache.
9. The computer-implemented method of claim 8 further comprising varying a rate at which backlog calls are submitted to the on-demand code execution environment according to at least one of a rate at which data stream calls are submitted to the on-demand code execution environment or a rate at which tasks corresponding to the data stream calls are completed by the on-demand code execution environment.
10. The computer-implemented method of claim 8 further comprising obtaining information identifying the data source and the task from a user computing device.
11. The computer-implemented method of claim 8, wherein the information obtained from the user computing device further includes a maximum rate for submission of at least one data stream calls or backlog calls.
12. The computer-implemented method of claim 8 further comprising determining a data stream call rate based at least in part on errors received from the on-demand code execution environment.
13. The computer-implemented method of claim 8 further comprising determining that the first set of data items have not been previously processed based at least in part on identifiers for the set of data items.
14. The computer-implemented method of claim 13, wherein the identifiers for the first set of data items are retrieved from the data source.
15. Non-transitory computer readable media including computer-executable instructions to process data items within a data source via an on-demand code execution environment, wherein the computer-executable instructions, when executed by a computing system, cause the computing system to: obtain time data indicating points in time at which individual data items from the data items within the data source were created or modified;determine, from the time data, an estimated modification frequency for the data source, the estimated modification frequency indicating an estimated frequency at which data items within the data source are created or modified;obtain a threshold period of time;utilize the time data, the estimated modification frequency for the data source, and an anticipated rate of processing of data items at the on-demand code execution system, to establish a demarcation time for the data source that is expected to result in a completion, within the threshold period of time, of processing of data items created or modified in the data source after the demarcation time, wherein data items created or modified in the data source prior to the demarcation time are considered backlogged data items, and wherein the set of data items includes at least one data item created or modified in the data source after the demarcation time;enqueue within a backlog cache a first set of data items, from the data store, that were created or modified in the data source prior to the demarcation time;submit data stream calls to the on-demand code execution environment, the data stream calls requesting that the demand code execution environment process, by execution of a task, data items from the data source that were created or modified after the demarcation time;concurrently to submission of data stream calls to the on-demand code execution environment, submit backlog calls to the on-demand code execution environment, the backlog calls requesting that the demand code execution environment process, by execution of the task, data items from the backlog cache.
16. The non-transitory computer-readable media of claim 15, wherein the computer-executable instructions further cause the computing system to vary a rate at which backlog calls are submitted to the on-demand code execution environment according to at least one of a rate at which data stream calls are submitted to the on-demand code execution environment or a rate at which tasks corresponding to the data stream calls are completed by the on-demand code execution environment.
17. The non-transitory computer-readable media of claim 15, wherein the computer-executable instructions further cause the computing system to obtain information identifying the data source and the task from a user computing device.
18. The non-transitory computer-readable media of claim 15, wherein the information obtained from the user computing device further includes a maximum rate for submission of at least one data stream calls or backlog calls.
19. The non-transitory computer-readable media of claim 15, wherein the computer-executable instructions further cause the computing system to determine a data stream call rate based at least in part on errors received from the on-demand code execution environment.
20. The non-transitory computer-readable media of claim 15, wherein the computer-executable instructions further cause the computing system to establish a second demarcation time for the data source, wherein data items are considered backlogged data items only when created or modified on or after the second demarcation time, and wherein data items are created or modified before the second demarcation time are considered archived items.
21. The non-transitory computer-readable media of claim 15, wherein the computer-executable instructions further cause the computing system to modify the demarcation time based at least in part on at least one of a rate at which data stream calls are submitted to the on-demand code execution environment or a rate at which tasks corresponding to the data stream calls are completed by the on-demand code execution environment.

US Referenced Citations (310)

Number	Name	Date	Kind
4949254	Shorter	Aug 1990	A
5283888	Dao et al.	Feb 1994	A
5970488	Crowe et al.	Oct 1999	A
6463509	Teoman et al.	Oct 2002	B1
6708276	Yarsa et al.	Mar 2004	B1
7036121	Casabona et al.	Apr 2006	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
7886021	Scheifler et al.	Feb 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
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
8209695	Pruyne et al.	Jun 2012	B1
8219987	Vlaovic et al.	Jul 2012	B1
8321554	Dickinson	Nov 2012	B2
8321558	Sirota et al.	Nov 2012	B1
8336079	Budko et al.	Dec 2012	B2
8429282	Ahuja	Apr 2013	B1
8448165	Conover	May 2013	B1
8613070	Borzycki et al.	Dec 2013	B1
8631130	Jackson	Jan 2014	B2
8677359	Cavage et al.	Mar 2014	B1
8694996	Cawlfield et al.	Apr 2014	B2
8719415	Sirota et al.	May 2014	B1
8725702	Raman et al.	May 2014	B1
8756696	Miller	Jun 2014	B1
8769519	Leitman et al.	Jul 2014	B2
8799879	Wright et al.	Aug 2014	B2
8806468	Meijer et al.	Aug 2014	B2
8819679	Agarwal et al.	Aug 2014	B2
8825964	Sopka et al.	Sep 2014	B1
8904008	Calder et al.	Dec 2014	B2
8997093	Dimitrov	Mar 2015	B2
9027087	Ishaya et al.	May 2015	B2
9038068	Engle et al.	May 2015	B2
9086897	Oh et al.	Jun 2015	B2
9092837	Bala et al.	Jul 2015	B2
9110732	Forschmiedt et al.	Aug 2015	B1
9112813	Jackson	Aug 2015	B2
9146764	Wagner	Sep 2015	B1
9183019	Kruglick	Nov 2015	B2
9208007	Harper 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
9298633	Zhao et al.	Mar 2016	B1
9317689	Aissi	Apr 2016	B2
9323556	Wagner	Apr 2016	B2
9361145	Wilson et al.	Jun 2016	B1
9413626	Reque et al.	Aug 2016	B2
9436555	Dornemann et al.	Sep 2016	B2
9461996	Hayton et al.	Oct 2016	B2
9471775	Wagner et al.	Oct 2016	B1
9483335	Wagner et al.	Nov 2016	B1
9489227	Oh et al.	Nov 2016	B2
9537788	Reque et al.	Jan 2017	B2
9588790	Wagner et al.	Mar 2017	B1
9600312	Wagner et al.	Mar 2017	B2
9652306	Wagner et al.	May 2017	B1
9652617	Evans et al.	May 2017	B1
9661011	Van Horenbeeck et al.	May 2017	B1
9678773	Wagner et al.	Jun 2017	B1
9678778	Youseff	Jun 2017	B1
9715402	Wagner et al.	Jul 2017	B2
9727725	Wagner et al.	Aug 2017	B2
9733967	Wagner et al.	Aug 2017	B2
9760387	Wagner et al.	Sep 2017	B2
9785476	Wagner et al.	Oct 2017	B2
9811363	Wagner	Nov 2017	B1
9811434	Wagner	Nov 2017	B1
9830175	Wagner	Nov 2017	B1
9830193	Wagner et al.	Nov 2017	B1
9830449	Wagner	Nov 2017	B1
9910713	Wisniewski et al.	Mar 2018	B2
9928108	Wagner et al.	Mar 2018	B1
9930103	Thompson	Mar 2018	B2
20020172273	Baker et al.	Nov 2002	A1
20030071842	King et al.	Apr 2003	A1
20030084434	Ren	May 2003	A1
20030229794	James, II et al.	Dec 2003	A1
20040098154	McCarthy	May 2004	A1
20040249947	Novaes et al.	Dec 2004	A1
20040268358	Darling et al.	Dec 2004	A1
20050044301	Vasilevsky et al.	Feb 2005	A1
20050132167	Longobardi	Jun 2005	A1
20050132368	Sexton et al.	Jun 2005	A1
20050193113	Kokusho et al.	Sep 2005	A1
20050193283	Reinhardt et al.	Sep 2005	A1
20050257051	Richard	Nov 2005	A1
20060123066	Jacobs et al.	Jun 2006	A1
20060129684	Datta	Jun 2006	A1
20060184669	Vaidyanathan et al.	Aug 2006	A1
20060200668	Hybre et al.	Sep 2006	A1
20060212332	Jackson	Sep 2006	A1
20060242647	Kimbrel et al.	Oct 2006	A1
20060248195	Toumura et al.	Nov 2006	A1
20070094396	Takano et al.	Apr 2007	A1
20070130341	Ma	Jun 2007	A1
20070255604	Seelig	Nov 2007	A1
20080028409	Cherkasova et al.	Jan 2008	A1
20080082977	Araujo et al.	Apr 2008	A1
20080104247	Venkatakrishnan et al.	May 2008	A1
20080104608	Hyser et al.	May 2008	A1
20080126110	Haeberle et al.	May 2008	A1
20080126486	Heist	May 2008	A1
20080189468	Schmidt et al.	Aug 2008	A1
20080201711	Husain	Aug 2008	A1
20090013153	Hilton	Jan 2009	A1
20090025009	Brunswig et al.	Jan 2009	A1
20090055810	Kondur	Feb 2009	A1
20090055829	Gibson	Feb 2009	A1
20090070355	Cadarette	Mar 2009	A1
20090077569	Appleton et al.	Mar 2009	A1
20090125902	Ghosh et al.	May 2009	A1
20090158275	Wang et al.	Jun 2009	A1
20090193410	Arthursson et al.	Jul 2009	A1
20090198769	Keller et al.	Aug 2009	A1
20090204964	Foley et al.	Aug 2009	A1
20090288084	Astete et al.	Nov 2009	A1
20090300599	Piotrowski	Dec 2009	A1
20100023940	Iwamatsu et al.	Jan 2010	A1
20100031274	Sim-Tang	Feb 2010	A1
20100031325	Maigne et al.	Feb 2010	A1
20100036925	Haffner	Feb 2010	A1
20100064299	Kacin et al.	Mar 2010	A1
20100070678	Zhang et al.	Mar 2010	A1
20100070725	Prahlad et al.	Mar 2010	A1
20100114825	Siddegowda	May 2010	A1
20100115098	De Baer et al.	May 2010	A1
20100122343	Ghosh	May 2010	A1
20100131959	Spiers et al.	May 2010	A1
20100186011	Magenheimer	Jul 2010	A1
20100198972	Umbehocker	Aug 2010	A1
20100199285	Medovich	Aug 2010	A1
20100257116	Mehta et al.	Oct 2010	A1
20100269109	Cartales	Oct 2010	A1
20110010722	Matsuyama	Jan 2011	A1
20110029970	Arasaratnam	Feb 2011	A1
20110055378	Ferris et al.	Mar 2011	A1
20110055396	DeHaan	Mar 2011	A1
20110078679	Bozek et al.	Mar 2011	A1
20110099551	Fahrig et al.	Apr 2011	A1
20110131572	Elyashev et al.	Jun 2011	A1
20110134761	Smith	Jun 2011	A1
20110141124	Halls et al.	Jun 2011	A1
20110153727	Li	Jun 2011	A1
20110153838	Belkine et al.	Jun 2011	A1
20110154353	Theroux et al.	Jun 2011	A1
20110179162	Mayo et al.	Jul 2011	A1
20110184993	Chawla et al.	Jul 2011	A1
20110225277	Freimuth et al.	Sep 2011	A1
20110231680	Padmanabhan et al.	Sep 2011	A1
20110247005	Benedetti et al.	Oct 2011	A1
20110265164	Lucovsky	Oct 2011	A1
20110314465	Smith et al.	Dec 2011	A1
20110321033	Kelkar et al.	Dec 2011	A1
20120016721	Weinman	Jan 2012	A1
20120041970	Ghosh et al.	Feb 2012	A1
20120054744	Singh et al.	Mar 2012	A1
20120072914	Ota	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
20120110155	Adlung et al.	May 2012	A1
20120110164	Frey et al.	May 2012	A1
20120110588	Bieswanger et al.	May 2012	A1
20120131379	Tameshige et al.	May 2012	A1
20120192184	Burckart et al.	Jul 2012	A1
20120197958	Nightingale et al.	Aug 2012	A1
20120233464	Miller et al.	Sep 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
20130067494	Srour et al.	Mar 2013	A1
20130080641	Lui et al.	Mar 2013	A1
20130097601	Podvratnik et al.	Apr 2013	A1
20130111469	B et al.	May 2013	A1
20130132942	Wang	May 2013	A1
20130139152	Chang et al.	May 2013	A1
20130139166	Zhang	May 2013	A1
20130151648	Luna	Jun 2013	A1
20130179574	Calder et al.	Jul 2013	A1
20130179881	Calder et al.	Jul 2013	A1
20130179894	Calder 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
20130205092	Roy et al.	Aug 2013	A1
20130219390	Lee et al.	Aug 2013	A1
20130227097	Yasuda et al.	Aug 2013	A1
20130227563	Mcgrath	Aug 2013	A1
20130227641	White et al.	Aug 2013	A1
20130232480	Winterfeldt et al.	Sep 2013	A1
20130239125	Iorio	Sep 2013	A1
20130262556	Xu et al.	Oct 2013	A1
20130263117	Konik et al.	Oct 2013	A1
20130275975	Masuda et al.	Oct 2013	A1
20130290538	Gmach et al.	Oct 2013	A1
20130297964	Hegdal et al.	Nov 2013	A1
20130339950	Ramarathinam et al.	Dec 2013	A1
20130346946	Pinnix	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
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
20140059226	Messerli et al.	Feb 2014	A1
20140068611	McGrath et al.	Mar 2014	A1
20140082165	Marr et al.	Mar 2014	A1
20140101649	Kamble 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
20140173614	Konik et al.	Jun 2014	A1
20140173616	Bird et al.	Jun 2014	A1
20140180862	Certain et al.	Jun 2014	A1
20140189677	Curzi et al.	Jul 2014	A1
20140201735	Kannan et al.	Jul 2014	A1
20140207912	Thibeault	Jul 2014	A1
20140215073	Dow et al.	Jul 2014	A1
20140245297	Hackett	Aug 2014	A1
20140279581	Devereaux	Sep 2014	A1
20140280325	Krishnamurthy	Sep 2014	A1
20140282615	Cavage et al.	Sep 2014	A1
20140289286	Gusak	Sep 2014	A1
20140304698	Chigurapati et al.	Oct 2014	A1
20140304815	Maeda	Oct 2014	A1
20140380085	Rash et al.	Dec 2014	A1
20150039891	Ignatchenko et al.	Feb 2015	A1
20150052258	Johnson et al.	Feb 2015	A1
20150074659	Madsen et al.	Mar 2015	A1
20150081885	Thomas et al.	Mar 2015	A1
20150106805	Melander et al.	Apr 2015	A1
20150120928	Gummaraju et al.	Apr 2015	A1
20150135287	Medeiros et al.	May 2015	A1
20150143381	Chin et al.	May 2015	A1
20150178110	Li et al.	Jun 2015	A1
20150186129	Apte et al.	Jul 2015	A1
20150235144	Gusev et al.	Aug 2015	A1
20150242225	Muller et al.	Aug 2015	A1
20150256621	Noda et al.	Sep 2015	A1
20150261578	Greden 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
20150332048	Mooring et al.	Nov 2015	A1
20150350701	Lemus et al.	Dec 2015	A1
20150363181	Alberti et al.	Dec 2015	A1
20150371244	Neuse et al.	Dec 2015	A1
20150378764	Sivasubramanian et al.	Dec 2015	A1
20150378765	Singh et al.	Dec 2015	A1
20160012099	Tuatini et al.	Jan 2016	A1
20160072727	Leafe et al.	Mar 2016	A1
20160092250	Wagner et al.	Mar 2016	A1
20160092252	Wagner	Mar 2016	A1
20160098285	Davis et al.	Apr 2016	A1
20160100036	Lo et al.	Apr 2016	A1
20160117254	Susarla et al.	Apr 2016	A1
20160140180	Park	May 2016	A1
20160224360	Wagner et al.	Aug 2016	A1
20160224785	Wagner et al.	Aug 2016	A1
20160239318	Wagner	Aug 2016	A1
20160285906	Fine et al.	Sep 2016	A1
20160292016	Bussard	Oct 2016	A1
20160294614	Searle et al.	Oct 2016	A1
20160299790	Thompson	Oct 2016	A1
20160301739	Thompson	Oct 2016	A1
20160364265	Cao et al.	Dec 2016	A1
20160371127	Antony et al.	Dec 2016	A1
20160378554	Gummaraju et al.	Dec 2016	A1
20170083381	Cong et al.	Mar 2017	A1
20170085447	Chen	Mar 2017	A1
20170090961	Wagner et al.	Mar 2017	A1
20170093920	Ducatel et al.	Mar 2017	A1
20170116051	Wagner et al.	Apr 2017	A1
20170177391	Wagner et al.	Jun 2017	A1
20170192804	Wagner	Jul 2017	A1
20170199766	Wagner et al.	Jul 2017	A1
20170206116	Reque et al.	Jul 2017	A1
20170286143	Wagner et al.	Oct 2017	A1
20170371703	Wagner et al.	Dec 2017	A1
20170371706	Wagner et al.	Dec 2017	A1
20170371724	Wagner et al.	Dec 2017	A1
20180004553	Wagner et al.	Jan 2018	A1
20180004572	Wagner et al.	Jan 2018	A1
20180039506	Wagner et al.	Feb 2018	A1

Foreign Referenced Citations (13)

Number	Date	Country
2663052	Nov 2013	EP
WO 2009137567	Nov 2009	WO
WO 2015078394	Jun 2015	WO
WO 2015108539	Jul 2015	WO
WO 2016053950	Apr 2016	WO
WO 2016053968	Apr 2016	WO
WO 2016053973	Apr 2016	WO
WO 2016090292	Jun 2016	WO
WO 2016126731	Aug 2016	WO
WO 2016164633	Oct 2016	WO
WO 2016164638	Oct 2016	WO
WO 2017112526	Jun 2017	WO
WO 2017172440	Oct 2017	WO

Non-Patent Literature Citations (39)

Entry
Moirae: History Enhanced Monitoring Magdalena Balazinska, Yong Chul Kwon, Nathan Kuchta, and Dennis Lee Published: 2007.
Adaptive Stream Processing using Dynamic Batch Sizing Tathagata Das, Yuan Zhong, Ion Stoica, Scott Shenker Published:2014.
Continuous Analytics Over Discontinuous Streams Sailesh Krishnamurthy, Michael J. Franklin, Jeffrey Davis, Daniel Farina, Pasha Golovko, Alan Li, Neil Thombre (Year: 2010).
Adapter Pattern, Wikipedia, https://en.wikipedia.org/w/index.php?title=Adapter_pattern&oldid=654971255, [retrieved May 26, 2016], 6 pages.
Czajkowski, G., and L. Daynes, Multitasking Without Compromise: A Virtual Machine Evolution 47(4a):60-73, ACM SIGPLAN Notices—Supplemental Issue, Apr. 2012.
Dombrowski, M., et al., Dynamic Monitor Allocation in the Java Virtual Machine, JTRES '13, Oct. 9-11, 2013, pp. 30-37.
Espadas, J., et al., A Tenant-Based Resource Allocation Model for Scaling Software-as-a-Service Applications Over Cloud Computing Infrastructures, Future Generation Computer Systems, vol. 29, pp. 273-286, 2013.
Nakajima, J., et al., Optimizing Virtual Machines Using Hybrid Virtualization, SAC '11, Mar. 21-25, 2011, TaiChung, Taiwan, pp. 573-578.
Qian, H., D. and Medhi, et al., Estimating Optimal Cost of Allocating Virtualized Resources With Dynamic Demand, ITC 2011, Sep. 2011, pp. 320-321.
Shim (computing), Wikipedia, https://en.wikipedia.org/w/index.php?title+Shim_(computing)&oldid+654971528, [retrieved on May 26, 2016], 2 pages.
Vaghani, S.B., Virtual Machine File System, ACM SIGOPS Operating Systems Review 44(4):57-70, Dec. 2010.
Vaquero, L., et al., Dynamically Scaling Applications in the cloud, ACM SIGCOMM Computer Communication Review 41(1):45-52, Jan. 2011.
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 Search Report and Written Opinion in PCT/US2015/052838 dated Dec. 18, 2015.
International Search Report and Written Opinion in PCT/US2015/052833 dated Jan. 13, 2016.
International Search Report and Written Opinion in PCT/US2015/064071dated Mar. 16, 2016.
International Search Report and Written Opinion in PCT/US2016/016211 dated Apr. 13, 2016.
International Search Report and Written Opinion in PCT/US2016/026514 dated Jun. 8, 2016.
International Search Report and Written Opinion in PCT/US2016/026520 dated Jul. 5, 2016.
International Search Report and Written Opinion in PCT/US2016/054774 dated Dec. 16, 2016.
U.S. Appl. No. 15/085,902, Processing Pre-Existing Data Sets at an on Demand Code Execution Environment, Mar. 30, 2016.
U.S. Appl. No. 15/085,912, Dependency-Based Process of Pre-Existing Data Sets at an on Demand Code Execution Enviroment, Mar. 30, 2016.
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].
Amazon, “AWS Lambda: Developer Guide”, Retrieved from the Internet, Jun. 26, 2016, URL : http://docs.aws.amazon.com/lambda/ latest/dg/lambda-dg.pdf.
Ben-Yehuda et al., “Deconstructing Amazon EC2 Spot Instance Pricing”, ACM Transactions on Economics and Computation 1.3, 2013, 15 pages.
Hoffman, Auto scaling your website with Amazon Web Services (AWS)—Part 2, Cardinalpath, Sep. 2015, 15 pages.
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.
International Preliminary Report on Patentability in PCT/US2015/052810 dated Apr. 4, 2017.
International Preliminary Report on Patentability in PCT/US2015/052838 dated Apr. 4, 2017.
International Preliminary Report on Patentability in PCT/US2015/052833 dated Apr. 4, 2017.
International Preliminary Report on Patentability in PCT/US2015/064071 dated Jun. 6, 2017.
International Preliminary Report on Patentability in PCT/US2016/016211 dated Aug. 17, 2017.
International Preliminary Report on Patentability in PCT/US2016/026514 dated Oct. 10, 2017.
International Preliminary Report on Patentability in PCT/US2016/026520 dated Oct. 10, 2017.
International Search Report and Written Opinion in PCT/US2016/066997 dated Mar. 20, 2017.
International Search Report and Written Opinion in PCT/US/2017/023564 dated Jun. 6, 2017.
International Search Report and Written Opinion in PCT/US2017/040054 dated Sep. 21, 2017.
International Search Report and Written Opinion in PCT/US2017/039514 dated Oct. 10, 2017.

Related Publications (1)

	Number	Date	Country
	20170286156 A1	Oct 2017	US

Generating data streams from pre-existing data sets

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

CPC

International Classifications