Abstract: Methods that can batch process data on a remote system or disaster recovery (DR) site are disclosed herein. One method includes determining, by a processor, a first performance level for a production site based on a set of first resources for the production site and determining a second performance level for a DR site based on a set of second resources for the DR site. The method further includes allocating a portion of a workload scheduled for processing on the production site to the DR site for processing on the DR site in response to determining that a set of predetermined parameters related to the first performance level, the second performance level, or both the first performance level and the second performance level is satisfied. Apparatus, systems, and computer program products that can include, perform, and/or implement the methods are also disclosed herein.

Abstract: Embodiments described herein are generally directed to a controller of a managed container service that facilitates autoscaling based on bare metal machines available within a private cloud. According to an example, a CaaS controller of a managed container service monitors a metric of a cluster deployed on behalf of a customer within a container orchestration system. Responsive to a scaling event being identified for the cluster based on the monitoring and an autoscaling policy associated with the cluster, a BMaaS provider associated with the private cloud may be caused to create an inventory of bare-metal machines available within the private cloud. Finally, a bare metal machine is identified to be added to the cluster by selecting among the bare-metal machines based on the autoscaling policy, the inventory and a best fit algorithm configured in accordance with a policy established by or on behalf of the customer.

Abstract: A control device includes a processor that executes a plurality of tasks including a control task and a non-control task that performs related processing related to real-time control, a multitask execution part that causes the processor to execute the tasks in a sequence based on priorities of the respective tasks, and a scheduler. The control task is set to have a highest priority. The scheduler sets the priority of the non-control task to a first priority when an execution start condition of the non-control task has been satisfied, keep the priority of the non-control task at the first priority while the period of time from the execution start is less than or equal to a first time period for executing the related processing in real time, and thereafter reduces the priority to a second priority when the period of time has exceeded the first time period.

Abstract: Techniques and solutions are described for implementing virtual domains. Computing resources in a computing environment are determined and assigned to one or more virtual domains. One or more data structures can be located in a given virtual domain. The computing resources assigned to a virtual domain can be dynamically reconfigured without affecting processes that submit tasks to be performed on data structures in the virtual domains. Tasks can be submitted to a dispatcher, which can determine the appropriate virtual domain for the task and forward the task to the determined virtual domain. Tasks are received by virtual domains and assigned to worker threads, which can access a data structure specified for a given task.

Abstract: The techniques described herein may provide techniques to detect, categorize, and diagnose synchronization issues that provide improved performance and issue resolution. For example, in an embodiment, a method may comprise detecting occurrence of synchronization performance problems in software code, when at least some detected synchronization performance problems occur when a contention rate for software locks is low, determining a cause of the synchronization performance problems, and modifying the software code to remedy the cause of the synchronization performance problems so as to improve synchronization performance of the software code.

Abstract: An approach is provided for allocating a shared resource to threads in a multi-threaded microprocessor based upon the usefulness of the shared resource to each of the threads. The usefulness of a shared resource to a thread is determined based upon the number of entries in the shared resource that are allocated to the thread and the number of active entries that the thread has in the shared resource. Threads that are allocated a large number of entries in the shared resource and have a small number of active entries in the shared resource, indicative of a low level of parallelism, can operate efficiently with fewer entries in the shared resource, and have their allocation limit in the shared resource reduced.

Abstract: Described herein are systems, methods, and software to enhance the management of virtual nodes in a computing environment. In one example, a system is configured to mount storage repositories to a host. Once mounted the system may identify a request to initiate a virtual cluster on the host and may identify permissions associated with the virtual cluster. The system further determines at least one storage repository from the storage repositories for the virtual cluster based on the permissions and initiate execution of the virtual cluster with access to at least one file system corresponding to the at least one storage repository.

Abstract: Provided is a method for preventing deadlocks between competing threads. The method includes receiving a lock request from a first thread and, in response, identifying a potential deadlock with a second thread. In response, the method includes determining whether to deny the lock request, which includes: determining whether a first duration for which the first thread will hold the lock to complete its job is longer than a second duration for which the second thread will hold the lock to complete its job; determining whether the second thread will start to use the lock soon relative to the first duration; and determining whether both the first and second threads will complete their respective jobs within a time limit if the lock is denied to the first thread while the second thread completes its job. The method further includes denying the request for the requested lock from the first thread.

Abstract: The present disclosure provides for a system with an adaptive thread pool for processing messages. The system includes a processor and a memory storing instructions. The processor allocates a first quantity of threads in a thread pool to process a set of messages in parallel. The processor then measures one or more performance metrics of the system while processing the messages with the first quantity of threads. The processor then determines whether each of the one or more performance metrics meets a respective predetermined threshold. The processor then increases the allocation of the first quantity of threads to a second quantity of threads in the thread pool if each of the one or more performance metrics meets the respective predetermined threshold. The processor may also decrease the quantity of threads if at least one performance metric does not meet its predetermined threshold.

Abstract: The disclosure generally describes methods, software, and systems for handling integration flows. A set of flows is initially deployed to a single worker set. A load balancing issue is identified that is associated with initial runtime interactions by workers with the single worker set. In response to identifying the load balancing issue, the load balancing issue is analyzed to determine whether to autoscale or generate a new worker set. Load balancing is performed to initiate at least one new worker set. At least one flow to be moved to the at least one new worker set is identified. Movement of the identified at least one flow from a current worker set to a new worker set is performed.

Abstract: Methods and apparatus to customize deployment using metaproperties are disclosed. An example deployment metaproperty manager can generate a first metaproperty payload including an application component metaproperty of an application component that provides a logical template of an application. A deployment event broker can reply-back to the deployment metaproperty manager with a second metaproperty payload that includes a processed application component metaproperty.

Abstract: Threads of a process require a shared resource to perform their work. The threads have a shared object, which might include a lock and an expiration time. When the resource has not been acquired and any one of the threads attempts to access the shared resource, that thread locks the lock, acquires the shared resource, sets the expiration time, releases the lock, and then uses the shared resource to perform its work. When any one of the threads requires the resource and the resource has been acquired but the expiration time is within a time threshold, only that thread refreshes the resource, resets the expiration time, and uses the resource to perform its work. When any of the threads require the resource and the resource is available and not expired, the thread uses the shared resource.

Abstract: Disclosed are systems and methods for executing system calls in a virtualized environment. A method includes executing, on a host, a host process corresponding to a guest process executing within a virtual machine and having an associated guest-process virtual address space, the host process having an associated host-process virtual address space. The method also includes mapping the host-process virtual address space and the guest-process virtual address space to a host physical memory, trapping a system call invoked by the guest process, and performing the trapped system call using the host process, wherein state changes in the host-process virtual address space caused by the trapped system call are reflected in the guest-process virtual address space. The method further includes causing execution of the guest process to be resumed after performing the trapped system call.

Abstract: Methods and systems for memory resource allocation are disclosed. In an embodiment, a method for memory resource allocation involves reading a pool-specific configuration record from an array of memory mapped pool-specific configuration records according to a memory resource allocation request that is held in an address register of a memory mapped register interface, performing a memory resource allocation operation to service the memory resource allocation request, wherein performing the memory resource allocation operation involves interacting with a resource list according to a pointer in the pool-specific configuration record, advancing the pointer after the interaction, and updating the pointer in the pool-specific configuration record with the advanced pointer.

Abstract: Systems and methods for managing peripheral devices associated with host computer systems running virtual machines. An example method comprises: detecting, by a host computer system, a plug-in event associated with a peripheral device; identifying a type of a file system of the peripheral device; selecting, among a group of execution environments comprising the host computer system and one or more virtual machines, an execution environment having a highest compatibility metric value associated with the type of the file system; and responsive to determining that the execution environment is provided by a virtual machine, causing a guest agent running on the virtual machine to mount the peripheral device to the virtual machine.

Abstract: A method for constructing off-line a sequencing plan for a plurality of tasks executed on a real-time system, including decomposing each task into a sequence of frames, where each frame is associated with an elementary process having an execution need, and defines a start date from which the process can start and an end date, or deadline, at which the process must complete; associating respective order constraints with pairs of processes; projecting the dates on a time scale associated with an execution unit of the real-time system, thus forming a sequence of time slots; sequentially parsing the time slots of the sequence; identifying eligible processes in a current time slot, a process being eligible if it meets the following two criteria: i) it is executable in the current time slot, and ii) if it has an order constraint.

Abstract: A network device includes computing resources for utilization by processes hosted by the network device and a computing resources manager. The computing resources manager automatically instantiate a new instance of a first process of the processes upon termination of the first process; makes a determination that the network device has entered an out of computing resources state; and in response to the determination: performs an action set to increase a quantity of the computing resources that are available for allocation to the processes.

Abstract: A function processing service may receive a request to execute source code. The source code may include instructions to perform a function. The function processing service may determine whether at least one hardware acceleration condition has been satisfied for the function. If at least one hardware acceleration condition has been satisfied, the instructions in the source code may be translated into hardware-specific code corresponding to a hardware circuit. The hardware circuit may be configured based on the hardware-specific code, and the hardware circuit may perform the function. The function processing service may then provide the result obtained from the hardware circuit to the requesting entity.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed that enable out-of-order pipelined execution of static mapping of a workload to one or more computational building blocks of an accelerator. An example apparatus includes an interface to load a first number of credits into memory; a comparator to compare the first number of credits to a threshold number of credits associated with memory availability in a buffer; and a dispatcher to, when the first number of credits meets the threshold number of credits, select a workload node of the workload to be executed at a first one of the one or more computational building blocks.

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.