Abstract: In a computing storage environment having multiple processor devices, lists of Task Control Blocks (TCBs) are maintained in a processor-specific manner, such that each of the multiple processor devices is assigned a local TCB list. The local TCB list of each of the multiple processor devices is populated with a respective number of TCBs from a global TCB list. The local TCB list of each of the multiple processor devices exchanges TCBs with the global TCB list during processes to maintain the local TCB list of each of the multiple processor devices at the respective number.

Abstract: A method for transferring data between at least two subscribers, at least one of the subscribers being located in a vehicle, the at least one vehicle-based subscriber providing at least one virtual machine or being configured as a virtual machine, the at least one virtual machine forming a server in a client-server communications network. Also disclosed is a communications network, a subscriber, and a vehicle.

Abstract: An information processing device includes a confirmation unit and an application unit. If a changeable flag is attached to a process flow, the confirmation unit confirms whether or not a change exists in a master of the process flow. If the confirmation unit confirms that a change exists in the master, the application unit applies the change to the process flow that is to be executed.

Abstract: Systems, methods, and computer program products are provided for load balancing for processing large data sets. The method includes identifying a number of segments and a transaction data set comprising transaction data for a plurality of transactions, the transaction data for each transaction of the plurality of transactions comprising a transaction value, determining an entropy of the transaction data set based on the transaction value of each transaction of the plurality of transactions, segmenting the transaction data set into the number of segments based on the entropy of the transaction data set and balancing respective entropies of each segment of the number of segments, and distributing processing tasks associated with each segment of the number of segments to at least one processor of a plurality of processors to process each transaction in each respective segment.

Abstract: A method for deterministic clock replay can include in response to executing a guest clock access instruction, estimating, using a virtual processor of a guest virtual machine, a value of a guest clock of the guest virtual machine based on (a) a current branch counter value that indicates a number of branch instructions executed since a first time and (b) an average time between execution of branch instructions, comparing the estimated value to an actual guest clock value of a guest clock of the guest virtual machine, and in response to determining the estimated value is less than the actual guest clock value by a threshold value, recording the number of branch instructions, the first time, and the average time between execution of branch instructions in a memory.

Abstract: Methods and systems to compute application license costs of a number of applications run on virtual machines of a virtualized data center are described. In one aspect, one or more of the virtual machines (“VMs”) that form the virtual data center are determined. Each VM is created from hardware components specifications of one or more application blueprints stored in a data-storage devices. The one or more blueprints are searched to determine the one more applications that run in each VM. For each VM, a total VM application licensing cost of the one or more applications is computed based on one or more of an application instance license cost, application socket license cost, and application core license of each of the one or more applications associated with each application.

Abstract: A data processing device is provided that includes a plurality of hardware data processing nodes, wherein each hardware data processing node performs a task, and a hardware thread scheduler including a plurality of hardware task schedulers configured to control execution of a respective task on a respective hardware data processing node of the plurality of hardware data processing nodes, and a proxy hardware task scheduler coupled to a data processing node external to the data processing device, wherein the proxy hardware task scheduler is configured to control execution of a task by the external data processing device, wherein the hardware thread scheduler is configurable to execute a thread of tasks, the tasks including the task controlled by the proxy hardware task scheduler and a first task controlled by a first hardware task scheduler of the plurality of hardware task schedulers.

Abstract: An operating system interface, responsive to detecting a non-privileged thread request with a scheduling attribute set to a critical setting to request access to at least one privileged core, selectively schedules the non-privileged thread request into a privileged core queue associated with the at least one privileged core only when a resource availability of the at least one privileged class core meets a threshold level of availability, the at least one privileged core providing a higher throughput than at least one regular core. The operating system interface, responsive to detecting a privileged thread request with the scheduling attribute set to the critical setting, automatically scheduling the privileged thread request into the privileged core queue.

Abstract: Examples relate to deploying distributed applications using virtual nodes. In some examples, virtual nodes are created and are each assigned a core subset of a number of processing cores, an Internet protocol (IP) address, and an in-memory file system configured to provide access to a portion of physically shared memory. At this stage, a distributed application that is configured to be deployed to a plurality of machine nodes is deployed to the plurality of virtual nodes. On a first virtual node, a reference to a first dataset stored in physically shared memory is sent to a second virtual node, where the physically shared memory is accessible to each of the plurality of virtual nodes. Next, on the second virtual node, the first dataset is accessed through the in-memory file system of the first virtual node.

Abstract: A system and method of dynamically controlling a reservation of resources within a cluster environment to maximize a response time are disclosed. The method embodiment of the invention comprises receiving from a requestor a request for a reservation of resources in the cluster environment, reserving a first group of resources, evaluating resources within the cluster environment to determine if the response time can be improved and if the response time can be improved, then canceling the reservation for the first group of resources and reserving a second group of resources to process the request at the improved response time.

Abstract: A time-aware method of scheduling application tasks in a green data center (GDC) using a task scheduling processor and an energy collecting processor connected to one or more renewable energy sources and a grid power source. The method includes receiving energy data regarding available energy from renewable energy resources such that the renewable energy source is used first then receiving the application tasks and determining a service rate for servers to process the application tasks by using a service rate obtained by solving a profit maximization problem for the GDC by prioritizing and immediately scheduling or removing certain application tasks. The method also includes determining an initial fitness level of each representative application task based on total revenue of the GDC, an energy cost of the GDC, and a penalty associated with violated constraints.

Abstract: A host computer has a plurality of containers including a first container executing therein, where the host also includes a physical network interface controller (NIC). A packet handling interrupt is detected upon receipt of a first data packet associated with the first container. If the first virtual machine is latency sensitive, then the packet handling interrupt is processed. If the first virtual machine is not latency sensitive, then the first data packet is queued and and processing of the packet handling interrupt is delayed.

Abstract: Techniques for concurrent execution of multiple content item processes, such as video game processes, on a single virtual machine instance are described herein. In some examples, developers may provide an indication of a desired content item process quantity count, which is a quantity of content item processes for concurrent execution of content item sessions on each of one or more virtual machine instances. Also, in some examples, the content item process quantity count may be adjustable such that it may be changed, for example in response to various conditions or events. Also, in some cases, collected performance metric information may be used to make intelligent decisions regarding scaling of content item processes. In some examples, when a content item session stops executing on a healthy content item process, the content item process may remain active and may be reused by executing one or more subsequent content item sessions.

Abstract: A method and system for allocating and migrating workloads across an information technology (IT) environment based on persistent memory availability. Specifically, the method and system disclosed herein entail the intelligent placement of workloads on appropriate nodes of a node cluster based on workload requirements and node capabilities and/or resources availability. Further, workloads may be ranked based on a workload priority assigned to any particular workload, if available, or based on logged system calls issued by virtual machines hosting any particular workload. Subsequently, higher ranked workloads may be granted priority access to nodes that host healthier persistent memory, if any, or host higher performance traditional storage.

Abstract: In one or more embodiments, a device may include and/or implement a physical function and multiple virtual functions that are operable to be arranged in a logical nested hierarchy and operable to be configured to respective virtual machines in a hierarchy of nested virtual machines. For example, the physical function may be configured to receive a request, issued from a virtual function of the multiple virtual functions corresponding to a Nth level of nesting of the multiple virtual functions. Until a response to the request is received, the physical function may iteratively provide the request to a virtual function of the multiple virtual functions corresponding to a current level of nesting and if the response to the request is not received from the virtual function corresponding to the current level of nesting, utilize the current level of nesting as a level immediately below the current level of nesting.

Abstract: A single workload scheduler schedules sessions and tasks having a tree structure to resources, wherein the single workload scheduler has scheduling control of the resources and the tasks of the parent-child workload sessions and tasks. The single workload scheduler receives a request to schedule a child session created by a scheduled parent task that when executed results in a child task; the scheduled parent task is dependent on a result of the child task. The single workload scheduler receives a message from the scheduled parent task yielding a resource based on the resource not being used by the scheduled parent task, schedules tasks to backfill the resource, and returns the resource yielded by the scheduled parent task to the scheduled parent task based on receiving a resume request from the scheduled parent task or determining dependencies of the scheduled parent task have been met.

Abstract: There is provided an apparatus comprising scheduling circuitry, which selects a task as a selected task to be performed from a plurality of queued tasks, each having an associated priority, in dependence on the associated priority of each queued task. Escalating circuitry increases the associated priority of each of the plurality of queued tasks after a period of time. The plurality of queued tasks comprises a time-sensitive task having an associated deadline and in response to the associated deadline being reached, the scheduling circuitry selects the time-sensitive task as the selected task to be performed.

Abstract: In one embodiment, a system includes host machines that form elements of the virtualization environment, and that include a hypervisor, a user virtual machine (UVM), a connection agent, and an I/O controller. The system further includes a virtual disk comprising a plurality of storage devices, the virtual disk being accessible by all of the I/O controllers. At least one of host machines receives a request associated with one of the elements using an application programming interface (API), and including a context-specific identifier. The host machine determines, using reflection, a type of the context-specific identifier and processes the request based on a mapping, according to the determined type, from the context-specific identifier to a unique identifier associated with the element.

Abstract: A system and method for dynamic guest controlled halt polling includes a memory, one or more physical processors in communication with the memory, a virtual machine executing on the one or more physical processors, and a hypervisor executing on the one or more physical processors. In an example, the hypervisor detects a request to disable halt polling. Then, the hypervisor sets a halt polling disable flag in hypervisor memory. The halt polling disable flag is associated with a virtual central processing unit (VCPU) of the virtual machine.

Abstract: A system includes network interface controller (NIC) and a host processor. The host processor may run a hypervisor or OS which may manage virtual network activity for virtual machines (VMs) and/or applications. The NIC may provide a physical function to the hypervisor to support network activity by the VMs and/or applications. Some VMs and/or applications on the network may bypass the hypervisor and access virtual functions from the NIC. The NIC may execute a configurable flow analyzer (CFA), which may perform flow processing operations on the network traffic. The CFA may access flow configuration and management parameters maintained by the hypervisor to control implementation of the flow processing operations. Performing the flow processing operations on the traffic for the VMs and/or applications bypassing the hypervisor or OS may extend management by the hypervisor or OS to these VMs and/or applications.