Abstract: Disclosed herein are a resource manager node and a resource management method. The resource manager node includes a resource management unit, a resource policy management unit, a shared resource capability management unit, a shared resource status monitoring unit, and a shared resource allocation unit. The resource management unit performs an operation necessary for resource allocation when a resource allocation request is received. The resource policy management unit determines a resource allocation policy based on the characteristic of the task, and generates resource allocation information. The shared resource capability management unit manages the topology of nodes, information about the capabilities of resources, and resource association information. The shared resource status monitoring unit monitors and manages information about the status of each node and the use of allocated resources. The shared resource allocation unit sends a resource allocation request to at least one of the plurality of nodes.

Abstract: A parameter determination unit 110 substitutes, for each of a plurality of applications, a recommended amount of resources and a quality of experience corresponding to the recommended amount of resources, and a minimum amount of resources and a quality of experience corresponding to the minimum amount of resources into a quality function f in expression (1) indicating a relation between an amount of resources R and a quality of experience Q, to determine parameters a and b. A resource amount determination unit 120 determines an amount of resources to be allocated to the plurality of applications using the quality function f for each application in which the parameters a and b are determined. The quality function f(x) is a monotonically increasing function having an inverse function f?1, connects (??,0) and (+?,1), and is symmetrical with respect to x=0.

Abstract: A method for allocating parallel, independent, data tasks includes receiving data tasks, each of the data tasks having a penalty function, determining a generic ordering of the data tasks according to the penalty functions, wherein the generic ordering includes solving an aggregate objective function of the penalty functions, the method further including determining a schedule of the data tasks given the generic ordering, which packs the data tasks to be performed.

Abstract: Embodiments perform opportunistically proactive resource scheduling for a plurality of resource-consuming entities. The scheduling is based on both current entitlement (or demand) by the entities and predicted future entitlement (or demand) by the entities. Resources are allocated based on the current demands, while any remaining resource capacity is further allocated to entities based on predicted demands. In some embodiments, the scheduling is performed on a cluster of hosts executing a plurality of virtual machines (VMs) in a virtualized datacenter to implement load balancing.

Abstract: Methods, apparatuses, and computer program products for utilizing a kernel administration hardware thread of a multi-threaded, multi-core compute node of a parallel computer are provided. Embodiments include a kernel assigning a memory space of a hardware thread of an application processing core to a kernel administration hardware thread of a kernel processing core. A kernel administration hardware thread is configured to advance the hardware thread to a next memory space associated with the hardware thread in response to the assignment of the kernel administration hardware thread to the memory space of the hardware thread. Embodiments also include the kernel administration hardware thread executing an instruction within the assigned memory space.

Abstract: The illustrative embodiments described herein provide a computer implemented method, apparatus, and computer program product for managing a batch production system. In an illustrative embodiment, an application forecast is generated for a set of batch jobs in a critical path of a batch application. The application forecast comprises a sum of execution times for the batch jobs in the critical path. In response to detecting an abend from production data generated during the execution of the batch application, the abend is mapped against known abends in an abend database to identify a set of abend solutions. Thereafter, a notification is generated which comprises at least one of a status of the batch application and the set of abend solutions, wherein the status is generated based on the application forecast.

Abstract: Disclosed are systems, hybrid compute environments, methods and computer-readable media for dynamically provisioning nodes for a workload. In the hybrid compute environment, each node communicates with a first resource manager associated with the first operating system and a second resource manager associated with a second operating system. The method includes receiving an instruction to provision at least one node in the hybrid compute environment from the first operating system to the second operating system, after provisioning the second operating system, pooling at least one signal from the resource manager associated with the at least one node, processing at least one signal from the second resource manager associated with the at least one node and consuming resources associated with the at least one node having the second operating system provisioned thereon.

Abstract: A storage apparatus having plural control processors that interpret and process requests sent from a host computer includes a distribution judgment unit for judging, after a control processor receives a request sent from the host computer, whether or not to allocate processing relevant to the request from the control processor that received the request to another control processor, and a control processor selection unit for selecting an allocation target control processor if the distribution judgment unit judges to allocate the processing to another control processor.

Abstract: One embodiment of the present invention sets forth a technique for performing a method for synchronizing divergent executing threads. The method includes receiving a plurality of instructions that includes at least one set-synchronization instruction and at least one instruction that includes a synchronization command, and determining an active mask that indicates which threads in a plurality of threads are active and which threads in the plurality of threads are disabled. For each instruction included in the plurality of instructions, the instruction is transmitted to each of the active threads included in the plurality of threads. If the instruction is a set-synchronization instruction, then a synchronization token, the active mask and the synchronization point is each pushed onto a stack.

Abstract: Execution of a computer program on a multiprocessor system is monitored to detect possible excess parallelism causing resource contention and the like and, in response, to controllably limit the number of processors applied to parallelize program components.

Abstract: One embodiment is a computer-implemented method of trace collection for a virtual machine that includes: executing a sequence of instructions from an initial state of the virtual machine; accessing an event log of data relating to nondeterministic events, which data includes an execution point; making at least a portion of the data available to the virtual machine when the sequence reaches the execution point; collecting trace information in response to expansion parameters; and storing the trace information in a trace file.

Abstract: A system and method for parallel file system traversal using multiple job executors is disclosed. The system includes a pool of job executors, a job queue, and a trigger tracker. An object, representative of a node in the filesystem, is added (i.e., pushed) to the job queue for processing by an job executor. The job queue assigns (i.e., pops) objects to job executors in accordance to a LIFO (Last In First Out) ordering. Then the job executor performs an action such as copy. In one embodiment, the trigger tracker follows the processing of a child nodes to a particular child node. Thus, the filesystem is being traversed by several job executors at the same time.

Abstract: Systems and methods for reliably migrating a virtual machine (VM) are provided. The method comprises receiving overhead and reliability factors for hosts in a hosting fabric; determining a plurality of viable migration paths for migrating a source VM from a source host to a target host in the hosting fabric, wherein the migration is accomplished through a series of migration phases, wherein a phase involves migration of the source VM from one host to another host in a migration path; determining total overhead costs associated with each migration path; and selecting a migration path from among said plurality of migration paths according to the overhead costs and reliability factors, wherein the reliability of the migration over the selected path is monitored and controlled by dynamically allocating and de-allocating one or more replicas of the source VM on one or more hosts in the migration fabric.

Abstract: An image forming device includes a monitoring service performing unit and a service process performing instructing unit. The monitoring service performing unit acquires operation state information including index data that represents a service processing function mounted in the corresponding server and an operation state of the corresponding server from each server by starting a monitoring service when an accepted job is performed. The service process performing instructing unit instructs a low-load server to start a corresponding service processing function when the load on a server in which the service processing function used for executing the job is mounted is determined to be high.

Abstract: Techniques are provided for deploying applications hosted by an application service provider. An application in a first environment is automatically deployed to a second environment in response to receiving a request over a network from the party for whom the second environment is being hosted. The first environment may be an environment where applications are developed by the party over the network. Deployment of the application may entail provisioning of an environment for the application.

Abstract: A simultaneous multithreading computing system obtains process information for the simultaneous multithreading computing system. The process information comprises a plurality of processes associated with the simultaneous multithreading computing system. The simultaneous multithreading computing system obtains resource information for the simultaneous multithreading computing system. The resource information comprises a plurality of available resources in the simultaneous multithreading system. The simultaneous multithreading computing system determines that a process from the plurality of processes is unscalable on the simultaneous multithreading computing system. Upon determining that the process is unscalable, the simultaneous multithreading computing system selects a resource to execute the unscalable process based on the resource information. Upon determining that a sibling resource is associated with the selected resource, the simultaneous multithreading computing system disconnects the sibling resource.

Abstract: An analysis tool analyzes a software system by simulating runtime binding in order to identify function-level code dependencies. The tool receives a list of one or more entry point functions and identifies other functions that can be invoked if the entry point functions are executed. The tool generates a tracker graph having tracker nodes representing classes that can be instantiated from the entry points. Each tracker node identifies functions/methods in that class that can be invoked from the entry points. If the software system uses an object-relational mapping to a database, the tracker graph also identifies the portions of the database that can be accessed from the entry points. The tool can be used to partition the functionalities of the software system into core and non-core functionalities in order to support upgrading while maintaining high-availability.

Abstract: Enabling a Light-Weight Kernel (LWK) to run in a virtualized environment on a Full-Weight Kernel (FWK), in one aspect, may include replacing a FWK loader, e.g., FWK's dynamic library loader or linker, with a LWK library on a first computing entity for an application allocated to run on one or more second computing entities. The LWK library may be enabled to initialize the one or more second computing entities and associated memory allocated to run the application under the LWK library. The LWK library may be enabled to manage the one or more second computing entities and said associated memory and resources needed by the application.

Abstract: A method and apparatus are provided for operating a network data processing system on an aircraft. A number of operations are performed in a virtual machine on the aircraft. The virtual machine runs on a processor unit in the network data processing system on the aircraft to create a simulated computer environment. The virtual machine accesses resources of the processor unit for performing the number of operations using a host operating system on the processor unit. A current state of the aircraft is identified by the network data processing system. Running of the virtual machine is managed based on the current state of the aircraft and a policy for managing the virtual machine for different states of the aircraft.

Abstract: In one embodiment, the invention provides a method of managing a computing job based on a job priority and a submitter quota, the method including determining whether a declared priority of a computing job exceeds a predetermined declared priority quota of a submitter; in the case that the declared priority of the computing job exceeds the predetermined declared priority of the submitter, substituting a reduced priority for the declared priority of the computing job; determining whether the reduced priority of the computing job exceeds a predetermined reduced priority quota for the submitter; and in the case that the reduced priority of the computing job does not exceed the predetermined reduced priority quota of the submitter, assigning the computing job to at least one computer resource at the reduced priority.