-
公开(公告)号：US12204784B1
公开(公告)日：2025-01-21
申请号：US18649906
申请日：2024-04-29
Applicant: NetApp, Inc.
Inventor： Anil Paul Thoppil , Ananthan Subramanian , Kevin Daniel Varghese , Garima Choudhary , Qinghua Zheng
Abstract: Systems and methods for performing a zero-copy volume move between nodes of a distributed storage system are provided. In one example, an approach for performing a zero-copy volume move is proposed in which volume data may be maintained in place within a storage pod and need not be copied to move a given volume between the source node and the destination node. In one embodiment, metadata (e.g., a top-most physical volume block number (PVBN) of a node tree representing the volume at issue) of a write-anywhere file system is copied from the source node to the destination node. Since the storage pod is associated with a global PVBN space that is visible and accessible to all nodes of the distributed storage system, as a result of copying the top-mode PVBN of the volume to the destination node, anything below the top-most PVBN will automatically be visible to the destination node.
-
公开(公告)号：US20240370410A1
公开(公告)日：2024-11-07
申请号：US18773483
申请日：2024-07-15
Applicant: NetApp, Inc.
Inventor： Ravikanth Dronamraju , Ananthan Subramanian , Daniel McCarthy , Christopher Cason , Arindam Banerjee
IPC: G06F16/188 , G06F9/50 , G06F16/182
Abstract: In various examples, data storage is managed using a distributed storage management system that is resilient. Data blocks of a logical block device may be distributed across multiple nodes in a cluster. The logical block device may correspond to a file system volume associated with a file system instance deployed on a selected node within a distributed block layer of a distributed file system. Each data block may have a location in the cluster identified by a block identifier associated with each data block. Each data block may be replicated on at least one other node in the cluster. A metadata object corresponding to a logical block device that maps to the file system volume may be replicated on at least another node in the cluster. Each data block and the metadata object may be hosted on virtualized storage that is protected using redundant array independent disks (RAID).
-
公开(公告)号：US20240319921A1
公开(公告)日：2024-09-26
申请号：US18731634
申请日：2024-06-03
Applicant: NetApp, Inc.
Inventor： Ananthan Subramanian , Matthew Fontaine Curtis-Maury , Vinay Devadas , Bulli Venkata Rajesh Vipperla
IPC: G06F3/06 , G06F15/173
CPC classification number: G06F3/0659 , G06F3/0619 , G06F3/064 , G06F3/067 , G06F15/17331
Abstract: Techniques are provided for forwarding operations to bypass persistent memory. A modify operation, targeting an object, may be received at a persistent memory tier of a node. If a forwarding policy indicates that forwarding is not enabled for the modify operation and the target object, then the modify operation is executed through a persistent memory file system. If the forwarding policy indicates that forwarding is enabled for the modify operation and the target object, then the modify operation is forwarded to a file system tier as a forwarded operation for execution through a storage file system.
-
公开(公告)号：US20240143210A1
公开(公告)日：2024-05-02
申请号：US18399555
申请日：2023-12-28
Applicant: NetApp Inc.
Inventor： Kevin Daniel Varghese , Ananthan Subramanian , Asif Imtiyaz Pathan
IPC: G06F3/06
CPC classification number: G06F3/064 , G06F3/0619 , G06F3/0656 , G06F3/0659 , G06F3/067
Abstract: Techniques are provided for journal replay optimization. A distributed storage architecture can implement a journal within memory for logging write operations into log records. Latency of executing the write operations is improved because the write operations can be responded back to clients as complete once logged within the journal without having to store the data to higher latency disk storage. If there is a failure, then a replay process is performed to replay the write operations logged within the journal in order to bring a file system up-to-date. The time to complete the replay of the write operations is significantly reduced by caching metadata (e.g., indirect blocks, checksums, buftree identifiers, file block numbers, and consistency point counts) directly into log records. Replay can quickly access this metadata for replaying the write operations because the metadata does not need to be retrieved from the higher latency disk storage into memory.
-
公开(公告)号：US20240012571A1
公开(公告)日：2024-01-11
申请号：US18357206
申请日：2023-07-24
Applicant: NetApp Inc.
Inventor： Ganga Bhavani Kondapalli , Kevin Daniel Varghese , Ananthan Subramanian , Cheryl Marie Thompson , Anil Paul Thoppil
CPC classification number: G06F11/1076 , G06F11/1004 , G06F11/1435 , G06F21/602
Abstract: Techniques are provided for multi-tier write allocation. A storage system may store data within a multi-tier storage environment comprising a first storage tier (e.g., storage devices maintained by the storage system), a second storage tier (e.g., a remote object store provided by a third party storage provider), and/or other storage tiers. A determination is made that data (e.g., data of a write request received by the storage system) is to be stored within the second storage tier. The data is stored into a staging area of the first storage tier. A second storage tier location identifier, for referencing the data according to a format utilized by the second storage tier, is assigned to the data and provided to a file system hosting the data. The data is then destaged from the staging area into the second storage tier, such as within an object stored within the remote object store.
-
Patent Agency Ranking
公开(公告)号：US11861199B2
公开(公告)日：2024-01-02
申请号：US17871951
申请日：2022-07-24
Applicant: NetApp Inc.
Inventor： Ananthan Subramanian , Matthew Fontaine Curtis-Maury , Ram Kesavan , Vinay Devadas
CPC classification number: G06F3/064 , G06F3/0619 , G06F3/0631 , G06F3/0665 , G06F3/0679 , G06F9/30189 , G06F9/4498 , G06F11/0772
Abstract: Techniques are provided for data management across a persistent memory tier and a file system tier. A block within a persistent memory tier of a node is determined to have up-to-date data compared to a corresponding block within a file system tier of the node. The corresponding block may be marked as a dirty block within the file system tier. Location information of a location of the block within the persistent memory tier is encoded into a container associated with the corresponding block. In response to receiving a read operation, the location information is obtained from the container. The up-to-date data is retrieved from the block within the persistent memory tier using the location information for processing the read operation.
-
公开(公告)号：US11836363B2
公开(公告)日：2023-12-05
申请号：US17750793
申请日：2022-05-23
Applicant: NetApp Inc.
Inventor： Abdul Basit , Ananthan Subramanian , Ram Kesavan , Matthew Fontaine Curtis-Maury
IPC: G06F3/06
CPC classification number: G06F3/0631 , G06F3/0604 , G06F3/064 , G06F3/065 , G06F3/0679
Abstract: Techniques are provided for block allocation for persistent memory during aggregate transition. In a high availability pair including first and second nodes, the first node makes a determination that control of a first aggregate is to transition from the first node to the second node. A portion of available free storage space is allocated from a first persistent memory of the first node as allocated pages within the first persistent memory. Metadata information for the allocated pages is updated with an identifier of the first aggregate to create updated metadata information reserving the allocated pages for the first aggregate. The updated metadata information is mirrored to the second node, so that the second node also reserves those pages. Control of the first aggregate is transitioned to the second node. As a result, the nodes do not attempt allocating the same free pages to different aggregates during a transition.
-
公开(公告)号：US11803316B2
公开(公告)日：2023-10-31
申请号：US17868260
申请日：2022-07-19
Applicant: NetApp, Inc.
Inventor： Kevin Daniel Varghese , Ananthan Subramanian , Parag Sarfare , Sandeep Yadav , Suhas Urkude , Rajesh Khandelwal
IPC: G06F3/06
CPC classification number: G06F3/0644 , G06F3/064 , G06F3/067 , G06F3/0613 , G06F3/0623 , G06F3/0659
Abstract: A method and system for co-locating journaling and data storage based on write requests. A write request that includes metadata and data is received from a client. A logical storage unit for storing the metadata and the data is identified. The logical storage unit is divided into a journal partition and a volume partition. The journal partition includes a first log and a second log. Which of the first log and the second log is an active log and which of the first log and the second log is an inactive log are identified. The metadata is recorded in a first location in the active log and the data is recorded in a second location in the active log during a single I/O operation. A reply is sent to the client after the metadata and the data are recorded in the journal partition.
-
公开(公告)号：US20230342053A1
公开(公告)日：2023-10-26
申请号：US17728441
申请日：2022-04-25
Applicant: NetApp Inc.
Inventor： Kevin Daniel Varghese , Ananthan Subramanian , Asif Imtiyaz Pathan
IPC: G06F3/06
CPC classification number: G06F3/064 , G06F3/0659 , G06F3/0656 , G06F3/0619 , G06F3/067
Abstract: Techniques are provided for journal replay optimization. A distributed storage architecture can implement a journal within memory for logging write operations into log records. Latency of executing the write operations is improved because the write operations can be responded back to clients as complete once logged within the journal without having to store the data to higher latency disk storage. If there is a failure, then a replay process is performed to replay the write operations logged within the journal in order to bring a file system up-to-date. The time to complete the replay of the write operations is significantly reduced by caching metadata (e.g., indirect blocks, checksums, buftree identifiers, file block numbers, and consistency point counts) directly into log records. Replay can quickly access this metadata for replaying the write operations because the metadata does not need to be retrieved from the higher latency disk storage into memory.
-
公开(公告)号：US20230251932A1
公开(公告)日：2023-08-10
申请号：US18302212
申请日：2023-04-18
Applicant: NetApp Inc.
Inventor： Matthew Fontaine Curtis-Maury , Ram Kesavan , Ananthan Subramanian , Abdul Basit , Vinay Devadas , Yash Hetal Trivedi
IPC: G06F11/14 , G06F13/16 , G06F16/182
CPC classification number: G06F11/1435 , G06F13/1668 , G06F16/183
Abstract: Techniques are provided for persistent memory file system reconciliation. As part of the persistent memory file system reconciliation, high level file system metadata associated with a persistent memory file system of persistent memory is reconciled. Client access to the persistent memory file system is inaccessible until reconciliation of the high level file system metadata has completed. A first scanner is executed to traverse pages of the persistent memory in order to fix local inconsistencies associated with the pages. A local inconsistency of a first set of metadata or data of a page is fixed using a second set of metadata or data of the page. The first scanner is executed asynchronously in parallel with processing client I/O directed to the persistent memory file system.
-
-
-
-
-
-
-
-
-
Search Results
167
records
(took 0.026 seconds)
