Abstract: Systems and methods for multilayered resource scheduling are provided. A system may include a user interface, an upper level scheduler, at least one lower level scheduler, and a reporting module. The user interface may receive a plurality of tasks. The upper level scheduler may sort the plurality of tasks into tasks with identical resource requirements. The lower level scheduler may be operable to receive resource requirements associated with a task. The lower level scheduler may ascertain compute resources sufficient to execute the task on a machine in a compute farm and advertise the compute resources as matching the resource requirements. The lower level scheduler may further receive a request to execute the task on the machine. The compute resources may be controlled to execute the tasks with the identical resource requirements without further scheduling operations. The lower level scheduler may control the compute resources to execute the task.

Abstract: A technique for recovering from a hang in a virtualized accelerated processing device (“APD”) is provided. In the virtualization scheme, different virtual machines are assigned different “time-slices” in which to use the APD. When a time-slice expires, the APD stops operations for a current VM and starts operations for another VM. To stop operations on the APD, a virtualization scheduler sends a request to idle the APD. The APD responds by completing work and idling. If one or more portions of the APD do not complete this idling process before a timeout expires, then a hang occurs. In response to the hang, the virtualization scheduler informs the hypervisor that a hang has occurred. The hypervisor performs a function level reset on the APD and informs the VM that the hang has occurred. The VM responds by stopping command issue to the APD and re-initializing the APD for the function.

Abstract: A hypervisor managing a virtual machine (VM) running on a host computer system, modifies a virtual machine control structure (VMCS) associated with the VM to trigger a VM exit upon detecting a transition of the VM to a specified power state. Upon detection of the VM exit, a timer is initialized to trigger another VM exit, and execution of the VM in the specified power state is resumed.

Abstract: A computer-implemented method according to one embodiment includes identifying virtualization unit metadata for each of a plurality of nodes, the virtualization unit metadata including one or more guidelines for an application that is implemented by a virtualization unit, where the one or more guidelines include one or more benefits of a virtualization unit, one or more limitations of the virtualization unit, and one or more operating costs of the virtualization unit; determining, from the plurality of nodes, an optimal node for implementing a computation algorithm based on one or more required computation operations and the virtualization unit metadata for each of the plurality of nodes; and returning an identification of the optimal node.

Abstract: A method of organizing computer resources includes receiving a specification defining a plurality of quiescence groups of independent component instances for each of at least two services, and performing a first load balancing of the quiescence groups across a plurality of physical servers to define a plurality of supergroups while assigning each of the physical servers across the supergroups.

Abstract: A method for associating a network service (NS) with a virtualized network function (VNF) to enable a network manager (NM) to determine a relationship between the NS and the VNF and maintain the NS. The method includes sending, by the NM, an NS instantiation request message to a network function virtualization orchestrator (NFVO), where the NS instantiation request message carries the information about the NS. The method further includes receiving, by the NM, an NS instantiation completion message from the NFVO, where the NS instantiation completion message carries information about the NS and information about N VNFs. The method further includes determining a mapping relationship between the NS and the N VNFs according to the information about the NS and the information about the N VNFs, where information about each VNF in the information about the N VNFs represents the VNF in the N VNFs forming the NS, and N?one.

Abstract: A method is provided comprising: initializing a first thread based on a first work request; and executing the first thread to complete the first work request, wherein the first thread is initialized and executed by using an Application Programming Interface (API) that is arranged to emulate a work request queue by initializing a different respective thread for each work request that is submitted to the API for addition to the work request queue.

Abstract: The present invention provides a multi-resource scheduling method responding to uncertain demands in a cloud scheduler, where two computation formulas for fairness and efficiency are used as cost functions in an optimization problem. For some change sets with uncertain resource demands, a robust counterpart of an original non-linear optimization problem is computationally tractable. Therefore, the present invention models features of these sets with uncertain resource demands, i.e., establishes an ellipsoidal uncertainty model. In this model, each coefficient vector is put into a hyper-ellipsoidal space and used as a metric to measure an uncertainty degree. With the ellipsoidal uncertainty model, a non-linear optimization problem is solved and a resource allocation solution that can respond to dynamically changing demands can be obtained.

Abstract: Methods, systems and computer program products for processing an input sequence of a plurality of function calls on at least one processor. Each function call of the plurality of function calls is associated with an abort probability, and each function call is also associated with a processing cost per function call on the basis of a number of processor instructions of the respective function call and the abort probability of the respective function calls. During processing of the function calls according to an input sequence, the abort probability for at least some of the function calls may be updated taking into consideration whether or not the processing of the respective function call caused an abort. The processing cost per function may be updated during processing, and an updated input sequence may be determined by rearranging the order of the function calls based on the processing cost.

Abstract: A system includes a memory, at least one processor in communication with the memory, a plurality of threads executing on the at least one processor, and a supervisor. The supervisor is configured to preempt a first thread of the plurality of threads and determine a status of the first thread as either (i) executing in an atomic section or (ii) executing outside of the atomic section. The atomic section is a region of code tagged as atomic, and the atomic section includes instructions that run under a lock. Responsive to determining the status as executing in the atomic section, the supervisor is configured to notify a second thread of the plurality of threads to execute a system call based lock to block execution until the lock is released by the first thread.

Abstract: In one embodiment, a set of two or more workflow definitions is stored, wherein each workflow definition describes a workflow of an application. The set of two or more workflow definitions are used to implement a state machine of the application based at least in part on the two or more workflow definitions.

Abstract: Creating and executing flow plans by performing at least the following: obtaining a run-time flow plan that comprises a trigger, a first operation, and a second operation, wherein the first operation precedes the second operation within the run-time flow plan and one or more input values of the second operation are linked to the first operation, determining whether one or more conditions of the trigger are met, execute the first operation based at least on the determination that the one or more conditions of the trigger are met, monitoring whether the second operation is ready for execution based at least on a determination that the one or more input values of a second action operation are ready, and executing the second action operation when the second action operation has been identified as ready for execution.

Abstract: Methods, nodes, and a system for process scheduling, as well as corresponding computer programs and computer-program products.

Abstract: Apparatus and methods may include a method for enabling customized jobs deployment in Autosys TM, reviewing of deployment results of said jobs in Autosys TM, and querying said deployment results. The method may include providing a verification of the deployment in a staging area. The staging area may be configured for arranging and deploying a plurality of job scripts in Autosys TM. Each job script may be interrelated with one or more other job scripts. The method may include visually indicating, in a status line, whether the job script has been deployed in Autosys TM or is set to be deployed to Autosys TM. The method may include further visually indicating in what way the job script is interrelated with one or more other job scripts. The method may include importing selected contents of a log folder from Autosys TM.

Abstract: A method for processing data includes receiving a write request by a host operating system during a predetermined time window, storing data associated with the write request in a shared memory, making a first determination that a threshold number of write requests are obtained within the predetermined time window, and, in response to the first determination, sending an offload request to a virtual machine (VM), wherein the offload request specifies at least the write request.

Abstract: Selection and serving of content items may include receiving data indicative of a status of an energy source of a device with a request for a content item. A first received content item may be associated with a first energy consumption level and a second received content item may be associated with a second energy consumption level. The accessed content items are responsive to the request for a content item. The first energy consumption level may be higher than the second energy consumption level. The first content item or the second content item may be selected based, at least in part, on the received data indicative of the status of the energy source of the device, and data to display the selected content item may be provided to the device.

Abstract: The present invention relates to methods for processing jobs within a cluster architecture. One method comprises the pausing of a job when waiting upon external dependencies. Another method comprises the transmission of messages relating to the ongoing processing of jobs back to a client via a persistent messaging channel. Yet another method comprises determining capacity at a node before allocating a job for processing by the node or adding the job to a cluster queue. A system for processing jobs within a cluster architecture is also disclosed.

Abstract: Techniques are disclosed relating to processing a control stream such as a compute control stream. In some embodiments, the control stream includes kernels and commands for multiple substreams. In some embodiments, multiple substream processors are each configured to: fetch and parse portions of the control stream corresponding to an assigned substream and, in response to a neighbor barrier command in the assigned substream that identifies another substream, communicate the identified other substream to a barrier clearing circuitry. In some embodiments, the barrier clearing circuitry is configured to determine whether to allow the assigned substream to proceed past the neighbor barrier command based on communication of a most-recently-completed command from a substream processor to which the other substream is assigned (e.g., based on whether the most-recently-completed command meets a command identifier communicated in the neighbor barrier command).

Abstract: The disclosure relates to migration of virtual machines. In an example implementation, migration of a virtual machine (VM) is initiated from a source hypervisor to a destination hypervisor. A destination fibre channel (FC) port associated with the destination hypervisor is assigned to support a virtual initiator port of the VM upon migration, where the destination FC port is assigned using at least error statistics collected for the destination FC port. The VM is migrated from the source hypervisor to the destination hypervisor by supporting the virtual initiator port of the VM on the assigned destination FC port associated with the destination hypervisor.

Abstract: A computer-implemented method for scheduling a series of recurring events including: receiving one or more requests to allocate resource(s) to a series of recurring events, wherein the one or more requests specify, for each event, a corresponding desired time period over which the resource(s) are to be allocated, and the one or more requests further specify one or more adjustment criteria for defining, for one or more of the events, one or more permissibly adjusted time periods from the desired time period; obtaining, for each event, resource availability data indicative of an availability of the resource(s) during the desired time period; and, for each event: determining, based on the resource availability data, a viable time period, wherein the viable time period is either the desired time period or a permissibly adjusted time period that satisfies the one or more adjustment criteria; and allocating the resource(s) to the viable time period.