Patents by Inventor Deepak Raghu
Deepak Raghu 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).
-
Publication number: 20240126820Abstract: A data management services architecture includes architectural components that run in both a storage and compute domains. The architectural components redirect storage requests from the storage domain to the compute domain, manage resources allocated from the compute domain, ensure compliance with a policy that governs resource consumption, deploy program code for data management services, dispatch service requests to deployed services, and monitor deployed services. The architectural components also include a service map to locate program code for data management services, and service instance information for monitoring deployed services and dispatching requests to deployed services. Since deployed services can be stateless or stateful, the services architecture also includes state data for the stateful services, with supporting resources that can expand or contract based on policy and/or service demand. The architectural components also include containers for the deployed services.Type: ApplicationFiled: July 24, 2023Publication date: April 18, 2024Inventors: Deepak Raghu Kenchammana-Hosekote, Shiva Chaitanya, Saeed Ghanbari, Barry Patrick Benight, David Anthony Slik
-
Patent number: 11709897Abstract: A data management services architecture includes architectural components that run in both a storage and compute domains. The architectural components redirect storage requests from the storage domain to the compute domain, manage resources allocated from the compute domain, ensure compliance with a policy that governs resource consumption, deploy program code for data management services, dispatch service requests to deployed services, and monitor deployed services. The architectural components also include a service map to locate program code for data management services, and service instance information for monitoring deployed services and dispatching requests to deployed services. Since deployed services can be stateless or stateful, the services architecture also includes state data for the stateful services, with supporting resources that can expand or contract based on policy and/or service demand. The architectural components also include containers for the deployed services.Type: GrantFiled: September 7, 2020Date of Patent: July 25, 2023Assignee: NetApp, Inc.Inventors: Deepak Raghu Kenchammana-Hosekote, Shiva Chaitanya, Saeed Ghanbari, Barry Patrick Benight, David Anthony Slik
-
Publication number: 20230086414Abstract: A deduplication service can be provided to a storage domain from a services framework that expands and contracts to both meet service demand and to conform to resource management of a compute domain. The deduplication service maintains a fingerprint database and reference count data in compute domain resources, but persists these into the storage domain for use in the case of a failure or interruption of the deduplication service in the compute domain. The deduplication service responds to service requests from the storage domain with indications of paths in a user namespace and whether or not a piece of data had a fingerprint match in the fingerprint database. The indication of a match guides the storage domain to either store the piece of data into the storage backend or to reference another piece of data. The deduplication service uses the fingerprints to define paths for corresponding pieces of data.Type: ApplicationFiled: November 30, 2022Publication date: March 23, 2023Inventors: Saeed Ghanbari, Barry Patrick Benight, Deepak Raghu Kenchammana-Hosekote, Shiva Chaitanya
-
Patent number: 11537573Abstract: A deduplication service can be provided to a storage domain from a services framework that expands and contracts to both meet service demand and to conform to resource management of a compute domain. The deduplication service maintains a fingerprint database and reference count data in compute domain resources, but persists these into the storage domain for use in the case of a failure or interruption of the deduplication service in the compute domain. The deduplication service responds to service requests from the storage domain with indications of paths in a user namespace and whether or not a piece of data had a fingerprint match in the fingerprint database. The indication of a match guides the storage domain to either store the piece of data into the storage backend or to reference another piece of data. The deduplication service uses the fingerprints to define paths for corresponding pieces of data.Type: GrantFiled: March 3, 2020Date of Patent: December 27, 2022Assignee: NetApp, Inc.Inventors: Saeed Ghanbari, Barry Patrick Benight, Deepak Raghu Kenchammana-Hosekote, Shiva Chaitanya
-
Patent number: 11256424Abstract: In order to reduce write tail latency, a storage system generates redundant write requests when performing a storage operation for an object. The storage operation is determined to be effectively complete when a minimum number of write requests have completed. For example, the storage system may generate twelve write requests and also generate four redundant write requests for a total of sixteen write requests. The storage system considers the object successfully stored once twelve of the sixteen writes complete successfully. To generate the redundant writes, the storage system may use replication or erasure coding. For replication, the storage system may issue a redundant write request for each of n chunks being written. For erasure coding, the storage system may use rateless codes which can generate unlimited number of parity chunks or use an n+k+k? erasure code which generates an additional k? encoded chunks, in place of an n+k erasure code.Type: GrantFiled: August 6, 2019Date of Patent: February 22, 2022Assignee: NETAPP, INC.Inventors: Suganthi Dewakar, Xing Lin, Junji Zhi, Deepak Raghu Kenchammana-Hosekote
-
Patent number: 11232160Abstract: A data management services architecture includes architectural components that run in both a storage and compute domains. The architectural components redirect storage requests from the storage domain to the compute domain, manage resources allocated from the compute domain, ensure compliance with a policy that governs resource consumption, deploy program code for data management services, dispatch service requests to deployed services, and monitor deployed services. The architectural components also include a service map to locate program code for data management services, and service instance information for monitoring deployed services and dispatching requests to deployed services. Since deployed services can be stateless or stateful, the services architecture also includes state data for the stateful services, with supporting resources that can expand or contract based on policy and/or service demand. The architectural components also include containers for the deployed services.Type: GrantFiled: April 5, 2019Date of Patent: January 25, 2022Assignee: NetApp, Inc.Inventors: Deepak Raghu Kenchammana-Hosekote, Shiva Chaitanya, Saeed Ghanbari, Barry Patrick Benight, David Anthony Slik
-
Publication number: 20200401632Abstract: A data management services architecture includes architectural components that run in both a storage and compute domains. The architectural components redirect storage requests from the storage domain to the compute domain, manage resources allocated from the compute domain, ensure compliance with a policy that governs resource consumption, deploy program code for data management services, dispatch service requests to deployed services, and monitor deployed services. The architectural components also include a service map to locate program code for data management services, and service instance information for monitoring deployed services and dispatching requests to deployed services. Since deployed services can be stateless or stateful, the services architecture also includes state data for the stateful services, with supporting resources that can expand or contract based on policy and/or service demand. The architectural components also include containers for the deployed services.Type: ApplicationFiled: September 7, 2020Publication date: December 24, 2020Inventors: Deepak Raghu Kenchammana-Hosekote, Shiva Chaitanya, Saeed Ghanbari, Barry Patrick Benight, David Anthony Slik
-
Patent number: 10769212Abstract: A data management services architecture includes architectural components that run in both a storage and compute domains. The architectural components redirect storage requests from the storage domain to the compute domain, manage resources allocated from the compute domain, ensure compliance with a policy that governs resource consumption, deploy program code for data management services, dispatch service requests to deployed services, and monitor deployed services. The architectural components also include a service map to locate program code for data management services, and service instance information for monitoring deployed services and dispatching requests to deployed services. Since deployed services can be stateless or stateful, the services architecture also includes state data for the stateful services, with supporting resources that can expand or contract based on policy and/or service demand. The architectural components also include containers for the deployed services.Type: GrantFiled: July 31, 2015Date of Patent: September 8, 2020Assignee: NetApp Inc.Inventors: Deepak Raghu Kenchammana-Hosekote, Shiva Chaitanya, Saeed Ghanbari, Barry Patrick Benight, David Anthony Slik
-
Publication number: 20200201830Abstract: A deduplication service can be provided to a storage domain from a services framework that expands and contracts to both meet service demand and to conform to resource management of a compute domain. The deduplication service maintains a fingerprint database and reference count data in compute domain resources, but persists these into the storage domain for use in the case of a failure or interruption of the deduplication service in the compute domain. The deduplication service responds to service requests from the storage domain with indications of paths in a user namespace and whether or not a piece of data had a fingerprint match in the fingerprint database. The indication of a match guides the storage domain to either store the piece of data into the storage backend or to reference another piece of data. The deduplication service uses the fingerprints to define paths for corresponding pieces of data.Type: ApplicationFiled: March 3, 2020Publication date: June 25, 2020Inventors: Saeed Ghanbari, Barry Patrick Benight, Deepak Raghu Kenchammana-Hosekote, Shiva Chaitanya
-
Patent number: 10635585Abstract: In an on-chip copy process, performed by a storage device, data is copied from a plurality of Single Level Cell (SLC) blocks of non-volatile three-dimensional memory (e.g., 3D flash memory) in a respective memory die to a Multilevel Cell (MLC) block of the same memory die. A copy of source data from a respective SLC block is interleaved with a copy of source data from one or more other SLC blocks in the memory die to produce interleaved source data. Each source data copy that is interleaved is rotated by an offset assigned to the respective SLC block from which the source data is copied, and each respective SLC block in the plurality of SLC blocks is assigned a distinct offset. Each distinct set of the interleaved source data is written to a distinct respective MLC page of the MLC block.Type: GrantFiled: June 15, 2018Date of Patent: April 28, 2020Assignee: Western Digital Technologies, Inc.Inventors: Abhilash R. Kashyap, Gautam A. Dusija, Deepak Raghu, Chris Nga Yee Yip
-
Patent number: 10621151Abstract: A deduplication service can be provided to a storage domain from a services framework that expands and contracts to both meet service demand and to conform to resource management of a compute domain. The deduplication service maintains a fingerprint database and reference count data in compute domain resources, but persists these into the storage domain for use in the case of a failure or interruption of the deduplication service in the compute domain. The deduplication service responds to service requests from the storage domain with indications of paths in a user namespace and whether or not a piece of data had a fingerprint match in the fingerprint database. The indication of a match guides the storage domain to either store the piece of data into the storage backend or to reference another piece of data. The deduplication service uses the fingerprints to define paths for corresponding pieces of data.Type: GrantFiled: September 25, 2015Date of Patent: April 14, 2020Assignee: NetApp Inc.Inventors: Saeed Ghanbari, Barry Patrick Benight, Deepak Raghu Kenchammana-Hosekote, Shiva Chaitanya
-
Patent number: 10523786Abstract: I/O bandwidth reduction using storage-level common page information is implemented by a storage server, in response to receiving a request from a client for a page stored at a first virtual address, determining that the first virtual address maps to a page that is a duplicate of a page stored at a second virtual address or that the first and second virtual addresses map to a deduplicated page within a storage system, and transmitting metadata to the client mapping the first virtual address to a second virtual address that also maps to the deduplicated page. For one embodiment, the metadata is transmitted in anticipation of a request for the redundant/deduplicated page via the second virtual address. For an alternate embodiment, the metadata is sent in response to a determination that a page that maps to the second virtual address was previously sent to the client.Type: GrantFiled: June 22, 2018Date of Patent: December 31, 2019Assignee: NetApp Inc.Inventors: Deepak Raghu Kenchammana-Hosekote, Michael R. Eisler, Arthur F. Lent, Rahul Iyer, Shravan Gaonkar
-
Publication number: 20190361612Abstract: In order to reduce write tail latency, a storage system generates redundant write requests when performing a storage operation for an object. The storage operation is determined to be effectively complete when a minimum number of write requests have completed. For example, the storage system may generate twelve write requests and also generate four redundant write requests for a total of sixteen write requests. The storage system considers the object successfully stored once twelve of the sixteen writes complete successfully. To generate the redundant writes, the storage system may use replication or erasure coding. For replication, the storage system may issue a redundant write request for each of n chunks being written. For erasure coding, the storage system may use rateless codes which can generate unlimited number of parity chunks or use an n+k+k? erasure code which generates an additional k? encoded chunks, in place of an n+k erasure code.Type: ApplicationFiled: August 6, 2019Publication date: November 28, 2019Inventors: Suganthi Dewakar, Xing Lin, Junji Zhi, Deepak Raghu Kenchammana-Hosekote
-
Publication number: 20190354478Abstract: In an on-chip copy process, performed by a storage device, data is copied from a plurality of Single Level Cell (SLC) blocks of non-volatile three-dimensional memory (e.g., 3D flash memory) in a respective memory die to a Multilevel Cell (MLC) block of the same memory die. A copy of source data from a respective SLC block is interleaved with a copy of source data from one or more other SLC blocks in the memory die to produce interleaved source data. Each source data copy that is interleaved is rotated by an offset assigned to the respective SLC block from which the source data is copied, and each respective SLC block in the plurality of SLC blocks is assigned a distinct offset. Each distinct set of the interleaved source data is written to a distinct respective MLC page of the MLC block.Type: ApplicationFiled: June 15, 2018Publication date: November 21, 2019Inventors: Abhilash R. Kashyap, Gautam A. Dusija, Deepak Raghu, Chris Nga Yee Yip
-
Patent number: 10379754Abstract: A device includes a memory device and a controller. The controller is coupled to the memory device. The controller is configured to, in response to receiving a request to perform a memory access at the memory device, determine that the memory device has a characteristic indicative of a temperature crossing. The controller is also configured to, in response to determining that the memory device has the characteristic indicative of the temperature crossing, determine that the memory device satisfies an availability criterion. The controller is further configured to, in response to determining that the memory device satisfies the availability criterion, increase a temperature of the memory device by performing memory operations on the memory device until detecting a condition related to the temperature.Type: GrantFiled: January 20, 2018Date of Patent: August 13, 2019Assignee: WESTERN DIGITAL TECHNOLOGIES, INC.Inventors: Philip David Reusswig, Nian Niles Yang, Grishma Shah, Deepak Raghu, Preeti Yadav, Prasanna Desai Sudhir Rao, Smita Aggarwal, Dana Lee
-
Patent number: 10373696Abstract: A method for writing data to a NAND flash memory is disclosed, having steps of writing a first set of data to a first memory block, writing a second set of data to a second memory block, writing a third set of data to a third memory block and writing a fourth set of data to a XNOR memory block.Type: GrantFiled: August 17, 2018Date of Patent: August 6, 2019Assignee: Western Digital Technologies, Inc.Inventors: Gautam Ashok Dusija, Aaron Lee, Mrinal Kochar, Deepak Raghu
-
Publication number: 20190238640Abstract: A data management services architecture includes architectural components that run in both a storage and compute domains. The architectural components redirect storage requests from the storage domain to the compute domain, manage resources allocated from the compute domain, ensure compliance with a policy that governs resource consumption, deploy program code for data management services, dispatch service requests to deployed services, and monitor deployed services. The architectural components also include a service map to locate program code for data management services, and service instance information for monitoring deployed services and dispatching requests to deployed services. Since deployed services can be stateless or stateful, the services architecture also includes state data for the stateful services, with supporting resources that can expand or contract based on policy and/or service demand. The architectural components also include containers for the deployed services.Type: ApplicationFiled: April 5, 2019Publication date: August 1, 2019Inventors: Deepak Raghu Kenchammana-Hosekote, Shiva Chaitanya, Saeed Ghanbari, Barry Patrick Benight, David Anthony Slik
-
Publication number: 20190238641Abstract: A data management services architecture includes architectural components that run in both a storage and compute domains. The architectural components redirect storage requests from the storage domain to the compute domain, manage resources allocated from the compute domain, ensure compliance with a policy that governs resource consumption, deploy program code for data management services, dispatch service requests to deployed services, and monitor deployed services. The architectural components also include a service map to locate program code for data management services, and service instance information for monitoring deployed services and dispatching requests to deployed services. Since deployed services can be stateless or stateful, the services architecture also includes state data for the stateful services, with supporting resources that can expand or contract based on policy and/or service demand. The architectural components also include containers for the deployed services.Type: ApplicationFiled: April 5, 2019Publication date: August 1, 2019Inventors: Deepak Raghu Kenchammana-Hosekote, Shiva Chaitanya, Saeed Ghanbari, Barry Patrick Benight, David Anthony Slik
-
Publication number: 20190057750Abstract: A method for writing data to a NAND flash memory is disclosed, having steps of writing a first set of data to a first memory block, writing a second set of data to a second memory block, writing a third set of data to a third memory block and writing a fourth set of data to a XNOR memory block.Type: ApplicationFiled: August 17, 2018Publication date: February 21, 2019Inventors: Gautam Ashok DUSIJA, Aaron Lee, Mrinal Kochar, Deepak Raghu
-
Publication number: 20180309852Abstract: I/O bandwidth reduction using storage-level common page information is implemented by a storage server, in response to receiving a request from a client for a page stored at a first virtual address, determining that the first virtual address maps to a page that is a duplicate of a page stored at a second virtual address or that the first and second virtual addresses map to a deduplicated page within a storage system, and transmitting metadata to the client mapping the first virtual address to a second virtual address that also maps to the deduplicated page. For one embodiment, the metadata is transmitted in anticipation of a request for the redundant/deduplicated page via the second virtual address. For an alternate embodiment, the metadata is sent in response to a determination that a page that maps to the second virtual address was previously sent to the client.Type: ApplicationFiled: June 22, 2018Publication date: October 25, 2018Inventors: Deepak Raghu KENCHAMMANA-HOSEKOTE, Michael R. EISLER, Arthur F. LENT, Rohul IYER, Shravan GAONKAR