Resource Manager Architecture Utilizing a Policy Manager

• US 20060136988A1
• Filed: 02/27/2006
• Published: 06/22/2006
• Est. Priority Date: 05/02/2000
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: McDowell, Sean C., Sankaranarayan, Mukund, Srinivasan, Jai, Raja, Jayachandran, Speed, Robin, Bakin, David S.
• Granted Patent: US 7,316,020 B2
• Time in Patent Office: Days
• US Class Current: 726/1
• CPC Class Codes: G06F 2209/5021 Priority
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals

Abstract

Resource management architectures implemented in computer systems to manage resources are described. In one embodiment, a general architecture includes a resource manager and multiple resource providers that support one or more resource consumers such as a system component or application. Each provider is associated with a resource and acts as the manager for the resource when interfacing with the resource manager. The resource manager arbitrates access to the resources provided by the resource providers on behalf of the consumers. A policy manager sets various policies that are used by the resource manager to allocate resources. One policy is a priority-based policy that distinguishes among which applications and/or users have priority over others to use the resources. A resource consumer creates an “activity” at the resource manager and builds one or more “configurations” that describe various sets of preferred resources required to perform the activity. Each resource consumer can specify one or more configurations for each activity. If multiple configurations are specified, the resource consumer can rank them according to preference. This allows the resource consumers to be dynamically changed from one configuration to another as operating conditions change.

Claims

1. A method, comprising:

receiving requests from multiple consumers that seek to allocate resources to perform one or more computing-based tasks, the multiple consumers creating activity data structures that are associated with the one or more computing-based tasks to be performed by the multiple consumers;

prioritizing the activity data structures with a policy manager, the prioritizing according to one of multiple policies that defines which of the activity data structures are to be allocated the resources;

allocating the resources to the activity data structures with a resource manager, the allocating based on a priority ordering of the activity data structures by the policy manager;

the policy manager including a kernel component that resides at a kernel level, a user component that resides at a user level, and an interaction buffer facilitating communication between the kernel component and the user component; and

the user component including an activity list of the activity data structures, a policies component maintaining the policies which are implemented to prioritize the activity data structures, and a dispatch engine maintaining the activity list and dispatching the activity list to the policies component.

2. The method of claim 1, wherein at least one of the multiple consumers comprises an application program.

3. The method of claim 1, wherein prioritizing the activity data structures includes prioritizing the activity data structures according to a priority-based policy in which higher priority consumers are given precedent over lower priority consumers.

4. The method of claim 1, wherein prioritizing the activity data structures includes prioritizing the activity data structures according to a priority-based policy in which higher priority consumers are given precedent over lower priority consumers and wherein the consumers do not set the priorities of the activity data structures.

5. The method of claim 1, wherein prioritizing the activity data structures includes prioritizing the activity data structures according to a priority-based policy in which higher priority activity data structures are given precedent over lower priority activity data structures.

6. The method of claim 1, wherein prioritizing the activity data structures includes prioritizing the activity data structures according to a priority-based policy in which more important activity data structures are given precedent over less important activity data structures.

7. The method of claim 1, further comprising prioritizing the activity data structures with a fixed priority based policy of the user component, the activity data structures prioritized according to a user-defined importance ordering of activities associated with the activity data structures.

8. The method of claim 1, wherein one or more of the multiple consumers comprises a user interactive application associated with the activity data structures, and the method further comprising prioritizing the activity data structures with a focus based policy of the user component, the activity data structures prioritized according to a focus history of user interactive applications.

9. The method of claim 1, further comprising resolving a resource conflict between two or more activity data structures with a user resolution policy of the user component.

10. The method of claim 1, further comprising resolving resource conflicts between two or more activity data structures with the policies component, and wherein the user component comprises:

the policies comprising a fixed priority based policy, a focus based policy, and a user resolution policy; and

the fixed priority based policy being implemented first, the focus based policy being implemented if the fixed priority based policy fails to prioritize the activity data structures, and the user resolution policy being implemented if the focus based policy fails to prioritize the activity data structures.

11. The method of claim 1, wherein the multiple consumers create the activity data structures at the resource manager by submitting requests to reserve the resources to the resource manager.

12. The method of claim 1, wherein allocating the resources to the activity data structures includes allocating the resources to the consumers based on a priority ordering of the activity data structures established at the policy manager in which higher priority consumers are given precedent over lower priority consumers.

13. The method of claim 1, further comprising notifying the policy manager of an activity data structure event that indicates to the policy manager to prioritize the activity data structures.

14. The method of claim 13, wherein the activity data structure event includes at least one of creating an activity data structure or destroying an activity data structure.

15. The method of claim 13, wherein the activity data structure event includes at least one of an activity data structure requesting to reserve resources or unreserving resources.

16. One or more computer readable media comprising computer executable instructions that, when executed, direct a policy management architecture to:

receive requests from multiple consumers that seek to allocate resources to perform one or more computing-based tasks, the multiple consumers creating activity data structures that are associated with the one or more computing-based tasks to be performed by the multiple consumers;

prioritize the activity data structures with a policy manager according to one of multiple policies that defines which of the activity data structures are to be allocated the resources;

allocate the resources to the activity data structures with a resource manager based on a priority ordering of the activity data structures by the policy manager;

the policy manager including a kernel component that resides at a kernel level, a user component that resides at a user level, and an interaction buffer that facilitates communication between the kernel component and the user component; and

the user component including an activity list of the activity data structures, a policies component that maintains the policies which are implemented to prioritize the activity data structures, and a dispatch engine that maintains the activity list and dispatches the activity list to the policies component.

17. One or more computer-readable media as recited in claim 16, further comprising computer executable instructions that, when executed, direct the policy management architecture to prioritize the activity data structures according to a priority-based policy in which higher priority consumers are given precedent over lower priority consumers.

18. One or more computer-readable media as recited in claim 16, further comprising computer executable instructions that, when executed, direct the policy management architecture to prioritize the activity data structures according to a priority-based policy in which higher priority consumers are given precedent over lower priority consumers and wherein the consumers do not set the priorities of the activity data structures.

19. One or more computer-readable media as recited in claim 16, further comprising computer executable instructions that, when executed, direct the policy management architecture to prioritize the activity data structures according to a priority-based policy in which higher priority activity data structures are given precedent over lower priority activity data structures.

20. One or more computer-readable media as recited in claim 16, further comprising computer executable instructions that, when executed, direct the policy management architecture to prioritize the activity data structures according to a priority-based policy in which more important activity data structures are given precedent over less important activity data structures.