Abstract: A method, non-transitory computer readable medium, and apparatus for configuring a scheduling a job request in a data processing platform are disclosed. The method receives a new job request having a priority selected by a user, submits the new job request to an online job queue comprising a plurality of jobs, wherein each one of the plurality of jobs comprises a respective priority selected by a respective user and schedules the new job request and the plurality of jobs in the online job queue to one or more available worker nodes in a unit time slot based upon a comparison of the priority of the new job and the respective priority of the plurality of jobs in the online job queue, wherein the scheduling algorithm is based on one of: blocks having a variable size and a static processing time or blocks having a static size and a variable processing time.

Abstract: Provided are techniques for multiple stage workload management. A staging queue and a run queue are provided. A workload is received. In response to determining that application resources are not available and that the workload has not been previously semi-started, the workload is added to the staging queue. In response to determining that the application resources are not available and that the workload has been semi-started, and, in response to determining that run resources are available, the workload is started. In response to determining that the application resources are not available and that the workload has been semi-started, and, in response to determining that the run resources are not available, adding the workload to the run queue.

Abstract: Methods, apparatuses, and computer program products for managing virtual machine images in a distributed computing environment are provided. Embodiments includes a management system recording dependencies between the virtual machine images in the image service repository and dependencies between the deployed virtual machines in the compute service and the virtual machine images in the image service repository. Based on the recorded dependencies between the virtual machine images and the dependencies between the deployed virtual machines and the virtual machine images, the management system identifies a virtual machine image that has no deployed virtual machine dependent upon it. Embodiments also include the management system deleting, by the management system, the identified virtual machine image from the image service repository.

Abstract: A method is used in managing system I/O load. When a background operation is available to be executed on a processor core, it is determined whether a credit value associated with the processor core satisfies a memory use criterion. The background operation has a memory use requirement and is executed on the processor core when the credit value associated with the processor core satisfies the memory use criterion. The credit value associated with the processor core is modified by an amount corresponding to the memory use requirement.

Abstract: Methods, apparatuses, and computer program products for managing virtual machine images in a distributed computing environment are provided. Embodiments includes a management system recording dependencies between the virtual machine images in the image service repository and dependencies between the deployed virtual machines in the compute service and the virtual machine images in the image service repository. Based on the recorded dependencies between the virtual machine images and the dependencies between the deployed virtual machines and the virtual machine images, the management system identifies a virtual machine image that has no deployed virtual machine dependent upon it. Embodiments also include the management system deleting, by the management system, the identified virtual machine image from the image service repository.

Abstract: A system and method of terminating processing requests dispatched to a coprocessor hardware accelerator in a multi-processor computer system based on matching various fields in the request made to the coprocessor to identify the process to be terminated. A kill command is initiated by a write operation to a coprocessor block kill register and has match enable and value for each field in the coprocessor request to be terminated. Enabled fields may have one or more values associated with a single request or multiple requests for the same coprocessor. At least one match enable must be set to initiate a kill request. A process kill active signal prevents other coprocessor jobs from moving between operational stages in the coprocessor hardware accelerator. Processing jobs that are idle or do not match the fields with match enables set signal done with no match and continue processing. Processing jobs that do match the fields with match enables set are terminated and signal done with match.

Abstract: A device receives a command to initiate parallel processing. The command includes an operator associated with an operation that is to be performed in connection with the parallel processing, and a reference to a multidimensional array to which the operator is to be applied. The operator is represented by a symbol, and the multidimensional array includes at least three dimensions. The command also includes an indication of one or more dimensions by which the multidimensional array is to be partitioned. The device partitions the multidimensional array, along the one or more dimensions, to divide the multidimensional array into multiple blocks, each of the multiple blocks representing a subset of the multidimensional array. The device controls application of the operator to the multiple blocks to cause the operator to be applied in parallel to at least two blocks of the multiple blocks.

Abstract: A technique for determining placement fitness for partitions under a hypervisor in a host computing system having non-uniform memory access (NUMA) nodes. In an embodiment, a partition resource specification is received from a partition score requester. The partition resource specification identifies a set of computing resources needed for a virtual machine partition to be created by a hypervisor in the host computing system. Resource availability within the NUMA nodes of the host computing system is assessed to determine possible partition placement options. A partition fitness score of a most suitable one of the partition placement options is calculated. The partition fitness score is reported to the partition score requester.

Abstract: The second computer detects performance of processing to record the execution status of a batch job on a storing device, selects a recording method to be used from among a plurality of recording methods according to the detected performance, and notifies the first computer of the result. The first computer records the execution status of the batch job, executed in the own computer, on the storing device, using the recording method notified from the second computer.

Abstract: A method and system for providing a guest with virtual media that can be read by the guest. A hypervisor hosted by a computer system presents a guest-to-host channel to a guest in the computer system. The hypervisor receives content from the guest via the guest-to-host channel, the content to be stored and managed by the hypervisor in a memory area associated with the guest in the computer system, the memory area not being directly accessible to the guest. The hypervisor then receives a request from the guest indicating that the guest is to perform at least one operation on the content, and provides the content for the guest to perform the at least one operation.

Abstract: Migration of a virtual machine to a new host is coordinated while data that is mapped into virtual (swap) memory of a source instance of the virtual machine (or guest) is properly handled. Sharing rights for one or more swap devices can be modified to facilitate the use of the swap devices by a new host and a corresponding (target) instance of virtual machine running on the new host.

Abstract: Migration of a virtual machine to a new host is coordinated while data that is mapped into virtual (swap) memory of a source instance of the virtual machine (or guest) is properly handled. Sharing rights for one or more swap devices can be modified to facilitate the use of the swap devices by a new host and a corresponding (target) instance of virtual machine running on the new host.

Abstract: A exclusion control method includes setting, for at least one or more operation information defining operations for an information processing apparatus and being included in a plurality of work flow information that indicate operation procedures, exclusive sections that indicate units of exclusion control performing an exclusive lock, calculating priorities of the exclusive sections using operation importance level information that indicate importance levels of the operations according to types of the operation information and operation urgency level information that indicate an urgency levels of the operations, when the operations are executed based on the operation information corresponding to the exclusive sections of the plurality of workflow information, and executing the exclusion control in the exclusive sections for a plurality of workflow based on the priorities, when a competitive regarding the exclusive lock occurs between the exclusive sections.

Abstract: This disclosure relates generally to a system and method for translating between virtual machines. A network adaptor can be configured to be communicatively coupled to a server, the server comprising a first virtual machine having a first format, the network adaptor to receive input from the server. A translator can be configured to identify, from the input from the server, the first format of the first virtual machine and generate an output, compatible with a second format of a second virtual machine, based on the input from the server, the second format being incompatible with the first format.

Abstract: In one embodiment, a method includes empirically analyzing a set of active reservations and a current set of consumable resources belonging to a class of consumable resources. Each active reservation is of a managed task type and includes a group of one or more tasks requiring access to a consumable resource of the class. The method further includes, based on the empirically analyzing, clocking the set of active reservations each clocking cycle. In addition, the method includes, responsive to the clocking, sorting a priority queue of the set of active reservations.

Abstract: A computer system is disclosed that includes a host operating system and a virtual hypervisor that operates under management of the host operating system to control operations of virtual machines operating under management of the virtual hypervisor. The virtual hypervisor provides an interface between the virtual machines and the host operating system. A signing component generates digital signatures which identify owners of the virtual machines and associates the digital signatures with the virtual machines. A signature validation component determines the owners of the virtual machines using the digital signatures and responsive to occurrence of defined events. Related methods and computer program products for operating computer systems are also disclosed.

Abstract: A method for tuning workflow settings in a distributed computing workflow comprising sequential interdependent jobs includes pairing a terminal stage of a first job and a leading stage of a second, sequential job to form an optimization pair, in which data segments output by the terminal stage of the first job comprises data input for the leading stage of the second job. The performance of the optimization pair is tuned by determining, with a computational processor, an estimated minimum execution time for the optimization pair and increasing the minimum execution time to generate an increased execution time. The method further includes calculating a minimum number of data segments that still permit execution of the optimization pair within the increased execution time.

Abstract: A method and system for scheduling a time critical task. The system may include a processing unit, a hardware assist scheduler, and a memory coupled to both the processing unit and the hardware assist scheduler. The method may include receiving timing information for executing the time critical task, the time critical task executing program instructions via a thread on a core of a processing unit and scheduling the time critical task based on the received timing information. The method may further include programming a lateness timer, waiting for a wakeup time to obtain and notifying the processing unit of the scheduling. Additionally, the method may include executing, on the core of the processing unit, the time critical task in accordance with the scheduling, monitoring the lateness timer, and asserting a thread execution interrupt in response to the lateness timer expiring, thereby suspending execution of the time critical task.

Abstract: A device receives a command to initiate parallel processing. The command includes an indication of a function that is to be performed in connection with the parallel processing, and a reference to a multidimensional array to which the function is to be applied. The multidimensional array includes at least three dimensions. The command also includes an indication of one or more dimensions by which the multidimensional array is to be partitioned. The device partitions the multidimensional array, along the one or more dimensions, to divide the multidimensional array into multiple blocks, each of the multiple blocks representing a subset of the multidimensional array. The device controls application of the function to the multiple blocks to cause the function to be applied in parallel to at least two blocks of the multiple blocks.

Abstract: Systems and methods for automatic generation of software pipelines for heterogeneous parallel systems (AHP) include pipelining a program with one or more tasks on a parallel computing platform with one or more processing units and partitioning the program into pipeline stages, wherein each pipeline stage contains one or more tasks. The one or more tasks in the pipeline stages are scheduled onto the one or more processing units, and execution times of the one or more tasks in the pipeline stages are estimated. The above steps are repeated until a specified termination criterion is reached.