JP2013505519A - Conclusion to causal program execution capacity modification, and dynamic modification of program execution capacity - Google Patents

Abstract

Techniques are described for managing program execution capacity, such as for a group of computing nodes provided to execute one or more programs to a user. In some situations, the dynamic program execution capacity modification of the computing nodes being used is to aggregate multiple modifications that are requested or otherwise determined to be made over a period of time, etc. Alternatively, it may be executed periodically or otherwise iteratively. The technique may be used in some situations with a fee-based program execution service that executes multiple programs on behalf of multiple users of the service.

Description

  The present invention relates to the attributing to causal program execution capacity correction, and to dynamic correction of program execution capacity.

  Many businesses and other organizations are co-located (eg, as part of a local network) or alternatively (eg, connected via one or more private or public intermediate networks) A computer network interconnecting a number of computing systems is operated to assist in their operation, such as with computing systems located at topographic locations. For example, a private data center operated by a single organization and on behalf of a single organization, and a public data center operated by an entity as a business to provide computing resources to customers, etc. Data centers that accommodate large numbers of interconnected computing systems are becoming commonplace. Some public data center operators offer secure installation facilities for network access, power, and hardware owned by various customers, while other public data center operators further use that customer Providing a “full service” facility that includes hardware resources made available to do so. However, as the size and scope of a typical data center increases, the tasks of supplying, operating and managing physical computing resources are rapidly becoming complex.

  The advent of commodity hardware virtualization techniques has brought several advantages in managing large-scale computing resources for many users with diverse needs. Users can share efficiently and securely. For example, virtualization techniques such as those provided by VMWare, XEN, Linux KVM ("Kernel-based virtual machine") or User-Mode Linux are hosted by a single physical computing machine. Providing one or more virtual machines to each user may allow a single physical computing machine to be shared among multiple users, each such virtual machine being diverse Separate logical computing devices that provide users with the illusion that they are the sole operator and administrator of a given hardware computing resource while providing application isolation and security between virtual machines Software simulation acting as an operating system Is a Deployment.

FIG. 3 is a network diagram illustrating an exemplary embodiment of interactions for managing program execution capacity available to multiple users of a program execution service. FIG. 3 is a network diagram illustrating an exemplary embodiment of interactions for managing program execution capacity available to multiple users of a program execution service. An example of managing the program execution capacity of a group of a plurality of computing nodes for a user, such as when dynamically modifying the program execution capacity that can be used at various timings and in various modes, will be described. An example of managing the program execution capacity of a group of a plurality of computing nodes for a user, such as when dynamically modifying the program execution capacity that can be used at various timings and in various modes, will be described. 1 is a schematic diagram illustrating an exemplary embodiment of a computing system for managing program execution capacity provided to multiple users. FIG. FIG. 4 illustrates a flow diagram of an exemplary embodiment of a program execution service system manager routine. FIG. 4 illustrates a flow diagram of an exemplary embodiment of a recursive capacity matching routine. FIG. 4 illustrates a flow diagram of an exemplary embodiment of a capacity modification attribution routine. FIG. 4 illustrates a flow diagram of an exemplary embodiment of a program execution service capacity maintenance manager routine.

  Techniques for managing program execution capacity used to execute a program for one or more users are described. In at least some embodiments, the managed program execution capacity includes a group of one or more computing nodes that are provided for use by a user in executing one or more programs. In addition, the group of computing nodes associated with the user is dynamically modified while in use to manage the amount of program execution capacity available to the user from the computing nodes of the group. There is a case. Modifications to a group of computing nodes associated with a user may vary in various embodiments in various forms (eg, dynamically adding and / or deleting computing nodes, etc.) In various embodiments (e.g., based on a dynamic instruction specified by the user, a trigger previously defined by the user has been met) in various embodiments. Based on the determination, it may be initiated (eg, based on an automatic operation of a service providing a computing node of the group). Additional details regarding dynamic modification of program execution capacity available from a group of computing nodes are provided below. In addition, in at least some embodiments, the technique includes a plurality of computing nodes (eg, virtual machines and / or hosted on one or more physical computing systems) to execute a remote user's program. Used in conjunction with a program execution service (hereinafter “PES”) that executes multiple programs on behalf of multiple customers or other users of the service, such as a program execution service accessible from a network that provides multiple physical computing systems) May be. Some or all of the techniques may also be performed automatically by the program execution service system manager module and / or the program execution service capacity maintenance manager module, as described in detail below.

  As noted above, dynamic modifications performed on a computing node in use that is executing one or more programs for a user may have a variety of forms, and in various embodiments May start in a variety of styles. As an example, the program execution capacity of a group of computing nodes may be measured at least in part by the number of computing nodes that are part of the group, by changing the number of computing nodes in the group ( For example, it may be modified to increase program execution capacity by increasing the number of computing nodes and to decrease program execution capacity by decreasing the number of computing nodes. Such a modification of the number of computing nodes may, for example, provide a group with a given rate of increase / decrease in the number of computing nodes corresponding to the same or similar rate of increase / decrease in the sum of the group's computing resources and program execution capacity. In situations where some or all of the computing nodes in it provide or have access to the same or similar amount of computing resources (eg, amount of memory, hard drive capacity, CPU run cycles, network bandwidth, etc.) , May be used. In other embodiments, some or all of the computing nodes in the group are related to the amount of computing resources they have access to (eg, two or more distinct types of computing node configurations are used). If each computing node is configured independently of other computing nodes, etc.) or otherwise with respect to the type of program execution capacity they provide (eg, dedicated hardware, software programs) May vary in one or more salient ways, but nevertheless, dynamic program execution capacity modification for the group is at least partly of the group's computing nodes. Based on correcting the number, or instead of other parts As described in detail, it may be based on other modes (e.g., changing from one type of computing node configuration to another type).

  Further, in at least some embodiments and situations, the program execution capacity of a group of one or more computing nodes is a total metric (eg, of memory) of one or more types of computing resources provided by the group. May be measured and modified in a manner other than the number of computing nodes, such as based on volume, hard drive capacity, CPU execution cycle, network bandwidth, etc.). In addition, in at least some embodiments, in measuring and identifying the program execution capacity of a group of computing nodes, some or all geographic locations of the computing nodes, some or all of the computing nodes Correlation between (for example, classified by at most maximum geographical distance or at least minimum geographical distance, classified by at most maximum network latency or at least minimum network latency, simultaneous failures Additional factors such as availability of specialized hardware and / or software performance, etc.), which are classified as two or more independent data centers or other collections of computing nodes May be. Additional details regarding measuring and identifying program execution capacity are provided below.

  A PES or other system that manages a group of computing nodes in use that are executing one or more programs for a user can perform dynamic program execution for the group of computing nodes in a variety of ways. There are cases where it is automatically determined how and when capacity correction is performed. For example, in at least some embodiments and situations, a PES or other system may make some type of program execution capacity modification in an immediate manner, while other types of program execution capacity modification Postpones requests to be made during a period, or otherwise determined to be periodic, such as on a regular or otherwise recursive basis (eg, since the previous implementation of one or more aggregated modifications) And so on). If multiple program execution capacity modification decisions are aggregated over a period of time, the information regarding the aggregated modification decisions may be used to improve the performance of the program execution capacity modification in a variety of ways. For example, two determined program execution capacity modifications correspond to opposite types of modifications (eg, increasing / decreasing the number of compute nodes, increasing / decreasing the total available memory, etc.) If so, the two modifications are selected to partially or completely offset each other, or instead, implement the higher priority of the two modifications and do not perform the other modifications May be aggregated in various styles, such as by selecting. In addition, two or more determined program execution capacity corrections are given similar or complementary types of corrections (eg, total available memory that increases the number of compute nodes by a specified amount). Those determined modifications are aggregated as well in various ways (eg, having the highest, lowest, highest priority, first determined) (E.g., collecting various determined corrections and using the accumulated correction amount to select a single determined correction that meets some specified condition, such as the last determined) There is. Additional details regarding how and when to make various types of program execution capacity modifications are provided below.

  In addition, when a PES or other system dynamically implements program execution capacity modification for a group of computer nodes running one or more programs on behalf of a user, the PES or other system Various operations may be further performed to conclude causal information or other responsibilities for specific program execution capacity modifications. Responsibility attribution is, for example, identifying specific events that occurred during the relevant period, each of which can cause dynamic program execution capacity modifications, and one or more of the events: It may include concluding some or all of the dynamic program execution capacity modifications performed during or after that period. For example, some dynamic program execution capacity modifications may each be initiated by a single specific event in at least some embodiments and situations (eg, a group of computing nodes fails, or Otherwise, it becomes unavailable, the system automatically immediately provides a replacement computer node for the group, and the fact that the computing node is unavailable makes the replacement computer into automated system operation. Single event that triggers provisioning node). Each of the other dynamic program execution capacity corrections may conclude in a combination of multiple events, each of which may or may have been the cause of the capacity correction, in at least some embodiments and situations. For example, multiple independent events may request or direct an increase in the number of computing nodes in a group during each period, and may be aggregated to implement an increase in the number of single computing nodes at the end of the period, Independent events are then combined to allow automated system operation to indirectly increase the number of computing nodes).

  The attribution of responsibility for a particular dynamic program execution capacity modification to a group of computing nodes associated with the user is, for example, when the user is charged for at least some of the program execution capacity modifications (eg, PES or other System charged to user customers for providing each computing node of the group, for each other measure of the amount of program execution capacity, and / or based on other principles In certain situations, it may have certain benefits. In such a situation, the user will be able to ascertain the cause and appropriateness of those dynamic program execution capacity modifications, as well as information about the billing corresponding to a particular dynamic program execution capacity modification. As such, it may be possible to receive and review related liability attribution information. In at least some such embodiments, responsibility attribution information allows the user to understand why various automated actions were performed by PES or other systems contained within the human readable information. May be generated in a human readable format for display to the user. Such responsibility attribution information may also be used in a variety of other ways in other embodiments, including automatically initiating other operations by a PES or other system. In addition, in at least some embodiments, responsibility attribution information may be due to which events are specific indicated program execution capacity modifications, or other changes in the availability of one or more computing nodes in the group. A user or other source of information, such as a request to identify which and / or which program execution capacity modification or other computing node availability change was caused by one or more indicated events May be generated and / or used in response to various types of queries received from. Additional details regarding determining and using responsibility attribution information for dynamic program execution capacity correction are provided below.

  The techniques described above for automatically managing dynamic program execution capacity modifications can provide a variety of benefits in a variety of situations. For example, by summing together multiple requests to be considered or determined dynamic program execution capacity modifications, PES or other systems optimize how the aggregated modifications are performed and It may be possible to minimize repetitive changes to computer nodes that may result in temporary unavailable periods of some or all of the computing nodes due to additional changes In addition, users may pre-define various types of triggers based on the performance characteristics of a group of computing nodes, and program execution capacity will automatically increase appropriately as specific triggers are met Or decreased (e.g., to deal with a temporary increase in computing load of computing nodes) Additional program execution capacity, such as based on specific performance characteristics and / or historical trends over time in historical data that show a repetitive pattern of program execution capacity usage, which responsively increases the program execution capacity of computing nodes Aggressively increase or decrease the program execution capacity of a group of computing nodes to address the anticipated near future need and / or the near future need predicted against existing program execution capacity Etc.) Alternatively, a user may desire to maintain program execution capacity for a group of computing nodes at or near a particular level (eg, a particular desired constant of computing nodes), and various modifications To maintain the program execution capacity available at that particular level (eg, to return the actual number of computing nodes that was different from the particular desired number back to that particular desired number) May be done automatically for groups of. Such a technique may be used, for example, where each of the group of computing nodes executes a separate copy of the same program (eg, acts as an alternative to the total computing load of the entire group) When modified to manage the amount of work processed by a computing node, or otherwise, in situations where each of the diverse computing nodes of the group does not execute a separate copy of the same program (eg, some If a separate subset of computing nodes executes different copies of a program, such as having one computing node execute an application server program and another computing node execute an associated database server program, Some or all of the computing nodes, as distributed manner, such as when carrying out the different parts of a single program) may be useful. Further, when adding additional computing nodes to the group, the PES or other system provisions additional computing nodes that are ready to execute one or more programs, or adds additional computing nodes. In at least some situations, other operations may optionally be further performed, such as automatically starting further execution of one or more programs on the storage node.

  As mentioned above, a user may predefine various types of triggers related to dynamically modifying the program execution capacity of a group of computing nodes, and those triggers are May be used later to initiate a corresponding automated dynamic program execution capacity modification. By way of example, a corresponding computing node group is automatically maintained at a desired number of computing nodes or a desired amount of total computing resources, or alternatively specified computing is performed when specified conditions are met. A trigger is defined that specifies a specific desired number of computing nodes or a desired total metric of one or more computing resources, such as may be used to change to a node count or a total computing resource amount. There is a case. In other situations, if one or more indicated performance characteristics of the computing node group reach a specified threshold, or otherwise specified conditions (eg, a specified range for a specified period of time) One or more, such as from historical data that shows a recurring pattern of program execution capacity usage, indicating a specific trend, such as a specified amount of change over a specified period of time, or a specific “acceleration” or change rate Specified logical values of multiple performance characteristics, such as using and / or otherwise combining logical operators such as AND, NOT, OR, etc. that match or otherwise correspond to specified patterns of Or other combinations, etc.) that may be triggered, such as You may trigger specifying a specific absolute or relative change in the total metric ring resource is defined. In other embodiments and situations, the predefined trigger is based on information that is not otherwise part of the performance characteristics of the computing nodes (eg, some or all of the conditions for a particular trigger). Known or predicted to be, for example, queued or otherwise implemented by one or more programs, based on a current time that matches one or more specified times Based on status information of one or more programs running on a current set of computing nodes measured in a manner other than performance characteristics, such as the current computing load indicated by the amount of work being performed, for example As the computing load on other running programs increases or decreases, Not being executed by the current computing node group, such as when the current computing node group interacts with or otherwise supports other running programs to increase the program execution capacity of the node group (E.g., based on the performance characteristics of one or more other running programs or other status information). Such performance characteristics are an absolute or relative amount of use of one or more computing resources of a single computing node (eg, percent of available memory or CPU cycle usage being used, usage The absolute amount of network bandwidth being used), the absolute or relative amount of aggregate usage of all one or more computing resources of a group of computing nodes, in response to communication from an external computing system An absolute or relative amount of latency or other delay, including a non-exclusive list such as an absolute or relative amount of failure of a computing node in performing one or more desired operations To one or more measurable attributes or other metrics corresponding to its operation There is a case in which brute. Further, in at least some embodiments and situations, a specified system or module is notified when a trigger is satisfied, rather than causing the trigger to directly specify a particular program execution capacity modification that will occur when it is satisfied. The system or module may request a specific program execution capacity modification (eg, a predefined capacity modification that does not fluctuate, based on the current status, etc. The capacity is determined as follows). In addition, the PES or other system may, in some embodiments, perform various operations to monitor a group of computing nodes to determine some or all of the performance characteristics of the trigger associated with the group. If implemented, or otherwise, monitor the computing node and optionally report the monitored information from another information source (eg, from third party software that monitors the computing node) As such, from such software running on a computing node, such monitored performance characteristics may be obtained. Further, in some embodiments, a PES or other system has a system-defined trigger that initiates dynamic program execution capacity modification when the trigger condition is indicated to be met, or otherwise specified. In certain situations, it may be automatically determined to make some type of change to the computing nodes.

  The defined trigger specifies a specific absolute or relative change in the number of computing nodes or the total metric of one or more computing resources, and one or more specified conditions of the defined trigger are When a PES or other system automatically performs the program execution capacity modification specified in the trigger, it determines which is satisfied based on the current situation for the corresponding group of operating nodes. In some cases, it is automatically determined whether or not to implement. For example, some types of specified program execution capacity modifications may be implemented immediately (eg, requests to terminate use of one or more compute nodes, triggers specified by the user to be implemented immediately) On the other hand, other types of specified program execution capacity modifications are considered as part of the aggregate of requests or otherwise determined program execution capacity modifications during that period. May be postponed until the end of the total period. Similarly, dynamically requested by the user (eg, via a PES or other system GUI or graphical user interface, by a user program via a defined API or application program interface of the PES or other system, etc.) Program execution capacity modifications that are made may be implemented immediately and / or temporarily postponed based on the type of dynamic program execution capacity modification, such as based on an explicit request from the user for immediate or postponed implementation And may be determined to be aggregated in a similar manner. Further, when determining how to manage a combination of a plurality of determined program execution capacity modifications, in some situations, different priorities may be associated with different determined modifications. In that case, a dynamically specified user request or other user instruction is given a different priority than the satisfied trigger (eg higher or lower priority), for different types of determined modifications. Are given different priorities (for example, requests that reduce program execution capacity are given higher priority than requests that increase program execution capacity), and such priorities are evaluated in various ways. May be. Additional details regarding using a user-defined trigger to determine performance characteristics are provided below.

  Further, in at least some embodiments, the PES or other system may be based on tracking or using multiple attributes of a corresponding group of computing nodes, or otherwise one or more of the group. For a controllable parameter associated with each of the computing nodes, a periodic or otherwise recursive aggregate of a plurality of determined program execution capacity modifications may be managed. As an example, using the number of computing nodes of a computing node group as a metric corresponding to the program execution capacity of the computing node group, a PES or other system can compute the computing node group relative to the computing node group. Desired by the computing node group, such as may be initially set by an associated user when the user is started, the trigger may be satisfied, and / or may be modified by a dynamically specified user request The number of computing nodes, the actual number of computing nodes in the group's currently available computing nodes (eg, determined by continuous or iterative monitoring of the group's computing nodes), and the group's currently available computing nodes Ting The number of computing nodes in the node's official record (eg, optional when updated from time to time by continuous or repetitive monitoring, determined at the last time one or more dynamic program execution capacity modifications are initiated) At least three correlated measurements may be maintained and used. Such multiple attributes of a group of computing nodes measure the actual number continuously or iteratively and update the official record number accordingly (eg, based on the implementation of monitoring of the group's computing nodes). , And periodically try to update the latest official record number to match the current desired number (e.g., how to implement a combination of multiple aggregated and determined corrections) May be used in various styles.

  As mentioned above, a PES or other system may also perform various operations to conclude causal information or other responsibilities for a particular dynamic program execution capacity modification that has been made. For example, as described above, an event corresponding to a request for dynamic program execution capacity modification of a computing node group is a dynamic user-specified instruction received and a pre-defined that is automatically determined to be satisfied. Triggered, as well as, in some embodiments, operations automatically performed by a PES or other system may be tracked (eg, the compute node is frozen or otherwise desired) If it is determined that it will automatically shut down or otherwise terminate the use of a compute node as part of its current compute node group, etc. Based on the monitoring performed). Similarly, actual changes in the program execution capacity of a group of computing nodes, such as events that occur and / or changes that correspond to other capacity changes, may be tracked as well (e.g., a failure occurs or is not. An instance of a compute node that would otherwise be unavailable). As an example, information about various events may be stored in a first database table, and various information about capacity changes or other availability changes may be stored in a second database table. There is. If a relationship between a specific event and a specific availability change is identified (eg, a specific event causes a specific availability change to take effect immediately), that event and the availability Corresponding bindings between changes may be tracked by storing identifiers for the same binding along with other information about the event and its availability changes. In other situations where multiple events are individually or combined to produce a particular availability change, but the causal relationship cannot be concluded into a single event, the identifier for a single bond is its availability For gender changes and each of those events, and for one or more other availability changes if they may be concluded individually or in combination to those same multiple events as well It may be stored with other information. Thus, for example, if multiple events for a given group of computing nodes occur during a single aggregate period and one or more program execution capacity changes occur during or immediately after that same aggregate period ( Multiple events (for example, as part of a harmonization activity performed at the end of the grand total period) and none of those events can be directly attributed to any of one or more capacity changes. All combinations may be concluded for each of the one or more capacity changes. Details regarding such attribution of causality are shown below, including the description for FIG. 2B.

  In addition, in a similar fashion, a plurality of such desired attributes, actual attributes, and formula attributes are the desired, actual, and formula quantities of the first set of aggregate average CPU cycle utilization. For one or more other controllable parameters corresponding to the program execution capacity of the computing nodes, such as desired amount, actual amount, and official amount of aggregate average network bandwidth utilization of the second set May be tracked and used. In addition, when multiple parameters corresponding to the program execution capacity of the compute nodes are simultaneously tracked and used, the PES or other system can provide the desired aggregate average CPU cycle utilization and the desired aggregate average network bandwidth utilization. In order to achieve at the same time, it may try to manage all of the parameters, such as modifying the computing nodes. As another example, the plurality of parameters of the computing node group may include the number of computing nodes and the specified geographical location of the diverse computing node of the group (eg, the group of computing nodes in the first data center). 15-20 percent, and the remaining group of computing nodes in one or more other data centers), the PES or other system may include the number of computing nodes in the group and the geography of the computing nodes. Try to manage both locations simultaneously. Additional details regarding the use of multiple attributes to track and manage one or more program execution capacity parameters are provided below.

  In addition, the PES or other system can provide users with access to the computing node in various manners in various embodiments. For example, in some embodiments, at least some of the computing nodes available from the PES to execute a program are such that each of the users has preferential access over other users. May be assigned to one or more users for preferential use by those users. In one such embodiment, the user's preferred access is based on each of the users having dedicated or exclusive access to use their computing nodes for a specified period of time, such as in a manner similar to a lease. There is a case. In addition, in some embodiments, at least some of the computing nodes assigned to one or more users for dedicated or other preferential use are determined by the user to which the computing node is assigned, In some cases, such as when a computing node is not in use and / or when a user to whom a computing node is assigned explicitly makes the assigned computing node available for use by other users It may be used as extra program execution capacity for other users. In this manner, at least some program execution capacity assigned to the first group of users is on a non-guaranteed basis, etc. (eg, priority or reserved use by one or more other users, such as program execution capacity). If this is desirable for other purposes, access to extra program execution capacity may be disabled), sometimes available to temporarily run programs on behalf of other users There is a case. Further, in some embodiments, a PES is available at (or near) the requested time that there are not enough computing nodes to satisfy the requested execution, although there is no guarantee that such a request will be satisfied. If possible, one or more programs indicated by such a request may be executed (eg, immediately at the time of those users' requests, indicated at a future time indicated) It may include an on-demand computing node that can be used to satisfy a dynamically received user request to execute a program (such as at some time during a future period). In addition, in some embodiments, such an on-demand request for immediate (or scheduled) execution is satisfied, and after successfully starting execution of one or more programs on behalf of the respective user, The ongoing use of demand computing nodes is guaranteed to continue to some future point in time, such as the time selected by each user, and is optionally subject to certain restrictions (eg, PES It is guaranteed not to preempt its use for other purposes, but it is not guaranteed against the failure of the computing node running the program). In some embodiments, a computing node used to provide on-demand variable program execution capacity is a computing node used to provide dedicated program execution capacity and / or It may be distinguished from computing nodes used to provide extra program execution capacity, and therefore, of the computing nodes used to provide on-demand variable program execution capacity If some of these are not in use, in some embodiments they may be used to provide extra program execution capacity until an on-demand variable program execution capacity request is received. While in other embodiments they are In order to provide a program execution capacity it may not be used. In other embodiments, only a single type of program execution capacity may be provided and / or other types of program execution capacity may be provided.

  FIG. 1A is a network diagram illustrating an example of a program execution service that manages available computing nodes for use in providing program execution capacity for executing programs for multiple users. For purposes of illustration, some examples and embodiments are described below in which a particular type of program execution capacity is provided and managed in a particular fashion. In addition, in some of the examples and embodiments described below, the program execution capacity provided by a group of computing nodes is measured in a particular manner (eg, based on the number of computing nodes). ) When managed in a particular manner (eg, by tracking usage of desired, actual, and official attributes with respect to one or more program execution capacity metrics) When controlled by the user (eg, based on the use of predefined triggers and / or dynamically specified instructions), modified in a particular manner (eg, determined and postponed during the period) Totaling at least some program execution capacity modifications, then modifying the number of computing nodes in the group, etc. Finally one or more by carrying out the corresponding aggregate has been modified), and the like between. These examples are provided for illustrative purposes and have been simplified for the sake of brevity, and the techniques of the present invention may be used in a wide variety of other situations, some of which are listed below. It is understood that only is described.

  In the example of FIG. 1A, various users (not shown) use various client computing systems 130 to interact with the PES provided by the program execution service provider entity 105 from the network 100. And some of the functions of the PES are provided in this example by the exemplary embodiment of the Program Execution Service System Manager (hereinafter “PESSM”) module 110, and other functions in this example Provided by an exemplary embodiment of a service capacity maintenance manager (hereinafter “PESCMM”) module 115. The PESSM module 110 may, for example, specify an initial desired number of computing nodes for the group and triggers for use in automatically making dynamic corrections to the number of computing nodes later. In some cases, including specifying, may assist a particular user in configuring a group of computing nodes used to execute a program for the user. In this example, the PES makes various computing nodes 120 available to execute the user's program, but in other embodiments the computing used for at least some of the groups. At least some of the nodes may be provided in other manners (eg, made available by a user and / or a third party, such as an external computing system 140, but managed by a PES) ). In addition, the PESCMM module 115 monitors failures of the computing node in use continuously or repeatedly, and optionally faults to maintain program execution capacity at a previously determined level. It may help to replace any computing node that occurs or otherwise becomes unavailable.

  The network 100 may be, for example, a publicly accessible network of connected networks, and may be operated by various separate parties such as the Internet. In other embodiments, the network 100 may be a private network, such as, for example, a corporate or university network that is totally or partially inaccessible to unprivileged users. In still other embodiments, the network 100 may include one or more private networks that have access to and / or access from the Internet. In the illustrated embodiment, the PESSM module 110 and the PESCMM module 115 may each include software instructions that execute on one or more computing systems (not shown). In addition, the modules 110 and 115 and the various computing nodes 120 may be used in a variety of separate geographic locations, such as using a coexisting computing system, or otherwise in a single data center, or otherwise. It may be provided in a variety of ways, such as a distributed manner using a variety of computing systems in the location.

  In some embodiments, the illustrated computing node 120 may include multiple physical computing systems and / or multiple virtual machines (see FIG. 1B) hosted on one or more physical computing systems. May be included in detail). Each of the computing nodes 120 may be measured by a combination of one or more of, for example, processing capacity (eg, number and / or size of processing units), memory capacity, storage capacity, network bandwidth capacity, and the like. Having some amount of computing resources available to execute one or more programs, such as providing a certain amount of program execution capacity. In some embodiments, the PES provider 105 may provide pre-configured computing nodes, each pre-configured computing node being available to execute programs on behalf of the user. While in other embodiments, the PES provider 105 has an amount and / or type (eg, processing unit size, speed, etc.) that each option may vary, while having an amount that is equivalent to, or otherwise similar to, the amount of resources. And / or having computing resources of type, number of processing units, amount of memory and / or storage, platform configuration such as 32-bit or 64-bit, etc. Choose from a variety of different computing nodes that you may choose. There is a case to provide a limb.

  In the illustrated embodiment, the program execution service provides functionality for managing a group of one or more computing nodes 120 for each of a plurality of users. As described in detail elsewhere, various users interact with the PESSM module 110 to specify a request to begin using a group of computing nodes to execute programs on behalf of the user. There is a case. In various embodiments, such resources may be used at the time of a request to execute one or more programs on a group of computing nodes on behalf of a user and / or for a user to use PES services first. It may be specified at one or more other times, such as when registering and / or joining. In some embodiments, the PESSM module 110 may include information about one or more programs that a user executes on behalf of the user (eg, program, source code, addressable location of one or more programs, etc.), account In some cases, subscription and / or registration services may be provided to one or more users so that information (eg, user name, billing information, etc.), usage conditions, etc. can be specified. In some embodiments, after a user interacts with the PESSM module 110 and subscribes to and / or registers with the service, the user is given one or more identifiers associated with the user (eg, key, token, username, etc.). ) May be issued and used in connection with executing the program on behalf of the user. In other embodiments, modules (not shown) other than the PESSM module 110 may be provided to perform various operations related to PES subscription and / or registration services.

  After a request is received from a user to use one or more computing nodes, the PESSM1 module 10 determines whether there are a sufficient number of computing nodes 120 with resources available to satisfy the request. If present, the PESSM1 module 10 may initiate execution of one or more programs for the request on an appropriate amount of computing nodes on behalf of the user. If the user schedules a request to further execute one or more programs on a group of one or more computing nodes, the PESSM module 110 executes one or more programs at one or more future times. Which computing nodes to execute if they want to immediately reserve an appropriate amount of computing nodes to do and / or until a later time (eg, when one or more future times occur) The determination of whether to use may be delayed. In the illustrated embodiment, if the PESSM module 110 is unable to allocate a computing node for a user request, the request may fail, such as the program not being executed. In such cases, the user may resend the failed request for later execution. As described above, in some embodiments, the user can determine the number of computing nodes used, the type of computing node used, the period during which the computing node is used, and the specific that the computing node performs. Various charges may be charged in connection with the use of the PES, such as based on operations (eg, data transfer and / or storage) and the like.

  After one or more groups of computing nodes are provided for use in executing one or more programs on behalf of a user, the computing nodes may be managed in a variety of ways. For example, as described above, the PESCMM module 115 may include some of the computing nodes, including the actual number of computing nodes being provided by the group of computing nodes or other measurements of actual program execution capacity. A group of computing nodes may be monitored, such as to determine all performance characteristics. The actual program execution capacity of the group may change, for example, if one or more of the computing nodes fail or otherwise become unavailable, and in at least some embodiments, the module 115 is In such a situation, various operations may be performed to maintain the program execution capacity of the computing node group (eg, adding a replacement computing node to the group instead of an unavailable computing node). By starting). In addition, the module 115 determines the computing node group to update the computing node number in the official record of the computing node group, such as periodically, when detecting a change in the actual computing node number. Information about the actual number of compute nodes that have been used may be used.

  In addition, the PESSM module 110 may also assist in managing computing nodes in a variety of ways. For example, as described above, a user associated with a group may specify one or more numbers that specify the type of computing node change that is made to the group when various specified conditions are met. A correction trigger may have been specified previously. Moreover, in at least some embodiments, a user associated with a group dynamically changes the operation of the associated computing node group at various times, including changing the number of computing nodes in the group. May be specified. As part of managing the computing nodes, module 110 tracks the desired number of computing nodes in the computing nodes, and computes the number of computing nodes in the official record of the computing nodes, and the computing nodes. There may be periodic reconciliations to the desired number of computing nodes. Such regular reconciliation occurs during the aggregate period, such as from meeting one or more of the predefined user-specified triggers and / or from one or more dynamically specified user instructions. It may include tracking and summing up the requested modifications to the number of computing nodes. At the end of the period, the module 110 may then determine whether and how to implement the aggregated compute node number correction, based on the total compute node number correction desired. The number of computing nodes may be updated. Module 110 then initiates a correction of the total number of compute nodes and sets the number of compute nodes in the official record to match the new desired number of compute nodes resulting from the correction of the total number of compute nodes. Updating may complete the reconciliation of the desired number of computing nodes and the number of computing nodes in the official record. In addition, if the current actual number of computing nodes is different from the official record number at the end of the period, the actual actual number of computing nodes is calculated by taking into account the actual number of computing nodes. There may be further reconciliation of the desired computing node and the official record computing node, such as starting to modify the total number of computing nodes to update to the computing node. Module 110 may iteratively perform such periodic reconciliation activities repeatedly, such as each time a specified period of time has passed, each time a change in the minimum amount of computing nodes is requested.

  In addition, the PESSM module 110 may perform other activities to track events that occur for specific computing nodes and specific program execution capacity changes. At least some of the program execution capacity change information may correspond to a dynamic program execution capacity modification initiated by module 110 as part of a periodic or recursive reconciliation activity, and optionally some In such circumstances, program execution capacity change information from the monitoring performed by the PESCMM module 115 (eg, in the program execution capacity of a computing node or group of computing nodes that has failed or would otherwise be unavailable) May correspond to other types of detected changes). Module 110 may conclude causal or other responsibilities for a particular capacity change to a particular event, such as in line with periodic or other recursive reconciliation activities being performed, or alternatively at other times, Automatic determination may be further performed at various points in time.

  While the foregoing exemplary embodiment of FIG. 1A is described with respect to a PES that provides various types of functionality for a variety of users, it is understood that a variety of other embodiments may exist. . For example, in at least some embodiments, a single unused portion of computing node 120 (eg, unused processing unit clock cycle, unused portion of memory, etc.) is one of the first users. The above programs may be made available for use by one or more users, such as sharing a single computing node resource with one or more other users' programs. . In addition, although some embodiments are described in terms of program execution services and program execution capacity, the described techniques manage access to various other groups of computing nodes or other types of computing-related resources. It is understood that it may be used to A non-exclusive list of examples of other types of computing-related resources that may be managed for use by multiple users, such as persistent data storage capabilities (eg, non-volatile storage devices such as hard disk drives), Temporary data storage function (eg volatile memory such as RAM), message queuing and / or passing function, other types of communication functions (eg network socket, virtual communication circuit, etc.), database management function, dedicated bandwidth Or other network related resources, input device functions, output device functions, CPU cycles or other instruction execution functions may be mentioned.

  FIG. 1B illustrates an embodiment in which a program execution service may be provided that uses one or more data centers that include multiple physical computing systems. Specifically, FIG. 1B shows that the PESSM module 180 and the PESCMM module 160 of the program execution service use one of one or more programs on behalf of a user using a variety of computing systems in one or more data centers. FIG. 3 is a network diagram illustrating an exemplary embodiment for managing execution. The illustrated example includes a data center 170 used by the PES, which is connected to the Internet 196 external to the data center 170. In this example, the Internet 196 provides access to a variety of external computing systems, such as a computing system 190 over a private network 194 and a directly accessible computing system 192. Private network 194 may be, for example, a corporate network that is completely or partially inaccessible to private network 194 from external non-privileged computing systems. The computing system 192 may include, for example, a home computing system that connects directly to the Internet (eg, via a telephone or cable modem, a digital subscriber line (hereinafter “DSL”), etc.). In addition, one or more other data centers 198 are illustrated that are connected to the data center 170 via the Internet 196, as may be further used by the PES in at least some embodiments.

  The example data center 170 includes a number of physical host computing systems 175, a physical computing system 182, a PES PESSM module 180, and a PES PESCMM module 160. In this example, the host computing system 175 each provides a plurality of virtual machines as illustrated with respect to the host computing system 175a comprising a plurality of virtual machines 177a and a VM manager component 179a, and the virtual machines ( For example, it has a virtual machine (hereinafter “VM”) manager component for managing a hypervisor or other virtual machine monitor. Other host computing systems 175b may include such components as well, but those other components are not illustrated for brevity and some or all of the computing systems 182 Optionally, one or more such virtual machines and / or VM manager components (not shown) may be included as well. Each of the virtual machines provided by the host computing system makes the first virtual machine computing node on the host computing system part of the first computing node group for the first user and the same When used as a separate computing node for a PES, such as making a second virtual machine computing node on a host computing system part of a second group of computing nodes for a second user There is. Alternatively, in other embodiments, some or all of the physical host computing systems in the data center are otherwise as computing nodes that execute one or more programs on behalf of PES end-user customers. There are cases where virtual machines are not provided at all, such as functioning directly. Furthermore, in some embodiments, the various computing systems 175 and 182 may have different types of user programs (eg, image instances of different sizes of virtual machine software if they have different functions, have different usage-related charges, etc. Or programs with different types of resource conditions and / or computing resource usage, such as different patterns of I / O and memory access and network usage. If so, certain users and / or their programs may be grouped (eg, automatically) according to one or more such factors, and which computing to execute the particular program It may further be used as a constraint and / or preference regarding the choice of system. The exemplary data center 170 further includes an internal network 172 that may include multiple networking devices (not shown) such as switches, edge routers, core routers, etc., including computing systems 175 and 182, PESCMM module 160, and PESSM module. 180 is connected to the internal network 172. Various host computing systems 175 and other computing systems 182 may be arranged in a variety of ways, including being grouped into racks that share a common backplane or other interconnect media. is there. Further, each of modules 160 and 180 may be implemented using one or more computing systems (not shown).

  Exemplary PESSM module 180 and PESCMM module 160 manage the execution of programs on groups of computing nodes provided using computing systems 175 and 182 as described in detail elsewhere. Therefore, at least some of the described techniques are performed. When a particular computing node is selected to execute one or more programs for the user, the PESSM module controls the execution of the program for that selected computing node in some embodiments. , May initiate execution of those programs by interacting with the VM manager component or other manager components, or alternatively, may execute the programs directly on the selected computing node. PES users may use a variety of computing systems to interact with the PESSM module 180, such as computing systems 190 or 192, or computing systems in one of the other data centers 198. is there.

  It will be appreciated that the data center of FIG. 1B is provided for illustrative purposes only, and program execution services or other software execution services may be provided in other manners in other embodiments. For example, the PESSM module 180 and / or the PESCMM module 160 instead uses one or more other computing systems that are external to the data center 170, such as at the computing systems 190, 192 or the data center 198. May be provided.

  FIG. 2A illustrates a computing node provided to execute one or more programs of an exemplary user, such as a technique that may be automatically implemented by an embodiment of a PESSM module and / or a PESCMM module. 1 illustrates an example technique for managing an exemplary group. Specifically, in this example, a particular user (hereinafter referred to as user UUU, not shown in FIG. 2A) may use an alternative to process a request received by a service provided by the running program. A plurality of computing nodes each acting as a copy of a designated program on behalf of a user, such as acting as a computing node (eg, to balance the computing load of a service across a group of computing nodes) Was starting to use the group. As illustrated in the time series graph 210, the user has requested that a group of computing nodes be provided at time T1, and the initial desired number of computing nodes 215a of the group is represented by eight computing nodes. Is specified. Information 250 indicates various user-defined triggers that the user has specified for the group of computing nodes, such as at the time of the initial request. In addition, time series graph 205 illustrates information about two exemplary types of performance characteristics that are tracked for computing nodes and used to determine whether trigger 250 is satisfied, This includes, in this example, the compute node group aggregate average CPU utilization 205a and the compute node group aggregate average network bandwidth utilization 205b.

  In response to an event E1 at time T1, corresponding to a received user request to start providing a set of computing nodes, an exemplary PES (not shown) is initialized according to an initial desired number of computing nodes. Start a group of computing nodes for the user, including eight computing nodes. In addition, the computing node number 225 of the official record of the computing node group is similarly set to 8 computing nodes. However, as shown in the time series graph 210, provision a computing node for use as part of a group of computing nodes, including having a program copy performed by a PES or user on each of the computing nodes. However, since it takes some time to be available, the eight computing nodes are not actually immediately available. Specifically, after the initial time has elapsed after time T1, a change C1 255 in the program execution capacity of the computing node group occurs, which is completed at about time T2 after being started at time T1, This corresponds to the first four of the eight computing nodes becoming available. Accordingly, the actual number of computing nodes 220 tracked by the computing nodes increases from 0 to 4 at that time. In addition, at the same time or shortly thereafter, the time series graph 205 shows that the performance characteristics of aggregate average CPU utilization 205a and aggregate average network bandwidth utilization 205b are tracked based on the operation of the group's available computing nodes. Indicates that will start.

  In this example, the PES (or other third-party system) can perform group computing in a substantially continuous manner so that performance characteristics 205a and 205b and actual computing node number 220 information are maintained in an up-to-date manner. Perform node monitoring. However, in this example, at least some types of dynamic modifications to the number of computing nodes in the group of computing nodes aggregate at least some types of requested modifications during the aggregate period 260, each of which is a desired computing computer. Between the number of computing nodes, the actual number of computing nodes, and the number of computing nodes in the official record 215, 220 and 225, such as performing harmony activities at the end of the total period, etc. Accordingly, an additional change 255 occurs in the number of computing nodes in the computing node group during the first aggregate period 260a. For example, after the change C1 that makes the first four compute nodes available, the next change C2 that is completed approximately at time T3 is the three changes that are made available for use as part of the computing nodes. Corresponds to additional computing nodes.

  However, in this example, the initially requested eighth computing node will not be available in a timely manner, such as due to a hardware failure with the initially selected computing node (or alternatively In this situation, due to the fact that only 7 computing nodes are available at time T1 for use by the computing nodes, the 8th computing node will be activated as soon as it becomes available later. To be added). Thus, event E2 265 is shown to occur immediately after change C2, approximately at time T4, and the PES will revert to the original eighth computing node as needed (eg, frozen in an intermediate state). End and start providing the replacement eighth computing node. As described in detail with respect to FIG. 2B, in this example, the PES has started change C10a at time T1, corresponding to adding an initial eighth computing node, The actual eighth computing node that was added and made available fails to complete, so the change C10a is not reflected in the actual number of computing nodes 220 in the time series graph 210 and is also shown in FIG. 2A. Not. Rather, in this example, event E2 is divided into two separate events E2a and E2b (each not shown) that occur simultaneously or nearly simultaneously. Specifically, in this example, the PES records an event E2a at time T4 corresponding to an eighth computing node that has failed to start correctly (eg, within a specified deadline), and the PES A change C10b (not shown) is automatically started at time T4 to terminate the initial eighth computing node that failed to start correctly. Further, in this example, the actual termination of the initial eighth computing node that occurs as a result of event E2a itself automatically initiates immediate provision of the replacement eighth computing node. Event E2b at time T4. The result of such a series of events and the corresponding change is the other part so that the result from the change of the first event may itself be processed as a second event that causes another change. As described in more detail, may provide various benefits in tracking the interrelationship between events and corresponding change results. Then, based on event E2b, starting at time T4 and completing at time T5, change C3 255 will be available for use by the replacement eighth computing node as part of the computing nodes. Bringing the actual number of computing nodes from 7 to 8.

  Prompted by one of the computing nodes failing or unavailable after the eighth computing node in the group of computing nodes has operated in the intended manner during the aggregate period 260a Thus, another change C4 255 in the actual number of computing nodes 220 occurs at approximately time T7. The corresponding event E3 265 occurs almost simultaneously with the change C4, in which the PES terminates the unavailable computing node as needed, and optionally automatically provides a replacement computing node. Start. Specifically, in a manner similar to that described above with respect to event E2, event E3 is divided into events E3a and E3b (independently not shown) that occur simultaneously or nearly simultaneously in this example. Thus, in this example, the PES records the event E3a corresponding to the computing node that has been detected as unavailable in time T7, and the PES uses the change C4 directly, etc. The activity for terminating the impossible computing node is automatically started at time T7. Further, in this example, the termination of an unavailable computing node that occurs as a result of event E3a is itself a separate event that automatically starts immediate provisioning of the replacement computing node at approximately time T7. Although treated as E3b, in other embodiments and situations, any such provisioning of the replacement computing node is deferred until the reconciliation activity H1 that is performed at the end of the aggregate period 260a. Then, in this example, the change C5 255, which is directly generated by event E3b, returns the actual number of compute nodes to 8, change C5 255 is made available for use by the replacement compute node as part of the compute nodes. Then, it is completed at about time T9. In this example, the official record compute node count 225 is not temporarily updated to accommodate changes C4 and C5, nor the previous changes C1-3, but in other embodiments, the official record compute node. In order to maintain the official record number of compute nodes 225 in a state consistent with the updated actual number of compute nodes 220, some or all such changes may be made. May be updated to reflect. Other computing node capacity availability changes or events, including no specified trigger 250 and no dynamically specified user indications received in this example are aggregate periods It does not occur at all for the remainder of 260a. Thus, at the last time T11 of period 260a, the first set of harmony activities H1 is considered, but the currently desired computing node, the actual computing node, and the official record computing nodes 215, 220, respectively. Since 225 and 225 all match 8 computing nodes, no activity is required. If the change C5 that replaces the unavailable computing node was not implemented during the aggregate period 260a as illustrated in this example, it is not (for example, requested or initiated during the aggregate period 260a) To replace a computing node that is not available at that time (with any other dynamic availability change), it is started as part of the harmonization activity H1 after a total period.

  However, additional events will certainly occur during the second aggregate period 260b. Specifically, event E5 265 is triggered by aggregate average CPU usage 205a with increasing trigger TR-1 250a, as illustrated in the time series graph 205 by the first black ellipse on the average aggregate CPU usage 205a line. Corresponding to the automatic determination by the PES that it is satisfied, it occurs first approximately at time T16. When trigger TR-1 is met, it initiates a request to increase the desired computing node number 215 by four computing nodes for the total requested requested computing node number 215c of twelve (or Alternatively, the updated desired number of computing nodes can be requested to be set to 12 regardless of the current desired number of computing nodes). Similarly, after additional time has elapsed, event E6 265 then triggers TR-N 250c as illustrated in the time series graph 205 by a black ellipse on the aggregate average network bandwidth utilization 205b line. Corresponding to the determination that it has been satisfied by the increased aggregate average network bandwidth utilization 205b, occurs at approximately time T18. When the trigger TR-N is met, a request to increase the desired computing node number 215 by two computing nodes is initiated (or alternatively) for a total of 10 requested desired computing node numbers 215d. Can be requested to set the updated desired number of computing nodes to 10 regardless of the current desired number of computing nodes). After a short additional time has elapsed, event E4 265 occurs at approximately time T19, in which the users associated with the computing node group have a total of 11 requested desired computing node numbers 215b. Providing a dynamically specified request to increase the desired number of compute nodes 215 by three compute nodes (or alternatively, updated regardless of the currently desired number of compute nodes). The desired number of computing nodes can be requested to be set to 11). This request may be made based on a user notification that, for example, the total average CPU usage 205a is high or the total computing load on the computing node group is increasing.

  Finally, just before the end of the aggregate period 260b, prompted by one of the group of compute nodes that have failed or otherwise become unavailable, the additional change C6 is: It occurs at about time T20. A corresponding event E9 occurs almost simultaneously with the change C6, in which the PES terminates unavailable computing nodes as needed. In this example, however, instead of immediately starting to provide replacement computing nodes, the number of computing nodes in the group of computing nodes is reduced based on their harmonized activity, and the replacement computing nodes are Since it is no longer necessary, the PES decides to wait until the near future second set H2's reconciliation activity begins at time T21 (eg, based on the small amount of time remaining until time T21). , Such deferral of providing a replacement computing node is based on the default behavior of any computing node that becomes unavailable during use, etc.). In other embodiments, the PES may otherwise begin providing replacement computing nodes immediately (eg, based on not deferring replacement of computing nodes that are not available in any situation). Do not postpone replacement of computing nodes that are not available in this situation because the desired number of computing nodes is likely to increase rather than decrease as part of the harmony activity H2 To postpone replacing computing nodes that are not available in this situation due to other factors such as the user has already paid for eight computing nodes until later time T3 Not based on etc.). In this example, in a manner similar to that described above with respect to events E2 and E3, event E9 is divided into two separate events E9a and E9b (not separately shown) that occur simultaneously or nearly simultaneously. Thus, in this example, the PES records the event E9a corresponding to the computing node detected to be unavailable at time T20, and the PES uses the change C6 directly, etc. The activity for terminating the impossible computing node is automatically started at time T20. Further, in this example, the termination of an unavailable computing node that occurs as a result of event E9a itself maintains the desired number of computing nodes 215 at the desired number of eight computing nodes 215a. Etc., and is processed at approximately time T20 as another event E9b for initiating a request for an additional computing node in the group to be used as a replacement computing node. In this example, the request for event E9b is processed in a manner similar to events E4-E6 and postponed until the harmony activity H2 performed at the end of the current aggregate period 260b, but in other embodiments and situations Such provision of replacement computing nodes may instead be initiated immediately. In addition, in this example, the number of compute nodes 225 in the official record is not updated to accommodate change C6 in a manner similar to that described above for changes C4 and C5, but in other embodiments, The number of compute nodes 225 in the record may be updated to reflect such changes.

  Thus, at the end of the second aggregate period 260b, a harmony activity H2 is initiated, which in this case is a dynamic modification to the computing nodes. Specifically, the PES in this example aggregates the requested modifications corresponding to the various requested desired compute node numbers 215b, 215c, 215d, and 215a for events E4, E5, E6, and E9b. To determine the dynamic total count correction for the desired eight computing node counts 215a, so that the dynamic total count correction in this example corresponds to the updated current desired twelve computing node counts 215e. An increase of four additional computing nodes (based on taking the maximum of the requested number modification). In other embodiments, the dynamic total count correction selects the dynamic total count correction to maintain the previous desired computing node number 215a according to event E9b (eg, current actual computing node). To increase the requested number of events E4-E6 to a minimum (e.g., increase the number of computing nodes from the current desired number of computing nodes). Aggregating the requested number modifications of events E4 to E6, so as to average the requested number modifications of events E4 to E6 (eg, an increase of 3 computing nodes from the currently desired computing node). (E.g., 9 from the current desired number of computing nodes) Take the highest priority of the requested number modification of events E4 to E6 (e.g., higher priority than the user instruction of E4 satisfies the triggers of events E5 and E6, for example) Take the first request or the last request of the requested number modification of events E4-E6 (which is an increase of 3 computing nodes from the current desired number of computing nodes) (e.g., current It may be determined in other ways, such as an increase of 4 or 3 computing nodes, respectively, from the desired number of computing nodes). In some embodiments and situations, the user instruction event has a higher priority than the event that satisfies the trigger (eg, if the user instruction always overrides any requested dynamic modification from the event that satisfies the trigger): The PES further in this example, after the user command event is received, during the aggregate period, so that all events that satisfy the trigger are ignored (or never determined) after the user command is received for event E4. May prevent an event that satisfies the additional trigger from occurring. Further, in this example, the current actual computing node number and the official record computing node numbers 220 and 225 differ from the 7 and 8 computing nodes, respectively, at the time of the harmony activity H2. Thus, as part of the harmonization activity H2, the PES is for the compute nodes to rise from 7 current actual compute node numbers to 12 new updated desired compute node numbers. Begin providing 5 additional compute nodes and update the official record compute node count 225 to match the 12 new updated desired compute node count. Thus, in this example, a change in capacity availability of five computing nodes follows event E9b by replacing one computing node that became unavailable with respect to change C7, as well as event E4. , Generated indirectly by an increase of four additional computing nodes corresponding to the total count correction determined from E5 and E6.

  During the third grand total period 260c, additional events and computing node capacity availability changes further occur. Specifically, change C7 is completed at approximately time T22, in which the number of currently available computing nodes reflects the five additional computing nodes that have become available at time T21. Thus, it is increased by 5 to a total of 12 computing nodes, and the actual number of computing nodes 220 is updated accordingly. As shown in the time series graph 205, both the aggregate average CPU utilization 205a and the aggregate average network bandwidth utilization 205b decrease after change C7, and the aggregate average CPU utilization 205a decreases rapidly, specifically, In the example, the aggregate average CPU usage 205a eventually falls below a 20% threshold corresponding to the condition specified for trigger 250b and generates event E8, which includes a determination that trigger TR-3 250b has been met. In the time series graph 205, the second black ellipse on the total average CPU utilization 205a line is illustrated in the figure. When the trigger is met, it initiates a request to reduce the desired number of compute nodes 215 by two compute nodes for a total of 10 requested desired compute nodes 215f (or alternatively, Regardless of the desired number of computing nodes, it can be requested that the updated desired number of computing nodes be set to 10).

  Eventually, an additional change C8 is prompted and occurs by one of the group of computing nodes that have failed or become unavailable, approximately just before the end of the aggregate period 260c at time T28. A corresponding event E10 occurs almost simultaneously with change C8, in which the PES terminates unavailable computing nodes as needed. In a manner similar to that of change C6, the PES in this example does not immediately start the replacement of unavailable computing nodes, but the third set H3 reconciliation activity begins at time T31. (E.g., event E8 allows the desired number of computing nodes in the computing node group to be reduced or increased at that time), but other In an embodiment, the PES may not, and may immediately begin providing replacement computing nodes. Specifically, in a manner similar to that described above with respect to events E2, E3, and E9, event E10, in this example, occurs in two separate events E10a and E10b (not separately shown) that occur simultaneously or nearly simultaneously. ). Thus, in this example, the PES records the event E10a corresponding to the computing node detected to be unavailable at time T28, and the PES uses the change C8 directly, etc. The activity for terminating the impossible computing node is automatically started at time T28. Further, in this example, the termination of an unavailable computing node that occurs as a result of event E10a itself maintains the desired number of computing nodes 215 at the desired number 215e of 12 computing nodes. Etc., processed at approximately time T28 as another event E10b that initiates a request for a group of additional computing nodes for use as a replacement computing node. In this example, the request for event E10b is processed in a manner similar to event E9b and is postponed until the harmony activity H3 performed at the end of the current aggregate period 260c, but in other embodiments and situations, the replacement Such provisioning of computing nodes may instead be initiated immediately. In addition, in this example, the official record number of compute nodes 225 is not updated to correspond to change C8 in a manner similar to that described above for changes C4-C6, but in other embodiments, The number of compute nodes 225 in the record may be updated to reflect such changes.

  Therefore, at the end of the third total period 260c, the harmony activity H3 is started, resulting in a change to the computing node group. Specifically, the PES in this example aggregates the requested modifications corresponding to the events that occurred during period 260b, in this example only events E8 and E10b, and has been updated to the currently desired 10 It is determined that the dynamic total count correction is to be performed on the preceding desired twelve computing node counts 215e, which in this example would reduce the number of computing nodes by two to correspond to the computing node count 215g. In addition, the current actual number of compute nodes and the official record number of compute nodes 220 and 225 differ from the 11 and 12 compute nodes, respectively, at the time of the harmony activity H3. Therefore, as part of the harmonization activity H3, the PES will remove one of the existing computing nodes from the computing node group, taking into account that the current actual computing node limit is 11. Start changing the current official 12 compute node count to reach the actual desired 10 compute node count (e.g., optionally completing some or all operations already started) Later, the execution of the program on the deleted computing node is terminated, making the computing node available for other future use by other users). Thus, in this example, the capacity availability change of deleting one of the existing computing nodes at time T31 is due to the termination of one group computing node for event E10b as well as event E8. This is indirectly caused by the requested decrease in the two computing nodes corresponding to. The PES further updates the official record compute node count 225 to match the new updated desired 10 compute node count. Immediately after T31, the last change C9 is completed at approximately time T32, in which the number of currently available computing nodes is the number of computing nodes that began to be removed from the computing node group at time T31. As reflected, it is reduced by one to a total of 10 computing nodes, and the actual number of computing nodes 220 is updated accordingly. In other embodiments, the change C9 occurs at a substantially immediate time T31 after determining to make the change, such as when the deleted computing node is immediately excluded from further activity of the computing nodes. In some cases, however, the deleted computing node is temporarily running and available to continue performing the operation.

  In addition, although the harmony activities H1, H2, and H3 are illustrated in this example as occurring at a single point in time, some or all of the harmony activities may actually occur over a period of time, and even more May have other effects that continue over time. For example, in at least some embodiments, any or all changes to the program execution capacity of a group of computing nodes initiated by a PES may result in a temporary lockdown period, and at least some other Types of events or changes may not be possible. As the program execution capacity change indicated by the PES, which may cause such a lockdown, for example, an increase and / or decrease in program execution capacity initiated as part of the harmonization activity (eg, adding new computing nodes) , Reduce existing computing nodes, etc.) and / or program execution capacity changes that are initiated immediately in response to a PES decision (eg, computing node failure, receipt of user instructions, user-specified triggers are met) Etc.). Such lockdowns may have various types of time periods (for example, until an added computing node has a specified result or occurrence, such as until the added computing node is available). In some embodiments, it may vary based on the type of change initiated by the PES. During such lockdown, at least some types of events or changes do not allow a user-specified trigger to be met during the lockdown period (or ignore any such trigger being met) And / or does not allow user commands to be accepted during lockdown periods (or by ignoring any such user commands), etc. Further, in some embodiments, the user associated with the compute node group is similarly locked, such as a specified amount of cooling period that follows lockdown or otherwise becomes valid at other times. A cooling period operating in a manner similar to the down manner may be specified as well. Similar to lockdown, during the cooling period, at least some types of events or changes do not allow a user-specified trigger to be met during the cooling period (or any such trigger has been met). May not be possible). It is understood that users and / or PES may control modifications to computing nodes in other manners in other embodiments.

  Thus, in this manner, the PES manages the program execution capacity provided to the user by the group of computing nodes, including performing various dynamic modifications to the group of computing nodes based on various situations. Operate as follows. The events and changes illustrated in FIG. 2A are provided for illustrative purposes, and it is understood that the actual events, changes, and other operations of the PES may differ in other embodiments and situations. .

  FIG. 2B is an example of a technique for automatically concluding causal information to the dynamic computing node number correction described above with respect to FIG. 2A, such as a technique that may be automatically implemented by an embodiment of the PESSM module. Illustrate. Specifically, FIG. 2B illustrates two exemplary database table data structures that store information corresponding to some of the information illustrated in FIG. 2A, and the exemplary table 280 of FIG. A variety of information regarding the change in availability of the exemplary computing node capacity that occurred in the exemplary computing node group of FIG. 2A (referred to as “Group 1” in FIG. 2B) is stored, and the exemplary computing node of FIG. The table 290 stores a variety of information regarding exemplary events that occurred in the exemplary computing node group “Group 1” of FIG. 2A.

  The example table 280 includes various rows or entries 285a-285k, each corresponding to one of the exemplary changes C1-C10 described with respect to FIG. 2A, and the various fields or columns 280a-280x are Illustrated in each row. Specifically, in this example, each row includes a unique identifier (hereinafter “ID”) 280a, an ID 280b of an applicable computing node group corresponding to the change, a type 280c of program execution capacity change, and a program execution capacity change type. Intended result indication 280d, various details about the change 280e, start and end times 280f and 280g of the change, a total period 280h (in this example, the end of the total period in which the change occurs or otherwise the change is associated) The change event binding ID 280x, and optionally various other information. As one illustrative example, row 285a corresponds to group C change C1, which is responsible for the increase of four computing nodes completed at time T02 during aggregate period H1. Responds to changes in numbers. The other lines contain similar information.

  The example table 290 includes various rows or entries 295a-295m, each corresponding to one of the exemplary events E1-E10 described with respect to FIG. 2A, and the various fields or columns 290a-290x are each row. Is exemplified. Specifically, in this example, each row includes a unique identifier (hereinafter “ID”) 290a, an ID 290b of an applicable computing node group corresponding to the event, an event type 290c, and information 290d about the source of the event. , The event time 290e, the total period 290f (in this example referred to based on the harmonized activity performed at the end of the total period), the change event binding ID 290x, and optionally Includes a variety of other information (eg, specific users associated with received user instructions). As an illustrative example, row 295h corresponds to group E event E4, which requests that the desired number of computing nodes in group 1 be increased by three computing nodes, during the aggregate period H2. Corresponds to the user command received at T19. The other lines contain similar information.

  In the example of FIG. 2B, the change event binding ID information 280x and 290x in the tables 280 and 290 reflects the causal relationship information that is concluded to reflect the relationship between the change and the event. Specifically, in this example, if the rows of tables 280 and 290 share a common value for change event binding ID information 280x and 290x, reflect the concluded causal relationship between the corresponding event and the change. To do. As an example, as described above with respect to FIG. 2A, event E3b corresponds to providing a replacement computing node for a computing node that has become unavailable, resulting in the addition of a computing node to the group. Can be directly attributed to the change C5 corresponding to. Thus, row 295e (corresponding to event E3b) and column 285g (corresponding to change C5) share a common binding identifier.

  In contrast, change C7, corresponding to the addition of five computing nodes initiated during harmony activity H2, does not have a single event that can be directly attributed to that change. Specifically, events E4, E5, and E6 each request a dynamic modification for Group 1 that prompts the addition of four of the five computing nodes for change C7. , Aggregated and used in combination. Thus, rows 295f-295h (corresponding to events E4-E6) and row 285i (corresponding to change C7) all share a common binding identifier. Further, in the example of FIG. 2A, one of the five computing nodes added as part of change C7 is a replacement node for the computing node that has become unavailable with respect to change C6, and the replacement computing The start of the node corresponds to event E9b. Thus, row 295j (corresponding to event E9b) and column 285i (corresponding to change C7) also have the same common binding identifier. In other embodiments, event E9b separate from providing four additional computing nodes corresponding to events E4-E6, such as providing a replacement computing node immediately replaces an unavailable computing node. The corresponding change occurs before the end of the period 260b and the resulting reconciliation activity H2 and is shown separately in the table 280, the event E9b and its additional change is a separate corresponding combination Share the identifier. In addition, the five compute nodes added for change C7 are shown in a manner aggregated in a single row in table 280, but in other embodiments, each compute node added is , Represented in separate rows 285 of table 280, in which case each share the same binding identifier N 7 that is currently illustrated only in row 285 i of aggregated change C.

  Further, in this example, not only based on dynamic user instructions and / or satisfied user triggers, but also based on inadvertent changes to the number of computing nodes (e.g. computing node failure or unavailable) As such, changes corresponding to dynamic modifications to the number of computing nodes are tracked in table 280. Such changes are detected based on activity monitoring and are exemplified as events that trigger additional changes (eg, provision of a replacement computing node), but in other embodiments such changes are It may be handled in other ways, such as not tracking and / or not processing system-initiated replacement activities as events. Further, the change event binding information in tables 280 and 290 is indirect to changes that can be directly attributed to one or more corresponding events (eg, events that immediately initiate those changes) and one or more corresponding events. Changes that can be attributed to each other (eg, events that are aggregated together and combined, such as during a harmony activity, initiates those changes), but in other embodiments, such Information may be further tracked.

  As mentioned above, the attribution of responsibility for a particular dynamic program execution capacity modification for a group of computing nodes can vary, including providing an explanation to the user associated with the group of computing nodes why the change occurred. May provide a significant benefit. Such responsibility attribution information may indicate which event is responsible for a specific indicated program execution capacity modification or other change in availability of one or more computing nodes in the group and / or which program execution. For various types of queries received from a user or other source, such as a request to identify whether a capacity modification or other computing node availability change occurs due to one or more indicated events In response, it may be further generated and / or used. As described with respect to FIG. 2B, the combined information illustrated in tables 280 and 290 provides one mechanism for tracking and providing responsibility attribution information. For example, with respect to adding five computing nodes corresponding to change C7 in FIG. 2A, the user may want to know why five computing nodes were added (eg, in particular adding three computing nodes). In view of the user command of event E4). By using the combined information illustrated in FIG. 2B, a PES or other system can easily automatically generate a human-readable description. For example, in response to a user request regarding the cause of adding four computing nodes corresponding to change C1 of FIG. 2A, the PES or other system may, for example, “change C01 occurred directly by event E01 at time T1. The event E01 was a request from the user UUU to start a group of 8 computing nodes. This information uses join information 280x from row 285a corresponding to change C1 to identify row 295a of table 290 corresponding to event E1, and extracts information from rows 285a and 295a in the desired manner. However, it may be generated based on formatting (for example, a format based on a user request or a preference setting of a preceding user, a format based on a PES default, etc.). Similarly, in response to a user request as an effect of a user instruction E1 to start a group of eight computing nodes, PES or other system, for example, “Event E01 at time T1, changes C01, C02 and C03. Change C01 was the addition of four computing nodes starting at T1 and ending at time T2. Change C02 was the addition of three computing nodes starting at T1 and ending at time T3 The change C03 was an addition of one computing node that started at time T1 and was not completed. " As another example, in response to a user request as a cause of adding five compute nodes corresponding to change C7 of FIG. 2A, PES or another system may, for example, “change C07 during T11 to T21. Indirectly triggered by events E05, E06, E04, and E09b that occurred at time 4. Event E05 was a request for four additional computing nodes based on the trigger TR-1 being satisfied. Was a request for two additional computing nodes based on the trigger TR-N being satisfied, and event E04 is a request for three additional computing nodes based on dynamic user input instructions from the user UUU. Event E09b is a group that has become unavailable Based on the automatic termination of the computing nodes may indicate that it was a request for one substituted computing nodes. ". In addition to or in lieu of such text strings, liability attribution information is further generated periodically or in other scheduled formats in a variety of other formats such as automatic reports (eg, tables, diagrams, etc.) There is a case. It is understood that such responsibility attribution information may be generated and used in a variety of other ways in other embodiments.

  Information regarding the events and changes illustrated in FIG. 2B is provided for illustrative purposes, and the stored information and storage of such information may be implemented in a variety of other ways in other embodiments. It is understood that there is. In addition, the PES has various additions for users and computing nodes in other embodiments, such as having additional tables to store information such as user-defined triggers, monitored performance measurement information, user accounts, etc. Types of information may be stored.

  In addition, the above examples of FIGS. 2A and 2B are provided for illustrative purposes, and other embodiments may differ from the examples in various ways. For example, program execution capacity is measured based on the number of computing nodes in these examples, such as when various available computing nodes are treated as equivalent (eg, having equivalent computing resources), Although modified, the various available computing nodes are of different types with varying characteristics (eg, different amounts of processing capacity, memory, platform specifications, etc.) and / or program execution capacity is computing. Other embodiments are provided that are tracked in a manner other than the number of nodes. In some such embodiments, the various requests may include one or more specific types of computing nodes for use in the group of computing nodes selected to execute the program associated with the request. Instructions may be included, and those requests may only be accomplished on the corresponding specified type of computing node.

  In addition, in at least some embodiments, the PES or other system may further perform other types of activities as part of managing a group of computing nodes. For example, as described above, a PES or other system may decide to add or remove a computing node from a group of computing nodes at various times, and one or more triggers satisfied during the period And / or any time in response to satisfying a user command or trigger designated or determined to have immediate effect during the last reconciliation activity of the aggregate period in response to a user command received during the period In response to automatic activity of the PES or other system, such as replacing a failed computing node and / or terminating and deleting a computing node that is prohibited from performing ongoing operations Including at times. In at least some embodiments, the PES or other system may further consider other factors when determining the exact timing for at least some such computing node group modifications. For example, in a situation where a user is responsible for using a given number of computing nodes for a given time period (eg, already charged for X computing nodes the next time) Such information may be used to determine timing for at least some types of modifications to the computing nodes. If the PES or other system determines to reduce the number of compute nodes in the group to less than X, the PES or other system will not reduce the number of compute nodes to less than X for a given period of time. It may be determined to wait until near the end or the end (for example, the end of the time when the user is already charged). Similarly, if a group of compute nodes fails near the point in time when a new harmonious activity is performed (eg, near the end of the period when the requested compute node count correction is aggregated), the PES or other The system may update the actual number of nodes and optionally the number of nodes in the official record to reflect the failure, but may decide not to start adding replacement computing nodes immediately, in this manner If the total number of requested compute node modifications during the harmonization activity determines that the group compute node count should be reduced by one or more compute nodes, then terminating the group's existing compute nodes Reduce the number of failed compute nodes It may use as one that.

  In some embodiments, a PES or other system may simultaneously manage multiple distinct types of modifications of computing nodes. As an example, a group of computing nodes may be currently managed to a desired number of computing nodes using computing nodes at a single location, but a user may It may be determined to specify a second type of metric for a group of computing nodes such that a specified desired subset is located at a separate second location. In that case, the PES or other system incrementally adds any new computing nodes to the group at the second location until the desired value of the second metric is reached, and is at the first location. The first location to allow a replacement computing node to be added to the group at the second location by incrementally removing any existing computing node from the group, or alternatively May be manipulated to meet the desired value of the second metric in a variety of ways, including by immediately terminating existing computing nodes from a group. Such incremental additions and / or deletions reduce the number of computing nodes in response to dynamically specified user instructions and / or satisfied user-specified triggers that replace unavailable computing nodes. It may be triggered in any of the ways detailed in other parts, including modifying etc. In addition, the number and location of computing nodes are balanced simultaneously in this example, but various other types of changes can be made in a similar manner (eg, based on different types having different related amounts of computing resources, etc. , To change an existing computing node from the first type to the second type). Further, program execution capacity modifications are performed by changing the number of computing nodes in some examples, but in other embodiments, such capacity modifications are performed on one or more computing nodes of the group. May be done by changing the program execution capacity (e.g., by replacing the first computing node with a second computing node having virtually one or more types of computing resources of interest, Etc.) by modifying the amount of one or more computing resources available to one of the computing nodes that are already part of the group.

  As described above, various types of functions may be provided and used by PES in various embodiments, and functions may be provided in various ways. For example, in some embodiments, program execution capacity available from a PES is interconnected via one or more networks or other data exchange media capable of transmitting data between computing machines. It may include multiple computing nodes for executing programs on behalf of a user, such as through multiple physical computing machines. At least some of the computing machines, in some embodiments, each include sufficient computing-related resources (eg, sufficient writable memory, non-volatile storage, CPU, to execute multiple programs simultaneously). Cycle or other CPU usage measurement, network bandwidth, swap space, etc.), at least some of the computing machines in some such embodiments each have one or more of them on behalf of a separate user It may host multiple virtual machine computing nodes that may each execute a program. Further, in various embodiments, the PES may execute various types of programs on behalf of multiple users. For example, such a program executed on behalf of a user may include one or more operating systems, applications (eg, servers and / or other software applications), utilities, libraries, etc. In addition, at least In some embodiments, such programs are bootable or loadable on one or more virtual machine computing nodes, each operating system software, software for one or more application programs, and / or Or, it may include executable software images, such as virtual machine images, which may include configuration information.

  In at least some embodiments, execution of one or more programs on a group of one or more computing nodes by a PES is initiated in response to a current execution request for immediate execution of those programs There is. Alternatively, initiation may be based on a previously received program execution request that schedules or otherwise reserves future future execution of those programs for the current time. A program execution request can be automated from the user (eg, via an interactive console or other GUI provided by a program execution service) or automatically executing one or more other programs or other instances of itself. In some cases, it may be received in a variety of ways, such as from a running program of a user that starts automatically (eg, via an API provided by a program execution service, such as an API using a web service). A program execution request is an executable or other copy of the program to be executed, an indication of the program previously registered or entered for execution, and several instances of the program to be executed simultaneously (eg, a single desired As several instances, as a minimum and maximum number of desired instances, etc.), and various other types of detailed settings and / or requirements for execution of one or more programs (eg, resource allocation, execution of Including diverse information used at the start of execution of one or more programs, such as geographical and / or logical location, execution proximity to other programs and / or computing nodes, timing relationships, etc.) There is.

  After receiving a request to execute one or more instances of the program at the indicated time, the PES may determine one or more computing nodes to use in the group to execute the program instance. . In some embodiments, the determination of the computing node to be used is performed at the time of the request, even for future executions. In other embodiments, the determination of the computing node used for future execution of one or more program instances is postponed until a later time, such as a future time of execution based on information currently available. May be. In some embodiments, determining which computing node to use for executing one or more programs on behalf of a user is determined when the user subscribes and / or registers to use the PES, and It may be done prior to the request to execute, such as another time prior to the request to execute the program for the user. For example, in some such embodiments, one or more computing nodes may be associated with any time during the period, such as any time a request to execute software for a user is received during the period. May be associated with a user for a period of time, such as running on behalf of that user on a computing node. In addition, in some embodiments, determining which computing node to use to execute the program on behalf of the user can be performed, for example, by the computing node being unused and / or otherwise executing the program. Of one or more computing nodes and / or one or more computing nodes, such as executing a program of one or more pending requests on one or more computing nodes when available to This may occur when computing resources become available to execute programs for the user.

  The determination of which compute node to use for the execution of each program copy or instance is based on any detailed settings and / or requirements specified in the request or otherwise specified in the program and / or associated user. This may be done in a variety of ways, including based (for example, during registration). For example, when a preferred and / or necessary resource condition for execution of a program instance is determined (eg, memory and / or storage, CPU type, cycle or other performance metric, network capacity, platform type, etc.) The determination of a computing node suitable for executing a program instance may be based at least in part on whether the computing node has sufficient resources available to satisfy those resource conditions. is there. Additional details regarding running and configuring a program on a program execution service can be found in pending US patent application Ser. No. 11 / 395,463, filed Mar. 31, 2006, “Managing Execution of Programs by Multiple Computing Systems. Is incorporated herein by reference in its entirety.

  In some embodiments, the fee may be associated with the use of the PES so that the PES may execute a program for that user in exchange for payment of one or more fees by the user. For example, in some embodiments, based on one or more of several processing units, the amount of memory, the amount of storage, the amount of network resources, etc. assigned to execute the user's program Etc., a fee may be charged to a user based on the amount and / or type of program execution capacity allocated to execute one or more programs on behalf of the user. In some embodiments, the fee is various characteristics of the computing resources used to execute the program, such as based on CPU capability or performance, platform type (eg, 32 bit, 64 bit, etc.), etc. Or other factors. In some embodiments, the fee is the price per use of the service, the price per unit of time that the computing service was used, the price per storage device used, per data received and / or transmitted. There are cases where charges are made on the basis of various usage factors such as price. In at least some embodiments, as described in detail below, the fee is based on a variety of other factors, such as various characteristics of program execution (eg, continuity of execution, fault tolerance, etc.) There is. In at least some embodiments, the PES provider presents one or more of various tariffs, types and / or levels of services, or functions for executing programs on behalf of multiple users And in some such embodiments, the various charges may be associated with various charge bands, types and / or levels of services. In addition, for example, a charge for a first amount of program execution capacity functionality is charged in a first fee zone (eg, up to a specified first threshold of the computing node being used) and second Charge for a second rate zone (eg, lower price range) for the amount of program execution capacity functionality (eg, the specified compute node being used from the specified first threshold) The fee zone may be used for certain types of functions provided by the PES, such as (to a second threshold). Additional details regarding the various fees associated with the program execution service are included in pending US Patent Application No. 11 / 963,331, filed December 21, 2007, “Providing Configurable Pricing for Execution of Software Images”, by reference. The entirety of which is incorporated herein.

  In addition, various other types of functions may be provided and used by the PES in various embodiments, as described in detail elsewhere.

  FIG. 3 is a schematic diagram illustrating an exemplary embodiment of a system suitable for implementing techniques for managing groups of computing nodes for multiple users. Specifically, FIG. 3 illustrates a server computing system 300 suitable for providing at least some functions of a program execution service, as well as various client computing systems that may be used by users of the program execution service. 350 illustrates a computing node 360 that may be used by a program execution service, and other computing systems 380. In the illustrated embodiment, the server computing system 300 has components that include a CPU 305, various I / O components 310, a storage device 320, and a memory 330. Illustrated I / O components include a display 311, a network connection 312, a computer readable media drive 313, and other I / O devices 315 (eg, keyboard, mouse, speakers, etc.). In addition, the illustrated user computing system 350 has components similar to those of the server computing system 300, including a CPU 351, I / O components 352, a storage device 354, and a memory 357. Other computing systems 380 and computing nodes 360 may each include components similar to some or all of the components illustrated with respect to server computing system 300, but such components are It is not illustrated in this example for brevity.

  An embodiment of the program execution service system manager module 340 is executing in the memory 330 and is running on a network 390 (eg, via the Internet and / or the World Wide Web, via a private cellular network, etc.). Interaction with computing systems 350 and 380 and computing node 360. In this exemplary embodiment, the PESSM 340 enables the use of multiple computing nodes 360 by various users (not shown) interacting with the user computing system 350, such as with program execution services managed by the PESSM 340. Includes functions related to management. Other computing systems 350 and 380 and computing node 360 may be running a variety of software as part of their interaction with PESSSM. For example, the user computing system 350 may be configured and / or configured to execute programs on behalf of a user of those systems on one or more computing nodes 360 in various ways, as described in detail elsewhere. Run software in memory 357 to interact with PESSM 340 (eg, as part of a web browser or specialized client-side application program), such as to request and perform various other types of operations May have. Configuration for executing a program on behalf of a plurality of users, information 322 regarding execution and / or registration, information 324 regarding modification of program execution capacity of a group of computing nodes (for example, information regarding a predefined user-specified trigger, Information about dynamically specified capacity modification instructions from the user, information about computing node performance measurements and other information about determining whether a specified trigger has been met, desired, actual, and Information about the attribution of causal associations of a particular program execution capacity modification of a particular computing node group (eg, computing of at least some events and groups occurring) Few for nodes A variety of information regarding the functionality of the PESSM module 340, such as by listing a number of changes and associating specific events with specific changes, such as in a manner similar to that described in FIG. 2B and elsewhere May be stored in the storage device 320.

  After the PESSM module 340 receives a request (or other indication) to execute one or more programs on the group of one or more computing nodes 360, the PESSM module 340 receives the request from the group of one or more computing nodes 360. And start execution of the programs on those computing nodes 360. In addition, the PESSM module 340 further transfers one or more of the programs to one or more other computing nodes 360 or computing systems 380 that later terminate execution of the program initiated on the computing node. It may interact with computing node 360, such as for migration. The computing node 360 has various forms in various embodiments, such as including several physical computing systems and / or several virtual machines running on one or more physical computing systems. There is a case. In some embodiments, server computing system 300 and computing node 360 may be part of a data center or other group of co-located computing systems, or may be a computing node in a private network. is there. In addition, in some embodiments, the PESSM module 340 is provided by one or more third party participants whose computing system 380 is providing a computing node for use by other users. As such, it may interact with one or more other computing systems 380 to initiate or terminate execution of one or more programs on those computing systems. In some embodiments, the PESSM module 340 may additionally or alternatively manage access to one or more types of computing-related resources or services other than program execution services (eg, persistent or temporary). Data storage services, messaging services, database services, etc.).

  In addition, an embodiment of the program execution service capacity maintenance manager module 345 is executing in the memory 330 and in this embodiment interacts with the computing node 360 over the network 390. Specifically, in this exemplary embodiment, the PESCMM module 345 includes functions related to monitoring or interacting with one or more of the computing nodes 360, and the current actual program of the computing nodes. Track usage of the computing nodes, such as determining execution capacity and / or determining current performance characteristics corresponding to some or all of the computing nodes in the group. As mentioned above, such information may be stored in storage device 320 and / or elsewhere and may be used by modules 340 and 345 in various embodiments. For example, in some embodiments, module 345 finds that a computing node has failed or is unavailable (eg, the computing node is being used as part of a group of computing nodes). After that, module 345 provisions the computing node to be used as part of the computing node group, such as provisioning or otherwise starting the computing node), There is a case where an operation of replacing a wing node is automatically performed. In other embodiments, the module 345 is instead instead from another source to the current actual program execution capacity of the computing nodes and / or to some or all computing nodes of the computing nodes. Module 345 performs some or all of the compute node monitoring, such as maintaining the compute node's program execution capacity appropriately when it obtains information about the corresponding current performance characteristics May not.

  It will be appreciated that computing systems 300, 350 and 380 and computing node 360 are exemplary only and are not intended to limit the scope of the invention. Each computing system and / or node includes a plurality of interacting computing systems or devices, the computing system / node being through one or more networks, such as the Internet, via the web, or privately. It may be connected to other devices not illustrated, including via a network (eg, a mobile communication network, etc.). More generally, a computing node or other computing system is a desktop or other computer, database server, network storage and other network devices, PDA, mobile phone, wireless phone, pager, electronic notebook, Internet Functions of the type described, including but not limited to equipment, television-based systems (eg, set-top boxes and / or personal / digital video recorders), and a variety of other consumer products including appropriate communication capabilities It may comprise any combination of hardware or software that may interact and implement these. In addition, the functionality provided by the illustrated modules 340 and / or 345 may be distributed to additional modules in some embodiments. Similarly, in some embodiments, some of the functions of modules 340 and / or 345 may not be provided and / or other additional functions may be available.

  Also, although various items are illustrated as being stored in memory or storage while in use, these items or portions thereof may be stored in memory or other for purposes of memory management and data integrity. May be transferred to or from the storage device. Alternatively, in other embodiments, some or all of the software modules and / or systems execute in memory on another device and communicate with the exemplary computing system via communication between the computers. There is a case. Further, in some embodiments, some or all of the systems and / or modules are one or more application specific integrated circuits (ASICs), standard integrated circuits, controllers (eg, execute appropriate instructions). (Including microcontrollers and / or embedded controllers), field programmable gate arrays (FPGAs), complex programmable logic devices (CPLDs), etc., including but not limited to firmware and / or hardware, etc. May be implemented or provided in other ways. If some or all of the modules, systems, and data structures are also stored on a computer-readable medium, such as a hard disk, memory, network, or portable media product that is read by a suitable drive via a suitable connection (E.g., as software instructions or structured data). Systems, modules, and data structures may also be transmitted as data signals generated on a variety of computer readable transmission media including wireless and wire / cable based media (e.g., carrier waves, or other As part of an analog or digital propagation wave, it may take a variety of forms (eg, as part of a single or multiple analog signal, or as multiple discrete digital packets or frames). Such computer program products may also take other forms in other embodiments. Thus, the present invention may be practiced with other computer system configurations.

  FIG. 4 is a flow diagram of an exemplary embodiment of a program execution service system manager routine 400. The routines assist in managing the use of a group of computing nodes for a user, and perform other types of management operations in some situations, for example, PESSM module 110 of FIGS. 1A and 1B, respectively. And / or 180, and / or may be provided by execution of the PESSM module 340 of FIG. In this illustrated embodiment, the routine 400 manages various aspects of the use of program execution services that provide program execution capacity for executing programs on behalf of multiple users.

  In the illustrated embodiment, the routine begins at block 405 and information or a request is received. The routine continues at block 410 to determine whether the received request or information is associated with initiating execution of one or more programs on a group of computing nodes, such as a request from a user. If so, the routine continues to block 415 where the desired desired amount of program execution capacity of the computing nodes, eg, the desired number of computing nodes, information about the requested program execution, 1 Information about one or more programs (optional) and information about one or more user-specified capacity correction triggers (optional) are obtained. As described elsewhere, in some embodiments, a user may select from one or more of various types of computing nodes and / or various amounts of computing resources desired and / or / Or type may be specified (eg, processing unit type / amount, memory amount, platform specification, etc.). At block 420, the routine then selects a computing node to be used in the group, and at block 425 provisions the selected computing node and optionally initiates execution of one or more programs to be executed. To begin making those selected computing nodes available to the user. The routine also specifies the desired program execution capacity of the group's selected computing node as the program execution capacity of the group's initial official record. When a computing node is available for use on behalf of a user, the user may be notified of availability in a variety of ways, or in other embodiments, the computing node may be further reciprocated by the user. It may operate in an automated fashion without acting. The routine then continues to block 430 and stores information about the computing node group, including any user-specified triggers for the group.

  Otherwise, if it is determined at block 410 that a request to start execution of the group of computing nodes has not been received, the routine instead continues to block 440 to modify the program execution capacity of the existing group of computing nodes. Determine if a request about what to do has been received. If so, the routine continues to block 445 and receives and stores dynamically specified user instructions relating to modifying program execution capacity for the indicated existing group of computing nodes. In the illustrated embodiment, the user instructions are aggregated with other possible program execution capacity modification requests that occur during the current aggregate period, such as with respect to blocks 465-477, during the next time the harmonization activity is performed. Although further processing may occur, in other embodiments, at least some such user-specified modification requests may instead be performed immediately.

  If, instead, at block 440, a request to modify the program execution capacity of the group of computing nodes is not received, the routine instead continues to block 460 to request a program execution capacity modification request for such group of computing nodes. At the end of the total period, etc., it is determined whether a periodic or recursive reconciliation activity for the program execution capacity of one or more computing nodes is currently performed. If so, the routine continues to block 465 to determine one or more computing nodes that are currently performing the harmonization activity (eg, the aggregation period ends and one or more dynamic program execution capacity modifications are aggregated). Block 467, starting from the beginning, the next determined computing node group is selected. The routine then continues to block 470 and performs a recursive capacity reconciliation activity, an example of such a routine is described in detail with respect to FIG. The routine then continues to block 475 and executes a routine that performs activities relating to causal attribution to program execution capacity modifications performed at block 470, an example of such a routine is described in detail with respect to FIG. After block 475, the routine continues to block 477 to determine if there are more compute nodes that are determined to be processed, and if so, the routine continues to block 467 and is determined as such. Select a computing node group.

  Instead, if at block 460 it is determined that no periodic or recursive reconciliation activity is currently undertaken with respect to the program execution capacity of one or more computing nodes, the routine instead continues to block 480 with one or more The other indicated operations are optionally performed. Such operations may include user requests relating to performing other types of program execution, such as executing a single program on a single computing node (such as provided program execution services such as other A program execution capacity modification request specified by a user (for example, when the computing node is not operating correctly), the execution of a specific designated computing node is performed. User command to terminate), user request to specify additional triggers or modify configuration information of the indicated computing node group, indicated computing node group in addition to or instead of recursive harmony activity, etc. Immediate harmony activities against A user request to perform (eg, if a harmonized activity is performed only at the time of the user request), a user request to obtain various status information regarding one or more computing nodes to which the user is associated, subscription, registration, Or, it may include one or more of a request to perform an activity related to user management, such as a payment operation.

  If after block 430, 445, or 480, or alternatively, at block 477, it is determined that additional determined computing nodes are not available, the routine continues to block 485 and the program execution provided to the user. Any user billing (or periodically) based on information or requests received at block 405 or otherwise (eg, periodically), such as charging and / or collecting from one or more users based on functionality (Refund) Conduct optional activities. The routine may further optionally perform housekeeping operations on a regular basis as needed.

  After block 485, the routine continues to block 495 and determines whether to continue, such as until an explicit instruction to end the routine. If it is determined to continue, the routine returns to block 405, otherwise it ends following block 499. How many additional types of activities are there, such as determining if a user is authorized to perform a specific requested operation, and getting immediate payment from the user for some types of requested operations? It is understood that this may be implemented in certain embodiments and situations. In addition, user requests and other operations are instructed to be performed in a particular manner by a particular group of computing nodes and a particular associated user in the illustrated embodiment, but in other embodiments, Alternatively, all such operations may instead be more general, such as to multiple computing nodes associated with a single user and / or from multiple users associated with one or more computing nodes. May apply.

  FIG. 5 is a flow diagram of an exemplary embodiment of a recursive capacity matching routine 500. The routine may be provided, for example, by PESSM modules 110 and 180 of FIGS. 1A and 1B and / or PESSM module 340 of FIG. 3, respectively, as may begin at block 470 of routine 400 of FIG. is there.

  In the illustrated embodiment, the routine begins at block 505 to obtain an indication of the currently selected computing node group on which the capacity balancing activity is to be performed. At block 515, the routine then proceeds based on the previous harmonization activity performed on the selected computing node group (or, if this is the first harmonization activity to be performed, the selected computing node group). Initial official record program execution capacity) and / or subsequent modifications to the official record program execution capacity that may be implemented by a PES capacity maintenance manager module (eg, as described in detail with respect to FIG. 7). The information about the program execution capacity of the official record of the selected computing node group is called. The routine then continues to blocks 520 and 525 to determine the current actual program execution capacity and the currently desired program execution capacity for the selected group of computing nodes, respectively. The determination of the current actual program execution capacity may include, for example, invoking information previously stored by the PES capacity maintenance manager module as part of monitoring selected computing nodes. In other embodiments, the routine 500 may dynamically determine the current actual capacity (eg, to provide that information to the PES capacity maintenance manager module or other monitored information source). By dynamically requesting).

  The determination of the currently desired program execution capacity of block 525 is, for example, any dynamically specified capacity modification received from an associated user of the selected computing node group during the current aggregate period corresponding to the harmony activity. Information about the instructions (eg, as described above with respect to block 445 of FIG. 4) and any user-specified of the selected computing node group that was previously determined to have been satisfied during the current aggregate period May include invoking information about triggers. Alternatively, in some embodiments, the routine may instead have any user-specified triggers for the selected set of computing nodes currently satisfied and / or previously satisfied during the current aggregate period. To determine the performance characteristics information determined for the selected computing node group (eg, monitoring the computing node group selected by the PES capacity maintenance manager module). Information previously stored as part of the information, or information obtained dynamically by requesting a PES capacity maintenance manager module or other monitoring source to provide that information). After a variety of information has been called, the currently desired program execution capacity is transferred to other parts to determine the resulting desired program execution capacity after any such aggregate capacity correction has been made. As described in detail, it may be determined by summing up one or more requested program execution capacity modifications.

  After block 525, the routine continues to block 530 where the current actual program execution capacity of the selected computing node group, the desired program execution capacity, and so on, to adjust the current official capacity to the currently desired capacity. In order to harmonize the program execution capacity of the official record, the actual changes made to the selected computing nodes are determined. The routine then continues to block 535 and designates the currently desired program execution capacity provided by the modified selected computing node group as the program execution capacity of the updated official record of the selected computing node group. Further, the program execution capacity correction determined in block 530 is started. After block 535, the routine continues to block 599 and returns.

  FIG. 6 is a flow diagram of an exemplary embodiment of a capacity modification attribution routine 600. The routine may begin at block 475 of routine 400 of FIG. 4, etc., and may be provided by, for example, PESSM modules 110 and 180 of FIGS. 1A and 1B, respectively, and / or PESSM module 340 of FIG. 3, respectively. is there.

  In the illustrated embodiment, the routine begins at block 605 to obtain an indication of the currently selected computing node group on which the capacity modification attribution activity is performed. At block 625, the routine then identifies information about changes in program execution capacity availability that have occurred since the previous time, such as previous harmonized activities performed on the selected set of computing nodes. To do. The identification of the change information may include, for example, invoking information previously stored by the PES capacity maintenance manager module as part of monitoring the selected computing nodes, although other embodiments In routine 600, the information may be determined dynamically (eg, by dynamically requesting that information to be provided to a PES capacity maintenance manager module or other monitored information source).

  After block 625, the routine continues to block 630 to determine if any such capacity availability change has occurred, and continues to block 699 if it has not. If so, the routine continues to block 635 and information about program execution capacity modification request events that have occurred since the previous time, such as previous harmonized activities performed on the selected computing nodes. Identify Identification of event information invokes information previously stored by the PES system manager module as part of providing the functionality of the selected computing node group, eg, as described in detail with respect to FIGS. May be included. At block 640, the routine then determines any of the identified events that directly generate the corresponding availability change, such as based on the type of event (eg, the unavailable computing node). Automated system operations to replace, received user commands specifying immediate response responses, etc.).

  After block 640, the routine continues to block 645 and selects the next availability change identified at block 625, starting from the beginning. At block 650, the routine then determines whether this change can be directly attributed to one of the individual events determined at block 640 and, if possible, the availability of the selected capacity. Record the event as the cause of the change. If not, the routine at block 650 concludes that the selected capacity availability change is due to a combination of other identified events not determined at block 640. At block 660, the routine then determines if there are more capacity availability changes, and if so, returns to block 645 and selects the next such capacity availability change. If not, the routine continues to block 699 and returns.

  FIG. 7 is a flow diagram of an exemplary embodiment of a program execution service capacity maintenance manager routine 700. The routine includes determining the actual program execution capacity available from the computing nodes, assisting in monitoring the usage of the computing nodes for the user, etc., eg, FIGS. 1A and 1B, respectively. PESCMM modules 115 and 160, and / or PESCMM module 345 of FIG. In this illustrated embodiment, the routine 700 operates with a program execution service that provides program execution capacity for executing programs on behalf of multiple users, but in other embodiments, some of the functions of the routine 700 are described. Or all may be provided in other ways.

  In the illustrated embodiment, the routine begins at block 705 where an instruction is received to begin collecting information about computing nodes of one or more computing nodes, such as in a continuous or otherwise iterative manner. However, while not illustrated herein, in some embodiments, other modules and / or routines generate and provide subject specific information, such as with respect to the subject's particular computing nodes. As described above, the routine 700 may be requested dynamically. In block 705, the routine includes one or more such computing nodes that include an indication of the computing nodes to which these computing nodes belong for later use in generating aggregate information for the computing nodes. Collecting performance characteristic information of a storage node. Information is obtained by pulling the information by requesting the information to be provided to a particular computing node or an associated module (eg, an associated VM manager component of the virtual machine computing node). And / or related components push information to the routine 700 (eg, periodically, during certain types of events such as detected error conditions that cause the computing node to shut down or become unavailable) May be collected in a variety of ways, including by monitoring network traffic and / or individual resource usage by different computing nodes.

  The routine then continues to block 710 to determine aggregate performance characteristic information for one or more selected computing nodes and compute all computing nodes, individual computing node information just collected. Nodes, computing node groups for which aggregate performance characteristic information has been requested or not recently generated, and computing node groups in which individual computing node information is available to each of the computing nodes in the computing node group The determined information is stored for later use, such as for later. That aggregate performance characteristic information is generated in a variety of ways, including interpolating or estimating individual performance characteristic information that is not available when only partial information is available for a group of computing nodes. There is a case. In addition, the specific performance characteristic information collected and / or aggregated is determined for a particular computing node group that necessarily collects a predetermined type of information for all computing node groups in a given embodiment. There are cases where the information fluctuates in various ways, such as collecting a predetermined type of information based on the conditions specified in the trigger. Further, although blocks 705-785 are illustrated in this example as being implemented in a sequential manner, various blocks may be implemented in other manners instead in some embodiments. Understood. For example, in some embodiments, the information gathering activity of block 705 may be performed on a continuous or near-continuous basis, but aggregate information generation for block 710 and / or other blocks is only periodically. May be implemented.

  After block 710, the routine continues to block 715 to reflect the current number of computing nodes in the currently available group and / or one or more other measurements of the program execution capacity of the computing node group, and so on. Determining and storing current actual program execution capacity information for each of the one or more groups of computing nodes, such as storing information determined for use in Although not illustrated herein, in some embodiments and situations, the routine further includes computing node groups to reflect the current actual program execution capacity determined for the computing nodes group. While the program execution capacity of the corresponding official record may be updated immediately, in other embodiments, to update the program execution capacity of the official record, wait until the next corresponding group of harmony activities.

  At block 720, the routine then optionally determines any capacity modification triggers for any computing node group that was satisfied for any computing node group (eg, collected at block 705 and / or The determination that the performance characteristics information aggregated at block 710 and / or the actual program execution capacity information determined at block 715) met such a trigger in other embodiments is Rather, it may be performed at the end of the aggregate period, such as for a corresponding harmony activity that will be described in detail with respect to FIG. If it is determined that any trigger is satisfied, information about such satisfied triggers is stored for later use. In some embodiments and situations, satisfying a particular trigger may further initiate an immediate program execution capacity modification of the associated computing nodes, in which case such a program execution capacity modification operation may be initiated. The routine may also record causal information that links the satisfied trigger to its program execution capacity modification operation, such as for later use with respect to the routine 600 of FIG.

  In a similar manner, the routine in block 725 is initiated such that any computing node of any computing node group is available for the computing node group, but the initiation fails or is specified. It is determined whether it was not completed within a period (for example, 10 minutes). In that case, the illustrated embodiment of the routine initiates immediate provision of a replacement computing node for any such computing node, and the routine further initiates unavailability of the initiated computing node. In some cases, the causal relationship information to be linked is recorded as the cause of the replaced activity. In other embodiments, such replacement activities may instead not be performed in an immediate manner (eg, instead may be aggregated with other requests to modify program execution capacity), and / or Rather, it may be performed by the routine 400 of FIG. In addition, as part of initiating a replacement activity for such an unavailable computing node, the routine may further operate to terminate the unavailable computing node (eg, , Still running but not responding).

  In a similar manner, the routine of block 730 is used for computing nodes that were previously in use as part of the computing nodes but are currently failing or otherwise unavailable. Optionally starting to immediately provide a replacement computing node to any of the computing nodes, in which case the routine will account for the unavailability of that computing node as the cause of the initiated replacement activity. In some cases, the causal information to be linked is further recorded. In other embodiments, such replacement activities may not otherwise be performed in the immediate manner (e.g., may be aggregated with other requests to modify program execution capacity otherwise). ) And / or other types of automated that may be implemented by the routine 400 of FIG. 4 and / or that can automatically initiate immediate changes to the program execution capacity of a particular group of computing nodes. Judgment may be made. In addition, as part of initiating a replacement activity for an unavailable computing node, the routine may also take action to terminate the unavailable computing node (eg, still running). But does not respond). Further, as will be described in detail elsewhere, the routine may affect the desirability of performing a replacement activity for a period during which the associated user is charged in some embodiments with respect to blocks 725 and / or 730. Other factors may be considered when determining whether to perform a replacement activity immediately, such as the amount of time until the next harmonized activity is scheduled to be performed, which may be given.

  After block 730, the routine continues to block 785 and optionally performs any housekeeping operations, including updating the stored information as needed. After block 785, the routine continues to block 795 and determines whether to continue, such as until an explicit end indication is received. If it is determined to continue, the routine returns to block 705, otherwise it ends following block 799. Various activities with respect to routine 700 are illustrated in this embodiment as being performed by a module that is different from the module that implements routine 400, but in other embodiments, some or all of the functions of the two routines are performed. May be implemented by a single module, or otherwise combined.

  It will be appreciated that in some embodiments, the functionality provided by the routines described above may be provided in alternative ways, such as splitting into more routines or integrating into fewer routines. Similarly, in some embodiments, the illustrated routines are used when other illustrated routines instead lack or include such functions, respectively, or when the amount of functions provided is changed. Etc., may provide more or less functions than described. In addition, while various operations may be illustrated as being performed in a particular manner (eg, sequentially or in parallel) and / or in a particular order, those of ordinary skill in the art will appreciate in other embodiments It will be appreciated that the operations may be performed in other orders and in other manners. Those skilled in the art also can structure the data structures described above in different ways, such as by dividing a single data structure into multiple data structures or by consolidating multiple data structures into a single data structure. Also understand that it may be. Similarly, in some embodiments, the illustrated data structure may be different when other illustrated data structures instead lack or contain such information, respectively, or the amount or type of information stored. More or less information than the description may be stored, such as when it is changed.

Section 1. A method for a computing system configured with a program execution service for determining a causal relationship of dynamic modifications in program execution capacity provided to a user, comprising:
Under the control of a computing system configured with a program execution service, it can be configured to execute a plurality of remote user programs for each of a variety of users in exchange for a fee charged to the user. Under the control where the program execution service provides a plurality of computing nodes,
Specifies the initial desired number of compute nodes for use in the execution of the user's indicated program and makes automated corrections to the number of compute nodes provided for use by the user Receiving information from a user specifying a plurality of number correction triggers for use to start later, each of the number correction triggers to determine whether the number correction triggers are met Receiving, including one or more criteria for use in, and including a change in the number of designated computing nodes requested when a number correction trigger is met;
Automatically determining a group for a user of a variety of computing nodes for use in executing a user's indicated program, wherein the computing nodes are initially desired computing Determining the number of nodes, at a first time, providing a plurality of computing nodes for use by a user;
In response to an instruction from a user, initiating execution of a copy of the indicated program at each of the computing nodes of the group;
Automatically monitoring computing nodes in the group and determining at least one of the number modification triggers specified by the user to determine performance metrics from the operation of these computing nodes during the period Automatically satisfying that is satisfied based on the determined performance metric,
Receiving one or more number change instructions from a user, each indicating a dynamically specified request for a change in the number of computing nodes in the group, for a period of time;
Automatically determining the actual amount of computing nodes for the second time, which reflects the number of computing nodes in the group that is actually available for the second time, in order to execute the program for the user. The first determined actual compute node amount is based at least in part on a plurality of changes to the availability of computing nodes in the group during the period of time. Determining that at least some of the plurality of availability changes have one or more associated charges for which the user is charged;
For each of at least one of the plurality of changes to availability, any one of at least one number modification trigger determined to be satisfied or one of one or more number change instructions from a user Automatically concludes a single cause of availability changes,
For each of at least one other change of the plurality of availability changes for which a single cause has not been automatically concluded, the at least one other availability change is said at least one One or more number change instructions from the user, including one or more of at least one number correction trigger that is separate from the availability change, independent of each other and determined to be satisfied Automatically concludes a combination of multiple possible causes into an availability change that includes at least one of the following:
A single cause to conclude for each of the at least one availability change to allow the associated fee for at least some availability changes to be attributed to the user Providing an indication of a plurality of causal combinations for each of the at least one other availability change, from a first time to a second time period, Automatically managing computing nodes.

  Section 2. For one of the plurality of users, the actual number of computing nodes determined at the second time is one or more of at least one number modification trigger determined to be satisfied and from one user. Initially preferred for the first time, based in part on the requested increase in the number of computing nodes for a group of users from each with at least one of the one or more number change instructions Automatically determining the second actual computing node number of a user more than the number of computing nodes is equal to one or more filled number modification triggers and at least from one user To increase the number of computing nodes in a group of users based on the total requested increase with one number change instruction Determining a single aggregated correction, the determined single aggregated correction for increasing the number of computing nodes in a group of one user is One of at least one other availability change, any one of the one or more filled number modification triggers and at least one number change instruction from one user, For a group of users, it is not possible to conclude as any single cause of at least one availability change, but for each of at least one other availability change A possible cause combination is identified for an availability change in one user's computing nodes over a period of time, and one of the at least one availability change. Of including all possible causes not conclude a single cause, the method described in Section 1.

  Section 3. A program execution service is a network accessible service that allows each remote user to provide instructions from a client computing device in one or more networks and is associated with a group of users. At least some availability changes include one or more increases in the number of computing nodes in the group of one user, one user used by one user at a first time One of each additional computing node provided as part of an increase in one or more number of groups of one user, paying a first fee for providing a plurality of computing nodes to The method according to Section 2, wherein the individual second charge is paid.

Section 4. A computer-implementable method for determining a causal relationship of dynamic modification in a program execution capacity provided to a user, the method comprising:
A plurality of programs configurable to execute a program of a user of the program execution service under the control of one or more computing systems configured to provide a program execution service for use by a plurality of users Under the control of the program execution service having the computing node,
Receiving an indication of an initial desired program execution capacity for executing one or more software programs on behalf of a first user of the program execution service;
Determining a plurality of capacity correction triggers for use in later initiating automated corrections to the program execution capacity provided to the first user, each of the capacity correction triggers Determining, including one or more criteria for use to determine whether the trigger is satisfied, and including a specified type of program execution capacity modification requested when the capacity modification trigger is satisfied And
Automatically determining a plurality of first groups of various computing nodes for use to provide an initial desired program execution capacity of a first user; Causing a computing node of a group to each execute one or more software programs for a first user;
A plurality of independent, which may occur in a period between the first and the second, and each may result in a modification of the program execution capacity provided by the first group of computing nodes Automatically identifying an event, wherein the plurality of events includes at least one of a designated capacity modification trigger that is determined to be satisfied;
Automatically determining the actual program execution capacity available to the first user from the computing node in the first group for the second time, the second actual program execution capacity being the first To the first user for the first time based at least in part on one or more changes to the availability of the first group of one or more computing nodes that occurred in the period between the first time and the second time Determining that it is separate from the desired program execution capacity,
Automatically concludes one or more of the events identified as the cause of the availability change for each of the availability changes of one or more computing nodes of the first group. A combination of events including one or more of at least one specified capacity modification trigger that is determined to be satisfied, wherein at least one of the availability changes is independent of each other Having a cause that is
An indication of the cause to be concluded for each of one or more of the availability changes to allow one or more additional actions to be performed in response to that conclusion. Providing a method.

  Section 5. The plurality of events further includes at least one capacity modification instruction that is dynamically specified by the first user to request a specified modification to the program execution capacity provided by the first group, and at least The method of clause 4, wherein the combination of events concluded as a cause of one availability change includes one or more of at least one specified capacity modification instruction.

  Section 6. At least one other change in the availability change has a concluded cause that is a single one of the plurality of events, and the at least one other availability change is: The method of clause 4, separate from the at least one availability change.

  Section 7. A single event is a determined type of cause of at least one other availability change, and the determined cause type is either a direct cause or an indirect cause, Providing an indication of one event further comprises automatically determining that it is a determined type of cause of at least one other availability change, Method.

  Section 8. Automatically determining the actual program execution capacity includes determining the multiple availability changes that have occurred, and automatically concludes one or more events as the cause of each availability change. Attaching each identifies one or more of a plurality of events that are a single cause of a plurality of availability changes and a plurality of availability without a single cause Summing all of a plurality of events that are not a single cause of one of a plurality of availability changes as part of a combination of gender changes with each other. Method.

  Section 9. For one of at least one availability change, automatically concludes a combination of events as a cause of one availability change is a combination of events Including determining that the cause of the change in likelihood is the determined type of cause, the determined type of cause being either a direct cause or an indirect cause, and one or more availability Providing an indication of the cause that can be concluded for each of the changes includes providing an indication of a combination of events that is a determined type of cause of one availability change. The method described.

  Section 10. The plurality of independent events each request a modification of the program execution capacity provided by the first group, and the method is based on the sum of the requested modifications of the plurality of events. Automatically determining a single aggregated correction to be made to the execution capacity and initiating a determined single aggregated correction for the first group before the second time. The method of clause 4, comprising.

  Section 11. The plurality of events further includes at least one capacity modification instruction that is dynamically specified by the first user to request a specified modification to the program execution capacity provided by the first group. The plurality of capacity modification triggers specified by the first user before the first time and the combination of the plurality of events concluded as one cause of the at least one availability change is at least one The method of clause 10, comprising one or more of the specified capacity modification instructions.

  Section 12. 12. The method of clause 11, wherein the determined single aggregated modification is one availability change included in a combination that is concluded due to one or more specified capacity modification instructions.

  Section 13. In the first group of program execution capacities, the initial desired program execution capacity is the number of initial desired computing nodes, and the actual program execution capacity determined in the second time is the second time. Measured based on the number of computing nodes that are part of the first group to be the number of actual computing nodes available as part of the first group of one or more computing nodes. The one or more availability changes are each one or more of one or more new nodes that are part of the first group that becomes unavailable and one or more new computing nodes that are added to the first group. The determined single aggregated correction for the first group, including at least one of the computing nodes, is a determination of the number of computing nodes in the first group. It has been a change, the method described in Section 10.

  Section 14. The determined single aggregated correction is to increase the number of computing nodes in the first group by the specified number of one or more computing nodes, and the determined single The aggregated correction is one of one or more availability changes that provide an indication of the cause that is concluded, and the method is the determined single aggregated correction initiated 14. The method of clause 13, further comprising performing one or more additional actions including initiating one or more monetary charges for the first user based at least in part on Method.

  Section 15. One of the one or more availability changes for which an indication of the cause being concluded is provided includes at least a first of the plurality of events as at least part of the cause of the one availability change; Providing an indication of the conclusive cause of a change in availability of one person is that an event causes one availability change, and a first event causes an availability change The method of clause 4, wherein the method is performed in response to at least one request.

  Section 16. Providing an indication of a conclusive cause of a single availability change when a request is received from a user, generating a human readable description of the conclusive cause of the single availability change; Providing a generated human readable description for display to a user.

  Section 17. For each one or more additional time periods that occur after the second time, further automatically concludes one or more additional identified events as the cause of the availability change that occurred during the additional time period One additional identified event for one of the additional identified events responsible for one of the availability changes that occurred during one of the one or more additional time periods. The method of clause 4, wherein the event is a result of one of the availability changes that occurred during the period between the first and second.

  Section 18. Making a computing node in the first group available for the first time to each run one or more software programs for the first user is computing in the first group. Automatically providing each of the nodes, and automatically starting execution of each of the one or more software programs on each of the computing nodes of the first group. The method described in Section 4.

  Section 19. A program execution service is a service that is accessible on a fee-based network that is remote from a first user, and the program execution service is a remote computer for programmatic interaction with the program execution service in one or more networks. Providing at least one of one or more application programming interfaces (APIs) of the operating system and a graphical user interface for use by a remote user in one or more networks, wherein the first user The method of clause 4, wherein one or more fees are paid based at least in part on one or more concluded causes of the change.

  Section 20. A program execution service such that a plurality of computing nodes includes a plurality of virtual machines hosted by a physical computing system, each capable of executing at least one program for each of a plurality of physical computing systems Section 4 uses virtual techniques, the computing nodes in the first group are hosted virtual machines, and the one or more programs of the first user are part of the virtual machine image. The method described in 1.

Section 21.
In order to provide an initial program execution capacity for use to execute one or more software programs on behalf of a first user under the control of a configured computing system, Receiving an indication of a first group of computing nodes associated with a user;
Automatically identifying a plurality of independent events that occur between a first time and a subsequent second time, each having an associated desirable modification of a first group of program execution capacity;
Automatically determining the actual program execution capacity available to the first user from the computing node in the first group for the second time, the second actual program execution capacity being the first Determining an initial program execution capacity provided at a first time that is based at least in part on one or more changes to the availability of one or more computing nodes of the group;
One or more causes for automatically deciding one or more causes for each of the determined availability changes of the first group, wherein one or more causes are concluded for at least one of the availability changes A conclusion that is a combination of a variety of identified independent events;
Providing the content to the user by performing a method comprising: providing an indication of one or more causes to be concluded for one or more of the at least one availability change A computer readable medium that configures a computing system to determine causal relationships for dynamic modification of program execution capacity.

  Section 22. The configured computing system is part of a program execution service that provides a plurality of computing nodes configurable to execute a program of a user of the program execution service, the first group of the plurality of computing nodes Is a subset of a plurality of computing nodes, and receiving the first group of instructions includes receiving an initial program execution capacity request from a first user before the first time, Automatically associating a first group of computing nodes with a first user for a first time for use to provide a user with initial program execution capacity, A first time to use for later initiating automated modifications to the first group of program execution capacities Wherein the plurality of independent events include at least one capacity modification instruction that is determined to be satisfied and that is dynamically specified by the first user. The computer-readable medium of clause 21, comprising at least one of the following:

  Section 23. The desired modification of program execution capacity for each of a plurality of independent events is a requested modification, the method comprising: at least one filled capacity modification trigger; and at least one capacity modification instruction from a first user; Automatically determining a single aggregated modification to be made to increase the first group of program execution capacities based on the requested modification total of Initiating one aggregated correction, wherein the determined single aggregated correction is one of the at least one availability change and the determined single aggregated The combination of multiple independent events that can be concluded as one or more causes of the corrected correction is less than at least one filled capacity correction trigger and the first user. Both containing one volume correction command, computer-readable medium according to the 22 section.

  Section 24. The computer readable medium is at least one of a memory of a computing system that stores content and a data transmission medium that includes a generated stored data signal containing the content, the content being executed. The computer readable medium of clause 21, instructions that cause a computing system to perform the method.

Section 25. A computing system configured to determine for a user a causal relationship for dynamic modification in program execution capacity,
One or more processors;
For each of multiple users
Determining the initial program execution capacity provided for use to execute one or more software programs on behalf of the user, and automated modifications to the program execution capacity provided for the user Determining one or more capacity correction triggers for use to start later;
Automatically associating a group of multiple available computing nodes with a user for a first time for use to provide the user with an initial desired program execution capacity;
Automatically identifying a plurality of independent events that occur between the first time and the second time after the first time, and each having a desirable modification associated with the group's program execution capacity. Identifying the plurality of events including at least one of capacity modification triggers determined to be satisfied;
Automatically determining one or more changes to the availability of one or more computing nodes of the group that affect the program execution capacity provided by the group;
One or more causes that automatically conclude one or more causes for each of the determined availability changes of the group, wherein at least one of the availability changes is concluded Is a combination of a variety of identified independent events, and one or more causes that can be concluded for at least one other change of availability are simply a single of the identified independent events. Providing an indication of one or more causes that can be concluded with respect to one or more of the determined availability changes of the group,
A system manager module configured to manage program execution capacity for a plurality of users of a network accessible service when executed by at least one of the one or more processors. System.

  Section 26. The plurality of independent events for one of the plurality of users further includes at least one capacity modification instruction that is dynamically specified by the one user, wherein the system manager module is at least one filled A single aggregate that is performed to increase the program execution capacity of a group of one user based on the desired modification total of the capacity modification trigger and at least one capacity modification instruction specified by one user. Configured to automatically determine a single correction that has been determined for the group for one user before the second time, and a single determined The aggregated correction is one of at least one availability change for one user and is concluded as one or more causes of the determined single aggregated correction. A plurality of combinations of independent events, including at least one capacitive correction command specified by at least horn filled capacity modified trigger and one user computing system according to the 25th section that.

  Section 27. The determined capacity modification trigger for one user is specified by one user and the network accessible service is configured to execute a program of a remote user of the program execution service. 27. The computing system of clause 26, wherein the computing system is a program execution service that provides a node, and the plurality of computing nodes in the group for each of at least one of the plurality of users is a subset of the plurality of computing nodes.

  Section 28. 26. The computing system of clause 25, wherein the system manager component includes software instructions for execution by the computing system.

Section 29. For each of multiple users
Determining the initial program execution capacity provided to be used to execute one or more software programs on behalf of the user and automated modifications to the program execution capacity provided to the user later Determining one or more capacity correction triggers for use to initiate;
Automatically associating a group of multiple available computing nodes with a user at a first time for use to provide an initial desired program execution capacity to the user;
Automatically identifying a plurality of independent events that occur between the first time and the second time after the first time and each having a desirable modification associated with the program execution capacity of the group, Identifying a plurality of events including at least one of capacity modification triggers determined to be satisfied;
Automatically determining one or more changes to the availability of one or more computing nodes of the group that affect the program execution capacity provided by the group;
Automatically concludes one or more causes for each of the determined availability changes of the group, wherein the one or more causes concluded for at least one of the availability changes may vary One or more of the identified independent events, and one or more causes that can be concluded for at least one other change in availability is one of the single identified independent events By providing instructions to one or more causes that can be concluded for one or more of the group's determined availability changes, the system manager component can provide a network accessible service. 26. The computing system of clause 25, comprising means for managing the program execution capacity of a plurality of users.

Section 30. A method of a computing system configured with a program execution service for dynamically modifying a user's program execution capacity, the method comprising:
The program execution service provides a plurality of computing nodes that can be configured to execute programs of a plurality of remote users under the control of a computing system configured with the program execution service. For each new user
For specifying an initial desired number of computing nodes for use to execute a user's indicated program and for use in later initiating automated modifications to the desired number of computing nodes Receiving information from a user specifying one or more number correction triggers, each of the number correction triggers being one used for determining whether the number correction trigger is satisfied Receiving, including the above criteria and including a specified compute node number change if a number correction trigger is met;
Automatically determining a plurality of groups of computing nodes for use in executing a user-instructed program, wherein the plurality of computing nodes in the group is an initial desired computing node quantity Determining, providing a plurality of computing node users for first use,
Responsive to one or more instructions from the user, starting to execute a copy of the indicated program on each of the computing nodes of the group and recording as available to the user for the first time. Specifying the initial desired compute node amount as the public compute node amount to be played,
During the period, at least one of automatically monitoring the computing nodes in the group and determining the number of modification triggers specified by the user to determine performance characteristics from the operation of these computing nodes Automatically determining that it is satisfied based on the determined performance characteristics;
Receiving at least one instruction indicative of a change in a user-instructed amount of computing nodes of a group of computing nodes of a group dynamically specified by a user for a period of time;
Automatically determining a desired amount of computing nodes modified a second time, wherein the desired number of computing nodes modified is a specified amount of computing nodes from at least one filled number modification trigger Determining a change in the desired number of computing nodes from the first time, based at least in part on the change in
Reflects the number of computing nodes in the group that are actually available for the second time to execute the program for the user. Automatically determining the actual amount of compute nodes the second time,
Second, automatically reconcile the user's number of public computing nodes with the modified desired number of computing nodes, where reconciliation is determined to be the modified desired number of computing nodes. Reconciling, including automatically modifying the number of computing nodes that are part of the group by performing an action to change the actual number of computing nodes performed;
Provide the group's modified number of compute nodes for use by the user and specify the desired amount of compute nodes modified to be the number of public computing nodes available to the user the second time And automatically managing computing nodes of the group for a period from a first time to a second time after.

  Section 31. For one of a plurality of users, the actual number of computing nodes determined for the second time is for one user that is unavailable for use during the first to second time period. Computing less than the first public computing node based on at least in part one or more of the computing nodes in the group and computing in the group for one user for a period of time Automatic monitoring of nodes repeatedly determines the current actual computing node number of one user and updates the public computing updated with the determined actual actual computing node quantity. Updating the number of public computing nodes of one user to adjust the number of nodes, including at least one user One filled number modification trigger is one or more unavailable to maintain the amount of the second public computing node at the initial desired number of computing nodes specified by one user. A trigger that specifies to increase the number of computing nodes in a group of one user by the number of active computing nodes, and a user-designated amount change dynamically specified by one user is Automatically determining the modified desired number of computing nodes for a single user for a second time, including an indicated decrease in the number of initially desired computing nodes of at least one computing node, 1 At least partially offset the indicated decrease in one or more unavailable computing nodes The number of public computing nodes available to one user for the second time is an indication specified by one user from the initial desired number of computing nodes specified by one user. 30. The method of paragraph 30, subtracted from the reduced.

  Section 32. The program execution service is for a plurality of users to pay a first fee for providing a plurality of computing nodes for the user to use for the first time, and for the user to use each time for the second time. A service that is accessible in a fee-based network to pay a separate second fee to provide a number of modified computing nodes in the group, each of the first and second fees being a user 32. The method of clause 31, based at least in part on a current number of computing nodes in the group.

Section 33. A computer-implementable method for dynamically modifying program execution capacity for a user, the method comprising:
A plurality of programs configurable to execute a program of a user of the program execution service under the control of one or more computing systems configured to provide a program execution service for use by a plurality of users Under the control of the program execution service having the computing node,
Specify an initial desired program execution capacity for use to execute one or more software programs on behalf of the first user of the program execution service, and later make automated modifications to the desired program execution capacity Receiving information specifying one or more capacity modification triggers for use to initiate, each of the capacity modification triggers being used to determine whether a capacity modification trigger is met Receiving, including a specified type of modification to a desired program execution capacity requested when a capacity modification trigger is met;
Automatically determining a first group of various computing nodes for use to provide an initial desired program execution capacity of the first user, each one or more for the first user; Making a computing node of the first group available for the first time to execute the software program and the first time recorded as available to the first user Specifying the desired initial program execution capacity as the program execution capacity;
After the first time, to determine one or more types of current values of the performance characteristics of these computing nodes in connection with executing one or more software programs, Monitoring the computing node, which is the actual program execution capacity available from the first group of computing nodes to the first user in the second time after the first time. Monitoring, including determining
Based on a plurality of events occurring in a period between the first time and the second time, automatically determining to correct a desired program execution capacity of the first user, the plurality of events being one Including at least one of the designated capacity modification triggers determined to be satisfied based at least in part on the determined current value of the performance characteristic type and dynamically by the first user Determining, including at least one designated capacity modification instruction, each of the at least one designated capacity modification trigger and at least one capacity modification instruction indicating a designated modification to the desired program execution capacity;
Automatically reconciling the recorded public program execution capacity available to the first user with the actual program execution capacity determined at the second time and the modified desired program execution capacity, Reconciling the public program execution capacity provided so that the modified computing node is available to provide the modified desired program execution capacity and the recorded public program execution capacity is provided Computing nodes that are part of the first group according to the determined actual program execution capacity and the modified desired program execution capacity to be updated to reflect the modified desired program execution capacity And automatically reconciling the method.

  Section 34. The first group of program execution capacities is measured based on the number of computing nodes that are part of the first group, such that the initial desired program execution capacity is the number of initial desired computing nodes. The actual program execution capacity determined the second time is the actual number of computing nodes available as part of the first group the second time, automatically determined to correct the desired program execution capacity Determining the modified desired program execution capacity as a modified desired number of computing nodes in the first group and automatically computing computing nodes that are part of the first group. To modify the actual amount of computing nodes that are part of the first group so that the desired amount is modified. Comprising changing the method according to the 33 section.

  Section 35. The designated modification to the desired program execution capacity of each of the at least one designated capacity modification trigger and the at least one capacity modification instruction is the indicated number of changes in the desired number of computing nodes in the first group. And determining the modified desired program execution capacity for the first group is the sum of the indicated number of changes of at least one specified capacity modification trigger and at least one capacity modification instruction. 35. The method of clause 34, comprising: modifying the initial desired number of computing nodes by changing the aggregated amount.

  Section 36. One or more types of performance characteristics of the computing nodes in the first group whose current values are determined by monitoring are the actual computing nodes available as part of the first group. Including and monitoring the number includes determining a current actual number of computing nodes at each of a plurality of times, between a first time and a second time, to determine a recorded public program execution capacity Harmonizing further includes specifying a modified desired amount of computing nodes in the first group to a current public program execution capacity available to the first user for a second time, The method according to paragraph 34.

  Section 37. The program execution capacity of the first group is measured based on summing each of the plurality of types of computing resources available from the computing nodes that are part of the first group, Automatically modifying a computing node that is part of the plurality of types of computing resources available from computing nodes that are part of the first group after the computing node is automatically modified. 34. The method of clause 33, comprising changing at least one total metric.

  Section 38. The one or more criteria for each of the at least one specified capacity modification trigger is based on one or more specified values for at least one of the one or more performance characteristic types, and the method includes at least Based at least in part on a match between one or more specified values for each of one specified capacity modification trigger and a current value determined for one or more performance characteristic types, at least 34. The method of clause 33, further comprising automatically determining that one specified capacity modification trigger is met.

  Section 39. The at least one performance characteristic type corresponds to a computing load on a computing node in the first group and determining that at least one specified capacity modification trigger is met is temporary Automatically modifying the computing nodes that are part of the first group based on the computing load on the computing nodes of the first group that have increased to Including temporarily increasing the actual program execution capacity available from the computing nodes of the first group to accept the increased state, the method temporarily increasing the computing load In order to reflect the end of the state, the computing nodes in the first group are temporarily increased. In order to reduce the actual program execution capacity, after temporarily increasing the actual program execution capacity, further comprising automatically determining the third post, the method according to the 38 section.

  Section 40. The at least one performance characteristic type includes an actual number of computing nodes available as part of the first group and is determined to determine that at least one specified capacity modification trigger is met. Automatically modifying the computing nodes that are part of the first group based on the actual number of computing nodes in the first group that is different from the desired number of computing nodes, 39. The method of clause 38, comprising returning a different actual number of computing nodes in the first group to a designated desired number of computing nodes.

  Section 41. One or more criteria of one of the at least one specified capacity modification trigger includes a determined current value threshold of the indicated performance characteristic type and a determined current value of the indicated performance characteristic type. 39. The method of clause 38, based on one or more of a value change over time and a logical combination of determined current values of a plurality of performance characteristic types.

  Section 42. The plurality of events further includes one of the triggered specified capacity modification triggers whose one or more criteria is based on one or more specified times, and the method is one or more specified 34. The method of clause 33, further comprising: automatically determining when one specified capacity modification trigger is met based at least in part on a current time corresponding to the selected time.

  Section 43. The plurality of events further includes one of the triggered designated capacity correction triggers, wherein the one or more criteria is based on one or more patterns identified from the historical data. Automatically, for one or more performance characteristic types corresponding to at least one of the above patterns, that one specified capacity correction trigger is met based on at least partially determined current values 34. The method of clause 33, further comprising: determining.

  Section 44. The plurality of events are triggered based on one or more indications of work performed by one or more software programs executed on one or more computing nodes of the first group. Further comprising one of the designated capacity modification triggers being configured, wherein the method is based at least in part on acquired information relating to actual work performed by the one or more software programs; 34. The method of clause 33, further comprising automatically determining that one specified capacity modification trigger is met.

  Section 45. Determining the desired program execution capacity modified for the first group includes an indicated modification to the desired program execution capacity specified by each of the at least one designated capacity modification trigger and at least one capacity modification instruction. 34. The method of clause 33, comprising summing and specifying the determined modified desired program execution capacity based on the aggregated indicated modification to the desired program execution capacity.

  Section 46. Summing the indicated modifications to the desired program execution capacity includes accumulating the indicated modifications, at least one of the indicated modifications, and at least one other modification of the indicated modifications. Canceling with, selecting a single one of the indicated modifications based on one or more selection criteria, and one or more associated with one or more of the indicated modifications 46. The method of clause 45, comprising using at least one of priority.

  Section 47. The at least one capacity modification instruction dynamically specified by the first user and included in the plurality of events includes a single capacity modification instruction specified by the first user and is specified by the first user The modified capacity instruction is prioritized over a designated capacity modification trigger that is determined to be satisfied, and determining the first group of modified desired program execution capacity is at least one designated capacity modification. 34. The method of clause 33, comprising selecting a directed modification for a desired program execution capacity specified by a single capacity modification instruction that is used in place of the triggered modified modification.

  Section 48. Each comprising an indicated subset of program execution capacity of the computing nodes of the first group based on one or more of the computing nodes of the first group at the geographical location, The method further includes receiving a designation by a first user of a plurality of individual geographic locations, wherein the modified computing node is a computer in the first group at each of the plurality of geographic locations. And automatically modifying the computing nodes that are part of the first group according to the received designation so as to be modified to include the indicated subset of the program execution capacity of the computing nodes. 34. The method of paragraph 33.

  Section 49. Automatically modifying a computing node that is part of a first group replaces one or more of the computing nodes in the first group with one or more other computing nodes. 34. The method of clause 33, wherein the one or more other computing nodes each have a different amount of available program execution capacity than the one or more replaced computing nodes.

  Section 50. Making the computing node of the first group available for the first time to each run one or more software programs for the first user may Automatically supplying each and including automatically starting execution of each of the one or more software programs on each of the computing nodes of the first group. The method described in the section.

  Section 51. A program execution service is a service that is accessible on a fee-based network that is remote from a first user, and the program execution service is a remote for programmatically interacting with the program execution service in one or more networks. Providing at least one of one or more application programming interfaces of the computing system and a graphical user interface for use by a remote user in one or more networks, the first user automatically reconciling 34. The method of clause 33, wherein one or more fees are paid for automatically modifying computing nodes that are part of the first group as part of the first group.

  Section 52. The program execution service includes a plurality of virtual machines hosted by a physical computing system in which a plurality of computing nodes can each execute at least one program for each of the plurality of physical computing systems. As such, using virtual techniques, a computing node in the first group is a hosted virtual machine and one or more programs of the first user are part of a virtual machine image. The method according to paragraph 33.

Section 53.
In order to provide a desirable program execution capacity for use to execute one or more software programs on behalf of the first user under the control of the configured computing system, the first time Receiving an indication of a first group of computing nodes associated with a user;
In the second time after the first time, automatically determining the actual program execution capacity available to the first user from the computing nodes in the first group, The program execution capacity of the first group was provided to the first user for the first time based at least in part on one or more changes to the availability of one or more of the plurality of computing nodes of the first group. Determining that it is different from the desired program execution capacity;
A modified desired program that is provided to the first user a second time, each based on a plurality of independent events, each occurring after the first time and each specifying a directed modification of the desired program execution capacity Automatically determining the execution capacity, wherein the desired modified program execution capacity for the second time is provided on the first time, based on the specified directed total of multiple independent events. Determining that the desired program execution capacity is different from the indicated
Automatically correct computing nodes that are part of the first group the second time so that the desired program execution capacity modified the second time matches the actual program execution capacity determined the second time Wherein the modified computing node is for use to provide a modified desired program execution capacity for the first user, performing the method including modifying A computer readable medium wherein the content configures the computing system to dynamically modify a user's program execution capacity.

  Section 54. The configured computing system is part of a program execution service that provides a plurality of computing nodes configurable to execute a program of a user of the program execution service, the first group of the plurality of computing nodes Is a subset of a plurality of computing nodes and is automatically sent to the first user the first time by a program execution service that responds to a request for the desired program execution capacity received from the first user before the first time. And the first user further includes one or more capacity modification triggers for use to later initiate automated modifications to the desired program execution capacity, the determined modified desired program Multiple independent events based on execution capacity Is a comprises at least one capacitive modification trigger is determined, and at least one capacitance correction command is dynamically specified by the first user, a computer-readable medium according to the 53 section.

  Section 55. The one or more software programs may support the at least one other software program running on the at least one computing system that is not part of the first group. One or more of the at least one capacity modification triggers that are executed on the storage node and determined to be satisfied are each one or more based on state information obtained for execution of at least one other software program 56. The computer readable medium of clause 54, having a reference.

  Section 56. The indicated desired program execution capacity provided for the first time to the first user is recorded by the program execution service as the initial public program execution capacity available to the first user for the first time, Identifies one or more availability changes for one or more computing nodes of the first group to reflect one or more availability changes and is available to the first user Monitoring the computing nodes of the first group in the first to second time period to update the recorded public program execution capacity of the various program execution services, The recorded public program execution capacity of the program execution service available to the user is automatically determined for the desired program execution capacity modified the second time. Modifying a computing node that is not updated based on the second time and that is part of the first group the second time the public program execution capacity recorded for the second time is desired modified program execution Harmonizing the recorded public program execution capacity that is further executed to harmonize with the capacity is as an additional updated recorded public program execution capacity of the program execution service available to the first user. 55. The computer readable medium of clause 54, comprising identifying a desired program execution capacity that has been modified a second time.

  Section 57. The computer readable medium is at least one of a memory of a computing system that stores content and a data transmission medium that includes a generated stored data signal containing the content, the content being computed when executed. 54. The computer readable medium of clause 53, instructions for causing a system to perform a method.

Section 58. A computing system configured to dynamically modify program execution capacity for a user,
One or more processors;
For each of multiple users
To determine a desired program execution capacity for use to execute one or more software programs on behalf of a user, and later to initiate automated modifications to the desired program execution capacity for the user Determining one or more capacity correction triggers to use;
Automatically associating a group of a plurality of available computing nodes with a user for a first time for use to provide the determined desired program execution capacity to the user;
In the second time after the first time, the actual program execution capacity available to the user from the computing nodes in the group is automatically determined after the first time, and the second actual program Determining that the execution capacity is different from the desired program execution capacity provided to the user for the first time;
Automatically the modified desired program execution capacity provided to the user a second time, each based on multiple independent events that occur after the first and each have an associated modification of the desired program execution capacity Wherein the plurality of independent events includes at least one of the capacity modification triggers determined to be satisfied, and includes at least one capacity modification instruction dynamically specified by the user. Including, determining the desired program execution capacity modified the second time based on a sum of associated modifications of multiple independent events;
The second is to automatically modify the computing nodes that are part of the group to match the desired program execution capacity modified the second time with the actual program execution capacity determined the second time. The modified computing node is for use to provide a modified desired program execution capacity to the user, by modifying,
A system manager module configured to manage program execution capacity for a plurality of users of a network accessible service when executed by at least one of the one or more processors. system.

  Section 59. The determined desired program execution capacity for one of a plurality of users is indicated by one user and is recorded as available to one user at a first time initial public Automatically identifying the actual program execution capacity that is identified as program execution capacity and available to one user for the second time is from the first time to the second time to identify one or more changes. In the period of time, based at least in part on monitoring computing nodes of a group of users, monitoring the computing nodes reflects one or more changes to reflect one or more changes. Including updating the recorded public program execution capacity available to the user, the recorded public program execution capacity available to one user is the second time Modifying the computing nodes that are part of the group for the second time, not updated based on automatically determining the correct desired program execution capacity, is the second time recorded public program execution capacity Is further executed to match the desired program execution capacity modified the second time, and reconciling the recorded public program execution capacity is further updated recorded available to one user 59. The computing system of clause 58, comprising identifying the desired program execution capacity modified a second time as the public program execution capacity.

  Section 60. The capacity modification trigger determined for one user is specified by one user and the network accessible service is a plurality of computing configurable to execute a program of a remote user of the program execution service. 60. The computing system of clause 59, wherein the computing system is a program execution service that provides a node, and for each of at least one of the plurality of users, the group of computing nodes is a subset of the plurality of computing nodes.

  Section 61. 59. The computing system of clause 58, wherein the system manager module includes software instructions for execution by the computing system.

Section 62. For each of multiple users
To determine a desired program execution capacity for use to execute one or more software programs on behalf of a user and to initiate automated modifications to the desired program execution capacity for the user later Determining one or more capacity correction triggers;
Automatically associating a group of a plurality of available computing nodes with a user for a first time for use to provide the user with the desired program execution capacity determined;
After the first time, the second time after the first time is to automatically determine the actual program execution capacity available to the user from the computing nodes in the group after the first time. Determining that the program execution capacity is different from the desired program execution capacity provided to the user for the first time;
Automatic modified desired program execution capacity provided to the user a second time, each based on multiple independent events, each occurring after the first and each having an associated modification of the desired program execution capacity The plurality of independent events includes at least one of the capacity modification triggers determined to be satisfied and includes at least one capacity modification instruction dynamically specified by the user. Determining a desired program execution capacity modified a second time based on a sum of associated modifications of multiple independent events;
The second is to automatically modify the computing nodes that are part of the group to match the desired program execution capacity modified the second time with the actual program execution capacity determined the second time. The modified computing node is for use to provide the modified desired program execution capacity to the user, and the modifying allows the system manager module to be a network accessible service. 59. The computing system of clause 58, comprising means for managing program execution capacity for a plurality of users.

  From the foregoing, it will be understood that although particular embodiments have been described herein for purposes of illustration, various modifications may be made without departing from the spirit and scope of the invention. Accordingly, the invention is not limited except as by the appended claims and the elements recited therein. Furthermore, while specific aspects of the invention are set forth below in certain claim forms, the inventors contemplate the various aspects of the invention in any available claim form. For example, only some aspects of the invention may currently be enumerated as being embodied in a computer readable medium, and other aspects may be similarly embodied as such.

Claims (15)

A computer-implemented method for determining causality of dynamic modification in program execution capacity provided to a user, the method comprising:
Configurable to execute a program of the user of the program execution service under the control of one or more computing systems configured to provide a program execution service for use by a plurality of users Under the control, the program execution service has a plurality of computing nodes.
Receiving an indication of an initial desired program execution capacity for executing one or more software programs on behalf of a first user of the program execution service;
Determining a plurality of capacity modification triggers for use in initiating automated modifications to the program execution capacity provided to the first user at a later time, wherein each of the capacity modification triggers comprises: Determining, including one or more criteria for use in determining whether a capacity modification trigger is satisfied, including a particular type of program execution capacity modification requested when the capacity modification trigger is satisfied; ,
Automatically determining a first group of the plurality of various computing nodes for use in providing the initial desired program execution capacity of the first user; Making a computing node available at a first time to each run one or more software programs for the first user;
A plurality of times that occur in a period between the first time and a second time thereafter, and each may cause a modification of the program execution capacity provided by the plurality of computing nodes of the first group; Automatically identifying independent events, wherein the plurality of events includes at least one of the specified capacity modification triggers determined to be satisfied;
In the second time, automatically determining an actual program execution capacity available to the first user from the computing nodes of the first group, wherein the actual program execution capacity in the second time Program execution capacity is based at least in part on one or more changes to the availability of one or more computing nodes of the first group that occurred in the period between the first and second times. Determining that it is distinguishable from the desired program execution capacity provided to the first user at the first time;
For each of the availability changes of the one or more computing nodes of the first group, automatically one or more of the identified events as a cause of the availability change In conclusion, at least one of the availability changes is a combination of a plurality of events that are independent of each other and is determined to be satisfied, at least one specified To have a cause, to conclude, including one or more of the capacity correction triggers, and to perform one or more additional actions in response to the concluded cause Providing an indication of the concluded cause for each of one or more of the availability changes.   The plurality of events are at least one capacity modification dynamically specified by the first user to request a modification specified for the program execution capacity provided by the first group. The combination of a plurality of events concluded as the cause of one of the at least one availability change further comprising one or more of the at least one specified capacity modification instruction. The method of claim 1 comprising.   Determining the actual program execution capacity automatically includes determining a plurality of availability changes that have occurred, and the one or more of the causes of each of the availability changes Automatically concludes an event each identifying one or more of the plurality of events that is a single cause of one of the plurality of availability changes; All of the plurality of events that are not a single cause of the one of the plurality of availability changes as part of the combination of the plurality of availability changes that have no cause of The method of claim 1, comprising: summing.   For each one or more additional time periods that occur after the second time, automatically attributing one or more additional identified events as a cause of availability changes that occur in the additional time period. For one of the additional identified events responsible for one of the availability changes that occurred in one of the one or more additional time periods. The method of claim 1, wherein the identified event is a result of one of the availability changes that occurred in the period between the first time and the second time. A computing system configured to determine causality of dynamic modifications within program execution capacity for a user, comprising:
One or more processors;
For each of the plurality of users,
Determining an initial program execution capacity provided for use to execute one or more software programs on behalf of the user and automated to the program execution capacity provided to the user; Determining one or more capacity correction triggers for use to initiate subsequent corrections;
Automatically associating a group of a plurality of available computing nodes with the user at a first time for use to provide the user with the initial desired program execution capacity;
After the first time,
Automatically identifying a plurality of independent events that occur between the first time and the second time after, and each having an associated desirable modification of the program execution capacity of the group, Automatically identifying the plurality of events including at least one of the capacity modification triggers that have been determined to be satisfied;
Automatically determining one or more changes to the availability of one or more computing nodes of the group that affect the program execution capacity provided by the group;
Automatically deciding one or more causes for each of the determined availability changes of the group, wherein the one is concluded on at least one of the availability changes. One or more causes are a combination of the identified independent events, and the one or more causes concluded to at least one other change of the availability change are the One or more of the determined one or more of the determined availability changes of the group that are a single one of the identified independent events And, when executed by at least one of the one or more processors, manages the program execution capacity of a plurality of users of services accessible on the network. A computing system comprising: a system manager module configured to:   The plurality of independent events for one of the plurality of users further includes at least one capacity modification instruction dynamically specified by the one user, and the system manager module includes the at least one Based on the desired modification aggregating of one filled capacity modification trigger and the at least one capacity modification instruction specified by the one user, the group of the one user in the group. A single aggregated modification is automatically determined to create program execution capacity, and the determined single aggregated to the group of one user before the second time Further configured to initiate a modification, wherein the determined single aggregate modification is the at least one utilization for the one user The combination of the plurality of independent events that is one of the performance changes and is concluded as the one or more causes of the determined single aggregated correction is the at least one satisfaction The computing system of claim 5, comprising: a modified capacity modification trigger and the at least one capacity modification instruction specified by the one user.   The determined capacity modification trigger for the one user is specified by the one user and the network accessible service can be configured to execute a remote user program of the program execution service A program execution service providing a plurality of computing nodes, wherein the plurality of computing nodes of each group of at least one of the plurality of users is a subset of the plurality of computing nodes. The computing system according to claim 6. A computer-implementable method for dynamically modifying a user's program execution capacity, the method comprising:
Configurable to execute a program of the user of the program execution service under the control of one or more computing systems configured to provide a program execution service for use by a plurality of users Under the control, the program execution service has a plurality of computing nodes,
Specify an initial desired program execution capacity for use to execute one or more software programs on behalf of the first user of the program execution service, and make automated modifications to the desired program execution capacity Receiving information specifying one or more capacity correction triggers for use to start later, each of the capacity correction triggers determining whether the capacity correction trigger is met Receiving one or more criteria for use to include and including a specified type of modification to the desired program execution capacity requested when the capacity modification trigger is satisfied;
Automatically determining a first group of the plurality of computing nodes for use to provide the initial desired program execution capacity of the first user and available at a first time; It is recorded that each of the computing nodes of the first group executes one or more software programs for the first user and is available to the first user at the first time. Specifying the initial desired program execution capacity as a public program execution capacity,
After the first time, to determine one or more types of current values of the performance characteristics of these computing nodes with respect to the execution of the one or more software programs, the first group of the Monitoring a computing node, the monitoring being the actual second available to the first user from the first group of computing nodes in the second time after the first time. Monitoring, including determining program execution capacity;
Automatically determining to modify the desired program execution capacity of the first user based on a plurality of events occurring during a period between the first time and the second time, wherein A plurality of events includes at least one of the specified capacity modification triggers that are determined to be satisfied based in part on the determined current value of the one or more performance characteristic types. And at least one capacity modification instruction dynamically specified by the first user, wherein each of the at least one designated capacity modification trigger and the at least one capacity modification instruction is the desired program execution Indicating a specified modification to the capacity, determining, and the actual program execution capacity determined in the second time, and the modified desired Automatically reconciling the recorded public program execution capacity available to the first user with a new program execution capacity, wherein the modified computing node is the modified desirable The record is available to provide program execution capacity and the recorded public program execution capacity is updated to reflect the provided modified desired program execution capacity Harmonizing the determined public program execution capacity automatically automates the computing nodes that are part of the first group according to the determined actual program execution capacity and the modified desired program execution capacity. Including refining, harmonizing.   The program execution capacity of the first group is based on the number of computing nodes that are part of the first group so that the initial desired program execution capacity is the number of initial desired computing nodes. The determined actual program execution capacity for the second time is the number of actual computing nodes available as part of the first group for the second time, and the desired program execution Automatically determining to modify capacity comprises determining the modified desired program execution capacity as a modified desired amount of computing nodes of the first group; The automatically modifying the computing nodes that are part of a first group is preferably the modified Wherein said computing node comprising changing the actual number, The method of claim 8 which is a part of the first group as is.   The program execution capacity of the first group is measured based on totaling each of a plurality of types of computing resources available from the computing nodes that are part of the first group, and Said automatically modifying said computing node that is part of a first group after said automatically modifying said computing node from said computing node that is part of said first group; 9. The method of claim 8, comprising changing a total metric of at least one number of the plurality of types of available computing resources.   The one or more criteria for each of the at least one specified capacity modification trigger is based on one or more specified values for at least one of the one or more performance characteristic types, the method comprising: At least a match between the one or more specified values for each of the at least one specified capacity modification trigger and the determined current value of the one or more performance characteristic types 9. The method of claim 8, further comprising, based in part, automatically determining that the at least one specified capacity modification trigger is met.   The determining the modified desired program execution capacity of the first group is the desired program execution capacity specified by each of the at least one specified capacity modification trigger and the at least one capacity modification instruction. Summing the indicated modification to the specified and specifying the determined modified desired program execution capacity based on the aggregated indicated modification to the desired program execution capacity. 9. The method of claim 8, comprising. A computing system configured to dynamically modify program execution capacity for a user,
One or more processors;
For each of the plurality of users,
Determining a desired program execution capacity to use for executing one or more software programs on behalf of the user and starting automated modifications to the desired program execution capacity for the user later Determining one or more capacity correction triggers to use to
Automatically associating a plurality of available computing nodes with the user at a first time for use to provide the determined desired program execution capacity to the user;
After the first time,
In the second time after the first time, automatically determining the actual program execution capacity available to the user from the computing nodes of the group, the second actual program execution Determining that the capacity is different from the desired program execution capacity provided to the user for the first time;
The modified desired program execution capacity provided to the user for the second time, each based on a plurality of independent events that each occur after the first time and each have an associated modification of the desired program execution capacity. Wherein the plurality of independent events include at least one of the capacity modification triggers that have been determined to be satisfied and are dynamically specified by the user Determining, based on a sum of the associated modifications of the plurality of independent events, and determining the desired program execution capacity modified at the second time, and including at least one capacity modification instruction; and Harmonizing the modified desired program execution capacity with the second determined actual program execution capacity Automatically modifying the computing nodes that are part of the second time group, wherein the modified computing nodes provide the modified desired program execution capacity to the user. A program for a plurality of users of a network accessible service when executed by at least one of the one or more processors by modifying, for use in providing A computing system comprising: a system manager module configured to manage execution capacity.   The determined desirable program execution capacity for one of the plurality of users is identified as an initial public program execution capacity recorded as available to the one user for the first time. And automatically determining the actual program execution capacity available to the one user for the second time as directed by the one user so as to identify one or more changes The monitoring of the computing node based at least in part on monitoring the computing node of the group for the one user during the first to second time period, Updating the recorded public program execution capacity available to the one user to reflect the one or more changes. The recorded public program execution capacity available to the one user is not updated based on the automatic determination of the modified desired program execution capacity at the second time, and the second time The modifying of the computing nodes that are part of the group in order to reconcile the recorded public program execution capacity at the second time with the modified desired program execution capacity at the second time. The reconciliation of the recorded public program execution capacity is further performed at the second time as the updated recorded public program execution capacity available to the one user. 14. The computing system of claim 13, comprising identifying a desired program execution capacity.   The determined capacity modification trigger of the one user is specified by the one user, and the network accessible service can be configured to execute a program of a remote user of the program execution service. A program execution service providing a plurality of computing nodes, wherein the plurality of computing nodes of the group for each of at least one of the plurality of users is a subset of the plurality of computing nodes; The computing system of claim 13.

Images