Patents by Inventor Venkata Harish Mallipeddi
Venkata Harish Mallipeddi 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: 11782620Abstract: In accordance with an embodiment, described herein are systems and methods for providing tiered data storage in cloud infrastructure environments. A data storage service (block store) is adapted to automatically adjust the manner by which the data for a data volume or block volume (data/block volume), associated with a cloud instance, can be stored to meet the requirements of a performance tier. For example, responsive to selection of a particular performance tier, the storage of the data/block volume can be allocated between a first type of data storage associated with a first performance characteristics; and a second type of data storage associated with a second performance characteristics. A graphical user interface enables configuring data/block volumes to use particular performance tiers, and/or to support automatic tuning.Type: GrantFiled: September 11, 2020Date of Patent: October 10, 2023Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Jeppe Larsen, Travis Portz, Venkata Harish Mallipeddi, Steven Gates
-
Publication number: 20230029465Abstract: Techniques are provided for cross-region replication of block volume data. The techniques include a method wherein a computer system implements operations including creating a first snapshot of a block volume at a first geographic region and at a first logical time, the block volume including a plurality of partitions, transmitting first snapshot data to an object storage system at a second geographic region, creating a second snapshot of the block volume at the first geographic region and at a second logical time, generating a plurality of deltas, transmitting a plurality of delta data sets corresponding to the plurality of deltas to the object storage system at the second geographic region, generating a checkpoint at least in part by aggregating object metadata associated with the plurality of deltas and the first snapshot, receiving a restore request to generate a restore volume, and generating the restore volume from the checkpoint.Type: ApplicationFiled: October 12, 2022Publication date: February 2, 2023Applicant: Oracle International CorporationInventors: Venkata Harish Mallipeddi, Travis John Portz, Jeppe Oskar Meyer Larsen, Mario Tayah
-
Patent number: 11537633Abstract: Techniques are provided for cross-region replication of block volume data. The techniques include a method wherein a computer system implements operations including creating a first snapshot of a block volume at a first geographic region and at a first logical time, the block volume including a plurality of partitions, transmitting first snapshot data to an object storage system at a second geographic region, creating a second snapshot of the block volume at the first geographic region and at a second logical time, generating a plurality of deltas, transmitting a plurality of delta data sets corresponding to the plurality of deltas to the object storage system at the second geographic region, generating a checkpoint at least in part by aggregating object metadata associated with the plurality of deltas and the first snapshot, receiving a restore request to generate a restore volume, and generating the restore volume from the checkpoint.Type: GrantFiled: November 6, 2020Date of Patent: December 27, 2022Assignee: Oracle International CorporationInventors: Venkata Harish Mallipeddi, Travis John Portz, Jeppe Oskar Meyer Larsen, Mario Tayah
-
Publication number: 20220147541Abstract: Techniques are provided for cross-region replication of block volume data. The techniques include a method wherein a computer system implements operations including creating a first snapshot of a block volume at a first geographic region and at a first logical time, the block volume including a plurality of partitions, transmitting first snapshot data to an object storage system at a second geographic region, creating a second snapshot of the block volume at the first geographic region and at a second logical time, generating a plurality of deltas, transmitting a plurality of delta data sets corresponding to the plurality of deltas to the object storage system at the second geographic region, generating a checkpoint at least in part by aggregating object metadata associated with the plurality of deltas and the first snapshot, receiving a restore request to generate a restore volume, and generating the restore volume from the checkpoint.Type: ApplicationFiled: November 6, 2020Publication date: May 12, 2022Applicant: Oracle International CorporationInventors: Venkata Harish Mallipeddi, Travis John Portz, Jeppe Oskar Meyer Larsen, Mario Tayah
-
Publication number: 20210081111Abstract: In accordance with an embodiment, described herein are systems and methods for providing tiered data storage in cloud infrastructure environments. A data storage service (block store) is adapted to automatically adjust the manner by which the data for a data volume or block volume (data/block volume), associated with a cloud instance, can be stored to meet the requirements of a performance tier. For example, responsive to selection of a particular performance tier, the storage of the data/block volume can be allocated between a first type of data storage associated with a first performance characteristics; and a second type of data storage associated with a second performance characteristics. A graphical user interface enables configuring data/block volumes to use particular performance tiers, and/or to support automatic tuning.Type: ApplicationFiled: September 11, 2020Publication date: March 18, 2021Inventors: Jeppe Larsen, Travis Portz, Venkata Harish Mallipeddi, Steven Gates
-
Patent number: 10394611Abstract: A currently operating computing cluster that has multiple nodes storing cluster data may be scaled. A cluster scaling request may be received for the current cluster indicating a change in a number or type of nodes in the current cluster. In response to receiving the cluster scaling request, a new cluster may be created as indicated in the cluster scaling request, a copy of the cluster data from the current cluster to the nodes in the new cluster may be initiated, a network endpoint for the current cluster may be moved to the new cluster, and the current cluster may be disabled. The current cluster may, in some embodiments, respond to read access requests during the copy of the cluster data.Type: GrantFiled: November 26, 2012Date of Patent: August 27, 2019Assignee: Amazon Technologies, Inc.Inventors: Venkata Harish Mallipeddi, Aleksandras Surna
-
Patent number: 10296518Abstract: A data storage system includes multiple storage zones that store replicated copies of data items. Upon receiving a delete operation at a particular time to delete a data item, the system computes a maximum last update time based on the particular time and a minimum data item lifetime. Based on determining that a copy of the data item is stored in the data storage zone, the system then determines a last update time of the data item. In addition, based on determining that the last update time is less than the first maximum last update time, the system deletes the copy of the data item from the data storage zone.Type: GrantFiled: January 5, 2017Date of Patent: May 21, 2019Assignee: Dropbox, Inc.Inventors: James Cowling, Venkata Harish Mallipeddi, IV
-
Publication number: 20170116301Abstract: A data storage system includes multiple storage zones that store replicated copies of data items. Upon receiving a delete operation at a particular time to delete a data item, the system computes a maximum last update time based on the particular time and a minimum data item lifetime. Based on determining that a copy of the data item is stored in the data storage zone, the system then determines a last update time of the data item. In addition, based on determining that the last update time is less than the first maximum last update time, the system deletes the copy of the data item from the data storage zone.Type: ApplicationFiled: January 5, 2017Publication date: April 27, 2017Inventors: James Cowling, Venkata Harish Mallipeddi, IV
-
Patent number: 9619322Abstract: A data storage system stores sets of data blocks in extents located on storage devices. During operation, the system performs an erasure-coding operation by obtaining a set of source extents, wherein each source extent is stored on a different machine in the data storage system. The system also selects a set of destination machines for storing destination extents, wherein each destination extent is stored on a different destination machine. Next, the system performs the erasure-coding operation by retrieving data from the set of source extents, performing the erasure-coding operation on the retrieved data to produce erasure-coded data, and then writing the erasure-coded data to the set of destination extents on the set of destination machines. Finally, after the erasure-coding operation is complete, the system commits results of the erasure-coding operation to enable the set of destination extents to be accessed in place of the set of source extents.Type: GrantFiled: November 13, 2014Date of Patent: April 11, 2017Assignee: Dropbox, Inc.Inventors: James Cowling, Kevin P. Modzelewski, Venkata Harish Mallipeddi
-
Patent number: 9569515Abstract: A data storage system includes multiple zones that comprise separate geographic storage locations and store replicated copies of data items. Upon receiving a delete operation at a local zone at a time td, if a copy of the first data item exists in the local zone, the system computes a maximum last update time tmlu=td?tmin, wherein tmin is a minimum lifetime for a data item. Next, the system determines, from a local index, a time tlu that the first data item was last updated. If tlu<tmlu, the system deletes the copy of the first data item in the local zone. The system also asynchronously propagates the delete operation to other zones in the data storage system along with tmlu, wherein the delete operation is performed in another zone if the other zone determines that the first data item was last updated before tmlu.Type: GrantFiled: November 13, 2014Date of Patent: February 14, 2017Assignee: Dropbox, Inc.Inventors: James Cowling, Venkata Harish Mallipeddi
-
Publication number: 20160140201Abstract: A data storage system includes multiple zones that comprise separate geographic storage locations and store replicated copies of data items. Upon receiving a delete operation at a local zone at a time td, if a copy of the first data item exists in the local zone, the system computes a maximum last update time tmlu=td?tmin, wherein tmin is a minimum lifetime for a data item. Next, the system determines, from a local index, a time tlu that the first data item was last updated. If tlu<tmlu, the system deletes the copy of the first data item in the local zone. The system also asynchronously propagates the delete operation to other zones in the data storage system along with tmlu, wherein the delete operation is performed in another zone if the other zone determines that the first data item was last updated before tmlu.Type: ApplicationFiled: November 13, 2014Publication date: May 19, 2016Inventors: James Cowling, Venkata Harish Mallipeddi
-
Publication number: 20160139980Abstract: A data storage system stores sets of data blocks in extents located on storage devices. During operation, the system performs an erasure-coding operation by obtaining a set of source extents, wherein each source extent is stored on a different machine in the data storage system. The system also selects a set of destination machines for storing destination extents, wherein each destination extent is stored on a different destination machine. Next, the system performs the erasure-coding operation by retrieving data from the set of source extents, performing the erasure-coding operation on the retrieved data to produce erasure-coded data, and then writing the erasure-coded data to the set of destination extents on the set of destination machines. Finally, after the erasure-coding operation is complete, the system commits results of the erasure-coding operation to enable the set of destination extents to be accessed in place of the set of source extents.Type: ApplicationFiled: November 13, 2014Publication date: May 19, 2016Inventors: James Cowling, Kevin P. Modzelewski, Venkata Harish Mallipeddi