Abstract: Data retention for a tiered ordered event stream (OES) data storage system is disclosed. Data retention can be applied to demoted data, e.g., data demoted from a first tier to a second tier of data storage devices. The data retention disclosed can avoid demoted events, generally aggregated via a chunk object, file object, etc., from being subject to both a stream-cut operation and a retention period. In embodiments, where a stream-cut instance corresponds to events occurring later in time than a retention end time (RET), all demoted events, e.g., as aggregated by a chunk, file, etc., can be affiliated with the RET. However, where the stream-cut instance corresponds to events occurring earlier in time than the RET, then a portion of the events, e.g., those that will be truncated by performing the stream-cut instance, can be demoted and affiliated with the RET.

Abstract: A zoned namespace storage device system includes a zoned namespace storage device coupled to a computing device. The zoned namespace storage device includes a zoned namespace storage subsystem that is configured to store data, and storage device compute hardware that is coupled to the zoned namespace storage subsystem and that is configured to provide a storage device operating system that includes a storage device management microservice. The storage device management microservice presents a non-zone storage service to a host subsystem in the computing device and receives, via the non-zone storage service presented to the host subsystem, a storage command from the host subsystem that is associated with a storage operation. The storage device management microservice then utilizes a zone storage service presented to the storage device management microservice by the zoned namespace storage subsystem to perform the storage operation on the zoned namespace storage subsystem.

Abstract: A set of host data items is received for programming to the memory subsystem. The set of host data items is programmed to a first region of the memory subsystem that includes one or more memory devices. A determination is made that a sequence at which the set of host data items are programmed across memory devices of the first region does not correspond to a target sequence associated with accessing the set of host data items via the first region. The target sequence corresponds to a sequence that enables a host data items programmed to the memory sub-system to be accessed in parallel. The set of host data items is copied from the first region to a second region of the memory subsystem. A sequence at which the set of host data items is copied to memory devices of the second region corresponds to the target sequence.

Abstract: A processing device illustratively includes a processor coupled to a memory, and is configured to initiate a background copy process in a host device to copy data from a first storage system to a second storage system. The processing device receives input-output (IO) processing pressure feedback from at least one of the first and second storage systems, and adjusts one or more characteristics of the background copy process based at least in part on the received IO processing pressure feedback. The processing device may comprise, for example, host level mirroring (HLM) logic configured to control execution of the background copy process for one or more logical storage devices. Adjusting one or more characteristics of the background copy process based at least in part on the received IO processing pressure feedback may comprise, for example, reducing a rate of the background copy process responsive to the received IO processing pressure feedback.

Abstract: Techniques for provisioning storage may include: initially provisioning storage for a storage group of logical devices; tagging the storage group to enable autonomous storage provisioning; receiving a plurality of parameters used in connection with performing autonomous storage provisioning for the storage group, wherein the plurality of parameters includes a first parameter denoting a threshold amount of consumed storage of the storage group, a second parameter denoting a storage capacity expansion amount by which to expand the storage capacity of the storage group, and a third parameter denoting a system-wide threshold of consumed backend non-volatile storage; determining, in accordance with the plurality of parameters, whether to expand a current storage capacity of the storage group; and responsive to determining to expand the current storage capacity of the storage group, performing first processing to automatically expand the current storage capacity of the storage group in accordance with the second pa

Abstract: Various embodiments provide block failure protection for a memory sub-system that supports zones, such a memory sub-system that uses a RAIN (redundant array of independent NAND-type flash memory devices) technique for data error-correction. For some embodiments, non-parity zones of a memory sub-system that are filling up at a similar rate are matched together, a parity is generated for stored data from across the matching zones, and the generated parity is stored in a parity zone of the memory device.

Abstract: A method, computer system, and a computer program product for storing a write data in a storage system that operates using a log-structured filing system is provided. The present invention may include compressing a write data. The present invention may also include identifying a region of a storage system based on a first size of the compressed write data. The present invention may further include the storage system operating using a log-structured filing system. The present invention may also include a different region of the storage system having a different compression ratio. The present invention may further include writing the compressed write data in the identified region of the storage system.

Abstract: Systems and methods are disclosed for implementing an event based retention schedule for a read only file. When a regular file is to be converted to an event based retention read only file, an “event-retain” property may be enabled on the file allowing the feature to be implemented. Then, that file may have its permissions changed to read only. This will allow the file to be changed to a read only file without using a default retention time. Then, once the event is triggered, the retention time may be set so the file can be scheduled for automatic deletion.

Abstract: An apparatus comprises a processing device configured to obtain information characterizing historical boot times for virtual machines associated with virtual volumes hosted on a storage cluster comprising a plurality of storage nodes, and to determine, based at least in part on the obtained information, whether any of the storage nodes has at least a threshold likelihood of experiencing a designated virtual machine boot condition during a given time period. The processing device is further configured, responsive to determining that a first one of the storage nodes has at least the threshold likelihood of experiencing the designated virtual machine boot condition during the given time period, to identify a subset of the virtual machines associated with a subset of the virtual volumes hosted on the first storage node and to move at least one of the subset of the virtual volumes to a second one of the storage nodes.

Abstract: A server, control circuit, or method for controlling an OPC UA Server includes receiving a request for data from an OPC UA Client, determining whether the request and/or the data requires a slow data access or a fast data access by a hardware implemented control circuit of the OPC UA Server; obtaining first data from a memory unit of the OPC UA Server when the request and/or the data requires the slow data access; obtaining second data from an second address space of the control circuit when the request and/or the data requires the fast data access; and sending the obtained first or second data to the OPC UA Client.

Abstract: A block storage service analyzes customer behaviors as external signals to the health of the block storage service. In one example, using rules set by a customer for a health monitoring service, the block storage service can gain insights into what the customer cares about. The customer rules can then be used to setup internal monitors within the block storage service. If the internal monitors are triggered, the block storage service can proactively correct problems before the customer alarm thresholds are reached. For example, customer volumes can be moved to increase performance characteristics. In some cases, if the customer has too much performance capability, the customer volume can be moved to a less costly alternative.

Abstract: A resource allocation method and a storage device are provided. The storage device includes a disk enclosure and a plurality of controllers. Each controller includes a plurality of processors, each processor includes a plurality of processor cores, the plurality of controllers are separately coupled to the disk enclosure including a plurality of hard disks. The plurality of processors are configured to provide computing resources. The plurality of hard disks are configured to provide storage space. Logical addresses corresponding to the storage space are classified into several address segment sets, each address segment set includes one or more address segments, some of the computing resources are allocated to each address segment set, and are used to execute a data access request for accessing an address segment comprised in the address segment set. Computing resources used to process different address segment sets are from different processors or from different processor cores.

Abstract: An example operation may include one or more of receiving data of an item from a data source, the data comprising one or more of historical data and quality data of the item, generating a cryptographic hash of the data, constructing a data block comprising the cryptographic hash of the data and a unique identifier of the item, and storing the constructed data block within a hash-linked chain of data blocks.

Abstract: Technologies are provided for dynamically changing a size of a cache region of a storage device. A storage device controller writes data to the cache region of the storage device using a particular storage format. The storage device controller then migrates the cached data to a storage region of the device, where the data is written using a different storage format. A dynamic cache manager monitors input and output activity for the storage device and dynamically adjusts a size of the cache region to adapt to changes in the input and/or output activity. The dynamic cache manager can also adjust a size of the storage region. The storage device controller can automatically detect that the storage device has dynamic cache support and configure the storage device by creating the cache region and the storage region on the device.

Abstract: A high performance packet stream storage method. Original packet data from data traffic transmitted over a network is collected. Collected original packet data is written in a memory. Metadata from the collected original package data is extracted and metadata is written in the memory. The original packet data and the metadata is stored in a storage unit.

Abstract: Methods and apparatuses to control digital data transfer via a memory channel between a memory module and a processor are disclosed. At least one of the memory module or the processor coalesces a plurality of short data words into multicast coalesced block data comprising a single data block for transfer via the memory channel. Each of the plurality of short data words pertains to one of at least two partitioned memory submodules in the memory module. The multicast coalesced block data is communicated over the memory channel.

Abstract: An information processing system determines whether the destination tenant corresponding to the source tenant is present, newly generates the destination tenant if the destination tenant is determined to be absent, and determines whether a destination resource which has the same ID as a source resource included in the source tenant is included in the tenant of the destination service. The system newly generates the destination resource in the destination tenant when the destination resource is determined not to be included in the tenant of the destination service, directly migrates data of the source resource to the destination resource if the tenant including the destination resource is the destination tenant, and migrates the data of the source resource to the destination resource via a dummy resource if the tenant including the destination resource is not the destination tenant.

Abstract: Disclosed in some examples are methods, systems, devices, memory devices, and machine-readable mediums for using a non-defective portion of a block of memory on which there is a defect on a different portion. Rather than disable the entire block, the system may disable only a portion of the block (e.g., a first deck of the block) and salvage a different portion of the block (e.g., a second deck of the block).

Abstract: The disclosure provides techniques for deduplicating files. The techniques include, upon creating or modifying a file, placing a logical timestamp of the current logical time, within a queue associated with the directory of the file. The techniques further include placing the logical timestamp within a queue of each parent directory of the directory of the file. To determine a set of files for deduplication, the techniques disclosed herein identify files that have been modified within a logical time range. The set of files modified within a logical time is identified by traversing directories of a storage system, the directories being organized within a tree structure. If a directory's queue does not contain a timestamp that is within the logical time range, then all child directories can be skipped over for further processing, such that no files within the child directories end up being within the set of files for deduplication.

Abstract: A method includes identifying a first block of a plurality of blocks stored at a first memory based on an amount of valid data of the first block, and writing the valid data of the first block from the first memory to a second memory. The first memory has a first memory type and the second memory has a second memory type different from the first memory type. The method further includes identifying a second block of the plurality of blocks stored at the first memory based on an age of valid data of the second block, determining that the age of the valid data of the second block satisfies a threshold condition, and in response to determining that the age of the valid data of the second block satisfies the threshold condition, writing the valid data of the second block from the first memory to the second memory.

Abstract: A memory controller includes a buffer memory configured to store first meta data and second meta data having a different type from the first meta data, and a cache memory including first and second dedicated areas. The first meta data is cached in the first dedicated area and the second meta data is cached in the second dedicated area.

Abstract: A method for generating data backups, that includes receiving, by a local backup manager executing on a local storage server, a command to initiate a backup process for a virtual data pool, and in response to receiving the command, identifying a plurality of locations pointing to a plurality of data, respectively, making a first determination that a first location points to a remote data stored on a remote storage server, in response to the first determination, sending a second command, to the remote storage server, to generate a remote backup data of the remote data, making a second determination that a second location points to a local data stored on the local storage server, and in response to the second determination, generating a local backup data of the local data, where the plurality of data backups includes the remote backup data and the local backup data.

Abstract: Snapshots may be remotely replicated asynchronously from a first LSU (R1) on a first storage system (A) to a second replica LSU (R2) on a second storage system (A2). The storage system A1 may open a consistency window to suspend initiating processing of new write operations received on A1. While the consistency window is open, A1 may: take a first snapshot, SS11, of R1; record, in association with the first replication cycle, an indication to replicate SS11 on A2; and initiate a next replication cycle to record write operations of the next new write requests to be received from hosts. After initiating a next replication cycle, A1 may close the consistency and transmit the first replication cycle to A2. A2 may apply the write operations of the first replication cycle to R2, and then take a second snapshot SS12 of R2, which should be a replica of SS11.

Abstract: The present disclosure includes apparatuses and methods related to a non-deterministic memory protocol. An example apparatus can perform operations on the memory device based on commands received from a host according to a protocol, wherein the protocol includes non-deterministic timing of the operations. The memory device can be a non-volatile dual in-line memory module (NVDIMM) device.

Abstract: A redundant array of independent drives (RAID) stripe is formed across a set of storage controllers of a plurality of storage controllers, wherein the RAID stripe comprises two or more of a plurality of modular storage devices of at least one of the set of storage controllers. The RAID stripe is written across the set of storage controllers.

Abstract: Methods, apparatus, and processor-readable storage media for automatically processing storage system data and generating visualizations representing differential data comparisons are provided herein. An example computer-implemented method includes obtaining current data from a first storage system and historical data from the first storage system and/or one or more additional storage systems; determining, for the first storage system, at least one current state value for at least one storage system parameter by processing the current data using a first hashing algorithm; determining, for the first storage system with respect to the first storage system and/or the additional storage systems, at least one differential state value for the at least one storage system parameter by processing the current data and the historical data using a second hashing algorithm; and generating data visualizations based on the current state value(s) and/or the differential state value(s).

Abstract: A method for accessing a file in a storage system is provided. The method includes determining, for each file chunk of the file, an authority among differing storage nodes of the storage system and receiving from the authority having ownership of the file chunk, location information for the file chunk. The method includes accessing file chunks of the file as directed by each of the determined authorities.

Abstract: A computing resource service provider may provide computing instances organized into logical groups, such as auto-scaling groups. Computing instances assigned to an auto-scaling group may be place into standby. Standby instances may still be managed by the auto-scaling group but may not contribute to the capacity of the auto-scaling group for auto-scaling purposes.

Abstract: A processing system selectively enables and disables a result lookaside buffer (RLB) based on a hit rate tracked by a counter, thereby reducing power consumption for lookups at the result lookaside buffer during periods of low hit rates and improving the overall hit rate for the result lookaside buffer. A controller increments the counter in the event of a hit at the RLB and decrements the counter in the event of a miss at the RLB. If the value of the counter falls below a threshold value, the processing system temporarily disables the RLB for a programmable period of time. After the period of time, the processing system re-enables the RLB and resets the counter to an initial value.

Abstract: In general, embodiments relate to a method for distributing topology information to client application nodes in a distributed system, the method comprising: creating a file system on a management node, enabling a plurality of client application nodes to access the file system on the management node, obtaining a topology file, wherein the topology file comprises information about a plurality of storage devices to enable the plurality of client application nodes to issue input/output (IO) requests directly to the plurality of storage devices, and storing, by the management node, the topology file in the file system, wherein the topology file is accessible to the plurality of client application nodes once the topology file is stored in the file system.

Abstract: Approaches for parallelized data deduplication. An instruction to perform data deduplication on a plurality of files is received. The plurality of files is organized into two or more work sets that each correspond to a subset of the plurality of files. Responsibility for performing each of said two or more work sets is assigned to a set of nodes in a cluster of nodes. The nodes may be physical nodes or virtual nodes. Each node in the set performs data deduplication on a different work set. In performing data deduplication, each node may store metadata describing where shared chunks of data are maintained in a distributed file system. The shared chunks of data are two or more sequences of bytes which appear in two or more of said plurality of files.

Abstract: A method and system for object metadata maintenance pertinent to object restoration. Concerning the realm of data protection, metadata, descriptive of data, may be considered as critical, if not more, than the data being protected itself. Metadata, amongst other purposes, may facilitate the rapid and/or efficient restoration of the data. Like data, metadata may also be susceptible to corruption due to various reasons. With corrupted metadata, restoration of the data may prove challenging. Accordingly, the disclosed method and system propose a framework through which metadata, if corrupted partially or wholly, may be repaired or rebuilt, respectively, using the data itself as references.

Abstract: Methods and systems for synchronizing controllers in an automation control system, can involve arranging redundancy elements in an automation control system comprising a group of nodes, wherein the redundancy elements can include one or more primary controllers and a group of concurrent secondary controllers, and wherein a back-up to the primary controller can exist on any node. Such methods and systems can further involve backing-up of the primary controller by the one or more secondary controllers to allow the primary controller to maintain the one or more secondary controllers as a new, alternate secondary controller for a load balancing or an equipment update.

Abstract: Direct memory access data path for RAID storage is disclosed, including: receiving, at a Redundant Array of Independent Disks (RAID) controller, a request to write data to be distributed among a plurality of storage devices; computing parity information based at least in part on the data associated with the request; causing the parity information to be stored on a first subset of the plurality of storage devices; and causing the data associated with the request to be stored on a second subset of the plurality of storage devices, wherein the plurality of storage devices is configured to obtain the data associated with the request directly from a memory that is remote to the RAID controller, and wherein the data associated with the request does not pass through the RAID controller.

Abstract: Embodiments of the invention are directed to utilizing an extension to software defined networking (SDN) to manage storage area networks (SANs) by receiving, at a switch configured with and managed by a SDN architecture, at least one table. The at least one table being operable in the SDN architecture and including routing information. The switch routes traffic over a SAN using the routing information in the at least one table.

Abstract: The present disclosure generally relates to improving data transfer in a data storage device. Not only prior to executing a command received from a host device, but even before scheduling the command, the data storage device parses the command and fetches physical region page (PRP) entries and/or scatter-gather list (SGL) entries. The fetching occurs just after receiving the command. Additionally, the host buffer pointers, which are described in PRP or SGL methods, associated with the entries are also fetched prior to scheduling the command. The fetching is a function of device constraints, queue depth, and/or tenant ID in a multi-tenant environment. The immediate fetching of at least part of the host buffers improves device performance, particularly in sequential write or read look ahead (RLA) scenarios.

Abstract: A virtualized copy-by-reference includes: receiving, from a first computer system, a request for reference information for source data within a source volume; providing, to the first computer system, the reference information, wherein the reference information corresponds to a metadata representation of the source data; receiving, from a second computer system, a request to write the source data to a target volume, and wherein the request to write the source data indicates the reference information; and copying, using the reference information, the metadata representation of the source data to the target volume.

Abstract: A Data Storage Device (DSD) includes one or more magnetic disks with each magnetic disk including at least one recording surface. A segment mapping is generated having a predetermined number of segment entries per recording surface with each segment entry corresponding to a data segment of the recording surface. One or more segment entries include a first logical address corresponding to a first logical data block that begins in the corresponding data segment and at least one of the data segments is configured to store multiple logical data blocks. A target segment entry is located in the segment mapping corresponding to a highest logical address less than or equal to a requested logical address of a read command and a head of the DSD is moved to a beginning portion of a target data segment corresponding to the target segment entry to perform the read command.

Abstract: A host system communicates to a production system that performs point-in-time copy operations to a backup system to generate a logical corruption protection (LCP) copy of a production copy that comprises a data set, wherein the point-in-time copy operations perform copying at a media level in which physical tracks are copied from the production system to the backup system, and wherein the point-in-time copy operations avoid using information on the data set or file structure that is included in a media on which the data set is stored. In response to a detection of a logical corruption in the data set, a recovery application executing in the host system recovers the data set from the LCP copy.

Abstract: In response to receiving an exception indication, an exception-handling state variable in state information is asserted. Firmware instruction(s) are selected from a plurality of firmware instructions based at least in part on: (1) a conditions table that includes condition(s) for handling the plurality of firmware instructions and (2) the state information that includes the exception-handling state variable. It is determined how to handle the selected firmware instruction(s) based at least in part on: (1) the conditions table and (2) the state information that includes the exception-handling state variable where. The plurality of firmware instructions includes: (1) a non-exception-handling set of firmware instruction(s) and (2) an exception-handling set of firmware instruction(s).

Abstract: A storage system and method for time-based data retrieval are provided. In one embodiment, a controller of the storage system is configured to receive time information from a host; receive a write command from the host, wherein the write command comprises a logical block address; and create a time-to-logical-block-address map from the time information and the logical block address received from the host. Other embodiments are provided.

Abstract: A Random Read Miss (RRM) distribution process monitors execution parameters of first, second, and third emulations of a storage engine, and distributes newly received read operations between the emulations. The RRM distribution process assigns newly received read operations to the first emulation, unless the CPU thread usage of the first emulation or the response time of the first emulation meet a first set of criteria. The RRM distribution process secondarily assigns newly received read operations to the second emulation, unless the CPU thread usage of the second emulation or the response time of the second emulation meet a second set of criteria. The RRM distribution process assigns all other newly received newly received read operations, that are not assigned to the first emulation or to the second emulation, to the third emulation. Distribution of read IOs between the emulations enables the storage engine to increase IOPs while minimizing response time.

Abstract: One example method includes powering off a replica VM, taking a snapshot of an OS disk of a source VM associated with the replica VM, taking a snapshot of an OS disk of the replica VM, generating a list of blocks that includes all blocks of the source VM OS disk that have changed since a preceding cloning or snapshot process and further includes all blocks of the replica VM OS disk that have changed since the preceding cloning or snapshot process, and performing an override of the replica VM disk by writing, to the replica VM OS disk, the respective source VM OS disk values for each block in the list of blocks.

Abstract: Aspects of the innovations herein are consistent with a storage system for storing variable sized objects. According to certain implementations, the storage system may be a transaction-based system that uses variable sized objects to store data, and/or may be implemented using data stores, such as arrays disks arranged in ranks. In some exemplary implementations, each rank may include multiple stripes, each stripe may be read and written as a convenient unit for maximum performance, and/or a rank manager may be provided to dynamically configure the ranks. In certain implementations, the storage system may include a stripe space table that contains entries describing the amount of space used in each stripe. Further, an object map may provide entries for each object in the storage system describing the location, the length and/or version of the object.

Abstract: An information processing apparatus includes an acquiring part, a copying part, and a switching part. The acquiring part acquires a file structure at a migration source and one or more identification information items each of which identifies a file at the migration source. The copying part copies the file structure and the one or more identification information items to a migration destination before migration of content data of one or more files at the migration source. In response to detection of an operation on a file corresponding to one of the one or more identification information items copied to the migration destination by the copying part, the switching part switches an access destination to the file at the migration source if a migration time to complete migration of content data of the file and finish the operation is equal to a predetermined duration or more.

Abstract: Techniques for provisioning storage may include: initially provisioning storage for a storage group of logical devices; tagging the storage group to enable autonomous storage provisioning; receiving a plurality of parameters used in connection with performing autonomous storage provisioning for the storage group, wherein the plurality of parameters includes a first parameter denoting a threshold amount of consumed storage of the storage group, a second parameter denoting a storage capacity expansion amount by which to expand the storage capacity of the storage group, and a third parameter denoting a system-wide threshold of consumed backend non-volatile storage; determining, in accordance with the plurality of parameters, whether to expand a current storage capacity of the storage group; and responsive to determining to expand the current storage capacity of the storage group, performing first processing to automatically expand the current storage capacity of the storage group in accordance with the second pa

Abstract: A system that implements a scaleable data storage service may maintain tables in a data store on behalf of storage service clients. The service may maintain data in partitions stored on respective computing nodes in the system. The service may support multiple throughput models, including a committed throughput model and a best effort throughput model. A service request to create a table may specify that requests directed to the table should be serviced under a committed throughput model and may specify the committed throughput level in terms of logical service request units. The service may reserve low-latency storage and other resources sufficient to meet the specified committed throughput level. A client/user may request a modification to the committed throughput level in anticipation of workload changes, such as an increase or decrease in traffic or data volume. In response, the system may increase or decrease the resources reserved for the table.

Abstract: A data storage device can have one or more rotating data media with data tracks that are radially disposed from a central spindle. The data tracks may be logically divided into multiple regions while a write strategy is generated with a region module to set a sequence of different regions for future data writes. Receipt of a data write request to the data storage media from a host can prompt the region module to classify the data write request as a sequential or random write in order to intelligently select a region to satisfy the data write request based on the write strategy to maximize data writing consistency for data associated with the data write request.

Abstract: Staging data on a storage element integrating fast durable storage and bulk durable storage, including: receiving, at a storage element integrating fast durable storage and bulk durable storage, a data storage operation from a host computer; storing data corresponding to the data storage operation within fast durable storage in accordance with a first data resiliency technique; and responsive to detecting a condition for transferring data between fast durable storage and bulk durable storage, transferring the data from fast durable storage to bulk durable storage in accordance with a second data resiliency technique.

Abstract: Virtual storage arrays consolidate branch data storage at data centers connected via wide area networks. Virtual storage arrays appear to storage clients as local data storage; however, virtual storage arrays actually store data at the data center. The virtual storage arrays overcomes bandwidth and latency limitations of the wide area network by predicting and prefetching storage blocks, which are then cached at the branch location. Virtual storage arrays leverage an understanding of the semantics and structure of high-level data structures associated with storage blocks to predict which storage blocks are likely to be requested by a storage client in the near future. Virtual storage arrays determine the association between requested storage blocks and corresponding high-level data structure entities to predict additional high-level data structure entities that are likely to be accessed. From this, the virtual storage array identifies the additional storage blocks for prefetching.