Symantec Corporation

Veritas Technologies LLC

Brad Boyer

Anindya Banerjee

Ajay Salpekar

Kedar Shrikrishna Patwardhan

Ryan Lefevre

Freddy James

Mitul Kothari

Pooja Mahadik

Charles Silvers

Balemurughan Kumaresan

Bala Kumaresan

Madhav Buddhi

Sunil Kumar Tekkatte Subramanya

Meher Shah

Pramodh Pisupati

Nagaraj Shyam

Edwin Menze

Ashish Puri

Anurag Vora

Rachit Chadha

The disclosed computer-implemented method for write-once-read-many storage may include (1) receiving, at a file system on the computing device, a request to assign a write-once-read-many (WORM) attribute to a file, wherein the request is received from an application, (2) setting, in response to the request to assign the WORM attribute to the file, a WORM flag in an extended attribute associated with the file, and (3) associating with the file, in response to the setting of the WORM flag, a retention period attribute and read-only access until the end of the retention period. The provided systems and methods may provide per-file WORM support at a file system level using extended attributes of the file system. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for write-once-read-many storage

The disclosed computer-implemented method for delayed allocation in cluster storage may include (i) delegating, to a node attached to a storage cluster including one or more storage devices that include a group of allocation units, a subset of allocation units on the storage cluster to be held as a delayed allocation pool, (ii) receiving, from the node, a request to allocate allocation units on the storage cluster, (iii) deducting the number of allocation units from available allocation units in the delayed allocation pool, (iv) satisfying the allocation request by allocating allocation units not in the delayed allocation pool before allocating allocation units included in the delayed allocation pool, and (v) recalculating, based on the number of allocation units in the delayed allocation pool used to satisfy the allocation request, the number of available allocation units in the delayed allocation pool. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for delayed allocation in cluster storage

The disclosed computer-implemented method for efficiently moving data within a filesystem may include (1) partitioning, on a storage device, physical address space of a filesystem into a plurality of logical partitions, (2) allocating, on the storage device, at least one container of data block identifiers representing data blocks for each of the logical partitions, (3) maintaining, on the storage device, a partition map of values identifying the container of data block identifiers, the logical partitions, and at least one offset associated with each of the logical partitions, (4) sending, on the storage device, the data blocks from a source logical partition within the logical partitions to a target logical partition within the logical partitions, and (5) updating, on the storage device, the partition map based on the data blocks sent from the source logical partition to the target logical partition. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for efficiently moving data within a filesystem

A system and method for replicating a set of files from a source computer system to a target computer system are described. The underlying extent structure of the files may be preserved. For example, if an original file on the source computer system has a particular number of extents then the copy of the file created on the target computer system may have the same number of extents, where each respective extent in the copy represents the same byte range of the file as its corresponding extent in the original file. The file systems employed on the source computer system and the target computer system may support different extent types. The extent types of the original files stored on the source computer system may be preserved in the copies of the files on the target computer system.

Efficient file replication which preserves the underlying extent structure

A method of reading data from a partitioned directory incident to a serialized process. A first read and an offset value are received. A first data block in a modeled fully partitioned directory is identified based on the offset value and a predetermined number of entries associated with a buffer. It is determined whether the first data block in the fully partitioned directory is present in the actual partitioned directory. Zeros are written in the buffer if the first data block in the fully partitioned directory is not present in the actual partitioned directory otherwise the first data block associated with the actual partitioned directory is written to the buffer. A second data block is similarly read by a second read operation and written. The second data block is associated with a second subdirectory, selected based on a horizontal node traversal at a node level of said first subdirectory.

Method and system for efficiently reading a partitioned directory incident to a serialized process

A system and method for implementing clustered network file system lock management is provided. A failure of a first server node among a collection of nodes is detected. The first server node includes lock status data. The lock status data grants a first client exclusive access to data stored on a server storage device. The server storage device is coupled to the collection of server nodes. The lock status data is transferred to a second server node among the collection of server nodes. The first client is granted exclusive access to data stored on the server storage device, based on the lock status data transferred to the second server node from the first server node, in response to the transferring. Lock requests from the collection of clients are accepted, in response to the transferring.

System and method for implementing clustered network file system lock management

Systems and methods for extent reference count updates are presented. In one embodiment; a reference count update method includes: receiving an indication of new reference association with an extent of a shared storage component; generating reference count update log information for a reference count update log to indicate the new reference association with an extent of a shared storage component, wherein the altering occurs inline; forwarding a successful data update indicator to initiator of activity triggering the new reference association with the extent of the shared storage component; and updating a reference count table in accordance with the information in the reference count update log, wherein the updating is included in a background process.

Extent reference count update system and method

Growing community of inventors

San Jose, CA, United States of America

Brad Boyer