Abstract: A data storage system includes storage devices and a processing subsystem executing software forming a lower-deck file system and an upper-deck file system. The lower-deck file system presents a volume file from which storage is provided to the upper-deck file system, and units of storage of the storage devices are reserved to the upper-deck file system. The volume file is fully provisioned based on the reserved units of storage so that an out-of-space condition is not presented to the upper-deck file system. Reserved units of storage are dynamically added to the volume file to increase its allocated size in response to demand from the upper-deck file system, and a direct operating mode is used in which a block address in the lower-deck file system is obtained by a predetermined calculation from a corresponding block address in the volume file.

Abstract: A data storage system includes storage devices and a processing subsystem executing software forming a lower-deck file system and an upper-deck file system. The lower-deck file system presents a volume file from which storage is provided to the upper-deck file system, and units of storage of the storage devices are allocable to the upper-deck file system but not reserved to it. The volume file is thinly provisioned, and additional units of storage are added dynamically to increase its allocated size in response to demand from the upper-deck file system. The lower-deck file system operates in a mapped mode in which a block address in the lower-deck file system is obtained by a generally arbitrary mapping (e.g., an Inode/IB tree) of a block address in the volume file.

Abstract: A data storage system employs a multi-level stack including a lower-deck file system and an upper-deck file system providing a file system interface to a file system consumer. The lower-deck file system presents a volume file to provide storage to the upper-deck file system. Storage is reserved to the upper-deck file system, and the volume file is fully provisioned so an out-of-space condition is not presented to the upper-deck file system. In an initial direct operating mode a block address in the lower-deck file system is obtained by a calculation from a corresponding block address in the volume file. Snapshots of a primary volume file are created and stored in respective snapshot volume files. The lower-deck file system transitions into a mapped mode using generally arbitrary mappings of block addresses of the primary volume file and snapshot volume files to obtain corresponding block addresses in the lower-deck file system.

Abstract: Techniques are described for copying data using a throttling mechanism to achieve a desired time delay. A request is received to copy a data portion from a source location of a first physical device to a target location of a second physical device. A desired average delay time is determined in accordance with a plurality of values including a throttle value affecting a rate at which data is copied from the source location to the target location. The request is partitioned into subrequests. The data portion is partitioned into a subportions. Each of the subrequests copies one of the subportions. The subrequests are performed whereby a time delay is introduced between at least two of the plurality of subrequests and whereby an average time delay with respect to each pair of consecutively issued subrequests is the desired average time delay.

Abstract: A technique forms contents of a compression container from a standalone container file system stored on the same data storage array on which the compression container is stored. Such a standalone container includes a container file which is formed by standalone blocks. The standalone blocks store host data and which are hierarchically related to each other. Upon receiving a compression command, the storage processor carries out a set of compression operations which include creating and storing the compression container in the data storage array. The compression container includes container files which are formed by compression blocks storing the host data and which are hierarchically related to each other.

Abstract: A system and method of operating a storage server in a data network for relocating one or more data blocks of a file, comprising creating a virtual block mapping pointer; and relocating one or more file system data.

Abstract: This invention is a system and a method for operating a storage server to provide read or write access to a data in a data network using a new architecture. The method of creating virtual block mapping pointer in response to a request by a client of the storage server to de-duplicate the file system data block or to allow compression of one or more file system data blocks into one or more physical data blocks. Further, the method relocates one or more file system data blocks from one part of the file system address space to another by using one or more virtual block mapping pointers that provides the mapping information for the one or more file system data blocks that are being relocated. The virtual block mapping pointer allows relocating of file system data blocks by same number of metadata operations regardless of number of files sharing the block that are being relocated and the state of those blocks (compressed or not).

Abstract: A system for non-destructively salvaging cemented concentric piping members by ramming the concentric piping members, thereby breaking the bond between the piping members and the concrete. The ramming of the concrete portions is accomplished by anchoring the cemented concentric piping members to an immovable base, then separating an outer pipe or casing and inner concentric pipes from each other by using an air hammer.