International Business Machines Corporation

Nelson Mimura Gonzalez

Jose R Brunheroto

Fausto Artico

Juan Gonzalez Garcia

Marco Aurelio Stelmar Netto

Renato Luiz De Freitas Cunha

Bruno Silva

Guojing Cong

Tonia Elengikal

Described are techniques for application migration. The techniques include migrating an application to a target cloud infrastructure and generating a cost-aware code dependency graph during execution of the application on the target cloud infrastructure. The techniques further include modifying the application by removing source code corresponding to unused nodes according to the cost-aware code dependency graph and replacing identified source code of a high-cost subgraph of the cost-aware code dependency graph with calls to a generated microservice configured to provide functionality similar to the identified source code. The techniques further include implementing the modified application on one or more virtual machines of the target cloud infrastructure.

Application migration using cost-aware code dependency graph

A computer-implemented method, a computer program product, and a computer system for multi-path networking with a feature of multiplexing. One or more computing devices or servers configure wrappers for respective ones of applications and run the applications with the wrappers preloaded to the respective ones of the applications. The wrappers establish communication through one or more alternative paths between wrapped applications, where the one or more alternative paths are parallel to an original path between the applications. The wrappers exchange data between the applications through either the one or more alternative paths or the original path. The wrappers finalize connections through the one or more alternative paths, in response to all the data being exchanged.

Transparent service-aware multi-path networking with a feature of multiplexing

Methods for dynamically executing computer code across multiple disparate processing unit architectures are disclosed. During execution of a first portion of computer code on a first processing unit, it is determined that a first dynamic hardware behavior of a plurality of dynamic hardware behaviors will occur at a subsequent point in time, based on a second dynamic hardware behavior that is occurring. The methods include determining to execute code corresponding to the first dynamic hardware behavior on a second processing unit, rather than the first processing unit, and scheduling computer program code corresponding to the first dynamic hardware behavior to execute on the second processing unit rather than the first processing unit. Upon completion of execution of the computer code corresponding to the first dynamic hardware behavior, a remaining portion of the computer code is scheduled to execute on the first processing unit.

On-the fly scheduling of execution of dynamic hardware behaviors

Methods for estimating accelerator performance for dynamic hardware behaviors are disclosed. Computer program code to be executed on a first processing unit is received, and an execution of the computer code on the first processing unit is monitored to determine a plurality of performance characteristics. A plurality of dynamic hardware behaviors is determined by applying a clustering algorithm to the performance characteristics, and an equivalent accelerator portion of computer code to be executed on a second processing unit is generated by translating a set of instructions in a first portion of computer code corresponding to a first one of the plurality of dynamic hardware behaviors to an equivalent set of instructions to be executed on the second processing unit. An estimated measure of performance for executing the equivalent accelerator portion on the second processing unit is determined for the first one of the plurality of dynamic hardware behaviors.

Growing community of inventors

Yorktown Heights, NY, United States of America

Nelson Mimura Gonzalez