Red Hat, Inc.

Jason Greene

Stuart Wade Douglas

Manik Surtani

Manik Ram Surtanl

The present disclosure provides new and innovative systems and methods for in-place upgrades of applications. In an example, a computer-implemented method includes obtaining source code, obtaining automated tests, generating a software application based on the source code, the software application validated based on the automated tests and the software application includes the automated tests, deploying the software application to a production environment, obtaining update data, generating an updated application based on the update data, automatically validating the updated application based on the automated tests included in the software application, and deploying, based on the automatic validation, the updated application to the production environment.

Systems and methods for in-place application upgrades

A system includes a memory and processor in communication with the memory. The processor is configured to receive a connection request at an emulation layer from an integrated development environment (IDE). The emulation layer connects, via a socket connection, with the IDE. Using the socket connection, the emulation layer receives a command. The command is decoded to retrieve a parameter and a reference to a native application. The command is mapped to a native debugger command and then used to debug the native application using the native debugger.

Debugging a native compiled application from an integrated development environment

A system includes a memory and a processor in communication with the memory. The processor is configured to, prior to runtime, process application metadata for an application. The application metadata is classified into a first class used only for deployment, a second class used only for runtime, and a third class used for both runtime and deployment. Responsive to processing the application metadata, the processor is configured to build a deployment model from the processed application metadata. Prior to runtime, the processor is configured to generate an intermediate representation of the application from the deployment model. The intermediate representation of the application includes direct calls for classes associated with the second class of metadata and the third class of metadata.

Reducing application startup time by generating bytecode from metadata at build time

A system includes a memory and a processor, where the processor is in communication with the memory. The processor is configured to retrieve data structure metadata from a source code of an application. Each of the complex thread variables are registered and an object is generated that is accessible from a thread initiated during execution of the application. At least one thread object implementation is generated within the object, where each of the thread object implementation corresponds to each of the complex thread variables referenced within the source code. Next, the processor is configured to modify an implementation of the source code of the application to call the at least one thread object implementation when attempting to access one or more complex thread variables referenced within the source code. Next, the source code is compiled into an object code corresponding to the application, where the object code includes the object.

Build time optimization using thread object variables

An apparatus and a method for forming a concurrent linked hash map is described. Doubly linked nodes of a linked list are formed in a data container of a networked memory. A hash table is generated from the doubly linked nodes. A parent node is located in the hash table to update a reference of a node in the data container. The parent node is processed in a forward direction of the linked list.

Concurrent linked hashed maps

An apparatus and a method for Java array interception using bytecode manipulation and data flow analysis. In one embodiment, a user-provided object class is identified. An array access operation of the user-provided object class is intercepted. The intercepted array access operation is translated with an emulator class of a native Java array. The translated array access operation is sent to an emulator class to determine whether to dispatch to the native Java array or an alternate data source.

Method of array interception using data-flow analysis

A method and apparatus for dynamically partitioning data across a cluster in a tree-based structure is disclosed. In one embodiment, cache nodes in the cluster are detected. A partition group is formed with members including one or more cache nodes of the cluster. An instance of a cache node in the partition group is copied to each cache node in the partition group. The membership of the partition group is adjusted based on a participation of data in the partition group.

Dynamic data partitioning of data across a cluster in a distributed-tree structure

A method and apparatus for obtaining data from a cluster of cache nodes in a tree-based structure is disclosed. A querying cache node outside a partition group queries data of a cache node of the partition group. The partition group is made of one or more cache nodes of the cluster, where an instance of a cache node in the partition group is copied to each cache node in the partition group. The instance of the data of the cache nodes of the partition group is copied to the querying cache node. The partition group is adjusted to include the querying cache node as a member of the partition group.

Data gravitation in a distributed-tree structure

A method and apparatus for providing concurrent access to a cache node of a tree-based data structure. Readers concurrently read access the cache node. A copy of the cache node is created for a write access of a writer. Only one copy of the cache node is allowed at any one time. The writer operates on the copy of the cache node while concurrent read access of the cache node are provided to the readers.

Multiversion concurrency control in in-memory tree-based data structures

A method and apparatus for calculating a degree of participation of a server in a group of servers is disclosed. In one embodiment, a memory stores timestamps for each access to the server. A processor weights the timestamps to treat more recent accesses as more important than older accesses, wherein older accesses decay in importance exponentially using a half-life constant.

Growing community of inventors

Madison, WI, United States of America

Jason Greene