International Business Machines Corporation

Intel Corporation

Infosys Limited

Hariprasad V Nellitheertha

Thanunathan Rangarajan

Anil S Keshavamurthy

Deepak S

Srikanth Sundarrajan

S Deepak

The present disclosure is directed to a protection scheme for remotely-stored data. A system may comprise, for example, at least one device including at least one virtual machine (VM) and a trusted execution environment (TEE). The TEE may include an encryption service to encrypt or decrypt data received from the at least one VM. In one embodiment, the at least one VM may include an encryption agent to interact with interfaces in the encryption service. For example, the encryption agent may register with the encryption service, at which time an encryption key corresponding to the at least one VM may be generated. After verifying the registration of the encryption agent, the encryption service may utilize the encryption key corresponding to the at least one VM to encrypt or decrypt data received from the encryption agent. The encryption service may then return the encrypted or decrypted data to the encryption agent.

Protection scheme for remotely-stored data

Virtual machines can be pre-created in a grid environment. Pre-created machines can be of a tiny configuration to avoid consuming resources. A request for a virtual machine in the grid can be granted by ballooning a pre-created tiny virtual machine to a larger configuration. The tiny pre-created virtual machine can be advertised as being of a non-tiny configuration. Agents can work in concert to coordinate handing requests for a virtual machine in the grid. The virtual machine can be initialized before it is reduced to a tiny configuration. Ballooning the virtual machine can take considerably less time than creating it from scratch. Thus, high performance computing can be provided on virtual machines in a grid environment, enabling virtual machine technology to be applied in a wide variety of grid-based scenarios.

Pre-creating virtual machines in a grid environment

A system and program storage device for extracting data of a buffer after a failure of an operating system. An application is registered prior to the failure. The registering includes identifying a buffer in which the data to be extracted is stored prior to the failure. The buffer is reserved to maintain the data residing in the buffer as unchanged from initiation to completion of a fast reboot of the operating system. The fast reboot is responsive to the failure. An in-memory file is generated during the fast reboot, points to the data residing in the buffer, and is stored in volatile memory and not in persistent storage. The data is extracted via an instruction which is executed by the application after completion of the fast reboot, and which operates on the in-memory file.

Extracting log and trace buffers in the event of system crashes

A method for extracting data of a buffer after a failure of an operating system. An application is registered prior to the failure. The registering includes identifying a buffer in which the data to be extracted is stored prior to the failure. The buffer is reserved to maintain the data residing in the buffer as unchanged from initiation to completion of a fast reboot of the operating system. The fast reboot is responsive to the failure. An in-memory file is generated during the fast reboot, points to the data residing in the buffer, and is stored in volatile memory and not in persistent storage. The data is extracted via an instruction which is executed by the application after completion of the fast reboot, and which operates on the in-memory file.

The automatic selection of an input/output scheduler in a computing system with a plurality of input/output schedulers is disclosed. Each of the plurality of input/output schedulers is mapped against a corresponding desired set of heuristics. Heuristics relating to job requests submitted by processes in the computer system are monitored and analysed. These heuristics may include the number of read and write requests, the ratio of read requests to write requests, input/output throughput, disk utilization and the average time taken for processes to submit subsequent jobs once an initial job completes. The analysed heuristics are compared to the desired sets of heuristics for the plurality of input/output schedulers to select one of the plurality of input/output schedulers.

Growing community of inventors

Karnataka, India

Hariprasad V Nellitheertha