Abstract: A non-preemption task group apparatus comprises a scheduling module that identifies a first task that is one of executing and scheduled to execute on a processor during a first time slice and a second task to be executed on a processor during a subsequent time slice, the first slice occurring before the subsequent slice, a relationship module that compares the first task to the second task, and an examining module that identifies whether the first task and the second task are interchangeable tasks based on the comparison, wherein the first task executes during the subsequent time slice in response to the first task and the second task being identified as interchangeable.

Abstract: A method, system and product for predicting impact of workload migration. The method comprising: obtaining a utilization pattern of a workload that is being executed on a first platform; generating a synthetic workload that is configured to have the utilization pattern when executed on the first platform; executing the synthetic workload on a second platform; and identifying a change in performance between execution of the synthetic workload on the first platform and between execution of the synthetic workload on the second platform in order to provide a prediction of an impact of migrating the workload from the first platform to the second platform.

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: An information processing terminal including an application execution portion, a sub-application execution portion and a hidden screen display portion is provided. The application execution portion executes an application. The sub-application execution portion executes a sub-application in response to an execution request from the application execution portion. The sub-application is configured to provide a specified function for the application executed by the application execution portion. The hidden screen display portion, instead of displaying an execution screen indicating execution of the sub-application, displays a hidden screen hiding the execution of the sub-application while the sub-application execution portion is executing the sub-application.

Abstract: Various techniques are described herein for creating data partition process schedules and executing such partition schedules using multiple parallel process instances. Data processing tasks initiated by or for applications may be executed by creating and executing partition schedules, in which a number of different process instances are created and each assigned a subset of data to process. Partition schedules may be used to determine a number of process instances to be created, and each process instance may be assigned a unique set of run-time data values corresponding to a unique set of parameters within the data set to be processed by the application. The process instances may operate independently and in parallel to retrieve and process separate partitions of the data required for the overall data processing task initiated by/for the application.

Abstract: A snapshot manager in a virtual machine monitor receives a write request comprising data from a guest operating system of a virtual machine, wherein the write request is directed to a sector of a virtual disk associated with the virtual machine. The snapshot manager writes the data from the guest operating system of the virtual machine to the sector in a base image of the virtual disk, the base image comprising a current version of the virtual disk, wherein the virtual disk comprises the base image and a overlay image, the overlay image comprising a snapshot of the base image at a previous point in time.

Abstract: Parallelism-aware scheduling of memory requests of threads in shared memory controllers. Parallel scheduling is achieved by prioritizing threads that already have requests being serviced in the memory banks. A first algorithm prioritizes requests of the last-scheduled thread that is currently being serviced. This is accomplished by tracking the thread that generated the last-scheduled request (if the request is still being serviced), and then scheduling another request from the same thread if there is an outstanding ready request from the same thread. A second algorithm prioritizes the requests of all threads that are currently being serviced. This is accomplished by tracking threads that have at least one request currently being serviced in the banks, and assigning the highest priority to these threads in the scheduling decisions. If there are no outstanding requests from any thread having requests that are being serviced, the algorithm defaults back to a baseline scheduling algorithm.

Abstract: Computing platforms may enable clients to use services to perform data processing jobs. A given job may utilize several services in a service call pattern. Each of these services consumes resources during execution. Described herein are systems, devices and methods for determining costs associated with performance of a service call pattern. Weight data may be generated for each service using various metrics. As service calls are made in the service call pattern, an accumulated weight value is generated which is indicative of the weight data of the services in the service call pattern. The accumulated weight data may represent metrics such as amounts of resources consumed, latency, and transactions per second.

Abstract: A number of synchronization objects simultaneously usable during runtime by a group of threads within a multi-threaded execution environment is predicted by a processor that manages synchronization object allocations within the multi-threaded execution environment. A synchronization object pool is allocated with the predicted number of synchronization objects, each initialized with a deployment state of undeployed and an acquisition state of unlocked. Over time, the deployment state is changed between deployed and undeployed in response to requests by threads to deploy and undeploy the synchronization objects. The acquisition state is independently controlled as the synchronization objects are acquired and released by the threads. The allocated number of synchronization objects within the synchronization object pool is adjusted during the runtime in response to determined deployment rates of the allocated number of synchronization objects.

Abstract: A method of capturing the state of a target program that is running within the environment of an operating system is provided. The method includes identifying threads associated with the target program, suspending threads associated with the target program, preserving data characterizing the threads, and preserving data accessible by the threads when in operation. A method of changing the state of a target program that is running within the environment of an operating system is also provided. This method includes identifying threads associated with the target program, suspending threads associated with the target program, replacing data characterizing the threads with previously preserved data, and replacing data accessible by the threads when in operation with previously preserved data. In either case, the threads are then resumed to allow the target program to continue operation.

Abstract: Hybrid transaction memory systems and accompanying methods. A transaction to be executed is received, and an initial attempt is made to execute the transaction in a hardware path. Upon a failure to successfully execute the transaction in the hardware path, an attempt is made to execute the transaction in a hardware-software path. The hardware-software path includes a software path and at least one hardware transaction.

Abstract: Provided is a task allocation optimizing system that, for a development target system which has a plurality of states and which is provided with multi-cores, makes an allocation of tasks to the cores such that a performance of the target system does not significantly degrade in a specific one of the states. The task allocation optimizing system according to the present invention performs optimization by calculating, for each of the states, a state-evaluating-function value, which represents the preferability of an allocation to the cores, through using a task set operating in the state, and further calculating a consolidated evaluating-function value as a whole of operation of the target system, through consolidating the state-evaluating-function values for all states targeted for an evaluation.

Abstract: Aspects relate to offloading virtual machines (VMs). Aspects include identifying a VM for offload from a mainframe processor of a heterogeneous processor to a specialty processor of the heterogeneous processor. The mainframe processor is emulated by the specialty processor. The VM is migrated from the mainframe processor to the specialty processor, and the VM is activated on the specialty processor.

Abstract: Embodiments of the invention are directed to systems, methods and computer program products for creating and managing a virtual operating environment on a physical machine connected to a distributed network, the virtual operating environment is virtualized by the physical machine. The invention may categorize the virtual operating environment using a tiered data structure, where each tier of the tiered data structure defines an attribute for categorizing the virtual operating environment. The invention generates a graphical representation of the tiered data structure for display via a user computing device that enables a user to communicate requests for causing the virtual operating environment to perform a function and communicates commands to the physical machine based on receiving such requests. The invention may additionally update the graphical representation after the virtual operating environment has executed the function.

Abstract: Methods and systems for managing storage shares in a virtual environment having a plurality of virtual machines are provided. The system includes a storage system for managing storage space for the storage shares and generating a quota report. The quota report shows an assigned quota for each storage share and actual storage used by each storage share. The assigned quota indicates an amount of designated storage space for each storage share. The system also includes a storage provider for obtaining the quota report from the storage system and filtering the quota report based on storage shares that are managed by the storage provider. The storage provider modifies a quota for a storage share based on a client request and notifies the storage system of the modification.

Abstract: A non-transitory computer-readable storage medium storing a notification conversion program causing a computer to execute a process includes determining, in response to acquisition of a first notification transmitted from a first virtual machine, a type of first management software capable of executing the first notification by referring to a first storage unit storing therein first information in which a notification transmitted from a virtual machine and a type of management software capable of executing a notification transmitted from a virtual machine are associated with each other, converting the first notification into a second notification executable by second management software that has acquired the first notification, based on the determined type of the first management software; and executing the second notification obtained by the conversion.

Abstract: Computing platforms may enable clients to use services to execute data processing tasks. Each of these services consumes resources during execution. Described herein are systems, devices and methods for generating resource consumption data for service calls. The resource consumption data may indicate amounts of resources consumed to process computational tasks associated with service calls. The system may determine when to process computational tasks based on the resource consumption data.

Abstract: Data can be categorized into facts, information, hypothesis, and directives. Activities that generate certain categories of data based on other categories of data through the application of knowledge which can be categorized into classifications, assessments, resolutions, and enactments. Activities can be driven by a Classification-Assessment-Resolution-Enactment (CARE) control engine. The CARE control and these categorizations can be used to enhance a multitude of systems, for example diagnostic system, such as through historical record keeping, machine learning, and automation. Such a diagnostic system can include a system that forecasts computing system failures based on the application of knowledge to system vital signs such as thread or stack segment intensity and memory heap usage. These vital signs are facts that can be classified to produce information such as memory leaks, convoy effects, or other problems.

Abstract: There is provided a method to schedule execution of a plurality of batch jobs by a computer system. The method includes: reading one or more constraints that constrain the execution of the plurality of batch jobs by the computer system and a current load on the computer system; grouping the plurality of batch jobs into at least one run frequency that includes at least one batch job; setting the at least one run frequency to a first run frequency; computing a load generated by each batch job in the first run frequency on the computer system based on each batch job's start time; and determining an optimized start time for each batch job in the first run frequency that meets the one or more constraints and that distributes each batch job's load on the computer system using each batch job's computed load and the current load.

Abstract: A technique for defragmenting jobs on processor-based computing resources including: (i) determining a first defragmentation condition, which first defragmentation condition will be determined to exist when it is favorable under a first energy consideration to defragment the allocation of jobs as among a set of processor-based computing resources of a supercomputer (for example, a compute-card-based supercomputer); and (ii) on condition that the first defragmentation condition exists, defragmenting the jobs on the set of processor-based computing resources.