Method for dynamically allocating and managing resources in a computerized system having multiple consumers

• US 20050246705A1
• Filed: 01/25/2005
• Published: 11/03/2005
• Est. Priority Date: 07/25/2002
• Status: Abandoned Application

• Current Assignee: Parallels Holdings Limited (HNA Technology Co. Ltd.)
• Original Assignee: Sphera Corp. (Corel Holdings LP)
• Inventors: Stoler, Michael, Etelson, Garik, Bondar, Gregory
• Application Number:
  US11/042,478
• Publication Number:
  US 20050246705A1
• Time in Patent Office: Days
• US Class Current: 718/100
• CPC Class Codes: G06F 8/70 Software maintenance or management
• CPC Class Codes: G06F 9/5016 the resource being the memory
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals

Abstract

Method for dynamically allocating and managing resources in a computerized system managed by an operating system (OS) and having multiple accounts of consumers. Portions of the virtual memory address space are allocated, whenever desired, in a swap file, for each account associated with a consumer. The memory address space is limited for each account. The CPU usage is divided between the tasks requested from each account, and segments in the original code of the OS are changed by locating one or more specific procedures in the original code, and modifying the specific procedures to operate according to the allocation and/or the limitation of the memory address space and/or the limitation of the number of processes and/or the divided CPU usage.

Claims

1. A method for dynamically allocating and managing resources in a computerized system managed by an operating system (OS) and having multiple accounts of consumers, comprising:

a) allocating, in a swap file, portions of the virtual memory address space for each account associated with a consumer;

b) limiting the memory address space for each account;

c) dividing the CPU usage between the tasks requested from each account; and

d) changing segments in the original code of said OS by locating one or more specific procedures in said original code, and modifying said specific procedures to operate according to the allocation and/or the limitation of said memory address space and/or the limitation of the number of processes and/or the divided CPU usage.

2. A method according to claim 1, further comprising dynamically modifying the specific procedures to operate in response to varying allocation and/or limitation of the memory address space and/or the divided CPU usage.

3. A method according to claim 1, wherein locating the required procedure comprises obtaining the name of said required procedure that is stored in a symbol table.

4. A method according to claim 1, wherein locating the required procedure is carried out by identifying a sequence of bytes of said required procedure.

5. A method according to claim 1, wherein the modification of a specific procedure comprises:

a) obtaining the allocated memory address space;

b) creating an executable code in said allocated memory address space;

c) copying code segments from the original code;

d) saving the commands line at the beginning of said copied code, and skipping to the beginning of the next command in said original code; and

e) replacing the commands line at the beginning of said original code by skipping to the beginning of said created application, and adding non-operational bytes to the unused bytes of said created application.

6. A method according to claim 4, wherein the blank bytes are No Operations (NOPs) data.

7. A method according to claim 1, wherein the limitation of the memory address space is implemented by performing the following steps:

a) calling the original code whenever the call for consuming resources is not by an account of a specific consumer, and identifying said account by its related parameters;

b) verifying that said account will not exceed its quota, or the quota of the level above it according to said allocated memory address space, whenever resource consumption is required by an account;

c) checking the result of an operation related to said account, whenever it succeeds, updating the consumption data of said account and/or of the levels above said account.

8. A method according to claim 7, wherein the identifying parameters are a user ID, group ID or program name.

9. A method according to claim 1, wherein the limitation of the memory address space is implemented by replacing the original code with a new code, which comprising the steps of:

a) allocating memory for the new code; and

b) replacing the beginning of the original code with a “

jump”

operation to a new code.

10. A method according to claim 9, wherein the new code ends with a “

return”

operation, for ignoring the original code completely.

11. A method according to claim 9, wherein the new code includes partial operations of the original code.

12. A method according to claim 1, further comprising dynamically allocating CPU resources that are not used by tasks to other tasks.

13. A method according to claim 1, wherein the CPU usage is divided between all the tasks uniformly.

14. A method according to claim 1, wherein the division of the CPU usage between the tasks is obtained by modifying the calculation of the “

counter”

of the tasks that are candidates for being executed, so that each task is limited by the quota of the account that is associated with said tasks.

15. A method according to claim 14, wherein the modification of the counter calculation, comprises:

a) Intercepting the function that performs the calculation of the “

counters”

;

b) Calculating the desired “

counter”

value for each task, based on the guaranteed value to the user account and holding the correct value of the counter according to the quotas when its value is calculated whenever there are several tasks that belong to the same account, summing the “

counter”

value of said tasks according to the account, while their internal allocation is currently according to their usage;

c) keeping information regarding the “

behavior”

of each process;

d) calculating on every “

tick”

the amount of CPU resource that the account received during the last time, and adding said calculated amount to the levels above said account;

e) whenever said account or a level above said account receives more than its allocated share, the “

counter”

of the task is decreased to zero, until the next CPU allocation is done; and

f) Whenever a decision is made about the next task to be executed, confirming that the selection of the next task to be executed is valid.

16. A method for dynamically allocating and managing resources in a computerized system having multiple consumer accounts, substantially as described and illustrated.