Abstract: Various embodiments for a thread management system are described herein. An embodiment operates by determining that one or more scheduler threads of a server are allocated from a shared memory. A request to spawn a native thread at the server is received. The request is intercepted and an override for the request in which the resources for spawning the native thread are requested from the shared memory is executed. An allocation of resources for spawning and executing the native thread is received from the shared memory. An error on the server is detected. The shared memory is dumped into a dump file responsive to determining the error. The dump file includes an indication of what threads were allocated from the shared memory. The one or more scheduler threads and the native thread are restarted after the dumping.

Abstract: Embodiments disclosed herein provide systems, methods, and computer readable media for container based application reification. In a particular embodiment, an application reification system is provided including one or more computer readable storage media and a processing system operatively coupled with the one or more computer readable storage media. The application reification system further includes program instructions stored on the one or more computer readable storage media that, when read and executed by the processing system, direct the processing system to preserve a version of application data at a first time and a configuration of an application at the first time. At a second time subsequent to the first time, the program instructions direct the processing system to create a template for a container containing the application in the configuration and a pointer to the version of the application data in a secondary storage repository.

Abstract: A method for deploying remote desktop gateways (RDGWs), a computer device, and a storage medium are provided. Application data of virtual machines (VMs) is obtained in RDGWs, the application data includes historical data and real-time data. A neural network is trained by using the historical data and a target classification model is obtained. The real-time data is inputted into the target classification model and a classification result of the real-time data is obtained. The VMs are deployed to a designated RDGW based on the classification result. The method allocates and deploys resources with greater efficiency.

Abstract: Systems and methods are provided that may be implemented to automatically discover intended and/or unintended changes as they occur in an IT environment, such as a network that includes multiple endpoint information handling systems. Intended changes may include, but are not limited to, changes in user and device or endpoint system level experience metrics that occur on one or more of the endpoint information handling systems within the IT environment after a planned action occurring in the IT environment. Unintended changes to similar metrics may occur when no activities are planned or initiated for the IT environment. These IT environment changes may be discovered automatically based on individual device level telemetry data and/or fleetwide aggregations derived of benchmarking various telemetry metrics.

Abstract: Methods and systems are presented for providing a container orchestration framework for facilitating development and deployment of software applications across different operating environments within an enterprise system. Upon receiving a service request for processing a set of data is received, the container orchestration framework determines one or more machines that store the set of data. Instead of processing the set of data remotely, the container orchestration framework deploys a container that encapsulates an application on the one or more machines. Each application instance running on the one or more machines are executed to process a corresponding subset of data stored on the machine locally. The container orchestration framework obtains the output data from executing the applications on each of the one or more machines, and present the output data as a response to the service request.

Abstract: Systems and methods for generating custom applications for querying a multidimensional database of a target platform include, responsive to receiving a custom application request, an application definition is discovered based on data received from one or more sources. The application definition indicates target outputs of the custom application, influencers for each of the target outputs that correspond to members of one or more first dimensions of the multidimensional database, and granularity definitions relative to second dimensions of the multidimensional database for each influencer. Mutually exclusive groups each including two or more target outputs are generated by applying a weighting algorithm to the application definition, and resource-efficient machine written code is dynamically generated based on the groupings and the results of the weighting algorithm.

Abstract: Automation methods of utilizing signposts assigned to automation tasks in order to correlate automation output with lines of automation source code are disclosed. Automation job(s) are identified/detected (manually or automatically), and then processed. Tasks in the job are identified and unique identifiers (e.g., signposts in and to the source code) are assigned for each task and inserted into the source code. The unique identifiers may include task numbers, code directory identifiers, nested file identifiers, and/or standalone file identifiers, or a hexadecimal alias may be used as the identifier. Job task indicia can be stored in memory with the associated unique identifiers. If a job failure is detected during execution, a log identifying the signpost at which the fault occurred can be generated. This facilitates debugging and troubleshooting, because lines of automation output are correlated with lines of automation code.

Abstract: Various examples are directed to systems and methods for performing operations in a reconfigurable compute fabric. A dispatch interface may send a first asynchronous message to a first flow controller of a first synchronous flow. The first asynchronous message may instruct the first flow controller to begin execution of a first-level loop. The first synchronous flow may send a second asynchronous message to a second flow controller of a second synchronous flow. The second asynchronous message may instruct the second flow controller to execute a second-level loop. The first flow controller may receive a third asynchronous message indicating that the second-level loop has completed and that a synchronous flow thread is free for executing a next iteration of the first-level loop.

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: 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: 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: 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.