公开(公告)号：US20240291887A1

公开(公告)日：2024-08-29

申请号：US18654088

申请日：2024-05-03

Applicant: Commvault Systems, Inc.

Inventor： Lasaro CAMARGOS ,  Bharat Pundalik NAIK ,  Avinash LAKSHMAN ,  Deepak JAIN

IPC: H04L67/104 ,  G06F9/455 ,  G06F11/14 ,  G06F16/182 ,  G06F16/23 ,  G06F18/25 ,  G06V10/25 ,  G06V10/34 ,  G06V20/54 ,  G06V20/59 ,  G06V40/10 ,  H04N7/18 ,  H04N23/56 ,  H04N23/66

CPC classification number: H04L67/1046 ,  G06F9/45558 ,  G06F11/1425 ,  G06F16/182 ,  G06F16/2365 ,  G06F18/251 ,  G06V10/25 ,  G06V10/34 ,  G06V20/54 ,  G06V20/59 ,  G06V40/10 ,  G06V40/103 ,  H04L67/1048 ,  H04N7/181 ,  H04N7/188 ,  H04N23/56 ,  H04N23/66 ,  G06F2009/45583 ,  G06V2201/08

Abstract: In a running distributed data storage system that actively processes I/Os, metadata nodes are commissioned and decommissioned without taking down the storage system and without introducing interruptions to metadata or payload data I/O. The inflow of reads and writes continues without interruption even while new metadata nodes are in the process of being added and/or removed and the strong consistency of the system is guaranteed. Commissioning and decommissioning nodes within the running system enables streamlined replacement of permanently failed nodes and advantageously enables the system to adapt elastically to workload changes. An illustrative distributed barrier logic (the “view change barrier”) controls a multi-state process that controls a coordinated step-wise progression of the metadata nodes from an old view to a new normal. Rules for I/O handling govern each state until the state machine loop has been traversed and the system reaches its new normal.

公开(公告)号：US20240289300A1

公开(公告)日：2024-08-29

申请号：US18655558

申请日：2024-05-06

Applicant: Commvault Systems, Inc.

Inventor： Srividhya KAVAIPATTI ANANTHARAMAKRISHNAN ,  Lasaro CAMARGOS ,  Abhijith SHENOY ,  Xiangyu WANG ,  Avinash LAKSHMAN ,  Srinivas LAKSHMAN

IPC: G06F16/11 ,  G06F16/182

CPC classification number: G06F16/119 ,  G06F16/125 ,  G06F16/128 ,  G06F16/182

Abstract: A distributed data storage system comprises features for integration with application orchestrators such as Kubernetes, and includes a proprietary Container Storage Interface (CSI) driver. Features include setting snapshot scheduling and retention policies, and a “container data mover” that replicates data from a source to a distinct destination distributed data storage system. The migration may be configured one-to-one, one-to-many, unidirectional, and/or bi-directional. Metadata-based snapshots and metadata-based changed block tracking identify payload data to move from source to destination within application orchestrator frameworks at both ends. Payload data is migrated from source to destination using different techniques than those used for migrating metadata, e.g., kernel-to-kernel for copying payload data versus ordinary metadata writes. An illustrative barrier logic ensures that the migration follows a controlled progression of operations.

公开(公告)号：US20240152489A1

公开(公告)日：2024-05-09

申请号：US18413183

申请日：2024-01-16

Applicant: Commvault Systems, Inc.

Inventor： Avinash LAKSHMAN ,  Lasaro CAMARGOS ,  Deepak JAIN

IPC: G06F16/178 ,  G06F11/14 ,  G06F16/13 ,  G06F16/2457 ,  G06F16/2458

CPC classification number: G06F16/178 ,  G06F11/1464 ,  G06F16/137 ,  G06F16/24573 ,  G06F16/2471 ,  G06F16/182

Abstract: A client machine writes to and reads from a virtual disk on a remote storage platform. Metadata is generated and stored in replicas on different metadata nodes of the storage platform. A modified log-structured merge tree is used to store and compact string-sorted tables of metadata. During file storage and compaction, a consistent file identification scheme is used across all metadata nodes. A fingerprint file is calculated for each SST (metadata) file on disk that includes hash values corresponding to regions of the SST file. To synchronize, the fingerprint files of two SST files are compared, and if any hash values are missing from a fingerprint file, then the key-value-timestamp triples corresponding to these missing hash values are sent to the SST file that is missing them. The SST file is compacted with the missing triples to create a new version of the SST file. The synchronization is bi-directional.