Dynamic resource allocation for user management in multi-processor time shared computer systems

• US 6,360,263 B1
• Filed: 02/25/1998
• Issued: 03/19/2002
• Est. Priority Date: 02/25/1998
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Levanoni, Menachem, Kurtzberg, Jerome M.
• Primary Examiner(s): Maung, Zarni
• Assistant Examiner(s): Barot, Bharat
• Application Number:
  US09/030,432
• Time in Patent Office: 1,483 Days
• Field of Search: 709/200-203, 709/223-226, 709/227-229, 709/243-244, 709/100, 709/103-107, 707/2-3, 707/100-104, 705/7-9
• US Class Current: 709/226
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals
• CPC Class Codes: G06F 9/5066 Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs mappping at compile time, see G06F8/451

Abstract

A method suitable for optimizing allocation of resources, in support of k users, in a multi-processor time-shared computer system. The method includes the steps of inputting data comprising current job requirements; operating upon the current job requirements for determining required resources; storing said required resources for subsequent processing by a resource allocator; and executing the required resources for generating a resource allocation for said k users.

Claims

1. An assembly suitable for optimizing allocation of resources, in support of k users, in a multi processor time-shared computer system, said assembly comprising:

a resource monitor comprising;

an input device for inputting job requirement data for a plurality of jobs;

a device for deter required resources based on said job requirement data; and

a storage device for storing said required resources for subsequent processing; and

a resource allocator connected to said resource monitor comprising;

an input device for inputting available resources and said required resources from said resource monitor; and

a device for determining an optimum allocation of resources,

wherein said optimum allocation is determined according to a predetermined algorithm so that said plurality of jobs are assigned to said processors independent of job priority and in proportion to available processing capacities for said processors.

2. The assembly according to claim 1, wherein said resource monitor and said resource allocator both reside in a memory of said multi-processor time-shared computer system.

3. The assembly according to claim 1, wherein said assembly is operable in a multi-job environment.

4. The assembly according to claim 3, wherein said resource allocator optimally allocates a set of resources to satisfy needs of a set of jobs simultaneously.

5. The assembly according to claim 3, wherein said jobs comprise requests from said k users.

6. The assembly according to claim 3, wherein each resource is selectively operable on more than one job.

7. The assembly according to claim 6, wherein said jobs are selectively divided into sub-jobs for allocation to different resources, to optimize total system operation.

8. The assembly according to claim 1, wherein an output from said resource monitor comprises a file including a plurality of jobs for said k users.

9. The assembly according to claim 8, wherein said resource allocator computes resources of said jobs for the k users to allocate the jobs to available resources, said resources comprising loads of said jobs.

10. The assembly according to claim 1, wherein said assembly is operable in a multi-task environment, tasks comprising at least one of a plurality of jobs and a job divided into sub-jobs.

11. The assembly according to claim 10, wherein said assembly optimally allocates a set of resources to satisfy needs of a set of jobs simultaneously, and wherein each resource is selectively operable on more than one job or more than one sub-job, to optimize total system operation.

12. A method suitable for optimizing allocation of resources in support of k users, in a multi-processor time-shared computer system, the method comprising:

inputting data comprising job requirement data for a plurality of jobs;

determining required resources based on said job requirement data;

storing said required resources for subsequent processing by a resource allocator; and

determining an optimum allocation of resources; and

allocating resources according to said optimum allocation,

wherein said optimum allocation is determined according to a predetermined algorithm so that said plurality of jobs are assigned to said processors independent of job priority and in proportion to available processing capacities for said processors.

13. The method according to claim 12, wherein said inputting and said operating are performed by a resource monitor, and wherein said resource monitor and said resource allocator both reside in a memory of said multi-processor time-shared computer system.

14. The method according to claim 12, wherein said method is operable in a multi-job environment.

15. The method according to claim 14, wherein said executing comprises optimally allocating a set of resources to satisfy needs of a set of jobs simultaneously.

16. The method according to claim 14, wherein jobs in said multi-job environment comprise requests from said k users.

17. The method according to claim 14, wherein each resource is selectively operable on more than one job.

18. The method according to claim 17, wherein said jobs are selectively divided into sub-jobs for allocation to different resources, to optimize total system operation.

19. The method according to claim 12, wherein said method is operable in a multi-task environment, tasks comprising at least one of a plurality of jobs and a job divided into sub-jobs,

said method further comprising:

optimally allocating a set of resources to satisfy needs of a set of jobs simultaneously, and wherein each resource is selectively operable on more than one job or more than one sub-job, to optimize total system operation.

20. A time shared computer network system having a plurality of user terminals, said system comprising:

a resource monitor comprising;

an input device for inputting job requirement data for a plurality of jobs;

a processor for determining required resources based on said job requirement data; and

a memory for storing said required resources for subsequent processing; and

a resource allocator connected to said resource monitor comprising;

an input device for inputting said required resources from said resource monitor; and

a processor for determining an optimum allocation of resources and allocating said resources according to said optimum allocation,

wherein said optimum allocation is determined according to a predetermined algorithm so that said plurality of jobs are assigned to said processors independent of job priority and in proportion to available processing capacities for said processors.

21. The system according to claim 20, wherein said processor of said resource allocator inputs loads for said plurality of jobs and processing rates for said resources and determines permissible assignments for each job to said resources and actual assignments for each job to said resources.