Abstract: Techniques for providing a fencing scheme for cluster systems without inherent hardware fencing. Storage nodes in an HA cluster communicate with one another over communication paths implemented through a variety of mechanisms, including drives and network connections. Each storage node in the HA cluster executes a fencing enforcer component operable to enforce actions or processes for initiating fencing of itself and/or initiating self-fencing of another storage node in the HA cluster determined to be malfunctioning. By providing for richer communications between storage nodes in an HA cluster and a richer set of actions or processes for fencing a malfunctioning storage node including self-fencing, the malfunctioning storage node can be made to exit the HA cluster in a more controlled fashion. In addition, a remaining storage node in the HA cluster can more safely take on the role of primary storage node with reduced risk of data corruption on shared resources.

Abstract: Provided are techniques for enhancing applications based on effectiveness scores. Application functionalities of applications in an application landscape are identified. Application logs for the applications are analyzed to identify how the application functionalities are executing. Groups of application functionalities are formed, where each of the groups includes different application functionalities that perform a similar function. For a group of the groups, an effectiveness score is assigned to each of the different application functionalities in that group. For each application functionality, a corresponding recommendation is identified on how that application functionality is to be modified based on the effectiveness score for that application functionality compared to the effectiveness score of each of the other application functionalities in the group. Each application functionality to be modified is automatically updated based on the corresponding recommendation.

Abstract: An automated system for detecting performance bugs in a program and for providing code recommendations to improve the performance of the program generates a code recommendation table from performance-related pull requests. The performance-related pull requests are identified in part from a classifier trained on semi-supervised data. A code recommendation table is generated from performance-related pull requests and is searched for similarly-improved code based on a set of difference features that includes structural and performance features of the before-code of a pull request that is not in the after-code.

Abstract: A computer-implemented method includes: receiving, by a computing device and from a user device, a request to validate an application program interface (API); validating, by the computing device, the API by performing a fetch analysis using different user profiles; returning, by the computing device and to the user device, a result of the fetch analysis; validating, by the computing device, the API by performing an insert/update analysis using the different user profiles; and returning, by the computing device and to the user device, a result of the insert/update analysis.

Abstract: Analyzing or debugging applications is provided. The system identifies an action for an application provided by a developer. The system determines a first classification score based on historical execution of the action. The system generates a machine generated action for the application based on metadata associated with the application. The system determines a second classification score based on a comparison of the action with the machine generated action. The system selects, via a matching program, a second application that matches the application. The system determines a third classification score based on a comparison of an action approved for the second application with the action provided by the application developer. The system updates a delivery control parameter based on the first classification score, the second classification score and the third classification score. The system controls delivery of the application based on the delivery control parameter.

Abstract: A request to launch a compute instance is received at a control plane of a provider network. At an outbound command communicator, an indication that a compute instance is to be established at a target host at a client premise is obtained. A first address is associated with the target host at the control plane and also assigned to the communicator. A message with a second address within a first network of the client premise as a destination is transmitted. The message comprises a command to establish the compute instance at the target host. The first address is assigned to the target host within a second network of the client premise. Processing of the command at the target host results in establishment of a compute instance.

Abstract: A computer implemented method determines a placement of an application being added to a network. The method includes determining a logical-physical mapping for the application. Sub-graphs in the logical-physical mapping are identified. A stored application in a catalog of applications previously used in the network is located. The stored application includes one of the sub-graphs in the logical-physical mapping. An experiment is generated, performed by a computing device running a neural network model, using the sub-graphs. The experiment includes inducing a physical node mapping for the sub-graph. A cost function associated with a placement of the application being added to the network to one or more physical nodes in the induced physical node mapping is determined.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for optimizing thread assignment to schedulers, avoid starvation of individual data partitions, and maximize parallelism in the presence of hierarchical data partitioning are disclosed, which include: partitioning, by a network storage server, a scheduler servicing a data partitioned system into a plurality of autonomous schedulers; determining what fraction of thread resources in the data partitioned system at least one of the plurality of autonomous schedulers is to receive; and determining, with minimal synchronization, when it is time to allow the at least one of the plurality of autonomous schedulers servicing a coarse hierarchy to run.

Abstract: A method for automatically modeling a codebase to facilitate management and analytics is provided. The method includes automatically aggregating a data set, the data set including data that correspond to a codebase; identifying, from the data set, entities and corresponding attributes, the entities relating to a component of the codebase; establishing, by using the data set, a relationship for the entities, the relationship corresponding to an interaction between each of the entities; determining a potential owner for each of the entities based on a corresponding change history; defining, by using the data set, an ownership rule for each of the entities, the ownership rule associating the potential owner to the corresponding entities; and computing an actionable item for each of the entities based on the corresponding attributes.

Abstract: A method and an apparatus for scheduling a virtual machine are disclosed in. The method includes predicting resource data required by a virtual machine in a next time period to obtain a prediction result; obtaining used resource data and available resource data of candidate host machines; adding the prediction result to used resource data of each candidate host machine to obtain a superimposition result of each candidate host machine; and separately comparing the superimposition result of each candidate host machine with available resource data of each host machine, and selecting a target host machine corresponding to the virtual machine from the candidate host machines. The present disclosure solves the technical problem of a large waste of resources caused by the needs of a host machine to reserve resources for respective peaks of each virtual machine in the existing technologies.

Abstract: A patch controller, when removal of a to-be-deleted node on a virtual path is detected, extracts a node immediately before deletion located adjacently to and on an upstream side of the to-be-deleted node on the virtual path and a node immediately after deletion located adjacently to and on a downstream side of the to-be-deleted node, forms a bypass path for discharging a queued packet being processed by the to-be-deleted node to the node immediately after deletion, and a changed path excluding the to-be-deleted node from the virtual path, by making a connection so as to cause a transfer packet from the node immediately before deletion to flow to the node immediately after deletion, and prioritizes processing of discharging the queued packet to the node immediately after deletion on the bypass path over processing of transferring the transfer packet to the node immediately after deletion on the changed path.

Abstract: In one embodiment, a method includes empirically analyzing, by a computer cluster comprising a plurality of computers, a set of active reservations and a current set of consumable resources belonging to a class of consumable resources. Each active reservation is of a managed task type and comprises a group of one or more tasks task requiring access to a consumable resource of the class. The method further includes, based on the empirically analyzing, clocking the set of active reservations each clocking cycle. The method also includes, responsive to the clocking, sorting, by the computer cluster, a priority queue of the set of active reservations.

Abstract: Systems and methods described herein may relate to a system that includes one or more industrial devices that perform one or more operations within an industrial automation system. One or more industrial devices may include a compute surface able to perform one or more software tasks. The system may include a processor that determines a trigger event has occurred. The processor may determine additional data and a target device based on the trigger event, where the processor may be located on a different hierarchical level as compared to the target device. The processor may determine a container to be deployed to the target device based on the container generating the additional data when deployed on the target device. The processor may deploy the container to the target device.

Abstract: Systems, methods, and storage media for optimizing automated modelling of resource allocation are disclosed. Exemplary implementations include operations for: receive or retrieve by a computer system, operational information associated with a plurality of users; allocate, by the computer system, at least a first time portion to at least a first task associated with a first user of the plurality of users based on analysis of the operational information; and dynamically modify, by the computer system, the first time portion responsive to receiving or retrieving additional operational information over time.

Abstract: In non-limiting examples of the present disclosure, systems, methods and devices for selectively virtualizing software application functions are presented. An application package for a containerized software application may be received. The application package may comprise an application manifest and a virtualization exclusion for a first location of a global file system of the computing device. The containerized software application may be installed in a container comprising a virtual file system. An indication to write a first new file at the first location may be received by the containerized software application. A determination may be made that the first location comprises the virtualization exclusion. The first new file may be written to the first location of the global file system based on the determination that the first location comprises the virtualization exclusion.

Abstract: A method of using a dongle connects the dongle to a USB port of a building equipment system. Once connected, remote communication with the building equipment system may be achieved via the dongle, and firmware may be downloaded to a processor of the building equipment from the dongle.

Abstract: Systems and methods are disclosed for migrating a virtual machine (VM) having a virtual function that maps resources of an artificial intelligence (AI) accelerator to the VM. A driver for the AI accelerator can generate a checkpoint of VM processes that make calls to the AI accelerator, and can the checkpoint can include a list and configuration of resources mapped to the AI accelerator by the virtual function. The driver can also access the code, data, and memory of the AI accelerator to generate a checkpoint of the AI accelerator status. When the VM is migrated to a new host, then either, or both, of these checkpoint frames can be used to ensure that resuming the VM on a new host having appropriate AI accelerator resources, can be successful resumed on the new host. One or both checkpoint frames can be captured based upon an event, in anticipation of the need to migrate the VM.

Abstract: A virtual mobile computing device with enhanced availability, flexibility, statefulness, and persistence features that allows the virtual mobile computing device be used to facilitate communications and transactions even where the owner or the owner's physical mobile device are intermittently unavailable. The virtual mobile computing device is a containerized or virtual machine implementation of a mobile computing device tethered to a physical mobile device which allows for interactions to occur regardless of the network availability of the mobile device. In some embodiments, copies of, or links to functionality of, the virtual mobile computing device may be created to implement certain functionality, and may be passed from one entity in a transaction to another such entity. Depending on configuration, the virtual mobile computing device may reside on a server, or as hardware or firmware on the physical mobile computing device.

Abstract: Disclosed are compiling methods and apparatuses, where a compiling method includes receiving a single-core-based code and input data for an operation to be performed based on the single-core-based code, generating kernel clusters by performing graph clustering based on one or more operation kernels in the single-core-based code and the input data, and generating a multi-core-based code based on the kernel clusters.

Abstract: The access method includes: implementing a resident virtual CPU to which a physical CPU is always assigned and a non-resident virtual CPU to which a physical CPU is not always assigned, on the virtual machine in the virtual environment; and taking over the process of accessing the virtual device by the non-resident virtual CPU when accessing from the resident virtual CPU to the virtual device corresponding to the occupancy type physical device.