ACQUISITION AND MAINTENANCE OF COMPUTE CAPACITY

• US 20190102231A1
• Filed: 08/30/2018
• Published: 04/04/2019
• Est. Priority Date: 12/21/2015
• Status: Active Grant

• Current Assignee: Amazon Technologies, Inc. (Amazon.com, Inc.)
• Original Assignee: Amazon Technologies, Inc. (Amazon.com, Inc.)
• Inventors: Wagner, Timothy Allen
• Granted Patent: US 10,691,498 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 2009/45562 Creating, deleting, cloning virtual machine instances
• CPC Class Codes: G06F 2009/45575 Starting, stopping, suspending or resuming virtual machine instances
• CPC Class Codes: G06F 2209/5011 Pool
• CPC Class Codes: G06F 2209/5013 Request control
• CPC Class Codes: G06F 2209/506 Constraint
• CPC Class Codes: G06F 9/45558 Hypervisor-specific management and integration aspects
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals
• CPC Class Codes: G06F 9/5055 considering software capabilities, i.e. software resources associated or available to the machine
• CPC Class Codes: G06F 9/5077 Logical partitioning of resources; Management or configuration of virtualized resources specific details on emulation or internal functioning of virtual machines G06F9/455

Abstract

A system for providing low-latency computational capacity from a virtual compute fleet is provided. The system may be configured to maintain a plurality of virtual machine instances on one or more physical computing devices, wherein the plurality of virtual machine instances comprises a first pool comprising a first sub-pool of virtual machine instances and a second sub-pool of virtual machine instances, and a second pool comprising virtual machine instances used for executing one or more program codes thereon. The first sub-pool and/or the second sub-pool may be associated with one or more users of the system. The system may be further configured to process code execution requests and execute program codes on the virtual machine instances of the first or second sub-pool.

Claims

1. (canceled)

2. A system, comprising:

one or more processors; and

one or more memories, the one or more memories having stored thereon instructions, which, when executed by the one or more processors, configure the one or more processors to;

receive, at a first time, a request to execute a program code, the request including information usable for executing the program code;

determine, based at least on the information included in the request, that the requested execution of the program code is not time-sensitive; and

subsequent to determining that the requested execution of the program code is not time-sensitive, acquire compute capacity for a second time subsequent to the first time such that performing the requested execution of the program code using the acquired computed capacity would consume resources that are in lower demand or consume less resources compared to performing the requested execution of the program code using compute capacity available at the first time; and

cause the program code to be executed using the acquired compute capacity.

3. The system of claim 2, wherein the instructions, when executed by the one or more processors, further configure the one or more processors to:

receive, at a third time, another request to execute another program code, said another request including information usable for executing said another program code;

determine, based at least on the information included in said another request, that the requested execution of said another program code is time-sensitive; and

cause said another program code to be executed using compute capacity available at the third time.

4. The system of claim 2, wherein the instructions, when executed by the one or more processors, further configure the one or more processors to determine that the requested execution of the program code is not time-sensitive based on a flag included in the request indicating that the request is not a time-sensitive request.

5. The system of claim 2, wherein the instructions, when executed by the one or more processors, further configure the one or more processors to determine that the requested execution of the program code is not time-sensitive based on a program code identifier included in the request that identifies the program code.

6. The system of claim 2, wherein the instructions, when executed by the one or more processors, further configure the one or more processors to determine that the requested execution of the program code is not time-sensitive based on a user identifier included in the request that identifies a user associated with the program code.

7. The system of claim 2, wherein the instructions, when executed by the one or more processors, further configure the one or more processors to:

determine a time period during which the requested execution of the program code should be performed; and

determine that performing the requested execution of the program code at the second time within the time period would consume resources that are in lower demand or consume less resources than performing the requested execution of the program code at one or more other times within the time period.

8. The system of claim 7, wherein the request indicates the time period during which the requested execution of the program code should be performed.

9. A computer-implemented method, comprising:

as implemented by one or more computing devices configured with specific executable instructions,

receiving, at a first time, a request to execute a program code, the request including information usable for executing the program code;

determining, based at least on the information included in the request, that the requested execution of the program code is not time-sensitive; and

subsequent to determining that the requested execution of the program code is not time-sensitive, acquiring compute capacity for a second time subsequent to the first time such that performing the requested execution of the program code using the acquired computed capacity would consume resources that are in lower demand or consume less resources compared to performing the requested execution of the program code using compute capacity available at the first time; and

causing the program code to be executed using the acquired compute capacity.

10. The method of claim 9, further comprising:

receiving, at a third time, another request to execute another program code, said another request including information usable for executing said another program code;

determining, based at least on the information included in said another request, that the requested execution of said another program code is time-sensitive; and

causing said another program code to be executed using compute capacity available at the third time.

11. The method of claim 9, further comprising determining that the requested execution of the program code is not time-sensitive based on a flag included in the request indicating that the request is not a time-sensitive request.

12. The method of claim 9, further comprising determining that the requested execution of the program code is not time-sensitive based on a program code identifier included in the request that identifies the program code.

13. The method of claim 9, further comprising determining that the requested execution of the program code is not time-sensitive based on a user identifier included in the request that identifies a user associated with the program code.

14. The method of claim 9, further comprising:

determining a time period during which the requested execution of the program code should be performed; and

determining that performing the requested execution of the program code at the second time within the time period would consume resources that are in lower demand or consume less resources than performing the requested execution of the program code at one or more other times within the time period.

15. The method of claim 14, wherein the request indicates the time period during which the requested execution of the program code should be performed.

16. Non-transitory physical computer storage including computer-executable instructions that, when executed by a computing system, cause the computing system to:

receive, at a first time, a request to execute a program code, the request including information usable for executing the program code;

determine, based at least on the information included in the request, that the requested execution of the program code is not time-sensitive; and

subsequent to determining that the requested execution of the program code is not time-sensitive, acquire compute capacity for a second time subsequent to the first time such that performing the requested execution of the program code using the acquired computed capacity would consume resources that are in lower demand or consume less resources compared to performing the requested execution of the program code using compute capacity available at the first time; and

cause the program code to be executed using the acquired compute capacity.

17. The non-transitory physical computer storage of claim 16, wherein the instructions further cause the computing system to:

receive, at a third time, another request to execute another program code, said another request including information usable for executing said another program code;

determine, based at least on the information included in said another request, that the requested execution of said another program code is time-sensitive; and

cause said another program code to be executed using compute capacity available at the third time.

18. The non-transitory physical computer storage of claim 16, wherein the instructions further cause the computing system to determine that the requested execution of the program code is not time-sensitive based on a flag included in the request indicating that the request is not a time-sensitive request.

19. The non-transitory physical computer storage of claim 16, wherein the instructions further cause the computing system to determine that the requested execution of the program code is not time-sensitive based on a program code identifier included in the request that identifies the program code.

20. The non-transitory physical computer storage of claim 16, wherein the instructions further cause the computing system to determine that the requested execution of the program code is not time-sensitive based on a user identifier included in the request that identifies a user associated with the program code.

21. The non-transitory physical computer storage of claim 16, wherein the instructions further cause the computing system to:

determine a time period during which the requested execution of the program code should be performed; and

determine that performing the requested execution of the program code at the second time within the time period would consume resources that are in lower demand or consume less resources than performing the requested execution of the program code at one or more other times within the time period.