Abstract: Virtual machine threads are mapped to virtual processors. Groups of virtual processors are formed. The number of virtual processors in each group is selected to match a number of unassigned physical processors in a proximity. The virtual processors of each group are selected so that the total estimated interactivity for the group is significantly above average for groups having the same number of those virtual processors.

Abstract: According to one embodiment, a request is received for executing a process on a computer. Information is accessed for a plurality of cells associated with the computer. A cell is selected that is the preferred candidate among the plurality of cells for executing the process using memory, which resides on the selected cell, based, at least in part, on the accessed information and the request.

Abstract: In one embodiment, a method comprises (i) identifying a group associated with an executable that is using a resource of a computer system, (ii) decrementing a group utilization limit for the resource when the group utilization limit is greater than zero, (iii) decrementing a utilization reserve for the group when the group utilization limit for the resource equals zero, wherein operations (i)-(iii) are performed by a software routine responsive to system interrupts, and (iv) scheduling another executable to use the resource, wherein the scheduling verifies that (a) the another executable belongs to a group that has a non-zero group utilization limit for the resource or (b) the another executable belongs to a group that has a non-zero utilization reserve.

Abstract: A system and method is provided for assigning a plurality of executable processes to a plurality of physical processors in a multi-processor computer system using a minimum processor share and a maximum processor share defined for each executable process. In an embodiment, the method can include allocating shares of total processor time to each executable process in proportion to the minimum processor shares up to the maximum processor shares to form target share allocations. The target share allocations can be used to map processes to the physical processors.

Abstract: In an embodiment, a computing system comprises a plurality of resources, a first manager process for allocating the plurality of resources on a dynamic basis according to service level parameters, and a plurality of computing domains, wherein at least one application, a respective second manager process, and a respective performance monitor process are executed within each computing domain, and wherein the performance monitor generates performance data related to the execution of the at least one application and the second manager process requests additional resources from the first manager process in response to analysis of performance data in view of at least one service level parameter.

Abstract: A computer system comprises a virtual machine scheduler that dynamically and with computed automation controls non-uniform memory access of a plurality of cells in interleaved and cell local configurations. The virtual machine scheduler maps logical central processing units (CPUs) to physical CPUs according to preference and solves conflicts in preference based on a predetermined entitlement weight and iterative switching of individual threads.

Abstract: In one embodiment, a computer system comprises a plurality of processors, first software code for registering executables, creating partitions, and assigning executables to partitions, wherein the first software code assigns non-registered executables to a first partition, second software code for monitoring a utilization rate associated with the first partition, examining executables of the first partition when the utilization rate exceeds a first limit, and transferring executables having accessed an amount of resources greater than a second limit to a second partition.

Abstract: A system and method is provided for assigning a plurality of executable processes to a plurality of physical processors in a multi-processor computer system using a minimum processor share and a maximum processor share defined for each executable process. In an embodiment, the method can include allocating shares of total processor time to each executable process in proportion to the minimum processor shares up to the maximum processor shares to form target share allocations. The target share allocations can be used to map processes to the physical processors.

Abstract: In one embodiment, a computer system comprises a plurality of processors, a plurality of groups of executables, wherein a respective share parameter is defined for each group that represents an amount of processor resources to support executables of the group, a software routine that generates a plurality of weights using the share parameters and generates a distribution of the weights across the plurality of processors, wherein the distribution defines a subset of processors for each group and a proportion of each processor within the subset for scheduling executables of the group, and a scheduling software routine for scheduling each executable of the plurality of groups on a specific processor of the plurality of processors during a scheduling interval according to the distribution.

Abstract: In one embodiment, a computer system comprises a plurality of processors, first software code for registering executables, creating partitions, and assigning executables to partitions, wherein the first software code assigns non-registered executables to a first partition, second software code for monitoring a utilization rate associated with the first partition, examining executables of the first partition when the utilization rate exceeds a first limit, and transferring executables having accessed an amount of resources greater than a second limit to a second partition.

Abstract: In one embodiment, a method comprises (i) identifying a group associated with an executable that is using a resource of a computer system, (ii) decrementing a group utilization limit for the resource when the group utilization limit is greater than zero, (iii) decrementing a utilization reserve for the group when the group utilization limit for the resource equals zero, wherein operations (i)-(iii) are performed by a software routine responsive to system interrupts, and (iv) scheduling another executable to use the resource, wherein the scheduling verifies that (a) the another executable belongs to a group that has a non-zero group utilization limit for the resource or (b) the another executable belongs to a group that has a non-zero utilization reserve.

Abstract: In an embodiment, a computing system comprises a plurality of resources, a first manager process for allocating the plurality of resources on a dynamic basis according to service level parameters, and a plurality of computing domains, wherein at least one application, a respective second manager process, and a respective performance monitor process are executed within each computing domain, and wherein the performance monitor generates performance data related to the execution of the at least one application and the second manager process requests additional resources from the first manager process in response to analysis of performance data in view of at least one service level parameter.

Abstract: A retrieval system and method which allows a computer system to adjust the data retrieval start times of the data retrieval requests from the different users in order to achieve overall system objectives. Each user is assigned a percentage availability which then determines a factor for all of the applications run by that user. This factor is associated with each request for data retrieval from any application. For any given batch of data requests there is calculated a start time for each data request, with the start time dependent upon the assigned factor. The start times from all users for that batch are then ordered in accordance with the calculated start times. The system will reorder the start times when efficient operation requires such reordering.

Abstract: A retrieval system and method which allows a computer system to adjust the data retrieval start times of the data retrieval requests from the different users in order to achieve overall system objectives. Each user is assigned a percentage availability which then determines a factor for all of the applications run by that user. This factor is associated with each request for data retrieval from any application. For any given batch of data requests there is calculated a start time for each data request, with the start time dependent upon the assigned factor. The start times from all users for that batch are then ordered in accordance with the calculated start times. The system will reorder the start times when efficient operation requires such reordering.