Abstract: A system and method for creating and tracking software requirements associated with a product offering. An electronic template is employed in connection with the system and method. The electronic template is configured to be associated with a product type, where the product type is associated with a plurality of software requirements. The electronic template comprises a plurality of fields where the fields comprise software requirement type fields. Each software requirement type field is associated with a software requirement content field. The electronic template is configured to receive data in the software requirement type fields and the software requirement content fields. A database is employed and configured to store the data received in the software requirement type fields and the software requirement content fields in accordance with the configuration of the template.

Abstract: An illustrative “Live Synchronization” feature in a data storage management system can reduce the downtime that arises in failover situations. The illustrative Live Sync embodiment uses backup data to create and maintain a ready (or “warm”) virtualized computing platform comprising one or more virtual machines (“VMs”) that are configured and ready to be activated and take over data processing from another data processing platform operating in the production environment. The “warm” computing platform awaits activation as a failover solution for the production system(s) and can be co-located at the production data center, or configured at a remote or disaster recovery site, which in some embodiments is configured “in the cloud.” Both local and remote illustrative embodiments are discussed herein. An “incremental forever” approach can be combined with deduplication and synthetic full backups to speed up data transfer and update the disaster recovery sites.

Abstract: A system for a bot factory environment is disclosed. The system may receive a graphical process model. The system may compile a bot based on the graphical process model. The system may validate the bot to generate a validated bot. The system may register the validated bot to a registry table. The system may deploy the validated bot to a runtime environment.

Abstract: Automated techniques are disclosed for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node. For example, a technique comprises the following steps. Information is maintained about frequencies of compound requests received and individual requests comprising the compound requests. For a plurality of request types which frequently occur in a compound request, the plurality of request types is associated to a same node. As another example, a technique for minimizing communication between nodes, in a system comprising multiple nodes for executing a plurality of applications, comprises the steps of maintaining information about an amount of communication between said applications, and using said information to place said applications on said nodes to minimize communication among said nodes.

Abstract: Techniques are described for managing creation and/or implementation of compliance-based procedures and policies for computing environments executing software programs using computing resources. In at least some situations, the described techniques include performing one or more defined compliance tests on a target computing environment by employing user-defined and/or predefined compliance profiles to test one or more computing resources in the target computing environment. Profiles typically include one or more user-defined or predefined controls that each includes one or more compliance tests, which in turn utilize one or more user-defined or predefined testing-implementation modules to execute the tests. Profiles can introduce dependencies so that one profile can access and utilize the controls or testing-implementation modules in other profiles. A user can dynamically execute a profile, and/or profiles can be scheduled for execution (e.g.

Abstract: Techniques are described herein that are capable of pausing deployment of a pre-provisioned virtual machine. Deployment of a virtual machine on a computing system is initiated. The deployment of the virtual machine is paused, prior to execution of code that depends on a name of the virtual machine, to wait for receipt of user-specific setting(s) of the virtual machine. The deployment of the virtual machine is continued based at least in part on receipt of the user-specific setting(s). Continuing the deployment includes configuring the virtual machine to have at least one of the user-specific setting(s).

Abstract: An information handling system may include a processor subsystem and non-transitory computer-readable media communicatively coupled to the processor subsystem and storing instructions, the instructions configured to, when read and executed by the processor subsystem: execute a basic/input output service to create a link aggregation table with details based on wireless and wired network interface modules present within the information handling system; execute a first operating system service on a container instantiated on a hypervisor of the information handling system to instantiate virtual link aggregation tables for the container based on a network bandwidth policy of the container and link aggregation capabilities as set forth in the link aggregation table; and execute a second operating system service on the hypervisor to instantiate an operating system driver based on operating systems for network instances of link aggregation drivers and dynamic detection of network driver requirements determined by the

Abstract: A computing system includes a processing unit and a memory storing instructions that, when executed by the processor, cause the processor to receive program source code in a compiler, identify in the program source code a set of operations for vectorizing, where each operation in the set of operations specifies a set of one or more operands, in response to identifying the set of operations, vectorize the set of operations by, based on the number of operations in the set of operations and a total number of lanes in a first vector register, generating a mask indicating a first unmasked lane and a first masked lane in the first vector register, based on the mask, generating a set of one or more instructions for loading into the first unmasked lane a first operand of a first operation of the set of operations, and loading the first operand into the first masked lane.

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: Mapping input locations to enable execution of second executable code using trace data gathered during execution of first executable code. A trace of a prior execution of the first code, and the second code, are accessed. The trace stores data of an input that was consumed by first executable instructions of the first code. It is determined that the stored data of the input is usable as an input to second executable instructions of the second code. A difference in how the first instructions accessed the input during recording, as compared to how the second instructions expect to access input, is identified. Based on the identified difference, a location transformation is determined that would enable the second instructions to access the stored data. Execution of the second instructions is emulated using the stored data, including projecting the location transformation to enable the second instructions to access the stored data.

Abstract: A system receives one or more software artifacts for enabling a software version change requested for a production environment associated with at least one data center location. The system stores the one or more software artifacts in a memory location of a controlled-access production repository. The system receives a first authorization determination of the one or more software artifacts from an author-user account, the author-user account associated with a developer identity that created the one or more software artifacts. The system receives a second authorization determination of the one or more software artifacts from an additional-user account. Based on the first and second authorization determinations, the system determines whether to package the one or more software artifacts into a manifest for transmission to the at least one data center location.

Abstract: A method for processing data on a programmable logic controller includes a priority with a predetermined priority level assigned to at least one parallel processing section of a program of a master-processor core of a control task. Respective priority levels are inserted into a data structure as the respective master-processor core arrives at the parallel processing section. A parallel-processor core examines whether entries are present in the data structure and processes partial tasks from a work package of the master-processor core the priority level of which ranks first among the entries. A real-time condition of the control task is met by setting executing times of the programs for the master-processor core so that the master-processor core is capable of processing the partial tasks from the work packages without being supported by the parallel-processor core. The master-processor core further processes partial tasks not processed by the at least one parallel-processor core.

Abstract: The present invention relates to a method and apparatus for generating difference between old and new versions of data (software data) for updating software, and in more detail, when updating software programs and their related data in client devices like autonomous vehicles and smartphones, an update management server generates the difference by comparing old and new versions of the software data, and provides the generated difference to client devices, thereby provided is a method and apparatus for making software update simple and fast.

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: Embodiments include systems and methods that facilitate implementation of software component ecosystems using a distributed ledger, e.g., as implemented in part as a distributed blockchain, that is maintained by ecosystem full nodes, called catalog instances. Various registration transactions, e.g., developer registrations, namespace registrations, usage registrations, and so on, may be added to the distributed blockchain by one or more catalog instances. Adding blocks to the blockchain may including using a tree hash of tending transactions to generate a block hash for the new block. The new block also includes or incorporates a hash of an immediately prior block.

Abstract: A packet is received by a first virtual machine supported by a host system from a second virtual machine via a shared memory device that is accessible to a plurality of virtual machines supported by the host system. The first virtual machine determines that the second virtual machine is supported by the host system in view of receiving the packet via the shared memory device. Identification information associated with the second virtual machine is stored in a virtual bond data structure, wherein the identification information associated with the second virtual machine being present in the virtual bond data structure causes the first virtual machine to transmit a subsequent packet to the second virtual machine via the shared memory device.

Abstract: A system and method include migrating, by a migration controller, a first entity of a first subset of entities from a source site to a target site in a virtual computing system based on an asynchronous mode of replication. The system and method also include replicating, by the migration controller, data of a second entity of a second subset of entities from the source site to the target site based on a synchronous mode of replication in parallel with the migration of the first entity for dynamically adjusting a recovery time objective parameter.

Abstract: The present disclosure discloses a data processing method and related products, in which the data processing method includes: generating, by a general-purpose processor, a binary instruction according to device information of an AI processor, and generating an AI learning task according to the binary instruction; transmitting, by the general-purpose processor, the AI learning task to the cloud AI processor for running; receiving, by the general-purpose processor, a running result corresponding to the AI learning task; and determining, by the general-purpose processor, an offline running file according to the running result, where the offline running file is generated according to the device information of the AI processor and the binary instruction when the running result satisfies a preset requirement. By implementing the present disclosure, the debugging between the AI algorithm model and the AI processor can be achieved in advance.

Abstract: Systems and methods are disclosures for scheduling code in a multiprocessor system. Code is portioned into code blocks by a compiler. The compiler schedules execution of code blocks in nodes. The nodes are connected in a directed acyclical graph with a top node, terminal node and a plurality of intermediate nodes. Execution of the top node is initiated by the compiler. After executing at least one instance of the top node, an instruction in the code block indicates to the scheduler to initiate at least one intermediary node. The scheduler schedules a thread for execution of the intermediary node. The data for the nodes resides in a plurality of data buffers; the index to the data buffer is stored in a command buffer.

Abstract: The disclosure provides an approach for high-availability admission control. Embodiments include determining a number of slots present on the cluster of hosts. Embodiments include receiving an indication of a number of host failures to tolerate. Embodiments include determining a number of slots that are assigned to existing computing instances on the cluster of hosts. Embodiments include determining an available cluster capacity based on the number of slots present on the cluster of hosts, the number of host failures to tolerate, and the number of slots that are assigned to existing computing instances on the cluster of hosts. Embodiments include determining whether to admit a given computing instance to the cluster of hosts based on the available cluster capacity.