Patents by Inventor Hariprasad Nellitheertha
Hariprasad Nellitheertha has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9852299Abstract: 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.Type: GrantFiled: September 27, 2013Date of Patent: December 26, 2017Assignee: INTEL CORPORATIONInventors: Hariprasad Nellitheertha, Deepak S., Thanunathan Rangarajan, Anil S. Keshavamurthy
-
Publication number: 20150220745Abstract: 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.Type: ApplicationFiled: September 27, 2013Publication date: August 6, 2015Inventors: Hariprasad Nellitheertha, Deepak S., Thanunathan Rangarajan, Anil S. Keshavamurthy
-
Patent number: 8671403Abstract: 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.Type: GrantFiled: May 15, 2007Date of Patent: March 11, 2014Assignee: Infosys LimitedInventors: Srikanth Sundarrajan, Hariprasad Nellitheertha
-
Publication number: 20100042723Abstract: A method for managing load in a network comprising a first set of hosts, a second set of hosts and a centralized server is provided. A virtual machine runs on each of the first set of hosts. The centralized server receives resource donation information from each of the second set of hosts that are underutilized. Further, a load surge indicating additional tasks to be performed by the first set of hosts and the second set of hosts is identified. Next, the centralized server negotiates with the second set of hosts for modification of the resource donation information. Thereafter, one or more hosts are determined, based on the resource donation information and the load surge. These hosts create a virtual machine, based on the resource donation information, and become a part of the first set of hosts. The centralized server delegates the additional tasks among the first set of hosts.Type: ApplicationFiled: August 12, 2009Publication date: February 18, 2010Inventors: Srikanth Sundarrajan, Hariprasad Nellitheertha
-
Publication number: 20070288224Abstract: 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.Type: ApplicationFiled: May 15, 2007Publication date: December 13, 2007Applicant: Infosys Technologies Ltd.Inventors: Srikanth Sundarrajan, Hariprasad Nellitheertha
-
Publication number: 20070168699Abstract: A method and system 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.Type: ApplicationFiled: November 10, 2005Publication date: July 19, 2007Applicant: International Business Machines CorporationInventor: Hariprasad Nellitheertha
-
Patent number: 7197577Abstract: 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.Type: GrantFiled: December 12, 2003Date of Patent: March 27, 2007Assignee: International Business Machines CorporationInventor: Hariprasad Nellitheertha
-
Publication number: 20050144332Abstract: 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.Type: ApplicationFiled: December 12, 2003Publication date: June 30, 2005Applicant: International Business Machines CorporationInventor: Hariprasad Nellitheertha