Abstract: Reusing containers is provided. It is communicated to a pipeline workload manager that a particular container has finished running a step of a pipeline workload using an agent daemon of the particular container. Pipeline workload information corresponding to the pipeline workload is checked using the pipeline workload manager to determine whether the particular container can be reused to run a particular step in a different pipeline workload. The particular container is provided to be reused to run the particular step in the different pipeline workload without having to perform a prepare container environment sub-step of that particular step based on determining that the particular container can be reused to run that particular step in the different pipeline workload according to the pipeline workload information.

Abstract: Implementations are disclosed to automatically evaluate, detect, or predict an event, and provide customized virtual assistance to a user based on the event. The implementations include a system capable of pulling data from a client device, detecting an event based on the pulled data, and pushing customized digital resources to the client device based on the detected event.

Abstract: Computing system enhancements make container instantiation faster, reduce layer content storage demands, and make more container image formats available. A container instantiation location sends a container image pull request to a container registry, receives an image manifest, sends a layer mount request to the registry instead of a layer content download request, receives a layer mount, optionally repeats for additional layers, creates a union file system spanning the layers, and launches a container process based on the union file system without first downloading all the layer content.

Abstract: Computing systems, devices, and methods of dynamic image composition for container deployment are disclosed herein. One example technique includes receiving a request for accessing a file from a container process. In response to receiving the request, the technique includes querying a mapping table corresponding to the container process to locate an entry corresponding to a file identifier of the requested file. The entry also includes data identifying a file location on the storage device from which the requested file is accessible. The technique further includes retrieving a copy of the requested file according to the file location identified by the data in the located entry in the mapping table and providing the retrieved copy of the requested file to the container process, thereby allowing the container process to access the requested file.

Abstract: Techniques described herein relate to a method for performing state management services for composed information handling systems. The method includes determining that at least one control resource set is not associated with a distributed state storage system; instantiating the distributed state storage system using first additional computing resources; registering the at least one control resource set with the distributed state storage system; preparing the at least one control resource set to perform a first portion of the state management services using the distributed state storage system; determining that the at least one control resource set is not associated with an audit storage; instantiating the audit storage using second additional computing resources; registering the at least one control resource set with the audit storage; and preparing the at least one control resource set to perform a second portion of the state management services using the audit storage.

Abstract: Improved techniques for combining a plurality of distinct recordings pertaining to user interactions with one or more software applications each of which concerns performing a task. Then, the combined recording can be used to form a software automation process for performing the task in an automated fashion. Advantageously, the improved techniques enable a robotic process automation (RPA) system to capture multiple recordings, combine (e.g., merge) the recordings, and form a software automation process to perform repetitive tasks in an automated manner, all with little or no assistance from a user.

Abstract: There are provided a method for behavioral pairing in a task assignment system with an external pairing system. The method includes transmitting, to the external pairing system over an application programming interface, a control flag and a benchmark flag and receiving, from the external pairing system, a task-agent pairing based on one of a first pairing strategy and a second pairing strategy. The task-agent pairing is based at least in part on the control flag and the benchmark flag.

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

Abstract: Service cells may be utilized to limit the blast radius and reduce the probability of operational incidents (e.g., attacks, load spikes, distributed thrash, and the like). Techniques discussed herein provide any suitable number of service cells, each if which include a management plane and a data plane. A work request that includes an intended state of the service cell can be received and stored. One or more execution tasks can be executed by a management plane of the service cell to bring the data plane to a state corresponding to the intended state. The management plane can monitor the actual state of the data plane with respect to the intended state (e.g., the state requested by a user). Over time, the management plane can make modifications to the service cell to ensure the resources of the data plane are ever in conformance with the intended state requested by the user.

Abstract: Virtual computer systems (virtual machines) have become increasingly common with the evolution of virtualization technology, cloud computing, etc. However, as a virtual machine and its associated guest operating system seek to execute and/or access a page of memory through synchronous processes execution of the virtual processor associated with the virtual processing is blocked until the page of memory is locked and available. Accordingly, time is wasted on calls waiting for physical page availability thereby reducing utilization of the host machine and virtual machine respectively. To address this an asynchronous virtual machine environment is established allowing the virtual machine or physical machine to handle additional operations whilst waiting for physical page availability.

Abstract: A facility for retrieving content. The facility invokes an API, as part of the invocation passing to the API: (1) information identifying one or more units of content to return; and (2) an indication that an entity on behalf of which the invocation is performed attests that the entity is compliant with a license that applies to the identified units of content. The facility receives a response to the API invocation that contains the identified units of content.

Abstract: Methods and non-transitory machine-readable media associated with a virtual queue are described. A method can include receiving, by a processing resource, a request from a user to join a virtual queue, adding, by the processing resource, the user to the virtual queue, determining, by the processing resource, a queue optimization based on an estimated wait time for the user in the virtual queue, and providing to the user, by the processing resource, the queue optimization including the estimated wait time for the user in the virtual queue. The virtual queue can be updated in an example.

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: A computing device may execute a robot service that receives process requests to store in a process queue in memory. The robot service may utilize user-defined preferences to prioritize the process requests in the process queue. The process requests may be scheduled based on the user-defined preferences. The robot service may initiate the scheduled process requests for robotic automation of the application.

Abstract: A processing node selects a first task from a task list and sends, to a task assignment repository, a first write operation with a first task identifier of the first task to assign the first task to the processing node. The processing node detects failure of the first write operation based on the first task already being assigned and selects a second task from the task list. The processing node sends, to the task assignment repository, a second write operation with a second task identifier of the second task to assign the second task to the processing node. The processing node detects success of the second write operation and executes the second task.

Abstract: Disclosed in the present disclosure is an out-of-order data generation method. The method comprises: creating a plurality of threads; instructing all threads to acquire transmission permission in a manner of acquisition after random delay, determining, after any thread acquires the transmission permission, a thread as the current thread, and instructing the current thread to drive currently generated data and a corresponding data ID to an AXI bus for reading by a receiving end, so as to implement an out-of-order reading test on the basis of the data and corresponding data identifier that are read by the receiving end; and after sending, by the current thread, of the currently generated data and the corresponding data identifier ends, recycling the transmission permission, and returning to execute the step of instructing the all threads to acquire the transmission permission in the manner of acquisition after the random delay.

Abstract: The detection of utilized virtual machines through usage pattern analysis is described. In one example, a computing device can collect utilization metrics from a virtual machine over time. The utilization metrics can be related to one or more processing usage, disk usage, network usage, and memory usage metrics, among others. The utilization metrics can be used to determine a number of clusters, and the clusters can be used to organize the utilization metrics into groups. Depending upon the number or overall percentage of the utilization metrics assigned to individual ones of the plurality of clusters, it is possible to determine whether or not the virtual machine is a utilized or an idle virtual machine. Once identified, utilized virtual machines can be migrated in some cases. Idle virtual machines can be shut down to conserve processing resources and costs in some cases.

Abstract: A method, system, and computer program product for implementing container runtime optimization and execution is provided. The method includes enabling a container management instance and a container runtime comprising specified operational attributes associated with a container. Supervisor tree code is embedded within the container runtime and definition software is executed. The definition software describes specified digital endpoints of an associated application process being executed by the container. The container is enabled for operational functionality and an external interface is enabled for communications with the supervisor tree code. The container management instance is executed in response to a command received via the external interface.

Abstract: A deduplicated file system includes a set of microservices including front-ends and back-ends. Assignments of files are balanced across front-ends. The files are represented by segment trees including multiple segment levels. Assignments of similarity groups are balanced across back-ends. Similarity groups are associated with segments at a lower-level of the segment trees that form the files. Front-ends are responsible for operations involving an upper-level of the trees. Back-ends are responsible for operations involving the lower-level of the trees. A mapping of file assignments to front-ends and of similarity group assignments to back-ends is stored. A request to perform a file system operation is received. The mapping is consulted to identify particular front and back-ends that should be responsible for handling and processing the request.

Abstract: A method, system, and computer program product for implementing automated serverless runtime container allocation is provided. The method includes defining a number of runtime containers and associated characteristics required for each worker node of a plurality of worker nodes for execution of a specified workload. The specified workload is dispatched to the plurality of worker nodes and a specified portion of the specified workload is assigned to each worker node. An application executing a universal runtime container that includes potential application runtimes and associated supported software versions within a layered modifiable format is generated and unused layers are removed from the universal runtime container. The specified workload is executed via the universal runtime container and a set of available universal runtime containers is refilled on an associated work node.