Abstract: A method and apparatus are provided for a dynamic information connection search engine. User actions may be detected on at least one client system. In response, a determination may be made whether the user is searching for supported information. When the user is searching for supported information, information may be extracted electronically from, for example, third party websites, direct supplier connections, and/or intermediate databases. Potential suppliers may be automatically selected in response to the detected user search. Queries may be formulated from the user search and transferred to one or more selected suppliers over a network coupling (e.g., the Internet and/or an intranet). The queries may include one or more requests for information. One or more responses may be received from the suppliers, and the responses may be used to generate a result list for the user. The result list may include information and/or query status information.

Abstract: Systems and methods for managing deployment of an update to computing devices are provided. An update deployment manager determines one or more initial computing devices to receive and execute an update. The update deployment manager further monitors a set of performance metrics with respect to the initial computing devices or a collection of computing devices. The update deployment manager may modify the rate of deployment based on the monitored performance metrics. For example, the update deployment manager may select additional computing devices to receive and execute an update. Further, the update deployment manager may halt deployment of the update. Moreover, the update deployment manager may rollback the deployment of the update.

Abstract: A set of virtualized computing services may include multiple types of virtualized data store differentiated by characteristics such as latency, throughput, durability and cost. A sequence of captures of a data set from one data store to another may be scheduled to achieve a variety of virtualized computing service user and provider goals such as lowering a probability of data loss, lowering costs, and computing resource load leveling. Data set captures may be scheduled according to policies specifying fixed and flexible schedules and conditions including flexible scheduling windows, target capture frequencies, probability of loss targets and/or cost targets. Capture lifetimes may also be managed with capture retention policies, which may specify fixed and flexible lifetimes and conditions including cost targets. Such data set capture policies may be specified with a Web-based administrative interface to a control plane of the virtualized computing services.

Abstract: Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store block data that may be accessed over one or more networks by programs executing on other physical computing systems. Users may create block data storage volumes that are each stored by at least two of the server block data storage systems, and may initiate use of such volumes by one or more executing programs, such as in a reliable manner by enabling an automatic switch to a second volume copy if a first volume copy becomes unavailable. A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other physical computing systems at that data center.

Abstract: Methods and apparatus for dynamic pricing of cloud resources for stateful applications are disclosed. A system includes a resource manager and a plurality of execution platforms. The resource manager stores client-provided application packages in a repository, where each package includes an executable object and has an associated pricing constraint. The resource manager selects a particular execution platform on which to schedule execution of the executable object of a particular application package, based at least in part on a current pricing of execution units of the particular execution platform and the pricing constraint of the application package. In response to a price-based interruption event, a representation of a state of the application is saved, and the execution of the application on the particular execution platform is stopped.

Abstract: Methods and apparatus for flexible-location reservations and pricing for network-accessible resources are disclosed. A system includes a plurality of resources of a provider network distributed across multiple locations, and a resource manager. The resource manager implements a programmatic interface to allow a client to specify a flexible location option for a resource reservation request, indicating that the resource manager is to select one or more locations at which to reserve resource capacity. When a reservation request with the flexible location option specified is received, the resource manager selects a particular location based at least in part on heuristics using resource utilization data. In response to a resource activation request for the reservation, the resource manager activates a resource at a launch location selected from the multiple locations.

Abstract: Method and apparatus for dynamic information connection search engine. User actions may be detected on at least one client system. Determination may be made whether the user is searching for supported information. When the user is searching for supported information, information may be extracted electronically from, e.g., third party websites, direct supplier connections, and/or intermediate databases. Suppliers may be automatically selected in response to the user search. Queries may be formulated from the user search and transferred to one or more selected suppliers over a network coupling (e.g., the Internet and/or intranet). Queries may include one or more requests for information. One or more responses may be received from suppliers, and responses may be used to generate results for the user. Results may include information and/or query status information. An electronic link may be provided to a website of one or more suppliers from which information was derived.

Abstract: Methods and apparatus for flexible-location reservations and pricing for network-accessible resources are disclosed. A system includes a plurality of resources of a provider network distributed across multiple locations, and a resource manager. The resource manager implements a programmatic interface to allow a client to specify a flexible location option for a resource reservation request, indicating that the resource manager is to select one or more locations at which to reserve resource capacity. When a reservation request with the flexible location option specified is received, the resource manager selects a particular location based at least in part on heuristics using resource utilization data. In response to a resource activation request for the reservation, the resource manager activates a resource at a launch location selected from the multiple locations.

Abstract: A set of virtualized computing services may include multiple types of virtualized data store differentiated by characteristics such as latency, throughput, durability and cost. A sequence of captures of a data set from one data store to another may be scheduled to achieve a variety of virtualized computing service user and provider goals such as lowering a probability of data loss, lowering costs, and computing resource load leveling. Data set captures may be scheduled according to policies specifying fixed and flexible schedules and conditions including flexible scheduling windows, target capture frequencies, probability of loss targets and/or cost targets. Capture lifetimes may also be managed with capture retention policies, which may specify fixed and flexible lifetimes and conditions including cost targets. Such data set capture policies may be specified with a Web-based administrative interface to a control plane of the virtualized computing services.

Abstract: A method and apparatus are provided for a dynamic information connection search engine. User actions may be detected on at least one client system. In response, a determination may be made whether the user is searching for supported information. When the user is searching for supported information, information may be extracted electronically from, for example, third party websites, direct supplier connections, and/or intermediate databases. Potential suppliers may be automatically selected in response to the detected user search. Queries may be formulated from the user search and transferred to one or more selected suppliers over a network coupling (e.g., the Internet and/or an intranet). The queries may include one or more requests for information. One or more responses may be received from the suppliers, and the responses may be used to generate a result list for the user. The result list may include information and/or query status information.

Abstract: A set of virtualized computing services may include multiple types of virtualized data store differentiated by characteristics such as latency, throughput, durability and cost. A sequence of captures of a data set from one data store to another may be scheduled to achieve a variety of virtualized computing service user and provider goals such as lowering a probability of data loss, lowering costs, and computing resource load leveling. Data set captures may be scheduled according to policies specifying fixed and flexible schedules and conditions including flexible scheduling windows, target capture frequencies, probability of loss targets and/or cost targets. Capture lifetimes may also be managed with capture retention policies, which may specify fixed and flexible lifetimes and conditions including cost targets. Such data set capture policies may be specified with a Web-based administrative interface to a control plane of the virtualized computing services.

Abstract: A method and apparatus are provided for a dynamic information connection search engine. User actions may be detected on at least one client system. In response, a determination may be made whether the user is searching for supported information. When the user is searching for supported information, information may be extracted electronically from, for example, third party websites, direct supplier connections, and/or intermediate databases. Potential suppliers may be automatically selected in response to the detected user search. Queries may be formulated from the user search and transferred to one or more selected suppliers over a network coupling (e.g., the Internet and/or an intranet). The queries may include one or more requests for information. One or more responses may be received from the suppliers, and the responses may be used to generate a result list for the user. The result list may include information and/or query status information.

Abstract: Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store network-accessible block data storage volumes that may be used by programs executing on other physical computing systems. A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other physical computing systems at that data center. If a program using a volume becomes unavailable, another program (e.g., another copy of the same program) may in some situations obtain access to and continue to use the same volume, such as in an automatic manner in some such situations.

Abstract: Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store block data that may be accessed over one or more networks by programs executing on other physical computing systems. Users may create block data storage volumes that are each stored by at least two of the server block data storage systems, and may initiate use of such volumes by one or more executing programs, such as in a reliable manner by enabling an automatic switch to a second volume copy if a first volume copy becomes unavailable. A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other physical computing systems at that data center.

Abstract: Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store network-accessible block data storage volumes that may be used by programs executing on other physical computing systems. A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other physical computing systems at that data center. If a program using a volume becomes unavailable, another program (e.g., another copy of the same program) may in some situations obtain access to and continue to use the same volume, such as in an automatic manner in some such situations.

Abstract: Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store copies of network-accessible block data storage volumes that may be used by programs executing on other physical computing systems, and snapshot copies of some volumes may also be stored (e.g., on remote archival storage systems). A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other computing systems at that data center, while the archival storage systems may be located outside the data center. The snapshot copies of volumes may be used in various ways, including to allow users to obtain their own copies of other users' volumes (e.g., for a fee).

Abstract: Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store block data that may be accessed over one or more networks by programs executing on other physical computing systems. Users may create block data storage volumes that are each stored by at least two of the server block data storage systems, and may initiate use of such volumes by one or more executing programs, such as in a reliable manner by enabling an automatic switch to a second volume copy if a first volume copy becomes unavailable. A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other physical computing systems at that data center.

Abstract: Usage of shared resources can be managed by enabling users to obtain different types of guarantees at different times for various types and/or levels of resource capacity. A user can select to have an amount or rate of capacity dedicated to that user. A user can also select reserved capacity for at least a portion of the requests, tasks, or program execution for that user, where the user has priority to that capacity but other users can utilize the excess capacity during other periods. Users can alternatively specify to use the excess capacity or other variable, non-guaranteed capacity. The capacity can be for any appropriate functional aspect of a resource, such as computational capacity, throughput, latency, bandwidth, and storage. Users can submit bids for various types and combinations of excess capacity, and winning bids can receive dedicated use of the excess capacity for at least a period of time.

Abstract: Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store copies of network-accessible block data storage volumes that may be used by programs executing on other physical computing systems, and snapshot copies of some volumes may also be stored (e.g., on remote archival storage systems). A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other computing systems at that data center, while the archival storage systems may be located outside the data center. The snapshot copies of volumes may be used in various ways, including to allow users to obtain their own copies of other users' volumes (e.g., for a fee).

Abstract: Usage of shared resources can be managed by enabling users to obtain different types of guarantees at different times for various types and/or levels of resource capacity. A user can select to have an amount or rate of capacity dedicated to that user. A user can also select reserved capacity for at least a portion of the requests, tasks, or program execution for that user, where the user has priority to that capacity but other users can utilize the excess capacity during other periods. Users can alternatively specify to use the excess capacity or other variable, non-guaranteed capacity. The capacity can be for any appropriate functional aspect of a resource, such as computational capacity, throughput, latency, bandwidth, and storage. Users can submit bids for various types and combinations of excess capacity, and winning bids can receive dedicated use of the excess capacity for at least a period of time.