Abstract: Described herein are hash table structures and system and methods for creating and storing data in the hash table structures. Hash tables and input buffers associated with same are configured in several arrangements, including multi-level hash tables and nested multi-level hash tables. The hash table structures described herein are well suited for being configured in the memory blocks of field-programmable gate arrays.

Abstract: A control device includes a processor. The processor is configured to receive a write request to write content data. The processor is configured to divide the content data into leading first data and subsequent second data. The processor is configured to write the first data to a first storage resource in a first storage group among a plurality of storage groups having operating rates different from each other. The first storage group has a first operating rate higher than operating rates of any other storage groups. The processor is configured to write the second data to a second storage resource in a second storage group. The second storage group has a second operating rate lower than the first operating rate. The processor is configured to activate, in parallel with the writing of the first data, the second storage resource when the second storage resource is in a non-operating state.

Abstract: Aligning memory access operations to a geometry of a storage device, including: receiving, by a storage array controller, information describing the layout of memory in the storage device; determining, by the storage array controller, a write size in dependence upon the layout of memory in the storage device; and sending, by the storage array controller, a write request addressed to a location within the memory unit in dependence upon the layout of memory in the storage device.

Abstract: A data storage device includes at least one data storage medium and a controller that is operably coupled to the at least one data storage medium. The controller receives the bit stream in a data storage device and performs a first level of compression on the received bit stream to obtain a symbol frame including a plurality of symbols. The controller encodes an initial portion of the plurality of symbols contained in the symbol frame by a fixed encoding scheme. The controller also collects statistics for the initial portion of the symbol frame. The controller then selects at least one data compression algorithm based on the collected statistics. The controller then performs compression encoding on a remaining portion of the symbol frame with the selected at least one data compression algorithm.

Abstract: A backup and archival policy method, system, and non-transitory computer readable medium, includes harnessing of metrics of data classification including both operational data and backup data from an end-to-end stack from a backup Information Lifecycle Governance (ILM) viewpoint.

Abstract: A system and method for efficiently maintaining metadata stored among a plurality of solid-state storage devices. A data storage subsystem supports multiple mapping tables. Records within a mapping table are arranged in multiple levels. Each level stores at least pairs of a key value and a physical pointer value. The levels are sorted by time. New records are inserted in a created new highest (youngest) level. No edits are performed in-place. A data storage controller determines both a cost of searching a given table exceeds a threshold and an amount of memory used to flatten levels exceeds a threshold. In response, the controller incrementally flattens selected levels within the table based on key ranges. After flattening the records in the selected levels within the key range, the records may be removed from the selected levels. The process repeats with another different key range.

Abstract: Exposing a geometry of a storage device, including: sending, by the storage device, information describing the layout of memory in the storage device; receiving, by the storage device, a write request, the write request associated with an amount of data sized in dependence upon the layout of memory in the storage device; and writing, by the storage device, the data to a memory unit, the data written to a location within the memory unit in dependence upon the layout of memory in the storage device.

Abstract: Dynamic quality of service for storage I/O port allocation is provided by obtaining indications of anticipated demand on a plurality of storage ports of a storage device of a data center, the anticipated demand being at least in part for storage input/output supporting transfer of data to or from a network, and dynamically adjusting storage port allocations based on the indications of anticipated demand and on real-time evaluation of workloads being serviced by the plurality of storage ports.

Abstract: Embodiments of the present invention disclose an access request scheduling method and apparatus. The method includes: receiving a to-be-enqueued access request, and determining a memory that the to-be-enqueued access request requests to access; writing the to-be-enqueued access request to one queue in one access queue group corresponding to the memory; selecting one candidate access queue from each candidate access queue group, as a to-be-scheduled queue; selecting, from the to-be-scheduled queues according to an access timeslot of each memory, alternative queues that can participate in scheduling in a current clock period; selecting, from the alternative queues, a specified queue in scheduling in the current clock period; extracting a to-be-scheduled access request from the specified queue; and granting an access authorization to the to-be-scheduled access request.

Abstract: According to an embodiment of the present invention, a storage management apparatus to manage a plurality of storage combinations which are combinations of storages included in a storage group, includes a combination failure probability calculator and an allocation ratio calculator. The combination failure probability calculator calculates a failure probability of the storage combination based on a failure probability of each of the storages. The allocation ratio calculator calculates an allocation ratio of received data with respect to the storage combination based on the failure probability of the storage combination.

Abstract: A storage cluster in a computing network can operate according to a service-level agreement (e.g., a set of performance conditions). The network can receive a request to register a new storage volume with the storage cluster. In response, the network may evaluate the current extent of replication of data in the storage cluster and how adding the new volume may affect the performance of the cluster to determine whether to register the new volume with the storage cluster.

Abstract: A technique for managing temporal data placement in data storage systems is disclosed. An application program interface (API) is provided, where a host application is configured to communicate sub-LUN data segment location, application configuration tiering, and timing parameter information to the API. The sub-LUN data segment location, application configuration tiering, and timing parameter information is transmitted to the data storage system via an out-of-band communications path. The sub-LUN data segment location, application configuration tiering, and timing parameter information is received at the data storage system and associated with the corresponding LUN. A timing estimate for implementing sub-LUN data segment relocation is generated based on system derived tiering information and recent relocation timing information.

Abstract: A hypervisor receives, from a guest virtual machine, a request to disable access to a memory range. The hypervisor disables access to the memory range. The hypervisor detects a prohibited access attempt. The prohibited access attempt is an access attempt to the memory range. Responsive to detecting the prohibited access attempt, the hypervisor stops the guest virtual machine. The hypervisor receives a request to reboot the guest virtual machine. The hypervisor reboots the guest virtual machine. Responsive to rebooting the guest virtual machine, the hypervisor enables access to the memory range.

Abstract: A system, method, and computer program product for storage provisioning in a data storage environment comprising protecting, through an orchestration API, a source volume at a source site by setting the source volume to be replicated to a target volume at a target site through the use of a replication appliance; wherein the API is enabled to create network zones between the source site and the target site for replication from the source site to the target site and wherein the network zone is configured to include the replication appliance; wherein the API is enabled to mask storage devices used to store data on the source volume and the target volume.

Abstract: A method for managing a storage system includes: providing at least one heartbeat monitoring path between a set of expander control circuits within an expansion module in the storage system, for transmitting at least one of a plurality of heartbeat monitoring signals for a set of management modules in the storage system, wherein the expansion module is utilized for installing a set of shared storage devices, and each shared storage device within the set of shared storage devices is coupled to the set of expander control circuits, respectively, to allow the management modules to control the set of shared storage devices through the expander control circuits, respectively. The method further includes performing heartbeat monitoring according to the heartbeat monitoring signals, for at least one of the management modules to perform high availability management on shared storage devices and selectively take over management of non-shared components.

Abstract: A method for reducing an amount of data transmitted during a backup process is described. The method may include receiving input data to insert into a rating hash table during the backup process. The method may further include selecting, based on a hash function, a bucket of the rating hash table in which the input data will be inserted, the bucket including a plurality of blocks. The method may also include, in response to determining that the input data has already been inserted in one of the plurality of blocks, increasing a rating corresponding to the one of the plurality of blocks by a popularity rating increment. The method may additionally include, in response to determining that the input data has not already been inserted in one of the plurality of blocks, determining a first block with a smallest rating from the plurality of blocks.

Abstract: Devices, systems and methods are disclosed for limiting a number of hibernations based on a finite lifetime expectancy of nonvolatile memory. As the nonvolatile memory has a finite lifetime expectancy, a device may determine cumulative thresholds and associated session thresholds and may limit a frequency that the device hibernates. For example, the device may determine a cumulative number of hibernations and associate the cumulative number of hibernations with a cumulative threshold. The device may determine a session threshold corresponding to the cumulative threshold and may limit a number of hibernations using the session threshold. For example, the device may enter a hibernation state up to the session threshold and thereafter may enter a suspended state instead.

Abstract: Embodiments for managing data stored in a tiered data storage system, by a processor device. Upon submission of a workload to a queue of a workload manager, a set of storage demands included in metadata associated with the workload is received by an optimization policy generator. The set of storage demands is translated, by the optimization policy generator, into data placement, migration, and deletion policies to be executed by the storage system. At least one of a plurality of storage tiers within the storage system is prepared for the workload in the queue by using current storage tier allocations and the data placement, migration, and deletion policies to restructure content in the storage tiers according to the set of storage demands prior to performing the workload.

Abstract: Deduplicating snapshot associated with a backup operation is disclosed, including: performing a backup operation including by generating a plurality of snapshots; maintaining, at a source system, deduplication data corresponding to one or more data blocks that have already been written to backup media during the backup operation; and using the deduplication data to deduplicate backup data across the plurality of snapshots.

Abstract: A memory system having multiple memory layers includes a first memory layer comprising a volatile memory, a second memory layer comprising a first sub-memory and a second sub-memory. In response to a reference failure that occurred in the first memory layer, to which a read reference failed data and a write reference failed data are respectively loaded from lower level memory layer.