Abstract: To manage a storage system, data objects are divided to groups according to keyword ranges of the data objects in the storage system. Array sets associated with the groups are respectively generated. An array in the array set includes elements. The elements are set according to a keyword of at least one data object in the group and at least one hash function. At least a part of the arrays in the array sets respectively associated with the groups is loaded into a memory of the storage system. The storage system is managed based on at least the part of the arrays in the memory. Further, a corresponding device and a corresponding computer program product are provided. With the above example implementation, only a part of the arrays is loaded into the memory of the storage system, so that the overhead of memory resources can be reduced.

Abstract: A distributed storage system includes a primary storage system and a secondary storage system. The secondary storage system stores the actual data and the primary storage system stores metadata for the actual data. The metadata references at the primary storage system may be deleted without deleting the corresponding data at the secondary storage system. Snapshots of the metadata at the primary storage system are sent to the secondary storage system. The secondary storage system can compare two metadata snapshots received from the primary storage in order to determine whether data stored at the secondary storage system has been deleted at the primary storage system for longer than a retention period. Such data may be deleted to free up storage space at the secondary storage server.

Abstract: An apparatus comprises a processing device configured to receive a request to create a given storage volume in a storage system, the storage system providing a plurality of storage features. The processing device is also configured to select, for the given storage volume, one of a set of one or more volume tiers, each of the volume tiers specifying whether respective ones of the plurality of storage features provided by the storage system are enabled or disabled for storage volumes associated with that volume tier. The processing device is further configured to create the given storage volume in the storage system, and to associate the selected volume tier with the given storage volume, wherein associating the selected volume tier with the given storage volume comprises enabling or disabling respective ones of the plurality of storage features provided by the storage system as specified by the selected volume tier.

Abstract: Executable memory space is protected by receiving, from a process, a request to configure a portion of memory with a memory protection attribute that allows the process to perform at least one memory operation on the portion of the memory. Thereafter, the request is responded to with a grant, configuring the portion of memory with a different memory protection attribute than the requested memory protection attribute. The different memory protection attribute restricting the at least one memory operation from being performed by the process on the portion of the memory. In addition, it is detected when the process attempts, in accordance with the grant, the at least one memory operation at the configured portion of memory. Related systems and articles of manufacture, including computer program products, are also disclosed.

Abstract: A method and system for co-locating journaling and data storage based on write requests. A write request that includes metadata and data is received from a client. A logical storage unit for storing the metadata and the data is identified. The logical storage unit is divided into a journal partition and a volume partition. The journal partition includes a first log and a second log. Which of the first log and the second log is an active log and which of the first log and the second log is an inactive log are identified. The metadata is recorded in a first location in the active log and the data is recorded in a second location in the active log during a single I/O operation. A reply is sent to the client after the metadata and the data are recorded in the journal partition.

Abstract: A method for allocating memory in a computing device having a non-volatile main memory is described. The method comprises receiving, by a memory allocator, a request for non-volatile memory allocation of an object from a program executing on the computing device, the request comprising a requested memory size and registration data from the program. The method comprises finding an available address of one of a plurality of portions of a page of the non-volatile memory and searching an active page table in the non-volatile main memory to find the page and if the page is not found in the active page table: inserting the page into the active page table; and waiting for a memory write for inserting the page into the active page table to complete.

Abstract: Disclosed are a storage system, and a method and an apparatus for allocating storage resources. In the storage system, a target management node allocates a target storage node to a monitoring device according to a first storage request; the target storage node allocates a target storage volume to the monitoring device according to a second storage request, allocates a target block group from the target storage volume to the monitoring device, acquires monitoring data in the form of a data stream from the monitoring device, and stores the monitoring data in the target block group. The storage system may select a management node from a management cluster to allocate a storage node to a monitoring device, and the storage node may allocate a storage position to the monitoring device. The storage position that is allocated to monitoring data can be determined by the management node and the storage node hierarchically.

Abstract: Methods, systems, and devices for performing an access operation on a memory cell, incrementing a value of a first counter based on performing the access operation on the memory cell, determining that the incremented value of the first counter satisfies a threshold, incrementing a value of a second counter based on determining that the incremented value of the first counter satisfies the threshold, and performing a maintenance operation on the memory cell based on determining that the incremented value of the first counter satisfies the threshold are described.

Abstract: Methods and systems disclosed herein allow data to be transferred from a data source to a target database with little to no offline period or data corruptions. The methods and systems describe a server that generates a temporary data repository having a similar configuration as the target data repository; transmits the set of new data records from the data source to the temporary data repository; identifies dependency relationship attributes among the data records stored within the target data repository; and when the server identifies that a predetermined number of data records and their respective dependent data records are stored within the temporary data records, the server merges the set of data records and the set of new data records. The server also stores a pre/post merger record of data such that the server can revert to a previous version of data or roll forward to another version.

Abstract: An archival blockchain system is disclosed that includes a cache-tier storage level where data is stored before it has met a first aging criteria, a disk-tier storage level where the data is migrated to and stored within archival blockchain blocks after it has met the first aging criteria. When the archival blockchain blocks containing the data meet a second aging criteria they are migrated to a tape-tier storage level where the disk-tier archival blockchain blocks are stored within another archival blockchain block stored on the tape-tier. This archival blockchain system also includes a blockchain appliance in digital data communication with the cache-tier, disk-tier, and tape-tier storage levels that maintains a ledger that stores data pointers to the data stored on the cache-tier, disk-tier, and tape-tier storage levels to logically link them into a contiguous data set.

Abstract: This application provides a method for allocating a resource of a hard disk in a distributed storage system. The distributed storage system includes a plurality of hard disks. The method includes: selecting a hard disk set from the plurality of hard disks based on a bandwidth requirement and a storage specification of a first user; and creating first logical storage space for the first user from the hard disk set, where the first storage space of each hard disk in the hard disk set provides storage space for the first logical storage space. In the method, a bandwidth lower limit of the hard disk can be ensured.

Abstract: Various embodiments comprise apparatuses and methods including a method of reconfiguring partitions in a memory device as directed by a host. The method includes managing commands through a first interface controller to mapped portions of a first memory not having an attribute enhanced set, and mapping portions of a second memory having the attribute enhanced set through a second interface controller. Additional apparatuses and methods are described.

Abstract: A memory control method for a memory storage device is provided according to an exemplary embodiment of the disclosure. The method includes: reading first data from a first physical unit in response to a first read command from a host system; performing a first decoding operation on the first data to obtain decoded data corresponding to the first data; storing the decoded data corresponding to the first data in a buffer memory; reading second data from the first physical unit in response to a second read command from the host system; performing a second decoding operation on the second data; and in response to failure of the second decoding operation, searching the buffer memory for the decoded data corresponding to the first data to replace the reading of the second data.

Abstract: A storage system monitors the first access frequency of occurrence which is the access frequency of occurrence from a host device during a first period, and the second access frequency of occurrence which is the access frequency of occurrence from a host device during a second period shorter than the first period. Along with performing data relocation among the tiers (levels) in the first period cycle based on the first access frequency of occurrence, the storage system performs a decision whether or not to perform a second relocation based on the first access frequency of occurrence and the second access frequency of occurrence, synchronously with access from a host device. Here the threshold value utilized in a decision on whether or not to perform the first relocation is different from the threshold value utilized in a decision on whether or not to perform the second relocation.

Abstract: A technique manages bandwidth allocated among input/output operations, such as reads and writes, to storage devices coupled to storage nodes of a cluster. The technique balances the writes in a manner that reduces latency of reads, while allowing the writes to complete in a desired amount of time. The writes include write types, such as client writes, data migration writes, block transfer writes, and recycling writes, which are defined by differing characteristics and relative priorities. To ensure timely completion of the write types, the technique provides periodic time intervals over which the writes may be balanced and allocated sufficient bandwidth to access the storage devices. The time intervals may include shuffle intervals within a larger distribution interval. In addition, the technique throttles certain write types at the storage device level to maintain consistent read performance. Throttling is based on a credit system that allocates bandwidth as “credits” based on write type.

Abstract: A method is used in improving rebuilding in data storage. The generation number of a PLB is compared with a generation number of a partition corresponding to the PLB. The data of the PLB is rebuilt based on the comparison.

Abstract: The present disclosure is directed to systems and methods that include cache operation storage circuitry that selectively enables/disables the Cache Line Flush (CLFLUSH) operation. The cache operation storage circuitry may also selectively replace the CLFLUSH operation with one or more replacement operations that provide similar functionality but beneficially and advantageously prevent an attacker from placing processor cache circuitry in a known state during a timing-based, side channel attack such as Spectre or Meltdown. The cache operation storage circuitry includes model specific registers (MSRs) that contain information used to determine whether to enable/disable CLFLUSH functionality. The cache operation storage circuitry may include model specific registers (MSRs) that contain information used to select appropriate replacement operations such as Cache Line Demote (CLDEMOTE) and/or Cache Line Write Back (CLWB) to selectively replace CLFLUSH operations.

Abstract: Compaction of an ordered event stream (OES) is disclosed. An OES storage system can employing multiple tiers of storage devices, wherein the different tiers each can provide certain advantages and disadvantages that can be used to balance OES event storage costs, both monetarily and in terms of computing resource burden. Compaction can be facilitated by storing, in a stream map, a reference to an event stored via a second tier of storage in contrast to storing in the stream map actual events of a first tier of storage. A reference can be enabled by storing events in a chunk body and storing a location relationships in a header of the chunk. The stream map can then search headers for references, which can often be smaller than the events themselves, which references can then be communicated, stored, and updated in the stream map to facilitate OES compaction.

Abstract: A method, computer program product, and computing system for receiving a plurality of data streams on an SSD cache memory system associated with a backend storage system and writing a first of the plurality of data streams to a first portion of the SSD cache memory system.

Abstract: Shared memory caching resolves latency issues in computing nodes associated with a cluster in a virtual computing environment. A portion of random access memory in one or more of the computing nodes is allocated for shared use by the cluster. Whenever local cache memory is unable in one of the computing nodes, a cluster neighbor cache allocated in a different computing node may be utilized as remote cache memory. Neighboring computing nodes may thus share their resources for the benefit of the cluster.