Abstract: A method for managing composed information handling systems includes obtaining, by a system control processor, a composition request for a composed information handling system of the composed information handling systems, wherein the composition request comprises an operational instances requirement, and initially allocating only a minimum number of instances of a resource based on the operational instances requirement to the composed information handling system, wherein at least one of the minimum number of instances of the resource is provided by a first information handling system, wherein the first information handling system is operatively connected to the system control processor manager.

Abstract: A processing device receives request from a process of a plurality of processes of a clusterized service, to attempt to create, in a file system accessible by the process, a file associated with a leader state of the plurality of processes. Responsive to successfully creating the file, the processing device to enable the process to enter the leader state. The processing device is further to enable the process to stay in the leader state for a lifetime of the process.

Abstract: Systems and methods for providing an environment for creating media content are disclosed. According to at least one embodiment, a method for providing an environment including a virtual production control room (VPCR) for creating media content is disclosed. The method includes: requesting, from a user, information regarding the environment to be provided; receiving, from the user, the information; and creating the environment by provisioning a plurality of resources for the VPCR from among a plurality of cloud computing resources based on the received information.

Abstract: A hardware thread scheduler (HTS) is provided for a multiprocessor system. The HTS is configured to schedule processing of multiple threads of execution by resolving data dependencies between producer modules and consumer modules for each thread. Pattern adaptors may be provided in the scheduler that allows mixing of multiple data patterns across blocks of data. Transaction aggregators may be provided that allow re-using the same image data by multiple threads of execution while the image data remains in a given data buffer. Bandwidth control may be provided using programmable delays on initiation of thread execution. Failure and hang detection may be provided using multiple watchdog timers.

Abstract: A computer-implemented method of monitoring programmatic containers (containers) through executing a computer program in a kernel space is disclosed. The method comprises storing trace data in a memory buffer that is shared by the kernel space and a user space, the trace data being related to execution of a process associated with a container at an execution point of the process. The method also comprises retrieving container data related to the container through raw access of one or more kernel data structures when execution of the process is stopped. In addition, the method comprises storing the container data in association with the trace data in the memory buffer.

Abstract: Various approaches for allocating resources to multiple virtual machines include identifying multiple reserved instances, each specifying a quantity of one or more computational resources compatible with the feasible resource template for the VMs; computationally generating, for each of the VMs, an instance-ranking list indicating a ranking order of the reserved instances having templates feasible for the VM; computationally generating, for each of the reserved instances, a VM-ranking list indicating a ranking order of the VMs to which the resources specified by the reserved instance may be allocated; and based at least in part on the instance-ranking list and the VM-ranking list, computationally mapping each of the VMs to one of the reserved instances.

Abstract: A method for graphics processing, wherein a graphics processing unit (GPU) resource is allocated among applications, such that each application is allocated a set of time slices. Commands of draw calls are loaded to rendering command buffers in order to render an image frame for a first application. The commands are processed by the GPU resource within a first time slice allocated to the first application. The method including determining at least one command has not been executed at an end of the first time slice. The method including halting execution of commands, wherein remaining one or more commands are not processed in the first time slice. A GPU configuration is preserved for the commands after processing a last executed command, the GPU configuration used when processing in a second time slice the remaining commands.

Abstract: Task scheduling in a computing device may be based in part on voltage regulator efficiency. For an additional task to be scheduled, multiple task scheduling cases may be determined that represent execution of the additional task on each of a number of processors concurrently with one or more other tasks executing among the processors. For each task scheduling case, a regulator input power level for a voltage regulator may be determined based on a performance level indication associated with the additional task, the one or more other tasks executing on the processors, and the efficiency level of each voltage regulator. For each task scheduling case, a total regulator input power level may be determined by summing the regulator input power levels for all voltage regulators. The additional task may be executed on a processor associated with a task scheduling case for which total regulator input power is lowest.

Abstract: A computer-implemented method for managing one or more operations of a workload includes selecting a resource type for workload management on a platform. One or more operations of the selected resource to be managed are identified. A reconciliation time for execution of each of the identified operations is determined. A reconciliation period between two consecutive reconciliations is determined for each of the identified operations. A minimum number of processes for workload management of a given set of the operations on resources is calculated, and the determined minimum number of processes is deployed to manage the workload.

Abstract: Information Security and privacy are the most critical aspects of the internet. The majority of the individuals that have access to the Internet have great difficulty understanding the basics of computers and how they work. This limits the ability of Internet users to protect themselves and their information while browsing the internet. With the creation and testing of SADD (Scalable Anonymous Disposable Desktops), Internet users no longer have to worry about protecting their computer or privacy.

Abstract: Systems and techniques that facilitate computing task coincidence reduction via prime scheduling are provided. In various embodiments, a system can comprise an input component that can access a periodic computing task performed by a computer system. In various instances, the system can further comprise a prime component that can assign a time period to the periodic computing task. In various cases, a duration of the time period can be a product of a common tick and a prime number. In various embodiments, the system can comprise an execution component that can periodically execute the periodic computing task according to the time period.

Abstract: According to examples, an apparatus may include a processor and a memory on which are stored machine-readable instructions that when executed by the processor, may cause the processor to receive information regarding a property of a data resource and to calculate a score associated with the data resource based on the received information regarding the property. The score may correspond to a probability that the data resource is to have a first type of accessibility. The processor may compare the calculated score to a predefined threshold value and, based on the comparison of the calculated score to the predefined threshold value, may output an indication that accessibility to the data resource should be set to the first type of accessibility or a second type of accessibility.

Abstract: Disclosed embodiments relate to systems and methods for enabling recovery of deactivated virtual computing instances that were previously instantiated in a dynamic virtualized computing environment. Techniques include identifying a status change for a virtual computing instance; archiving a plurality of environment properties representing a chain of activities comprising a plurality of activities executed by a processor of the virtual computing instance; and reactivating the virtual computing instance. Reactivating the virtual computing instance may include reinstantiation of the virtual computing instance based on the plurality of environment properties and chain of activities such that the virtual computing instance is reinstantiated to a state at a time of the status change.

Abstract: Improved systems and devices for medical imaging distribution are provided. A medical imaging order may be received from a medical facility that includes medical imaging. A configuration may be selected and applied based on a body site and an urgency field associated with the order that defines queueing rules for the medical imaging order. Utilization factors for queues associated with radiologists may also be determined. The configuration and the utilization factors may be used to determine a subset of queues associated with a subset of radiologists. The subset of queues may be prioritized based on certain requirements, such as how many medical imaging reports a particular radiologist is required to review, how many medical imaging reports are required to be allocated to a particular radiologist, and the like. The highest prioritized queue may be selected and the medical imaging order may be transmitted to the radiologist associated with that queue.

Abstract: An information processing method for determining a pattern that indicates an arrangement order of the plurality of tasks from upstream to downstream of a stream is performed by a computer. The method includes acquiring a plurality of patterns to be candidates of an arrangement order of the plurality of tasks from upstream to downstream of the stream in a case of executing the plurality of tasks using a stream processing format; specifying, for each pattern of the plurality of acquired patterns, an amount of data to be reintroduced from one task of the plurality of tasks to another task located upstream side of the stream with respect to the one task; and determining the pattern from among the plurality of patterns based on the specified amount of data to be reintroduced for the each pattern.

Abstract: Methods and apparatus for task processing in a distributed environment are disclosed and described. An example apparatus includes a task manager and a task dispatcher. The example task manager is to receive a task and create an execution context for the task, the execution context to associate the task with a routine for task execution. The example task dispatcher is to receive a report of task execution progress and provide an update regarding task execution progress, the task dispatcher, upon initiation of task execution, to facilitate blocking of interaction with a resource involved in the task execution. The example task dispatcher is to trigger an indication of task execution progress and, upon task finish, facilitate unblocking of the resource involved in the task execution.

Abstract: A system and method for launching parallel processes on a server configured to process a number of parallel processes. A request is received from a parallel application to start a number of parallel processes. In response to this request a launcher creates a surrogate. The surrogate inherits communications channels from the launcher. The surrogate then executes activities related to the launch of the parallel processes, and then launches the parallel processes. The parallel processes are launched and the surrogate is terminated.

Abstract: Concepts and technologies are disclosed herein for service creation and management. A processor can detect an event relating to a service, and access a service creation database to identify a recipe associated with the service. The recipe can define a resource to be used to provide the service. The processor can access an inventory to determine if the resource is available, identify a service control to control the service, instruct an infrastructure control to allocate virtual machines to host components of the service, and issue instructions to the service control. The instructions can instruct the service control to load service functions to the virtual machines.

Abstract: A system for container migration includes containers running instances of an application running on a cluster, an orchestrator with a controller, a memory, and a processor in communication with the memory. The processor executes to monitor a vitality metric of the application. The vitality metric indicates that the application is in either a live state or a dead state. Additionally, horizontal scaling for the application is disabled and the application is scaled-down until the vitality metric indicates that the application is in the dead state. Responsive to the vitality metric indicating that the application is in the dead state, the application is scaled-up until the vitality metric indicates that the application is in the live state. Also, responsive to the vitality metric indication transitioning from the dead state to the live state, the application is migrated to a different cluster while the horizontal scaling of the application is disabled.

Abstract: Provided are a computer program product, system, and method for estimating resource requests for workloads to offload to host systems in a computing environment. A calculation is made required resources of computational resources required to complete processing a plurality of unfinished workloads that have not completed. A determination is made of allocated resources that are not yet provisioned to workloads. The required resources are reduced by the allocated resources not yet provisioned to determine resources to provision. The resources to provision for the unfinished workloads are requested.