Abstract: The present invention relates to a method for distributing software upgrade in a communication network (30). The communication network comprises a plurality of nodes (N1-N5) and each node is configured to execute a node specific version of software and is configured to communicate with one or more neighbouring nodes.

Abstract: A task management method is disclosed. The method includes sending a query command by a host to an electronic storage device at a variable interval to determine a status of a task queue of the electronic storage device; obtaining a response information. The response information includes a status of the task queue, and the status of the task queue includes an information about whether a task preparation in the task queue is to be completed.

Abstract: Systems and methods for converting FLASH content to HTML content is described herein. A transcoder module can receive a FLASH-based content item including instructions to cause a computing device to generate or access a display list comprising display objects. The transcoder module can traverse the display list to identify a class type for each display object. The transcoder module can generate a set of HTML-based instructions based on the class type for each display object. The transcoder module can insert the generated set of HTML-based instructions into an instruction list. The transcoder module can store the instruction list in a data structure. An policy generator module can generate an execution policy. The execution policy can specify an application of a client device to execute the sets of HTML-based instructions in the instructions list based on a trigger condition.

Abstract: A profile guided optimization compiler utilizes sample profile data including a control flow representation of a program having block counts associated with each basic block of the program, and edge counts associated with each control flow edge estimated from the block counts. The sample profile data utilizes correlation data to map the address of a sampled instruction from a fully optimized binary directly into a corresponding basic block of source code control flow of the program using a relative virtual address (RVA) that is associated with each source code basic block and the sampled instruction. The correlation data is able to differentiate multiple blocks on the same source code line and handle inlining and optimizations with greater precision and efficiency. The block counts are then used to guide the optimization of the program.

Abstract: In various embodiments, before a data subject request can be processed, the data subject's identity may need to be verified. In various embodiments, the system provides a mechanism to automatically detect the type of authentication required for a particular data subject based on the type of Data Subject Access Request being made and automatically issues a request to the data subject to verify their identity against that form of identification. For example, a subject rights request might only require two types of authentication, but a deletion request may require four types of data to verify authentication. The system may automatically detect which is type of authentication is required based on the DSAR and send an appropriate request to the data subject to verify their identity.

Abstract: Virtual redundancy for active-standby cloud applications is disclosed herein. A virtual machine (“VM”) placement scheduling system is disclosed herein. The system can compute, for each standby VM of a plurality of available standby VMs, a minimum required placement overlap delta to meet an entitlement assurance rate (“EAR”) threshold. The system can compute a minimum number of available VM slots for activating each standby VM to meet the EAR threshold. For each standby VM of a given application, the system can filter out any server of a plurality of servers that does not meet criteria. If a given server meets the criteria, the system can add the given server to a candidate list; sort, in descending order, the candidate list by the minimum required placement overlap delta and the number of available virtual machine slots; and select, from the candidate list of servers, a candidate server from atop the candidate list.

Abstract: The present disclosure relates to computer-implemented methods, software, and systems for providing extension application mechanisms. Memory is allocated for a virtual environment to run in an address space of an application that is to be extended with extension logic in a secure manner. The virtual environment is configured for execution of commands related to an extension functionality of the application. A virtual processor for an execution of a command of the commands is initialized at the virtual environment. The virtual processor is operable to manage one or more guest operating systems (OS). A first guest OS is loaded at the allocated memory and application logic of the extension functionality is copied into the allocated memory. The virtual environment is started to execute the first guest OS and the application logic of the extension functionality in relation to associated data of the application in the allocated memory.

Abstract: An automated system is presented for unit testing an application in a mainframe execution environment. The system includes a test configurator, a stub setup routine and an interceptor routine. The test configurator is configured to receive and parse a test input file, where the test input file includes a record for a particular file accessed by the application using the given type of file system. Upon reading the record, the test configurator calls the stub setup routine. The stub setup routine is associated with the given type of file system and creates an object for the particular file in the mainframe execution environment, such that the object is instantiated from a class representing the given type of file system. The interceptor routine is accessible by the application. In response to a given command issued by the application for the given type of file system, the interceptor routine operates to interact with methods provided by the object.

Abstract: Examples disclosed herein relate to classification models for binary code data. Some of the examples enable obtaining changed binary code data and unchanged binary code data, and generating, using a machine-leaning algorithm, a classification model based on training data that comprises the changed binary code data and the unchanged binary code data.

Abstract: Information about firmware modules for a power unit (e.g., a battery backup unit or a power supply unit) can be downloaded, along with the firmware modules themselves. The firmware modules, which may constitute less than a complete firmware re-flash, can be used to update firmware of the power unit from a first version type to a second version type.

Abstract: Techniques and systems are disclosed for allocating resources between two or more resource pools in a computing resource environment. Allocation may be realized by identifying a first resource in the first resource pool; creating a second resource based on at least a portion of the identified first resource; adding the created second resource to the second resource pool; identifying at least a portion of the added second resource as unused with respect to the second resource pool; creating a third resource based on the identified portion of the second resource; and adding the created third resource to a resource pool other than the second resource pool.

Abstract: A live migration method for a virtual machine passthrough device, includes: performing a register state synchronization method by calling a register state synchronization interface; cancelling a passthrough state of the source virtual machine passthrough device, and migrating the source virtual machine passthrough device to the target virtual machine by iteratively executing multiple rounds of a synchronization operation as following: performing the register state synchronization method by calling the register state synchronization interface to capture a read/write operation on a register of the source virtual machine passthrough device in a migration process, and executing the captured read/write operation on a register of a target virtual machine passthrough device; and performing a DMA dirty page synchronization method by calling a configured DMA dirty page transmission interface, to write data corresponding to a DMA dirty page identified by the source virtual machine passthrough device into a memory of th

Abstract: Content deployment systems and methods are provided for integrating and deploying selected content items in a web content publishing process. A first content source can manage and store a plurality of first content items for potential inclusion in a specific release that is published as web content. Each content item can include one or more of: a set of directions for rendering web content and actual content that is rendered as web content. A content publishing module can store a manifest record that specifies release items that are allowed to be part of the specific release, and receive a content package object, from the first content source, that includes the first content items. It can then extract selected ones of first content items that are specified in the manifest record, and add them into a release object so that they are included as part of the specific release.

Abstract: A two-phase commit online transaction processing system injects a set of test cases into a logical unit of work (LUW) associated with a transaction. Performance of the test cases, by respective transaction process monitors (TPMs), serves to predict the outcome of the LUW processes, before the TPMs vote with respect to committing or rolling back the transaction. The system contributes to improved transaction process quality assurance by detecting potential problems before the LUW is committed.

Abstract: A scheduler is provided for tall algorithms that include control flow statements that are dependent on tall computations. Thunks may be defined for the tall algorithms and the boundaries or limits of the thunks may be determined by places where tall variables are required to be gathered. The scheduler executes the tall algorithms by calling individually the thunks from the tall algorithms and pausing when a gather operation is required. The scheduler collectively gathers the tall variables from different tall algorithms by using an optimizer to combine I/O operations for the tall algorithms. The scheduler may put back the gathered variables into the context of each tall algorithm, and the scheduler may resume with the next thunk for each tall algorithm. This process may be repeated until all tall algorithms are finished.

Abstract: Described herein is a system and method for ranking and/or taking an action regarding execution of jobs of a shared computing cluster based upon predicted user impact. Information regarding previous executions of a plurality of jobs is obtained, for example, from job execution log(s). Data dependencies of the plurality of jobs are determined. Job impact of each of the plurality of jobs as a function of the determined data dependencies is calculated. User impact of each of the plurality of jobs as a function of the determined data dependencies, the calculated job impact, and time is calculated. The plurality of jobs are ranked in accordance with the calculated user impact. An action is taken in accordance with the ranking of the plurality of jobs. The action can include automatic scheduling of the jobs and/or providing information regarding the rankings to a user.

Abstract: Embodiments of the present disclosure relate to software application optimization. Other embodiments may be described and/or claimed.

Abstract: The invention relates to a method for storing data of an application running on a virtual machine, in a virtualized storage system corresponding to the emulation of at least one magnetic tape and at least one associated magnetic tape drive, via a data exchange protocol which is TCP/IP.

Abstract: MapReduce processing is carried out in a disaggregated compute environment comprising a set of resource pools that comprise a processor pool, and a memory pool. Upon receipt of a MapReduce job, a task scheduler allocates resources from the set of resource pools, the resources including one or more processors drawn from the processor pool, and one or more memory modules drawn from the memory pool. The task scheduler then schedules a set of tasks required by the MapReduce job. At least one particular task in the set is scheduled irrespective of a location of data required for the particular task. In association with a shuffle phase of the MapReduce job, and in connection with the particular task, at least one connection between a processor and at least one memory module is dynamically rewired based on the location of the data required for the particular task, thereby obviating network transfer of that data.

Abstract: Methods and systems for test deployment of computational code on virtual servers are disclosed. In one embodiment, an exemplary method comprises receiving test computational code programmed to provide resources; selecting a test virtual server from a plurality of virtual servers; uploading the test computational code to the test virtual server; initializing the test computational code on the test virtual server; receiving computational performance measurements of the test virtual server and a remainder of the plurality of virtual servers; calculating a test score of the test virtual server based on the received computational performance measurements; and stopping the test computational code if the test score is outside a set range.