Abstract: In some embodiments, a multiple-data-storage-devices cartridge can implement a method of writing data via a data range application programming interface (“API”). The method can include: receiving a write request from a requester device, wherein the write request is a direct, broadcast or multicast, or fanout message and includes a size indication for a contiguous range of data; responsive to receiving the write request, sending a response message to the requester device indicating an intent to store the contiguous range of data; receiving the contiguous range of data from the requester device; powering on a target data storage device from amongst data storage devices within the cartridge while keeping at least another data storage device in the cartridge powered off; and writing the contiguous range of data to the target data storage device.

Abstract: A method includes reading a superblock of a read-only replica of a source virtual volume in a source virtual storage partition associated with a source aggregate of a source storage system at the destination storage system, modifying the superblock of the read-only replica in a memory of the destination storage system, and associating the modified superblock with one or more virtual volume block number(s) configured to be previously associated with the superblock of the read-only replica of the source virtual volume without initiating a destination consistency point (DCP) at the destination storage system to render the destination virtual volume writable. The method also includes modifying a disk group label to reflect an association of the destination storage disk with the writable destination virtual volume, and initiating DCP to ensure that the modified superblock and the modified disk group label are flushed to the destination storage disk.

Abstract: A novel technique for improving throughput in a multi-core system in which data is processed according to a producer-consumer relationship by eliminating latencies caused by compulsory cache misses. The producer and consumer entities run as multiple slices of execution. Each such slice has an associated execution context that comprises of the code and data that particular slice would access. The execution contexts of the producer and consumer slices are small enough to fit in the processor caches simultaneously. When a producer entity scheduled on a first core completed production of data elements as constrained by the size of cache memories, a consumer entity is scheduled on that same core to consume the produced data elements. Meanwhile, a second slice of the producer entity is moved to another core and a second slice of a consumer entity is scheduled to consume elements produced by the second slice of the producer.

Abstract: In at least one embodiment, a method of metering lifespan consumption of data storage devices in a multiple-data-storage-devices enclosure is disclosed. The method includes: receiving a storage access request; identifying a first data storage device within the enclosure as being targeted by the storage access request, wherein the enclosure includes two or more data storage devices; accessing the first data storage device in response to the storage access request; and in response to the identifying or the accessing, updating a record of a lifespan consumption meter assigned to the first data storage device.

Abstract: Various embodiments are directed to techniques for dynamically adjusting a maximum rate of throughput for accessing data stored within a volume of storage space of a storage cluster system based on the amount of that data that is stored within that volume. An apparatus includes an access component to monitor an amount of client device data stored within a volume defined within a storage device coupled to a first node, and to perform a data access command received from a client device via a network to alter the client device data stored within the volume; and a policy component to limit a rate of throughput at which at least the client device data within the volume is exchanged as part of performance of the data access command to a maximum rate of throughput, and to calculate the maximum rate of throughput based on the stored amount.

Abstract: Techniques for operating a storage system are disclosed. A read request with an object identifier for a data object is received. A synchronous group of data storage devices across a plurality of enclosures is identified. The synchronous group is associated with the object identifier. A request is sent to the plurality of enclosures to synchronously activate the data storage devices in the synchronous group. After sending the request, data fragments associated with the object identifier are retrieved from the synchronous group of data storage devices. The data fragments are erasure decoded into a contiguous data range to reconstruct the data object.

Abstract: A write allocation technique extends a conventional write allocation procedure employed by a write anywhere file system of a storage system. A write allocator of the file system implements the extended write allocation technique in response to an event in the file system. The extended write allocation technique efficiently allocates blocks, and frees blocks, to and from a virtual volume (vvol) of an aggregate. The aggregate is a physical volume comprising one or more groups of disks, such as RAID groups, underlying one or more vvols of the storage system. The aggregate has its own physical volume block number (pvbn) space and maintains metadata, such as block allocation structures, within that pvbn space. Each vvol also has its own virtual volume block number (vvbn) space and maintains metadata, such as block allocation structures, within that vvbn space.

Abstract: Technology is disclosed for deferring storage operations (e.g., writes or reads) during hostile events. When a data storage device experiences a hostile event, e.g., a vibration, shock, etc. contact by a head of the data storage device with a disk surface can cause errors or indeed damage. The technology can cause a data storage device to suspend storage operations until the hostile event is no longer detected.

Abstract: A system and method for prioritized queues is provided. A plurality of queues are organized to enable long-running operations to be directed to a long running queue operation, while faster operations are directed to a non-long running operation queue. When an operation request is received, a determination is made whether it is a long-running operation, and, if so, the operation is placed in a long-running operation queue. When the processor core that is executing long-running operations is ready for the next operation, it removes an operation from the long-running operation queue and processes the operation.

Abstract: Described herein is a storage system having hierarchical levels of storage functions. The storage system may comprise one or more hierarchical levels, each hierarchical level comprising a server pool of one or more physical servers. Each hierarchical level may be assigned to perform a particular set of storage functions. Each physical server may implement one or more VMs, each VM executing a storage operating system that provides an overall set of storage functions. Each VM is configured to perform only the set of storage functions assigned to the hierarchical level on which the VM executes. The set of storage functions assigned to a VM may comprise a sub-set of the overall storage functions of the storage operating system. In some embodiments, VMs of a first hierarchical level provide storage transaction functions and VMs of a second hierarchical level provide storage access functions.

Abstract: Example embodiments provide various techniques for locating cryptographic keys stored in a cache. The cryptographic keys are temporarily stored in the cache until retrieved for use in a cryptographic operation. The cryptographic key may be located or found through reference to its cryptographic key identifier. In an example, a particular cryptographic key may be needed for a cryptographic operation. The cache is first searched to locate this cryptographic key. To locate the cryptographic key, the cryptographic key identifier that is associated with this cryptographic key is provided. In turn, the cryptographic key identifier may be used as an address into the cache. The address identifies a location of the cryptographic key within the cache. The cryptographic key may then be retrieved from the cache at the identified address and then used in the cryptographic operation.

Abstract: Described herein is a system and method for managing environment metadata of a server system during a backup session between the server system and a storage system. In some embodiments, during the backup session, the server system sends a sequence of blocks or files comprising backup data and environment metadata to the storage system. The backup data may comprise data on the server that is typically sent to the storage system during a backup session, such as client or application data. The environment metadata may include information describing the server system, such as information describing hardware or software components of the server system or server metrics of the server system. In these embodiments, operations for processing environment metadata may be included with the operations for processing backup data during the backup session.

Abstract: Network storage system configuration via a network is disclosed. A network address assignment component is configured to listen for network discovery requests over the network. Responsive to receiving a network discovery request from a network storage system, one or more candidate network addresses are (e.g., randomly) generated until an available candidate network address is generated. For example, if a first candidate network address is determined as available (e.g., not used by another device within the network), then the first candidate network address is offered and/or assigned to the network storage system as an initial configuration network address that may be used to provide configuration access to the network storage system, otherwise a second candidate network address is generated and/or evaluated for availability. As such, configuration access may be provided over the network to the network storage system regardless of whether the network comprises an IP address assigning (e.g., DHCP) server.

Abstract: A write request including payload data is received. The payload data of the write request is stored in a staging area of a storage manager. A transformation pipeline is determined based, at least in part, on an attribute of the write request. The transformation pipeline is queued for execution. Data fragments are generated based, at least in part, on the payload data and the transformation pipeline. The data fragments are transmitted to a plurality of enclosures.

Abstract: Updating data in a distributed system, in which a data coordinator receives a proposed change to a data element, locks the data element, and sends an invalidation command to nodes in the distributed system. If all nodes acknowledge the invalidation command, the data coordinator updates the data element locally and unlocks the data element. If not all nodes acknowledge the invalidation command, the data coordinator terminates the proposed change and unlocks the data element. Each node that invalidated the data element requests the data element. The data coordinator returns its current value. If the value is changed, all nodes request and receive the update. If a node did not invalidate, it will not request an update, but the value will not have changed so all requesting nodes receive the previous value. Thus, all nodes have the same value for the data element and consistency is maintained throughout the system.

Abstract: An indication of an event is received at a storage controller. The indication of the event corresponds to a first severity. It is determined that the event is associated with a first stream of commands. It is determined whether the indication of the event is the first indication of the event received by the storage controller. If the indication of the event is the first indication of the event received by the storage controller, a maximum allowed count of in-flight commands to be less than a current count of in-flight commands is set. If the indication of the event is not the first indication of the event received by the storage controller, it is determined that the first severity is greater than a second severity corresponding to a previously received indication. If the first severity is greater than the second severity, the maximum allowed count of in-flight commands is decreased.

Abstract: Techniques for operating a storage front-end system are disclosed. The techniques include identifying a synchronous group of data storage devices across two or more enclosures, each of which comprise a plurality of data storage devices. Data across the data storage devices is accessible by a storage front-end system as an aggregate memory space. The techniques further include sending an activation request to the enclosures to synchronously activate the data storage devices in the synchronous group and performing a data maintenance task in the aggregate memory space of the data storage devices.

Abstract: Technology is disclosed for managing data in a distributed file system (“the technology”). The technology can gather metadata information associated with the data stored within the distributed file system, create a secondary namespace within a local file system of a local host using the gathered metadata information and store the gathered metadata information as files within the secondary namespace. Further, when a request to create a PPI of the distributed file system is received, the technology can create a PPI of the secondary namespace using a PPI creation feature of the local file system.

Abstract: A storage device failure in a computer storage system can be analyzed by the storage system by examining relevant information about the storage device and its environment. Information about the storage device is collected in real-time and stored; this is an on-going process such that some information is continuously available. The information can include information relating to the storage device, such as input/output related information, and information relating to a storage shelf where the storage device is located, such as a status of adjacent storage devices on the shelf. All of the relevant information is analyzed to determine a reason for the storage device failure. Optionally, additional information may be collected and analyzed by the storage system to help determine the reason for the storage device failure. The analysis and supporting information can be stored in a log and/or presented to a storage system administrator to view.

Abstract: Disclosed are systems, computer-readable mediums, and methods for transforming data in a file system. As part of a recycling process, a determination is made that transformations should be attempted. A data block is determined to be in use by at least one user of the storage system. If a transformation should be attempted on the data block is determined. Parameters associated with the performance of the file system can be used in this determination. A type of transformation to be done is determined. The data block is transformed based upon the selected transformation. The transformed data block is written to the storage system. As part of the recycling process, the transformation requires no additional input/output requests.