Abstract: Techniques for performing an upgrade can include: defining integration points, each associated with a workflow processing point of an upgrade workflow; associating code entities with the integration points; and performing processing that performs the upgrade workflow to upgrade a system, wherein the upgrade includes upgrading a first feature, facility or service of the system from a current version to a new version, wherein the processing further includes: executing code corresponding to workflow processing points of the upgrade workflow, wherein a first workflow processing point of the upgrade workflow is associated with a first of the integration points; and in response to said executing reaching the first workflow processing point corresponding to the first integration point, invoking a first code entity associated with the first integration point, wherein said first code entity performs customized processing in connection with upgrading the first feature, facility or service in the system.

Abstract: The invention relates generally to non-naturally occurring ACE2 proteins and their use in the treatment of coronavirus infection.

Abstract: Techniques for performing an upgrade can include: defining integration points, each associated with a workflow processing point of an upgrade workflow; associating code entities with the integration points; and performing processing that performs the upgrade workflow to upgrade a system, wherein the upgrade includes upgrading a first feature, facility or service of the system from a current version to a new version, wherein the processing further includes: executing code corresponding to workflow processing points of the upgrade workflow, wherein a first workflow processing point of the upgrade workflow is associated with a first of the integration points; and in response to said executing reaching the first workflow processing point corresponding to the first integration point, invoking a first code entity associated with the first integration point, wherein said first code entity performs customized processing in connection with upgrading the first feature, facility or service in the system.

Abstract: Techniques for performing an upgrade can include: defining integration points each associated with a workflow processing point included in an upgrade workflow; receiving command lists each include commands of an integration point; associating each command of a command list with a code entity; performing processing that performs an upgrade workflow to upgrade a system, wherein the processing includes: executing code corresponding to the upgrade workflow, wherein a workflow processing point of the workflow is associated with a first integration point; and in response to said executing reaching the workflow processing point corresponding to the first integration point, performing second processing including: executing commands of a command list associated with the first integration point; and for each command executed, invoking a corresponding code entity that performs customized processing in connection with upgrading a first feature, facility or service in the system.

Abstract: A method, computer program product, and computer system for triggering, by a computing device, a synchronization activity on a storage object. A request may be executed for a copy operation resulting from the synchronization activity to copy the storage object from a source to a destination when a current number of concurrent copy operations is below a maximum number of copy operations. The request for the copy operation resulting from the synchronization activity to copy the storage object from the source to the destination may be placed in a queue when the current number of concurrent copy operations is at least at the maximum number of copy operations. One or more attributes of the request in the queue may be identified. The request for the copy operation may be executed according to a replication policy based upon, at least in part, the one or more attributes of the request in the queue.

Abstract: A method, computer program product, and computer system for triggering, by a computing device, a synchronization activity on a storage object. A request may be executed for a copy operation resulting from the synchronization activity to copy the storage object from a source to a destination when a current number of concurrent copy operations is below a maximum number of copy operations. The request for the copy operation resulting from the synchronization activity to copy the storage object from the source to the destination may be placed in a queue when the current number of concurrent copy operations is at least at the maximum number of copy operations. One or more attributes of the request in the queue may be identified. The request for the copy operation may be executed according to a replication policy based upon, at least in part, the one or more attributes of the request in the queue.

Abstract: Techniques for processing requests are described. A first thread is selected for execution. Only a single thread is allowed to execute at a time. Each thread is associated with a queue of requests to be processed by the thread. A first request is selected from the queue of first thread that performs first processing to service the first request. A service time classification for the first request is determined in accordance with criteria that includes a runtime determination of what resource(s) are used in servicing the first request. It is determined, in accordance with the service time classification, whether to allow the first thread to continue execution and process a second request from the queue of the first thread. If the first thread is allowed to continue execution, second processing is performed by the first thread to service the second request. Otherwise, a second thread is selected for execution.

Abstract: Techniques for memory management are described. A memory management data structure may include a tree structure of nodes each representing a free memory portion of a size used as a key value. The tree may be a modified AVL tree with nodes sorted based on key values corresponding to free memory portion sizes. The data structure may include a first list representing a memory map corresponding to different memory portions where each entry of the first list represents a memory portion with an associated memory address range that is not contiguous with respect to any other memory address range of any other memory portion represented by an entry on the first list. Each entry of the first list representing a free memory portion may be associated with a node of the tree structure.