Abstract: The present disclosure includes apparatuses and methods related to a memory protocol with command priority. An example apparatus can execute a command that includes a read identification (RID) number based on a priority assigned to the RID number in a register. The apparatus can be a non-volatile dual in-line memory module (NVDIMM) device.

Abstract: Technologies are provided to ensure integrity of erasure coded data that is subject to read and write access from distributed processes. Multiple processes that access erasure coded data can be coordinated in an efficient, scalable and fault-tolerant manner so that integrity of the original data is maintained. The Technologies include a fault-tolerant access coordination protocol that ensures exclusive write access by a client. The coordination protocol achieves scalability by not relying on centralized components, and achieves efficiency and performance by piggy-packing access coordination messages on operations of the underlying erasure coding protocol.

Abstract: A method, computer program product and computer system are provided. A processor receives a host input/output write operation, wherein the host input/output write operation includes host metadata regarding data represented by the host input/output write operation. The processor stores the host input/output write operation in one or more physical storage data units. A processor assigns a priority to the one or more physical storage data units. In response to receiving a host volume delete command associated with at least one of the one or more physical storage data units, a processor prioritizes data units of the host volume for deletion based, at least in part, on the assigned priority of the data units of the host volume, wherein data units with a lower priority are permanently deleted before data units with a higher priority.

Abstract: Techniques for extending a truth table of a stacked memory system are provided. In an example, a storage system can include a stack of first memory die configured to store data and a logic die. The logic die can include an interface circuit configured to receive multiple memory requests from an external host using a first command bus, a second command bus, and a data bus, and a controller configured to interface with the stack of first memory die to store and retrieve the data from the stack of first memory die. The logic die can include a second memory having a faster access time than devices of the stack of first memory die, and the interface circuit can directly access the second memory in response to a first memory request of the multiple of memory requests.

Abstract: A first storage system compresses data relating to read and write by a primary site and stores the data in a first physical volume. A second storage system compresses data relating to read and write by a secondary site and stores the data in a second physical volume. When performing replication for transferring the data stored in the first physical volume of the first storage system to the second storage system and storing the data in the second physical volume, the first storage system and the second storage system determine, based on a compression scheme executable by the first storage system and a compression scheme executable by the second storage system, a compression scheme to be applied to transfer target data and transfer the transfer target data compressed by the determined compression scheme.

Abstract: A method includes performing a copyback operation comprising transferring, using an internal processing device, user data and header data corresponding to the user data from a first block of memory in a memory device to a register in the memory device, decoupling the user data from the header data, performing an error correction code (ECC) operation on updated header data using an external processing device, transferring, via the external processing device, the updated header data to the register, and transferring the user data and the updated header data from the register to a second block of memory in the memory device.

Abstract: In exemplary aspects of cache coherency management, a first request is received and includes an address of a first memory block in a shared memory. The shared memory includes memory blocks of memory devices associated with respective processors. Each of the memory blocks are associated with one of a plurality of memory categories indicating a protocol for managing cache coherency for the respective memory block. A memory category associated with the first memory block is determined and a response to the first request is based on the memory category of the first memory block. The first memory block and a second memory block are included in one of the same memory devices, and the memory category of the first memory block is different than the memory category of the second memory block.

Abstract: A data storage device and method for enabling endurance re-evaluation are provided. In one embodiment, a data storage device is provided comprising a memory and a controller. The controller is configured to receive data and a first storage requirement for the data from a host; store the data in a first group of memory cells in the memory, wherein the first group of memory cells satisfies the first storage requirement; receive a notification from the host that the first storage requirement has changed to a second storage requirement; and move the data from the first group of memory cells to a second group of memory cells in the memory, wherein the second group of memory cells satisfies the second storage requirement. Other embodiments are provided.

Abstract: An apparatus comprises a source system comprising a distribution layer, a management component and a plurality of replication components. The distribution layer is configured to obtain an input-output operation corresponding to an address and to identify a given replication component that corresponds to the address based at least in part on a distribution instance. The distribution layer is configured to assign a first distribution identifier corresponding to the distribution instance to the input-output operation and to provide the input-output operation to the given replication component with the first distribution identifier. The given replication component is configured to obtain a second distribution identifier from the management component and to determine whether or not the first distribution identifier is equal to the second distribution identifier.

Abstract: A method for data synchronization includes identifying a replaced component amongst a plurality of components in a storage system, establishing a quorum amongst the plurality of components in the storage system, and updating vital product data stored on the replaced component based at least in part on the quorum established amongst the plurality of components in the storage system. A computer program product for data synchronization includes one or more computer readable storage media and program instructions collectively stored on the one or more computer readable storage media. The program instructions include program instructions to perform the foregoing method. A system includes a processor and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor. The logic is configured to perform the foregoing method.

Abstract: A data storage system in which data storage space for storing data storage metadata is selectively allocated from non-volatile data storage devices contained in a first storage enclosure. The first storage enclosure is directly connected to at least one storage processor of the data storage system, and the data storage system further includes at least one secondary storage enclosure that is indirectly connected to the storage processor. Data storage metadata is generated within the data storage system, and the data storage metadata generated within the data storage system is stored into the data storage space that was selectively allocated for storing data storage metadata from the non-volatile data storage devices contained in the first storage enclosure.

Abstract: A computer-implemented method, according to one embodiment, includes: monitoring data requests that are performed on a logical volume in memory at a source location, and tracking changes that are made to data in the logical volume as a result of performing the data requests. A determination is made as to whether a preestablished amount of the data in the logical volume has been changed as a result of performing the data requests since a previous snapshot of the logical volume was captured. Moreover, in response to determining that a preestablished amount of the data in the logical volume has been changed as a result of performing the data requests since a previous snapshot of the logical volume was captured, a new snapshot of the logical volume is captured.

Abstract: A storage device includes a semiconductor memory device including memory blocks, planes which include the memory blocks and memory dies in which the planes are included; and a controller configured to store user data and metadata determined based on a command received from a host, in super memory blocks each including some of the memory blocks. The controller includes a segment queuing circuit configured to queue segments of the user data or the metadata to N (N is a natural number) virtual die queues according to a striping scheme; and a segment storage circuit configured to store the queued segments of the user data or the metadata in a super memory block among the super memory blocks, wherein the queued segments of the user data or the metadata are stored in the memory blocks included in the super memory block, according to a striping scheme.

Abstract: A memory device includes: in-memory operation units to perform in-memory processing of an operation pipelined in multi-pipeline stages; memory banks assigned to the plurality of in-memory operation units such that a set of n memory banks is assigned to each of the in-memory operation units, each memory bank performing an access operation of data requested by each of the plurality of in-memory operation units while the pipelined operation is performed, wherein n is a natural number; and a memory die in which the in-memory operation units, the memory banks, and command pads configured to receive a command signal from an external source are arranged. Each set of the n memory banks includes a first memory bank having a first data transmission distance to the command pads and a second memory bank having a second data transmission distance to the command pads that is larger than the first data transmission distance.

Abstract: Expandable cache management dynamically manages cache storage for multiple network shares configured in a file server. Once a file is written to a directory or folder on a specially designated network share, such as one that is configured for “infinite backup,” an intermediary pre-backup copy of the file is created in an expandable cache in the file server that hosts the network share. On write operations, cache storage space can be dynamically expanded or freed up by pruning previously backed up data. This advantageously creates flexible storage caches in the file server for each network share, each cache managed independently of other like caches for other network shares on the same file server. On read operations, intermediary file storage in the expandable cache gives client computing devices speedy access to data targeted for backup, which is generally quicker than restoring files from backed up secondary copies.

Abstract: An information processing apparatus includes: a memory; and a processor coupled to the memory and configured to: perform mirroring of data with a first information processing apparatus and switches from a standby system to an active system with operation shutdown of the first information processing apparatus to operate as a second information processing apparatus, the information processing apparatus; determine whether or not target data is data for which the mirroring is completed before the operation shutdown, the target data being target data of a restoration copy processing performed when the first information processing apparatus is restored to the active system after the information processing apparatus operates as the second information processing apparatus; and copy the target data from the own apparatus to the first information processing apparatus when determining that the target data is data for which the mirroring is completed.

Abstract: A distributed data storage system using erasure coding (EC) provides advantages of EC data storage while retaining high resiliency for EC data storage architectures having fewer data storage nodes than the number of EC data-plus-parity fragments. To ameliorate the effects of certain storage node outages or fatal disk failures, incoming data is temporarily replicated so that read and write operations can continue from/to the storage system. The system automatically heals failed EC write attempts in a manner transparent to users and/or applications: when all storage nodes are operational, the distributed data storage system automatically converts the temporarily replicated data to EC storage and reclaims storage space previously used by the temporarily replicated data. Individual hardware failures are healed through migration techniques that reconstruct and re-fragment data blocks according to the governing EC scheme. An illustrative embodiment is a three-node data storage system using EC 4+2.

Abstract: A converged memory device includes: a first memory group having first characteristics; a second memory group having second characteristics that are different from the first characteristics; and a controller configured to migrate predetermined data of the second memory group into a cache region in the first memory group, wherein the controller is further configured to migrate data of the second memory group into the cache region by using the cache region as a buffer when an energy throttling operation is performed on the second memory group.

Abstract: Techniques for implementing dynamic base disk mirroring for linked clones are provided. In one set of embodiments, a first node in a distributed storage system can monitor a congestion level of a base disk residing on the first node, where the base disk is shared by a plurality of linked clones. Upon determining that the congestion level exceeds a threshold, the first node can send, to a second node, a request to create a mirror of the base disk on that second node. Upon receiving an acknowledgement from the second node that the mirror has been successfully created, the first node can update a mirror set associated with the base disk to include an entry identifying the mirror. The first node can then communicate the updated mirror set to one or more other nodes.

Abstract: Disclosed are techniques that provide for eventually-complete backups, and restoration thereof. For example, such methods, computer program products, and computer systems can include initiating a backup operation (where the backup operation is configured back up a dataset), detecting termination of the backup operation, detecting termination of the backup operation, and determining whether the backup operation backed up the dataset completely. In response to a determination that the backup operation did not backup the dataset completely, generating an indication that the backup is not complete. In response to a determination that the backup operation did not backup the dataset completely, generating an indication that the backup is complete.