Abstract: Methods and systems for a multi-core operating system are provided. A first operating system (OS) core can manage kernel services. The first OS core may include a first memory manager and a first scheduler for scheduling a process to be executed. The process can be associated with a plurality of threads. One or more second operating system (OS) cores can share a shared memory manager and a shared scheduler, and the shared memory manager and the shared scheduler can communicate with the first memory manager and the first scheduler to facilitate offloading of one or more of a plurality of threads from the first OS core to at least one of the one or more second OS cores for execution. The first OS core can be asymmetric with respect to the one or more second operating system cores, and the one or more second operating system cores may be asymmetric with respect to each other.

Abstract: A system and method for allowing jobs originating from different partitions to simultaneously utilize different hardware threads on a processor by concatenating partition identifiers with virtual page identifiers within a processor's translation lookaside buffer is presented. The device includes a translation lookaside buffer that translates concatenated virtual addresses to system-wide real addresses. The device generates concatenated virtual addresses using a partition identifier, which corresponds to a job's originating partition, and a virtual page identifier, which corresponds to the executing instruction, such as an instruction address or data address. In turn, each concatenated virtual address is different, which translates in the translation lookaside buffer to a unique system-wide real address. As such, jobs originating from different partitions are able to simultaneously execute on the device and, therefore, fully utilize each of the device's hardware threads.

Abstract: Call stack information is sampled. A flag associated with a target thread is set in a memory work area associated with a virtual machine in response to an interrupt. Monitoring for an event takes place during execution of a plurality of threads created by the virtual machine. A determination is made as to whether the flag is set in response to an occurrence of the event. If the flag is set, the virtual machine makes a call out to a profiler which initiates sampling of the call stack information in response to the flag being set.

Abstract: An apparatus, system and method to optimize load distribution across logical and physical resources in a storage system. An apparatus in accordance with the invention may include an availability module and an allocation module. The availability module may dynamically assign values to resources in a hierarchical tree structure. Each value may correspond to an availability parameter such as allocated volumes, current resource utilization, and historic resource utilization. The allocation module may serially process the values and allocate a load to a least busy resource in the hierarchical tree structure based on the assigned values.

Abstract: Machine-readable media, methods, apparatus and system are described. In some embodiments, a virtual machine monitor of a computer platform may comprise a service virtual machine created by the virtual machine monitor partitioning an underlying hardware machine to support execution of a plurality of overlying guest operating systems, wherein the plurality of guest operating systems comprise a guest operating system complying with a non-native guest system architecture different from a host system architecture with which the hardware machine complies. The service virtual machine may further comprise a translation layer to translate instructions from the guest operating system complying with the non-native guest system architecture into instructions complying with the host system architecture.

Abstract: Memory assigned to a virtual machine is reclaimed. A resource reservation application running as a guest application on the virtual machine reserves a location in guest virtual memory. The corresponding physical memory can be reclaimed and allocated to another virtual machine. The resource reservation application allows detection of guest virtual memory page-out by the guest operating system. Measuring guest virtual memory page-out is useful for determining memory conditions inside the guest operating system. Given determined memory conditions, memory allocation and reclaiming can be used control memory conditions. Memory conditions in the virtual machine can be controlled with the objective of achieving some target memory conditions.

Abstract: A method comprises recognizing a need for an additional resource to be made available to a target computer workload. A determination is made whether said target workload is licensed for additional resource. If the determination is positive, the resource is transferred to the target workload. If the determination is negative, a license is transferred from a source workload, and then the resource is transferred to the target workload.

Abstract: A database can have multiple requests applied at one time. Each of these requests requires a specific amount of server resources. There can be a differentiation of user-submitted workloads between each other. These workloads are a set of queries submitted by different users. Each query can have specific resource limits. In addition, each set can have specific resource limits.

Abstract: In an embodiment of the invention, an apparatus and method for detecting resource consumption and preventing workload starvation, are provided. The apparatus and method perform the acts including: receiving a query; determining if the query will be classified as a resource intense query, based on a number of passes by a cache call over a data blocks set during a time window, where the cache call is associated with the query; and if the query is classified as a resource intense query, then responding to prevent workload starvation.

Abstract: A thread scheduler identifies a thread operable to be scheduled by a scheduling policy for execution on the chip multiprocessor. The thread scheduler estimates, for the thread, a performance value that is based on runtime statistics of the thread for a shared resource on the chip multiprocessor. Additionally, the thread scheduler applies the performance value to the scheduling policy in order to reallocate processor time of the thread commensurate with the performance value under fair distribution of the shared resource on the chip multiprocessor. The thread scheduler also applies the performance value to the scheduling policy in order to reallocate processor time of at least one co-executing thread to compensate for the reallocation of processor time to the thread.

Abstract: Provided are a method, system, and article of manufacture, wherein an execution unit requests additional execution time from a kernel to prevent the execution unit from being swapped out during an execution of a critical section. The kernel determines whether the execution unit has previously avoided yielding execution to other execution units within a predetermined period of time after being allocated the additional execution time in response to at least one previous request for the additional execution time. The kernel allocates the additional execution time to the execution unit, in response to determining that the execution unit has not previously avoided yielding execution to the other execution units within the predetermined period of time after being allocated the additional execution time in response to the at least one previous request for the additional execution time.

Abstract: A mechanism is provided for estimating the computing resources needed to execute a job. The mechanism receives a request to execute a new job. The mechanism processes the request to determine a set of job characteristics for the new job, and accesses a database containing execution information for a plurality of previously executed jobs. The mechanism obtains from the database a set of execution information associated with a particular previously executed job having similar or identical job characteristics as the new job. From this execution information, the mechanism determines what computing resources were actually used to execute the particular previously executed job. Then, based upon this information, the mechanism derives an estimate of the computing resources needed to execute the new job. By estimating the needed resources in this manner, the mechanism relieves the user of having to guess at what resources will be needed to execute a job.