Abstract: In various examples, access to VM memory by virtualization software is secured using a trusted firmware of a host controller to validate one or more of a command to read a VM's memory and/or the data read from VM memory in order to protect against improper access to data in VM memory. If validation fails, the firmware may refrain from reading the data and/or from providing the virtualization software with access to the data. The data may include a request command from a VM regarding establishing or modifying a connection using the host controller to another entity, such as another device within or outside of the virtualization environment. The virtualization software may use the request command to facilitate the connection. The host controller may provide an eXtensible Host Controller Interface (xHCI) or a different type of interface for the connection.

Abstract: A computer-implemented method and system for workload scheduling based on localizing virtual computing resources. The computer implemented method includes, in one embodiment, localizing a first computing resource having a workload under execution, the first computing resource being associated with a set of virtual computing resources. An embodiment includes rescheduling, responsive to the localizing, the workload for execution at least partially at a second computing resource in the set of virtual computing resources.

Abstract: A method, computer program product, and computer system for identifying, by a computing device, an attribute of a lock object associated with data. It may be determined that the lock object is acquired by a first task performing a transaction with the data based upon, at least in part, the attribute of the lock object. The lock object may be acquired by a second task by releasing the lock object from the first task prior to the transaction with the data being completed, wherein the second task is a higher priority task than the first task.

Abstract: A disclosed example includes accessing, by virtual nonvolatile memory in a virtual machine monitor executing on one or more processors, a first command submitted to a guest queue by a native nonvolatile memory driver executing in a guest virtual machine; generating, by the virtual nonvolatile memory, a translated command based on the first command by translating a virtual parameter of the first command to a physical parameter associated with physical nonvolatile memory; submitting, by the virtual nonvolatile memory, the translated command to a shadow queue to be processed by the physical nonvolatile memory based on the physical parameter; and submitting, by the virtual nonvolatile memory, a completion status entry to the guest queue, the completion status entry indicative of completion of a direct memory access operation that copies data between the physical nonvolatile memory and a guest memory buffer corresponding to the guest virtual machine.

Abstract: In an example embodiment, a solution is provided that causes a binary used by an in-memory database application to be deployed in a separate container. The container with the binary may be called a “sidecar” to the container with the in-memory database application. Both containers mount the same path in the hosts shared filesystem to expose the binary to the application. There is no permanent connection between the two containers, and thus the binary can be updated individually without inducing a downtime of the in-memory database application.

Abstract: A method and an apparatus for scheduling commands in a virtual computing environment includes picking a command. It is determined whether the command is a synchronization command or a conditional command. A synchronization command is an independent command. A conditional command is a dependent command that depends on a synchronization command. In response to the command being determined as the synchronization command, a waiting queue is enabled for the command, the waiting queue storing conditional commands dependent on a running synchronization command. The command is dispatched to a processing engine.

Abstract: Systems and methods are described for adjusting a number of concurrent code executions allowed to be performed for a given user on an on-demand code execution environment or other distributed code execution environments. Such environments utilize pre-initialized virtual machine instances to enable execution of user-specified code in a rapid manner, without delays typically caused by initialization of the virtual machine instances. However, to improve utilization of computing resources, such environments may temporarily restrict the number of concurrent code executions performed on behalf of the given user to a number less than the maximum number of concurrent code executions allowed for the given user. Such environments may adjust the temporary restriction on the number of concurrent code executions based on the number of incoming code execution requests associated with the given user.

Abstract: This disclosure describes techniques for flexible maintenance windows for performing maintenance for instances. Using techniques described herein, a user of a service provider network may specify configuration data that relates to maintenance events of instances. A “maintenance event” is any event that relates to deploying instances and/or at least temporarily losing use of an instance. For example, a maintenance event may cause an instance to be deployed, re-booted, re-started, or replaced. According to some configurations, customers may specify one or more maintenance event windows for when maintenance is to be performed, as well as customize notifications that are provided to the customer about scheduled maintenance events. For instance, customers may create a maintenance window that specifies to perform maintenance on Tuesdays, between 2 AM-3 AM, and that notifications are to include information specified by the customer (e.g., through one or more tags).

Abstract: A parallel process apparatus connecting electronic controllers via buses includes: a process request acceptance section that accepts process requests to the electronic controllers; and a process execution section that, while multiple process requests are simultaneously accepted, arbitrates the multiple process requests being accepted, and parallelizes multiple processes in accordance with the multiple process requests.

Abstract: An apparatus can comprise a processor and a memory. The memory can store instructions that, when executed by the processor, cause the processor to associate a plurality of consumer containers with a data container. The plurality of consumer containers can host workloads that access a data segment hosted by the data container. The plurality of consumer containers and the data container can be scheduled on different nodes of a horizontally scalable cluster. A node of the horizontally scalable cluster that hosts the data container can be identified. The plurality of consumer containers can be scheduled to execute on the node based on the association between the plurality of consumer containers and the data container.

Abstract: A memory/multi-core concurrent memory allocation method, which is applied to an embedded system, wherein a kernel module and a plurality of application programs are provided. The memory allocation method comprises: acquiring first memory allocation requests of the plurality of application programs; the kernel module determining whether preset screening marks exist in the first memory allocation requests; when screening marks exist in the first memory allocation requests, prohibiting allocating memory for the current application program managed by a contiguous memory allocator. By adopting the memory allocation method, the application programs which occupy contiguous memory allocated by the continuous memory allocator for a long time can be screened and removed, then contiguous memory allocation can be provided for the drivers in a shorter time, and the corresponding contiguous continuous memory can be allocated for the drivers through a plurality of processing units at the same time with a higher efficiency.

Abstract: A computer-implemented data stream processing method includes generating, calculating, and deploying. The generating includes generating a directed graph in which processes in a stream processing infrastructure are represented by nodes and data input/output relationships between the nodes are represented by edges. The calculating includes calculating a degree of each of the nodes based on a weight of each of the edges. The deploying includes deploying, based on the calculated degree of each of the nodes, the processes represented by the nodes at stages of a pipeline in the stream processing infrastructure.

Abstract: Examples described herein include virtualized environments including a virtualized file server. Examples of file server virtual machine managers are described which may setup and/or configure file server virtual machines in accordance with a target number of connections and/or a target throughput for the virtualized file server. The virtualized file server may be scaled up, scaled down, scaled in, and/or scaled out.

Abstract: Systems and methods for offloading data processing tasks using in-storage code execution are disclosed. For example, a data storage system including one or more processors, a non-transitory storage medium, and a storage logic executable by the one or more processors to perform operations including: receiving portable code configured to perform a data processing offload task, the portable code comprising one or more translatable, hardware-agnostic instructions for processing data stored on the storage medium; translating and executing the one or more translatable, hardware-agnostic instructions of the portable code to perform the data processing offload task using a translation and execution engine disposed in the storage logic; determining that use of the portable code has concluded; and responsive to determining that use of the portable code has concluded, releasing the portable code.

Abstract: A system and method for performing a task on a computing device based on access rights are described. In one aspect, an exemplary method comprises, gathering data characterizing a task by intercepting function calls used to perform the task, and sending a request to an operating system of the computing device to temporarily interrupt the called functions until access rights are determined, determining a threat level of the task based on the gathered data and task templates, generating a test based on the threat level and test generating rules and presenting the test to the user, analyzing results of the test and determining access rights of the task based on the results, and performing the task based on the access rights.

Abstract: A job scheduling system includes a primary job scheduler and a secondary scheduling gatekeeper. The primary job scheduler provides primary scheduling primitives. The primary job scheduler is configured to activate a first job on an activation date determined based on a primary scheduling definition of the first job, and execute a secondary scheduling gatekeeper to evaluate whether a target program associated with the first job is executed during the activation. The gatekeeper provides enhanced scheduling primitives that include scheduling primitives not in the primary scheduling primitives. The gatekeeper is configured to evaluate a secondary scheduling definition of the first job to determine whether the first job should continue to execution and return the enhanced scheduling result to the primary job scheduler. The secondary scheduling definition is configured using the set of enhanced scheduling primitives. The system causes the execution of the target program based on the result.

Abstract: Generally described, one or more aspects of the present application relate to an instance resource oversubscription service for scheduling a burst period for a running virtual machine instance based on a time window specified by a user of the virtual machine instance. For example, the instance resource oversubscription service can predict future resource usage and identify the appropriate timing and physical host machine for letting the user burst (e.g., temporarily use the virtual machine instance in a manner than consumes a higher amount of computing resources such as CPU cycles, memory, network bandwidth, etc.). In doing so, the instance resource oversubscription service may consider, for example, the historical and current resource utilization levels of the virtual machine instances running on a set of available physical host machines and the burst period scheduling requests from other users of the instance resource oversubscription service.

Abstract: The present disclosure describes a number of embodiments related to devices and techniques for implementing an interconnect switch to provide a switchable low-latency bypass between node resources such as CPUs and accelerator resources for caching. A resource manager may be used to receive an indication of a node of a plurality of nodes and an indication of an accelerator resource of a plurality of accelerator resources to connect to the node. If the indicated accelerator resource is connected to another node of the plurality of nodes, then transmit, to a interconnect switch, one or more hot-remove commands. The resource manager may then transmit to the interconnect switch one or more hot-add commands to connect the node resource and the accelerator resource.

Abstract: A method of deploying cloud services quickly is to make a near-end apparatus be connected to a cloud virtual machine of a cloud server, establish a cloud agent module in the cloud virtual machine, continuously synchronize local data from the near-end apparatus to the cloud virtual machine and converse the local data into cloud structured data, upload local data flow task from the near-end apparatus to the cloud virtual machine for configuring cloud task program. A cloud execution result based on the cloud task program and the cloud structured data corresponds to a local execution result based on the local data and the local data flow task.

Abstract: Virtual machine images available across a plurality of cloud networks may be identified. A catalog of the virtual machine images may be generated. The catalog may comprise, for each virtual machine image, a mapping information, comprising: a name of a virtual machine image, a name of a virtual machine instance based on the virtual machine image, a name of a cloud network providing the virtual machine image, a cost of deploying the virtual machine instance on the cloud network, a tag identifying a feature of the virtual machine image, and an identification tag assigned to the virtual machine image. For a given virtual machine instance, the catalog of the virtual machine images may be analyzed to identify a least cost cloud network.