System and method for dynamic allocation of computers in reponse to requests

• US 20050050546A1
• Filed: 08/29/2003
• Published: 03/03/2005
• Est. Priority Date: 08/29/2003
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Narayan, Hari S., Padisetty, Sivaprasad, Remany, Venkata S. S.
• Granted Patent: US 7,721,289 B2
• Time in Patent Office: Days
• US Class Current: 718/105
• CPC Class Codes: G06F 2209/5011 Pool
• CPC Class Codes: G06F 2209/5014 Reservation
• CPC Class Codes: G06F 9/5044 considering hardware capabilities
• CPC Class Codes: G06F 9/5055 considering software capabilities, i.e. software resources associated or available to the machine

Abstract

A mechanism dynamically allocates physical machines (computers) for satisfying requests for the machines, such as in the context of assigning test machines for running test cases. Each request specifies one or more logical machine sets it needs, and each logical machine set has specified requirements. The physical machines are organized into a hierarchical structure that includes groups and subgroups of machines. An allocation engine performs the function of allocating available machines from a selected group in the hierarchy for a request based on the requirements of each logical machine set of the request. A group or subgroup of machines may be marked as “allocate as one unit” and all machines in it will be reserved for one request. A job corresponding to a request may have sub-jobs, and machines allocated for the sub-job are selected from the machines allocated for the parent job.

Claims

1. A computer-readable medium having computer-executable instructions for performing steps for allocating computers in a computer pool in response to requests to use the computers, comprising:

organizing the computers in the computer pool into a hierarchical structure having groups and subgroups of computers;

receiving a request for computers, the request having at least one logical machine set specifying a number of required computers and requirements for the required computers;

identifying a target group of computers from the hierarchical structure of the computer pool;

selecting from the target group computers meeting the requirements of the logical machine set; and

allocating the selected computers to the logical machine set.

2. A computer-readable medium as in claim 1, wherein the step of selecting including referencing a data structure containing up-to-date information about availability and configurations of the computers in the target group for determining whether the computers meet the requirements of the logical machine set.

3. A computer-readable medium as in claim 2, having further computer-executable instructions for performing the step of updating the information in the data structure.

4. A computer-readable medium as in claim 1, wherein the number of required computers of the logical machine set is specified as a range between a minimum number and maximum number, and wherein the step of selecting selects a number of selected computers within the specified range.

5. A computer-readable medium as in claim 1, wherein the target group includes a subgroup of computers marked to be allocated as a whole, and wherein the step of selecting allocates the subgroup of computers to the logical machine set as a whole.

6. A computer-readable medium as in claim 1, wherein the step of identifying identifies the target group based on execution permissions associated with the request.

7. A computer-readable medium as in claim 1, wherein the logical machine set is associated with a job having a sub-job, and wherein the step of selecting includes selecting computers to be allocated to the sub-job from computers allocated to the run.

8. A computer-readable medium as in claim 1, wherein a group in the hierarchical structure has a plurality of individual machines and at least one sub-group of computers.

9. A computer-readable medium as in claim 1, having further computer-executable instructions to perform the step of assigning preferences to the computers in the target group, and wherein the step of selecting selects computers form the target group for allocation to the logical machine set based on the preferences assigned to the computers in the target group.

10. A computer-readable medium as in claim 9, wherein the target group includes a plurality of individual computers and one subgroup marked to be allocated as a whole, and wherein the step of assigning preferences assigns a lower preference to the subgroup.

11. A computer-readable medium as in claim 1, wherein the computer pool is for testing operations, and the request is for allocation of computers for running a test case.

12. A computer-readable medium as in claim 1, having further computer-executable instructions for determining whether a schedule start time for the request has elapsed.

13. A system comprising:

a computer pool having a plurality of computers organized into a hierarchical structure having groups and subgroups of computers;

an allocation engine for allocating computers in the computer pool in response to a request to use computers in the computer pool, the request having at least one logical machine set specifying a number of required computers and requirements for the required computers, the allocation engine being programmed to identify a target group of computers from the hierarchical structure of the computer pool, select from the target group computers meeting the requirements of the logical machine set, and allocate the selected computers to the logical machine set.

14. A system in claim 13, further including a data structure containing up-to-date information of availability and configurations of the computers in the target group, and wherein the allocation engine accesses the data structure for determining whether the computers in the target group meet the requirements of the logical machine set.

15. A system as in claim 13, wherein the number of required computers of the logical machine set is specified as a range between a minimum number and maximum number, and wherein the allocation engine selects a number of selected computers within the specified range.

16. A system as in claim 13, wherein the target group includes a subgroup of computers marked to be allocated as a whole, and wherein allocation engine allocates the subgroup of computers to the logical machine set as a whole.

17. A system as in claim 13, wherein the allocation engine identifies the target group based on execution permissions associated with the request.

18. A system as in claim 13, wherein the logical machine set is associated with a job having a sub-job, and wherein allocation engine selects computers to be allocated to the sub-job from computers allocated to the job.

19. A system as in claim 13, wherein a group in the hierarchical structure has a plurality of individual machines and at least one sub-group of computers.

20. A system as in claim 13, wherein the allocation engine assigns preferences to the computers in the target group, and selects computers form the target group for allocation to the logical machine set based on the preferences assigned to the computers in the target group.

21. A system as in claim 13, wherein the target group includes a plurality of individual computers and one subgroup marked to be allocated as a whole, and wherein the allocation engine assigns a lower preference to the subgroup.

22. A system as in claim 13, wherein the computer pool is for testing operations, and the request is for allocation of computers for running a test case.

23. A method of allocating computers in a computer pool in response to requests to use the computers, comprising:

organizing the computers in the computer pool into a hierarchical structure having groups and subgroups of computers;

receiving a request for computers, the request having at least one logical machine set specifying a number of required computers and requirements for the required computers;

identifying a target group of computers from the hierarchical structure of the computer pool;

selecting from the target group computers meeting the requirements of the logical machine set; and

allocating the selected computers to the logical machine set.

24. A method as in claim 23, wherein the step of selecting including referencing a data structure containing up-to-date information about availability and configurations of the computers in the target group for determining whether the computers meet the requirements of the logical machine set.

25. A method as in claim 24, further including the step of updating the information in the data structure.

26. A method as in claim 23, wherein the number of required computers of the logical machine set is specified as a range between a minimum number and maximum number, and wherein the step of selecting selects a number of selected computers within the specified range.

27. A method as in claim 23, wherein the target group includes a subgroup of computers marked to be allocated as a whole, and wherein the step of selecting allocates the subgroup of computers to the logical machine set as a whole.

28. A method as in claim 23, wherein the step of identifying identifies the target group based on execution permissions associated with the request.

29. A method as in claim 23, wherein the logical machine set is associated with a job having a sub-job, and wherein the step of selecting includes selecting computers to be allocated to the sub-job from computers allocated to the run.

30. A method as in claim 23, further including the step of assigning preferences to the computers in the target group, and wherein the step of selecting selects computers form the target group for allocation to the logical machine set based on the preferences assigned to the computers in the target group.

31. A method as in claim 30, wherein the target group includes a plurality of individual computers and one subgroup marked to be allocated as a whole, and wherein the step of assigning preferences assigns a lower preference to the subgroup.

32. A method as in claim 23, further including the step of determining whether a schedule start time for the request has elapsed.