Abstract: Controlling rate of resource consumptions improves manageability of resources in relation to the entities consuming the resource. A consumer's resource consumption behavior can be controlled with a mechanism that throttles its resource requests to conform to a threshold rate, such as a resource consumption rate. A set of one or more computations tracks a consumption measurement variable over a given time interval, such as number of resource requests for a given resource within the last 5 seconds. When a resource request is received, the set of computations determine whether servicing the resource request would exceed the threshold rate. If the threshold rate would be exceeded, then the computations sleep until servicing the resource request would not exceed the threshold rate.

Abstract: Systems, methods, and devices, including computer executable instructions for transferring threads are described. The method comprises determining an idle processor by checking a handoff state of the processor prior to placing an identified runnable thread in a run queue of an idle processor. The method also comprises transferring the runnable thread to a determined idle processor by setting the handoff state of the processor to a handle of the runnable thread.

Abstract: The invention is directed to a method for correlating processor usage to customer billing in an on-demand server with real-time allocation/deallocation of processing resources. A method in accordance with an embodiment of the present invention includes: providing a plurality of processors, each processor having thermal control circuit (TCC) logic; determining a processing requirement for the plurality of processors; and dynamically controlling a processing capability of the plurality of processors to provide the determined processing requirement by selectively enabling or disabling the TCC logic of each processor.

Abstract: A method, system, and computer program product for sharing adapter resources among multiple operating system instances. The present invention provides a mechanism for dynamically allocating virtualized I/O adapter resources. The present invention separates the operation of adapter resource allocation from adapter resource management. Protection attributes within the adapter resource context are used to allow the adapter to enforce access control over the adapter resources. The hypervisor allocates an available adapter resource to a given partition. The adapter is notified of the allocation, and the adapter updates its internal structure to reflect the allocation. The hypervisor may revoke ownership of and reassign adapter resources to another OS instance. In this manner, the allocation described above allows for the simple reassignment of resources from one partition to another.

Abstract: An information handling system (IHS) employs operating system software to manage IHS resources. The operating system software manages software application programs as processes executing within the IHS. The processes run in foreground and background mode within the IHS. Processes running in foreground mode are subject to hang-up events with negative process output results, such as output data loss. In one embodiment, the operating system software supports a “no hang-up now” command for use with processes running in foreground mode. The “no hang-up now” command provides system users the ability to hang-up or log-out of an IHS terminal without negative effects on the current foreground process. A user may invoke the “no hang-up now” command after execution of the foreground process is already underway. The no hang-up command moves the foreground application to the background for continued execution. A signal handler program prevents termination of the background process until the process completes.

Abstract: Methods, systems, and computer program products are provided for scheduling threads in a multiprocessor computer. Embodiments include selecting a thread in a ready queue to be dispatched to a processor and determining whether an interrupt mask flag is set in a thread control block associated with the thread. If the interrupt mask flag is set in the thread control block associated with the thread, embodiments typically include selecting a processor, setting a current processor priority register of the selected processor to least favored, and dispatching the thread from the ready queue to the selected processor. In some embodiments, setting the current processor priority register of the selected processor to least favored is carried out by storing a value associated with the highest interrupt priority in the current processor priority register.

Abstract: A distributed computing network is disclosed, the membership of which is determined in accordance with policy data stored at existing member nodes. A node wishing to join the distributed computing network sends profile data indicating the resources it has available for shared computation to a member node. The member node compares the resources with the requirement indicated in the priority data. If the comparison indicates that the applicant node should join, then data indicating the topology of the distributed computing network is updated at the member node and created at the applicant node. This allows for the creation of a distributed computing network whose topology is well-suited to a given task, provided the policy properly reflects the requirements of the task.

Abstract: Method and apparatus for allocating system resources for use by software processes in a computer-based system, such as a wide area network (WAN) comprising a data storage array. A first memory space provides a first bit indicator to indicate whether at least one system resource is available for use. A second memory space provides a second bit indicator to indicate whether a pending software process awaits availability of the system resource. The resource is allocated for use by the process in relation to a combinatorial operation upon the first and second bit indicators, preferably comprising a logical AND operation. The first and second memory spaces are preferably characterized as multi-bit registers. A free resource stack identifies available resources, and a process queue identifies pending processes waiting for released processes. The statuses of the respective stack and queue are reflected in the bits in the multi-bit registers.

Abstract: A control system for controlling the allocation of computer resources includes control plug-ins arranged in a multi-level hierarchy. A first-level control plug-in is operable to generate instructions for a resource manager to allocate computer resources for an application. A second-level control plug-in is operable to generate instructions for the first-level control plug-in to control the allocation of the computer resources for the application.

Abstract: In a multi-processor multi-threaded computer system, resources are dynamically assigned during program operation to either threads or processors in such a manner that resource usage is maximized. In one embodiment, the choice of whether to assign resources to threads or processors is dependent on the number of threads versus the number of processors. In another embodiment, when the system is operating in one assignment mode, the amount of wasted resources is measured and when this measured amount exceeds a predetermined threshold based on the maximum resources that could be wasted were the system operating in the other assignment mode, the assignment is switched to the other assignment mode.

Abstract: A method for scheduling jobs in a computing system accounts provides for current and future scheduling according to job priority, and system resources expected to be available during a given time period. Resources may be freed by preempting jobs scheduled to execute according to preemption rules specified for the system. Advance reservation and backfilling are accomplished, maximizing system efficiency.

Abstract: A runtime system implemented in accordance with the present invention provides an application platform for parallel-processing computer systems. Such a runtime system enables users to leverage the computational power of parallel-processing computer systems to accelerate/optimize numeric and array-intensive computations in their application programs. This enables greatly increased performance of high-performance computing (HPC) applications.

Abstract: A method for managing system resources including creating a container, wherein creating the container comprises allocating a first portion of a first resource to the container, associating the container with a resource pool, wherein the resource pool is associated with the first resource, determining whether the first portion of the first resource is valid, and activating the container if the first portion of the first resource is valid.

Abstract: In starting a session, a block ID is assigned to the respective blocks in which session is divided into tasks in every function, and a task lookup table which is a quick reference table for the block ID and a task ID is formed. In performing a message communication, a transmitter task assigns a destination in the block ID and obtains the task ID with reference to the task lookup table. And then, the task ID of the destination is assigned and a transmission and reception of the message is performed by applying a message communication function in OS.

Abstract: At least one input/output (I/O) firmware partition is provided in a partitioned environment to facilitate access to I/O resources owned by the at least one I/O firmware partition. The I/O resources of an I/O firmware partition are shared by one or more other partitions of the environment, referred to as consumer partitions. The consumer partitions use the I/O firmware partition to access the I/O resources. Since the I/O firmware partitions are responsible for providing access to the I/O resources owned by those partitions, the consumer partitions are relieved of this task, reducing complexity and costs in the consumer partitions.

Abstract: A system for improved scheduling of resources within a Workflow-Management-System or a computer system with comparable functionality (WFMS). Based on a new resource specification comprised within a process model and associated with an activity, the WFMS determines the resources required for execution of said activity. The invention further schedules a request for allocation of said resources on behalf and in advance of starting execution of said activity. This approach reduces the execution time of the activity as all resources required by the activity will be available when execution of the activity begins; the activity does not have to wait for these resources. Moreover, a WFMS knowing the required resources of the activities it is administrating is able to schedule resource requests to avoid resource conflicts between the activities.

Abstract: A procedure identifies multiple threads associated with a process and pauses execution of a first thread associated with the process. A determination is made regarding whether the first thread is attempting to access a first resource. If the first thread is attempting to access a first resource, the procedure identifies a second thread that has locked the first resource and determines whether the second thread is attempting to access a second resource that is locked by the first thread. A deadlock is identified if the second thread is attempting to access a second resource that is locked by the first thread.

Abstract: Techniques for assuring thread rendezvous for a plurality of threads executing in a computing system are disclosed. Techniques can be used to assure thread rendezvous for read-only code in a manner that is more efficient than polling techniques. A Light-weight, Yet Trappable On Demand (LYTOD) instruction can be generated for code that is executed by one or more threads. Typically, a LYTOD instruction is generated at critical points of the code in order to assure safe-point thread rendezvous. The LYTOD is a lightweight instruction that can change its behavior from a lightweight instruction to an instruction that causes a trap when executed. The LYTOD can, for example, be implemented as a read-from-memory instruction that operates to load a register with a content of a valid memory location.

Abstract: The use of spinlocks is avoided in the combination of mutex and condition variables by using any suitable atomic compare and swap functionality to add a thread to a list of waiting threads that waits for a data event to occur. Various embodiments of the present invention also provide an organization scheme of data, which describes an access bit, an awaken count, and a pointer to the list of waiting threads. This organization scheme of data helps to optimize the list of waiting threads so as to better awaken a waiting thread or all waiting threads at once.

Abstract: In one embodiment, a method for allocating computing resources comprises executing a plurality of applications and a grid virtual system within a shared resource domain, assigning computing resources to the plurality of applications to process application transactions, dynamically reallocating computing resources associated with the plurality of applications to the grid virtual system when the computing resources are idle, registering availability of grid services in response to the reallocating, scheduling grid jobs for execution within the grid virtual system, and modifying at least one reallocation parameter in response to the scheduling.