Hewlett Packard Enterprise Development LP

Novell, Inc.

Abhay Padlia

Clifford A McCarthy

Geoffery Schunicht

Rajeev Pandey

Charles S Greenidge

Latha Srinivasan

Subhajit Dasgupta

Charles E Fowler

Michelle Catherine Frolik

Jonathan M Sauer

Sandesh V Madhyastha

Gary L Thunquest

Jerry Harrow

Sujoy Saraswati

Suprateeka Radhakrishna Hegde

Deepti Kharbanda

Sachin Mishra

Rajesh Kumar Chaurasia

Bruce A Lundeby

Bhandari Ashank

Ashank Bhandari

Gurpreet Singh Sachdev

Raghu Narasimha Murthy

Parul Tyagi

A system to facilitate infrastructure management is described. The system includes one or more processors and a non-transitory machine-readable medium storing instructions that, when executed, cause the one or more processors to execute an infrastructure management controller to automatically balance utilization of infrastructure resources between a plurality of on-premise infrastructure controllers.

Load balancing of on-premise infrastructure resource controllers

A system to facilitate infrastructure management is described. The system includes one or more processors and a non-transitory machine-readable medium storing instructions that, when executed, cause the one or more processors to execute an infrastructure management controller to receive a request to provide infrastructure management services and generate a mapping between at least one instance of the infrastructure management controller and one or more resource instances at one or more on-premise infrastructure controller instances to provide the cloud based infrastructure management services, wherein the request includes one or more configuration parameters.

Infrastructure resource mapping mechanism based on determined best match proposal for workload deployment

In one implementation, a computing device includes a secure storage to store a plurality of security elements, a processor, and a storage medium including instructions. The instructions are executable by the processor to: receive a configuration request for a first server, the configuration request including one or more logical references to security settings of the first server; retrieve, from the secure storage, one or more security elements corresponding to the one or more logical references in the configuration request; and configure an operating system volume for the first server based on the configuration request and the one or more security elements.

Configuration of server using stored security elements

A system to facilitate infrastructure management is described. The system includes one or more processors and a non-transitory machine-readable medium storing instructions that, when executed, cause the one or more processors to execute an infrastructure management controller to receive first monitoring data indicating a first infrastructure condition occurring at an on-premise infrastructure controller, determine a first load state of the on-premise infrastructure controller based on the first infrastructure condition and adjust a consistency level of the on-premise infrastructure controller to a first level of the consistency based on the first state.

Infrastructure adaptive consistency level mechanism

Infrastructure load balancing using software-defined networking controllers

A system to facilitate infrastructure management is described. The system includes a plurality of management controllers each having a control function of a plurality of infrastructure devices and a state cache storing a state of the plurality of infrastructure devices, including a first management controller to initiate an operation to be performed on a first set of resources. The system also includes a plurality of infrastructure controllers, each having a state repository to maintain a state function of the plurality of infrastructure devices, including a first infrastructure controller associated with the first set of resources to perform the operation on the first set of resources, update a first state repository including an updated state of the first set of resources in response to the operation and broadcast the updated state of the first set of resources to each of the plurality of management controllers.

Peer to peer infrastructure management architecture

Some examples described herein relate to dynamically applying a patch to a computer application. An external process may be invoked to bring a target process of the computer application to a safe point. A dynamic loader may load a patch library into an address space of the target process, wherein the patch library includes a patched version of a target function or a new function. A specific function in the dynamic loader may be directed to route a function call for the target function to the patched version of the target function or the new function in the patch library.

Dynamically applying a patch to a computer application

Some examples described herein relate to dynamically applying a patch to a shared library. An external process may be invoked to bring target processes that refer to a shared library, to a safe point. In response to a function call from a target process, amongst the target processes, to access a target function in the shared library, the function call may be forwarded to a special function in a dynamic loader, wherein the target function is a function to be patched in the shared library. The special function may determine whether a shared patch library, comprising a patched version of the target function or a new function, is loaded for the target process. In response to determination that the shared patch library is not loaded for the target process, the shared patch library may be loaded only for the target process, and the request for the target function may be routed to the patched version of the target function or the new function, in the shared patch library.

Dynamically applying a patch to a shared library

A system and method for patching a kernel. The method includes receiving an online patch request, parsing a global kernel thread list to determine kernel threads associated with a target function, maintaining a storage data structure including identifiers of the determined kernel threads, and parsing the determined kernel threads using the identifiers in the storage data structure to determine when the global kernel thread list is free of the target function upon encountering an event associated with the target function.

Dynamically patching kernels using storage data structures

In one example implementation, a system for patching a kernel can comprise a plurality of processor resources, a distribution engine to divide a kernel thread list into a number of portions, and a handler engine to manage processing a portion of the kernel thread list to determine when a target function is associated with the portion of the kernel thread list. In another example implementation, a method for patching a kernel can comprise receiving an online patch request, sending an interrupt to a plurality of processor resources, distributing a kernel thread list to the plurality of processor resources, and parsing a portion of the kernel thread list on one of the plurality of processor resources to determine when the portion is associated with a target function.

Distributed kernel thread list processing for kernel patching

A method and system is provided for enhancing a reproduction of a recurring image of an first computer on a second computer in a computer network. In order to avoid transferring high color depth high volume of data for recurring images on one computer to another, the recurring image is invoked by a low bit identifier. For example, between a controlling and controlled computer, if a controlled computer detects a first screen image wherein the first screen image having a relative high color depth, it identifies the first screen image by assigning a first identifier (ID). Then, the controlled computer produces a low color depth representation of the first screen image to be stored, and sends the first screen image to the controlling computer along with the first ID. The controlling computer compresses and stores the first screen image along with the first ID. When the controlled computer, by using the stored low color depth representation of the first screen image, detects that a second screen image is a part of the first screen image or is the same as the first screen image, it sends the first ID to the controlling computer for invoking the first screen stored on the controlling computer, and the controlling computer retrieves and displays the stored first screen image.

Method and system for transferring repetitive images over computer networks

A method is provided for transferring digital image data. The method identifies areas of the image that frequently change and divides the image into regions based on the identified areas. The regions may be created based on a distance between identified areas, an amount of data encompassed by the identified areas, or other desired parameters. A unionizing process is applied to each of the regions to create a change rectangle encompassing the changes in each region. The information representing each change rectangle may then be transferred, resulting in a more efficient utilization of bandwidth.

Growing community of inventors

Bengaluru, India

Abhay Padlia