Abstract: Techniques for compressing data that use mismatch probability estimation to improve entropy encoding methods to account for, and efficiently handle, previously unseen data in data to be compressed. A mismatch probability estimate is calculated comprising an estimated frequency at which any given data sourceblock received during encoding will not have a codeword in the codebook. Entropy encoding is used to generate codebooks comprising codewords for data sourceblocks based on the frequency of occurrence of each sourceblock. A “mismatch codeword” is inserted into the codebook based on the mismatch probability estimate to represent those cases when a block of data to be encoded does not have a codeword in the codebook.

Abstract: A system and method for data compaction with codebook statistical estimates to improve entropy encoding methods to account for, and efficiently handle, previously-unseen data in data to be compacted. Training data sets are analyzed to determine the frequency of occurrence of each sourceblock in the training data sets. A mismatch probability estimate is calculated comprising an estimated frequency at which any given data sourceblock received during encoding will not have a codeword in the codebook. Entropy encoding is used to generate codebooks comprising codewords for data sourceblocks based on the frequency of occurrence of each sourceblock. A “mismatch codeword” is inserted into the codebook based on the mismatch probability estimate to represent those cases when a block of data to be encoded does not have a codeword in the codebook. During encoding, if a mismatch occurs, a secondary encoding process is used to encode the mismatched sourceblock.

Abstract: A data segment to be written to a set of storage devices is identified, wherein at least one storage device of the set of storage devices has a first allocation unit size that is larger than a second allocation unit size of other storage devices of the set of storage devices. A first subsegment having a first subsegment height corresponding to the second allocation unit size is mapped across the set of storage devices. A second subsegment having a second subsegment height that is a first difference between the first allocation unit size and the second allocation unit size is mapped across a first subset of the set of storage devices. A third subsegment having a third subsegment height that is a second difference between the second allocation unit size and second subsegment height is mapped across a second subset of the set of storage devices.

Abstract: A memory management method is provided. The memory management method includes: allocating, by a processor, a partial area of a memory as a reserved area during booting; identifying, by the processor, a contiguous memory allocation (CMA) area in the reserved area based on a CMA request of a process, wherein the CMA request indicates a required size; adjusting, by the processor, a size of the CMA area based on the size of the CMA area and the required size; and allocating, by the processor, to the process, a portion of the memory in the adjusted CMA area corresponding to the required size.

Abstract: The present disclosure generally relates to improved handling of write commands. The host memory buffer (HMB) or other storage space can be utilized to delay execution of host write commands which will improve write performance in different use cases and will also allow having more concurrent streams than open blocks without impacting write or read performance. Generally, once a write command is received, the write command is revised as a new write command that is logically equivalent to the original write command. The revised write command is moved to the HMB along with the data. In so doing, the write command is coalesced and write command handling is improved.

Abstract: A storage device comprises first and second storage devices mounted on respective first and second PCBs (Printed Circuit Boards) that are separated from each other, the first and second PCBs configured to store different data. The first storage device includes a first storage controller, and a first shock sensor that senses an impact of the first storage device to output a first sensor signal. The second storage device includes a second shock sensor different from the first shock sensor, and senses an impact of the second storage device to output a second sensor signal. The first storage controller outputs a first internal control signal that controls an internal operation of the first storage device based on the first sensor signal. The first storage device and the second storage device transmit data to each other based on the first sensor signal and the second sensor signal.

Abstract: A storage method includes determining layers that are to be merged in a database; determining a data block that is to be modified based on files of the layers that are to be merged in the database; reading a corresponding data block in the memory and reorganizing the read data block, according to a key corresponding to the data block that is to be modified; replacing the data block that is to be modified in the memory with the reorganized data block, when byte size of the reorganized data block does not exceed a first preset value; and storing the key and statistical information of the reorganized data block in a corresponding file of the database.

Abstract: Methods, systems, and devices for low-power boot-up for memory systems are described. A memory system may be configured to receive, over a first conductive path of a second communication interface, a first indication to boot-up a memory system and a first communication interface associated with the memory system, wherein the first communication interface includes a plurality of conductive paths; receive, over a second conductive path of the second communication interface, a second indication whether to perform a boot-up operation of the memory system using a low-power mode or a high-power mode based at least in part on receiving the first indication; and boot the memory system according to the low-power mode or the high-power mode based at least in part on receiving the second indication.

Abstract: A Zoned Namespace data storage device configured to perform logical-to-physical (L2P) address translation using first and second L2P tables of different respective granularities. In an example embodiment, the first L2P table has a finer (e.g., page-level) granularity and is used to perform L2P address translation for open zones. The second L2P table has a coarser (e.g., erase-block) granularity and is used to perform L2P address translation for finished zones. A controller of the data storage device performs granularity-changing transfers of L2P entries between the first and second L2P tables in response to a respective open zone becoming finished and in response to a new zone becoming open. The coarser granularity of the second L2P table enables the full L2P table to have a relatively small size, which can beneficially be used to make more space available in the same amount of RAM for other operations.

Abstract: A memory sub-system can determine a block granularity for an input/output (I/O) data stream received from a host system. The memory sub-system can determine that the block granularity is different than a memory block granularity of a first memory region in a first namespace of the one or more memory devices, where the first memory region is to store the I/O data stream. The memory sub-system can accumulate blocks from the I/O data stream in a second memory region in a second namespace of the one or more memory devices. Responsive to a capacity of the accumulated blocks in the second memory region satisfying a threshold criterion, the memory sub-system can migrate the accumulated plurality of blocks from the second memory region to the first memory region.

Abstract: A transaction manager for use with memory is described. The transaction manager can include a write data buffer to store outstanding write requests, a read data multiplexer to select between data read from the memory and the write data buffer, a command queue and a priority queue to store requests for the memory, and a transaction table to track outstanding write requests, each write request associated with a state that is Invalid, Modified, or Forwarded.

Abstract: Methods, systems, and devices for copy command for a memory system are described. A method may include storing, within a memory system, data associated with one or more first addresses within an address space. The method may further include receiving a copy command for the data from a host for the memory system. The memory system may associate, in response to the copy command, the data with one or more second addresses within the address space.

Abstract: A system and method for simultaneous compression and encryption of data. The system analyzes input data to determine its properties and creates a transformation matrix based on these properties. Using this matrix, the input data is transformed into a modified distribution, generating a main data stream of transformed data and a secondary stream of transformation information. The main data stream is compressed, and both streams are combined into a single output. The system implements security measures to protect against various attacks, including side-channel vulnerabilities. By using a dyadic distribution algorithm, the system achieves both compression and encryption in a single pass over the data, offering significant efficiency gains. The system can operate in both lossless and lossy modes, providing flexibility for different application requirements. This approach offers a unique solution for data transmission and storage scenarios where both data reduction and security are critical concerns.

Abstract: Disclosed herein are an evidence collection guidance method and apparatus for file selection. The evidence collection guidance method includes generating pieces of preliminary analysis information that are pieces of collection target information, setting levels of the pieces of preliminary analysis information based on predefined rules, and generating and outputting notification information including summary description information and follow-up measure items related to the pieces of preliminary analysis information corresponding to the levels.

Abstract: Methods, systems, and devices for memory management procedures for write boost mode are described. A memory system may receive a command to write data. The memory system may write the data to a first location of the memory system using a first mode for storing one bit per memory cell based on receiving the command. The memory system may select a first portion of the data to rewrite to the memory system using a second mode for storing two or more bits per memory cell based on one or more parameters satisfying one or more thresholds. The memory system may write the first portion of the data to a second location of the memory system using the second mode based on selecting the first portion of the data. The memory system may maintain a second portion of the data at the first location of the memory system.

Abstract: Codebook data compaction using a universal codebook and mismatch probability estimations to improve entropy encoding methods. Training data sets are analyzed to determine the frequency of occurrence of each sourceblock in the training data sets. A mismatch probability estimate is calculated comprising an estimated frequency at which any given data sourceblock received during encoding will not have a codeword in the codebook. Entropy encoding is used to generate codebooks comprising codewords for data sourceblocks based on the frequency of occurrence of each sourceblock. A “mismatch codeword” is inserted into the codebook based on the mismatch probability estimate to represent those cases when a block of data to be encoded does not have a codeword in the codebook.

Abstract: A system and method for encrypted data compression, which uses frequency analysis on data blocks within an input data stream to produce a prefix table, representing a first layer of transformation, and which applies a Burrow's-Wheeler transform (BWT) to the data inside the prefix table, representing a second layer of transformation, and which compresses the transformed data. In some implementations, the system and method may further include applying the BWT to a conditioned stream of genomic data, wherein the conditioned stream of data is accompanied by an error stream comprising the differences between the original data and the encrypted data.

Abstract: A system and method for data compaction utilizing distributed codebook encoding to improve entropy encoding methods to account for, and efficiently handle, previously-unseen data in data to be compacted, allow for distributed encoding and decoding capabilities, and allow for parametrized codebook encoding methods. Training data sets are analyzed to determine the frequency of occurrence of each sourceblock in the training data sets. A mismatch probability estimate is calculated comprising an estimated frequency at which any given data sourceblock received during encoding will not have a codeword in the codebook. Further, a codebook and a behavior codebook may both be maintained or altered in a distributed fashion across multiple devices or services, for widespread, or permission-based, or parametrized codebook encoding.

Abstract: Technology is disclosed herein for multi-stage data compaction. In a first data compaction stage valid data fragments from source erase block(s) are programmed into a destination erase block at two bits per memory cell. In a second data compaction stage additional valid data from the source erase block(s) is programmed into the destination erase block at two bits per memory cell. In this second stage, the same physical pages of memory cells in the destination erase block may be programmed such that each memory cell in the destination erase block is programmed to four bits.

Abstract: A technique for copying data from a source range to a destination range includes identifying a chunk of the source range. The chunk includes multiple logical blocks that map, through a series of source-mapping pages, to a set of virtual pages that point to physical data of the chunk. The technique further includes copying the series of source-mapping pages to form a corresponding series of destination-mapping pages pointed to by the destination range, so that a corresponding chunk of the destination range maps, via the series of destination-mapping pages, to the same set of virtual pages mapped to by the series of source mapping pages.