Processor provisioning by a middleware processing system for a plurality of logical processor partitions

• US 9,280,393 B2
• Filed: 03/21/2014
• Issued: 03/08/2016
• Est. Priority Date: 12/21/2012
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Bird, Paul M., Kalmuk, David
• Primary Examiner(s): Truong, Lechi
• Application Number:
  US14/221,712
• Publication Number:
  US 20140201757A1
• Time in Patent Office: 718 Days
• Field of Search: 719/314
• US Class Current: 1/1
• CPC Class Codes: G06F 11/3419 by assessing time
• CPC Class Codes: G06F 12/0842 for multiprocessing or multitasking
• CPC Class Codes: G06F 2209/485 Resource constraint
• CPC Class Codes: G06F 2209/5012 Processor sets
• CPC Class Codes: G06F 2209/504 Resource capping
• 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/5077 Logical partitioning of resources; Management or configuration of virtualized resources specific details on emulation or internal functioning of virtual machines G06F9/455
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues
• CPC Class Codes: Y02D 10/00 Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

A middleware processor provisioning process provisions a plurality of processors in a multi-processor environment. The processing capability of the multiprocessor environment is subdivided and multiple instances of service applications start protected processes to service a plurality of user processing requests, where the number of protected processes may exceed the number of processors. A single processing queue is created for each processor. User processing requests are portioned and dispatched across the plurality of processing queues and are serviced by protected processes from corresponding service applications, thereby efficiently using available processing resources while servicing the user processing requests in a desired manner.

Claims

1. A method implemented by a computer via a middleware software system for efficiently allocating workload for a plurality of user processing requests among a plurality of processor cores in a multiprocessor system comprising:

assessing a current processing workload for the plurality of user processing requests;

subdividing a processing capability of the multiprocessor system into a plurality of processing units based on the current processing workload;

executing a plurality of protected processes started by one or more service applications on the plurality of processing units to service the user processing requests such that the number of protected processes is allowed to exceed the number of processing units;

allocating a portion of a shared memory space to each of the processing units;

generating a processing queue for each of the processing units, wherein each processing queue has access to a corresponding portion of the shared memory space;

assigning a portion of each user processing request to one or more of the processing queues; and

servicing the portion of each user processing request by one or more of the plurality of protected processes as the portion of each user processing request is released for execution by a corresponding processing queue.

2. The method of claim 1, further comprising dedicating one or more of the plurality of protected processes started by one or more service applications to one of the processing units.

3. The method of claim 2, further comprising dedicating one or more of the processing queues to a corresponding processing unit.

4. The method of claim 3, wherein said assigning comprises assigning portions of the user processing requests to the affinitized processing unit via an affinitized processing queue.

5. The method of claim 1, wherein said executing comprises determining by a first executing service application whether a shared memory set exists for allocation to each of the processing units, and when a shared memory set does not exist, allocating the shared memory set from available memory, and generating a first processing queue.

6. The method of claim 5, further comprising:

incrementing a service application instance counter; and

obtaining a control token indicating the first executing service application is a master scheduler for performing said assigning of portions of each user processing request to one or more of the processing queues.

7. The method of claim 6, further comprising:

terminating the first executing service application; and

returning resources obtained by the first executing service application including the control token such that another executing service application can obtain the control token and become a master scheduler for performing said assigning of portions of each user processing request to one or more of the processing queues.

8. The method of claim 1, further comprising balancing a processing workload associated with the user processing requests across two or more processing queues.

9. The method of claim 1, wherein said assigning is based on one or more of user processing request priority and user processing request service class.

10. The method of claim 1, wherein one or more of the service applications include a virtual machine.

11. The method of claim 1, further comprising determining when a portion of a user processing request is holding a resource needed by a higher priority user processing request;

and re-queuing the portion of user processing request holding the resource to the front of one of the processing queues.