This disclosure provides for improvements in managing multi-drive, multi-die or multi-plane NAND flash memory. In one embodiment, the host directly assigns physical addresses and performs logical-to-physical address translation in a manner that reduces or eliminates the need for a memory controller to handle these functions, and initiates functions such as wear leveling in a manner that avoids competition with host data accesses. A memory controller optionally educates the host on array composition, capabilities and addressing restrictions. Host software can therefore interleave write and read requests across dies in a manner unencumbered by memory controller address translation. For multi-plane designs, the host writes related data in a manner consistent with multi-plane device addressing limitations. The host is therefore able to “plan ahead” in a manner supporting host issuance of true multi-plane read commands.

A system-on-chip is connected to a first memory device and a second memory device. The system-on-chip comprises a memory controller configured to control an interleaving access operation on the first and second memory devices. A modem processor is configured to provide an address for accessing the first or second memory devices. A linear address remapping logic is configured to remap an address received from the modem processor and to provide the remapped address to the memory controller. The memory controller performs a linear access operation on the first or second memory device in response to receiving the remapped address.

An information handling system may include a processor and a storage subsystem. The storage subsystem may include a non-expander backplane, a first plurality of storage resources coupled to the processor via the non-expander backplane, and a second plurality of storage resources coupled to the processor via a communication path that does not include the non-expander backplane. The information handling system may be configured to provide slot numbers for the storage resources according to a numbering scheme in which a storage resource from the first plurality of storage resources and a storage resource from the second plurality of storage resources have the same slot number.

A method for execution by a computing device of a dispersed storage network (DSN). The method begins with obtaining a plurality of write requests. The method continues where for a write request of the plurality of write requests, the computing device generates a vault identification and a generation number. The method continues where the computing device obtains a rounded timestamp and a capacity factor and generates a temporary object number based on the rounded timestamp and the capacity factor. The method continues where the computing device generates a temporary source name based on the vault identification, the generation number, and the temporary object number. The method continues where the computing device identifies a set of storage units of a plurality of sets of storage units of the DSN based on the temporary source name.

Several embodiments include a host computer coupled to a solid state drive (SSD). The filesystem of the host computer can receive a write pointer from the firmware of the SSD. The write pointer can reference a next available page to an erase block in the SSD. In response to a file write request to store a target file, the filesystem can determine a logical address range to store at least a portion of the target file based on the file write request and the write pointer. The filesystem can then generate a sector write command to send to the SSD. The sector write command can specify the determined logical address range.

A technique for maintaining synchronization between two arrays includes assigning one array to be a preferred array and the other array to be a non-preferred array. When write requests are received at the preferred array, the writes are applied locally first and then applied remotely. However, when write requests are received at the non-preferred array, such writes are applied remotely first and then applied locally. Thus, writes are applied first on the preferred array and then on the non-preferred array, regardless of whether the writes are initially received at the preferred array or the non-preferred array.

Systems and techniques for reducing probabilistic filter query latency are described herein. A query for a probabilistic filter that is stored on a first media may be received from a caller. In response to receiving the query, cached segments of the probabilistic filter stored on a second media may be obtained. Here, the probabilistic filter provides a set membership determination that is conclusive in a determination that an element is not in a set. The query may be executed on the cached segments resulting in a partial query result. Retrieval of remaining data of the probabilistic filter from the first media to the second media may be initiated without intervention from the caller. Here, the remaining data corresponds to the query and data that is not in the cached segment. The partial query results may then be returned to the caller.

An illustrative method includes an object retention management system establishing a retention policy for a bucket of an object-based storage system, detecting an operation that causes an object to be stored within the bucket, and applying, based on the detecting of the operation, the retention policy to the object, wherein the retention policy prevents the object from being deleted or overwritten for a predefined time duration and the retention policy cannot be modified or disabled for the bucket by a user.

A storage infrastructure, device and associated method for storing compressed data is provided. Included is a method for compressing data on a storage device in a storage infrastructure, including: receiving a compressed extent from a host, wherein the compressed extent includes data compressed with entropy-coding-less data compression; receiving logical identification information about the compressed extent from the host; performing in-memory entropy encoding on the compressed extent to generate a compressed unit; storing the compressed unit in a physical memory; and in a case where the host is aware of the in-memory entropy encoding, reporting size information of the compressed unit back the host.

A recording device includes a plurality of storage modules and a recording controller. With respect to a writing request, the recording controller generates parity data and writes data in the respective plurality of modules by dividing the data. When an error is detected with respect to a reading request, data of the error is restored from data and the parity data read from other recording modules. With respect to an initialization request of the storage module, the storage module to be initialized is specified from the plurality of storage modules, and an address conversion table is initialized. Moreover, identification information for identifying the initialized storage module is held. With respect to a request for cancelling the table initialization request of the storage module, reading of data from the storage module corresponding to the held identification information is processed as an error.