Adaptive resource management of a data processing system

• US 9,471,378 B2
• Filed: 02/12/2015
• Issued: 10/18/2016
• Est. Priority Date: 05/31/2012
• Status: Active Grant

• Current Assignee: Apple Inc.
• Original Assignee: Apple Inc.
• Inventors: Desai, Lionel D., Crane, Neil G., Sorresso, Damien P., Sokol, Joseph Jr.
• Primary Examiner(s): PORTKA, GARY J
• Application Number:
  US14/620,905
• Publication Number:
  US 20150286500A1
• Time in Patent Office: 614 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
• CPC Class Codes: G06F 9/5016 the resource being the memory
• CPC Class Codes: G06F 9/5022 Mechanisms to release resources
• CPC Class Codes: G06F 9/5038 considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration scheduling strategies G06F9/4881 and subgroups
• CPC Class Codes: G06F 9/528 by using speculative mechanisms
• CPC Class Codes: G09G 2360/12 Frame memory handling
• CPC Class Codes: G09G 5/001 Arbitration of resources in a display system, e.g. control of access to frame buffer by video controller and/or main processor
• CPC Class Codes: G09G 5/14 Display of multiple viewports

Abstract

A method for resource management of a data processing system is described herein. According to one embodiment, a token is periodically pushed into a memory usage queue, where the token includes a timestamp indicating time entering the memory usage queue. The memory usage queue stores a plurality of memory page identifiers (IDs) identifying a plurality of memory pages currently allocated to a plurality of programs running within the data processing system. In response to a request to reduce memory usage, a token is popped from the memory usage queue. A timestamp of the popped token is then compared with current time to determine whether a memory usage reduction action should be performed.

Claims

1. A computer-implemented method for resource management of a data processing system, the method comprising:

for each of a plurality of programs running within the data processing system;

assigning a priority to the program based on a role of the program wherein the role is determined from entitlement information obtained from the program, wherein the entitlement information defines functionality or resources that the program is entitled to request or utilize during execution;

storing a program identifier identifying the program in a priority band of a priority queue, wherein the priority queue includes a plurality of priority bands, each priority band being associated with one of a plurality of priorities, wherein the storing includes storing a data structure associated with the program identifier containing entitlement information obtained from the program;

in response to a request to reduce memory usage of the data processing system, retrieving a program identifier from the priority band of the priority queue that has lowest priority and having at least one program identifier stored therein; and

performing a memory recovery operation on the program having the retrieved program identifier.

2. The method of claim 1, wherein a role of a program indicates whether the program is a critical program, a background program, a foreground program, or a special program to perform a predetermined function and wherein the entitlement information for a program, that is obtained from an image of the program, is compared to the corresponding entitlement information maintained by the data processing system.

3. The method of claim 1 wherein the entitlement information for a program is obtained from an image of the program.

4. The method of claim 1, wherein each of the priority bands includes a head and a tail, wherein a program identifier of a program being assigned with a priority is pushed into a tail of a corresponding priority band, and wherein a program identifier of a program being removed is popped from a head of a corresponding priority band.

5. The method of claim 4, wherein retrieving a program identifier from the priority queue comprises walking through the plurality of priority bands of the priority queue, starting from a lowest priority band to a highest priority band.

6. The method of claim 4, further comprising:

in response to a request to adjust a priority of a first program, removing a first program identifier of the first program from a first priority band of the priority queue; and

inserting the first program identifier into a tail of a second priority band of the priority queue.

7. The method of claim 6, further comprising:

receiving a request from the first program to perform a predetermined action;

determining a second priority corresponding to the second priority band based on the request; and

determining whether the first program is entitled to second priority based on entitlement associated with the first program, wherein the first program identifier is inserted into the second priority band if the first program is entitled.

15. The method of claim 1, wherein entitlement information is defined for a program during program development and stored in a binary image of the program.

16. The method of claim 1, wherein the memory recovery operation comprises one of:

terminating the program associated with the retrieved program identifier;

or

causing the program with the retrieved identifier to reduce its memory consumption.

8. A non-transitory computer-readable storage medium having instructions stored therein, which when executed by a processor, cause the processor to perform a method for resource management of a data processing system, the method comprising:

for each of a plurality of programs running within the data processing system;

assigning a priority to the program based on a role of the program wherein the role is determined from entitlement information obtained from the program, wherein the entitlement information defines functionality or resources that the program is entitled to request or utilize during execution;

storing a program identifier identifying the program in a priority band of a priority queue, wherein the priority queue includes a plurality of priority bands, each priority band being associated with one of a plurality of priorities, wherein the storing includes storing a data structure associated with the program identifier containing entitlement information obtained from the program;

in response to a request to reduce memory usage of the data processing system, retrieving a program identifier from the priority band of the priority queue that has lowest priority and having at least one program identifier stored therein; and

performing a memory recover operation on the program having the retrieved program identifier.

9. The non-transitory computer-readable storage medium of claim 8, wherein a role of a program indicates whether the program is a critical program, a background program, a foreground program, or a special program to perform a predetermined function and wherein the entitlement information for a program, that is obtained from an image of the program, is compared to the corresponding entitlement information maintained by the data processing system.

10. The non-transitory computer-readable storage medium of claim 8 wherein the entitlement information for a program is obtained from an image of the program.

11. The non-transitory computer-readable storage medium of claim 8, wherein each of the priority bands includes a head and a tail, wherein a program identifier of a program being assigned with a priority is pushed into a tail of a corresponding priority band, and wherein a program identifier of a program being removed is popped from a head of a corresponding priority band.

12. The non-transitory computer-readable storage medium of claim 11, wherein retrieving a program identifier from the priority queue comprises walking through the plurality of priority bands of the priority queue, starting from a lowest priority band to a highest priority band.

13. The non-transitory computer-readable storage medium of claim 11, wherein the method further comprises:

in response to a request to adjust a priority of a first program, removing a first program identifier of the first program from a first priority band of the priority queue; and

inserting the first program identifier into a tail of a second priority band of the priority queue.

14. The non-transitory computer-readable storage medium of claim 13, wherein the method further comprises:

receiving a request from the first program to perform a predetermined action;

determining a second priority corresponding to the second priority band based on the request; and

determining whether the first program is entitled to second priority based on entitlement associated with the first program, wherein the first program identifier is inserted into the second priority band if the first program is entitled.