Abstract: Code pattern matching is performed within computer code to determine whether the computer code includes an idiom from a predefined set of idioms. Based on determining that the computer code includes the idiom, a set of data items of the idiom to be analyzed is determined. The set of data items is analyzed with respect to one or more corresponding values from the computer code based on a set of constraints defined for the idiom to determine whether the set of data items satisfy one or more predefined conditions for the idiom. Based on the analyzing indicating that the one or more predefined conditions are satisfied, one or more code segments of the computer code including the idiom are replaced with replacement code to provide revised computer code.

Abstract: Various embodiments of the invention may receive information related to a plurality of application upgrades from an application monitoring agent. Based on the received information, a device emulation will be requested, and an emulation will be performed in response to generate an application upgrade strategy that includes such things as emulated (e.g., predicted) upgrade times. The application upgrade strategy is used to produce a more refined upgrade strategy. The various embodiments refine the upgrade strategy by specifically consider the power consumption and cost for the power that is consumed.

Abstract: The present disclosure is directed to systems and methods for container security using a hopping mechanism. Methods include the steps of selecting a first virtual container associated with one or more software processes; replicating the first virtual container to create a plurality of replicated virtual containers, each of the plurality of replicated virtual containers a duplicate of the first virtual container, and the plurality of replicated virtual containers configured to run synchronously; generating a randomized hopping set that defines a set of replicated virtual containers from the plurality of replicated virtual containers, the randomized hopping set establishing a sequence of the set of replicated virtual containers in which to run the one or more software processes; and running the one or more software processes across the set of replicated virtual containers based on the sequence of the randomized hopping set.

Abstract: A system, method, and computer program product for implementing dynamic virtual network access is provided. The method includes monitoring hardware devices associated with network locations comprising data and software code. In response, updates applied to the data and software code are detected and a context of the updates is determined. Based on the context, it is determined that that the updates applied to the data and software code should be cloned and associated user access is verified. A target component location associated with the updates applied to the data and software code to be cloned is determined and the updates applied to the data and software code with respect to the target component location are cloned. A notification indicating the cloning is transmitted to users.

Abstract: Methods and systems for managing a queue are disclosed. In one aspect, an example method can comprise accessing at least a portion of a queue comprising a plurality of tasks. Each task of the plurality of tasks can be associated with a property, and the property associated with each task can comprise a respective value. An exclusion value can be determined based on a distribution of the respective values. A group of tasks that comprises respective values of the property that do not match the exclusion value can be selected from the queue, and the selected group of tasks can be processed.

Abstract: A first plurality of programming instructions written in a first quantum programming language is accessed. A first quantum computing system is selected from a plurality of quantum computing systems based on an attribute of the first quantum computing system. A second plurality of programming instructions is generated based on the first plurality of programming instructions and a characteristic of the first quantum computing system, at least one programming instruction in the second plurality of programming instructions being a translation of a corresponding programming instruction in the first plurality of programming instructions.

Abstract: The compression and decompression of files can be selectively offloaded to a hardware controller. A hardware controller, such as the controller of an SSD or other drive, can include a compression engine that is configured to implement compression techniques. A filter driver in the I/O pathway on a computing device may be configured to intercept an application's attempt to write a file to or read a file from the SSD or other drive and to selectively offload compression or decompression of the file to a compression engine on the SSD or other drive.

Abstract: Techniques promote monitoring of hypervisor systems by presenting dynamic representations of hypervisor architectures that include performance indicators. A reviewer can interact with the representation to progressively view select lower-level performance indicators. Higher level performance indicators can be determined based on lower level state assessments. A reviewer can also view historical performance metrics and indicators, which can aid in understanding which configuration changes or system usages may have led to sub-optimal performance.

Abstract: A processing system includes physical function circuitry to execute virtual functions and a processing unit configured to operate in a first mode that allows more than one virtual function to execute on the physical function circuitry and a second mode that constrains the physical function circuitry to executing a single virtual function. A first virtual function modifies a state of the processing unit in response to the processing unit being in the second mode. A host driver executing on the processing unit modifies an operating mode indicator to indicate that the processing unit is operating in the first mode or to indicate that the processing unit is operating in the second mode. Microcode executing on the processing unit accesses the operating mode indicator to determine whether the processing unit is operating in the first mode or the second mode.

Abstract: A method for testing a user interface (UI) includes obtaining a first state of the UI and setting a current position to specified location coordinates. The method includes determining whether the first state satisfies criteria for a goal and, if so, updating a collection of completed tests with a test distance and test data. The method includes, in response to the first state not satisfying the criteria: determining a set of potential user actions to be performed in the first state based on interactive elements of the UI; selecting and executing an action; and updating the test distance based on the current position and location coordinates of the element associated with the action. The method includes determining a shortest path to the goal in the UI based on the collection of completed tests. The method includes, based on the determined shortest path, automatically visually transforming a state of the UI.

Abstract: A quantum computing service includes a quantum circuit compilation module that uses received information about quantum processing units (QPUs) along with information about a quantum circuit to be compiled in order to generate an optimized ordered list of compilation passes to be performed to compile the quantum circuit for execution on a given QPU.

Abstract: A computing network includes nodes of different work groups. Nodes of a work group are dedicated to transactions of the work group. If a node of a first work group is predicted to have an idleness window, a second work group may borrow the node to execute a transaction of the second work group. At least a subset of steps of the transaction may be categorized into a step group. Trees of a transaction may be categorized into one or more tree groups. A node is selected for executing a transaction, if the predicted idleness duration of the node is sufficient relative to the predicted runtime of the transaction, the step group, and/or tree group. A credit system is maintained. A first work group transfers a credit to a second work group when borrowing a node of the second work group for executing a transaction of the first work group.

Abstract: Minimizing an energy use of virtual machines at one or more information handling systems, including receiving a plurality of computing tasks, each task associated with an energy efficiency indicator; positioning each of the tasks within a task queue indicating an order of execution of the tasks based on the energy efficiency indicator for each task; identifying a plurality of virtual machines, each virtual machine associated with a thermal efficiency indicator based on a historical energy usage of the virtual machine; sorting the virtual machines to identify a distribution of the virtual machines based on the thermal efficiency indicator of the respective virtual machines; allocating the virtual machines to execute the tasks based on i) the distribution of the virtual machines and ii) the task queue; and executing the tasks by the virtual machines based on the allocation.

Abstract: An automated, dynamic system and method of testing infrastructure-as-code (IaC). The system is configured to validate infrastructure provisioned in multi-cloud environments and is able to accommodate any cloud provider. Implementation of such as system can eliminate manual errors, as well as enable early detection of errors (i.e., before production deployment), thus empowering early ‘go live’. Furthermore, the proposed embodiments are configured to integrate with already existing devOps pipelines for rapid test execution and can run as many times as needed with minimal configuration, allowing for creation and execution of complex scenarios to test low-level validation upon cloud infrastructure setup.

Abstract: A compiler-implemented technique for performing a storage allocation is described. Computer code to be converted into machine instructions for execution on an integrated circuit device is received. The integrated circuit device includes a memory having a set of memory locations. Based on the computer code, a set of values that are to be stored on the integrated circuit device are determined. An interference graph that includes the set of values and a set of interferences is constructed. While traversing the interference graph, a set of memory location assignments are generated by assigning the set of values to the set of memory locations in accordance with one or more color selection schemes.

Abstract: A concurrency-restricting lock may divide a set of threads waiting to acquire the lock into an active circulating set (ACS) that contends for the lock, and a passive set (PS) that awaits an opportunity to contend for the lock. The lock, which may include multiple constituent lock types, lists, or queues, may be unfair over the short term, but improve throughput of the underlying multithreaded application. Culling and long-term fairness policies may be applied to the lock to move excess threads from the ACS to the PS or promote threads from the PS to the ACS. These policies may constraint the size or distribution of threads in the ACS (which may be NUMA-aware). A waiting policy may avoid aggressive promotion from the PS to the ACS, and a short-term fairness policy may move a thread from the tail of a list or queue to its head.

Abstract: A computer-implemented method, in accordance with one aspect of the present invention, includes collecting data existing in a development system that relates to the code change request, in response to receiving a code change request to merge new code with existing code. Factors from the collected data are computed for assessing a risk of promoting the new code, the factors including at least: a developer information factor, a developer availability factor, and an environment health analysis factor. The factors are processed to compute a confidence score for the code change request. If the confidence score is in a first predefined range, the new code corresponding to the code change request is promoted for merging with the existing code, without human intervention. If the confidence score is in a second predefined range, an indication that human intervention is needed before promoting the code is output.

Abstract: A virtual machine controller service of a service provider network may provide a virtual machine controller environment where applications associated with machine controllers (e.g., programmable logic controllers (PLCs), programmable automation controllers (PACs), etc.) can execute and data can be provided as input to the executing applications. An example process may include receiving a request to create a virtual controller instance, and creating the virtual controller instance in a service provider network based at least in part on the request. The example process may further include executing, on the virtual controller instance, an application that is associated with a machine controller that is operable within a facility, and sending data as input to the application to elicit a response from the application. This example process can be used for training personnel and/or for validating machine controller applications prior to their deployment on a physical machine controller in a facility.

Abstract: A new approach is proposed to support correlating high-level code with low-level instructions of an application running on a hardware. A compiler that compiles a high-level function in the high-level code of the application into a set of low-level instructions to be executed on the hardware is configured to utilize one or more reserved fields of the set of low-level instructions to incorporate one or more IDs and an actionable item. The IDs are mapped to the high-level function, wherein such mapping is programmable by the compiler. Based on the mapped IDs and the actionable item incorporated in the set of the low-level instructions, the runtime performance of the application on the hardware can be monitored and profiled and issues related to the high-level code of the application can be identified for debugging purposes.

Abstract: A processing system allows external systems to customize and extend services without increasing system intricacy. The processing platform maintains cloud containers that support virtual machines for external systems. An external system provides code for execution on a virtual machine that is supported by a cloud container. Cloud containers provide a boundary for executing code such that the processing platform may limit types of code an external system can run at a cloud container. The external system code can provide new services or may build upon existing public services, and external systems may designate their services as being available to other external systems by publishing the access information in a global application programming interface (API) maintained by the processing platform. Since the external systems submit instructions for execution within their assigned cloud containers, the services and applications are developed without affecting the underlying functionality of the processing platform.