14 results about "Unit size" patented technology

A system and method for storing data in a memory device. The method includes transmitting, to a host, information indicative of a first allowable maximum size of a first namespace associated with a first IU and a second allowable maximum size of a second namespace associated with a second IU. The first and the second IUs may be of different sizes. The includes comprise receiving configuration information comprising one or more instructions to: generate a first L2P table associated with the first IU based on the first allowable maximum size, and generate a second L2P table associated with the second IU based on the second allowable maximum size and generating the first L2P table and the second L2P table based on the configuration information; and causing first data and second data to be stored in the first namespace and the second namespace using the first and second L2P tables respectively.

Example implementations relate to deduplication operations in a storage system. An example includes receiving a set of data units to be stored in persistent storage of a deduplication storage system, and recording the arrival order of the set of data units in a manifest. The example also includes, in response to determining that an average unit size of the set of data units is smaller than a minimum size threshold, identifying a first data unit that is smaller than the minimum size threshold. The example also includes generating an aggregated data unit including the first data unit and a second data unit, and, in response to determining that the size of the aggregated data unit is larger than a target size threshold, replacing, in the manifest, the first data unit and the second data unit with the aggregated data unit.

Aspects of the disclosure provide methods and apparatuses. The apparatus includes processing circuitry to decode, from a coded video bitstream, coding information of a coding block (CB) in a picture. The coding information indicates a width W and a height H of the CB. The processing circuitry partitions the CB into sub-processing units (SPUs) having a width of a minimum of W and K and a height of a minimum of H and K. At least one of the width W and the height H is greater than a processing data unit size K. The processing circuitry determines a partition structure to partition the SPUs based on the width, the height, and a maximum transform unit (TU) size M. At least one of the width and the height is greater than M. The processing circuitry partitions each of the SPUs into MxM TUs based on the partition structure.

A method of compressing data for transfer between a local storage of a processor and an external storage. The data is formed in an array of three or more dimensions and the method comprises sequentially reading data stored in the local storage to a compressor in units of data. Each unit has a predetermined unit size corresponding to an integer number of a tile size. At an extremity of the array, a partial unit of data is read in a case that the array size is not an integer multiple of the unit size. The partial unit of data is filled at the compressor and the filled data is compressed on a tile-by-tile basis to form compressed data. The compressed data associated with the unit of data is transferred to the external storage.

The present application discloses a method for optimizing the memory management of the 5G NR RLC window. The RLC uplink window in the 5G NR in the acknowledged mode is implemented by a first pointer array. A memory of a first basic unit size is initialized and allocated for the first pointer array. If the allocated memory of the first pointer array has been used up, the UE allocates an additional memory of a first basic unit size for the first pointer array, and uses a pointer in the newly allocated memory of the first pointer array to record the storage address of the original data of the upcoming uplink RLC PDU to be sent. After the UE receives the uplink status report sent by the network side, the UE releases the memory space of the pointer of the uplink RLC PDU that has received the ACK information from the network side in the RLC uplink window. The above method implements the 5G NR RLC uplink window by using a first pointer array that dynamically allocates and releases memory, significantly saving the occupation of system memory.

Allocation units having equal allocation unit sizes are formed for writing into erase blocks of a storage system. One or more of the allocation units are formed of at least a portion of two erase blocks. Data is written to the erase blocks forming the allocation units such that one of the erase blocks is open at a time during the writing of the data.

The invention discloses a key expansion method and device and a storage medium, and the method comprises the steps: a terminal carries out the expansion of a local to-be-expanded source key file according to an expansion proportion M negotiated with a quantum key access gateway, and finally obtains and stores an expanded key file; the expansion comprises the following steps: recording the size of the to-be-expanded source key file as X, and then equally dividing the X-size to-be-expanded source key file into a file A and a file B; obtaining a minimum unit size C for executing the XOR calculation, and dividing the file A and the file B according to the minimum unit size for executing the XOR calculation to obtain N sub-files; obtaining N sub-files of the file A and the file B, and carrying out XOR calculation to obtain expanded first to 2M secret key files; and finally, splicing to obtain a complete expanded key file, and storing the complete expanded key file. According to the invention, during the key expansion operation, the time used by the key expansion process is shortened, and the key expansion rate is improved.

A system and method for improving program performance and reducing program cost by automatically providing and managing an appropriate memory pool cell size adapted to each executing application. The data is processed using a corresponding time series prediction model by collecting a time series of historical data for use with respect to a memory pool of an application over a period of time to predict a size of assignments for the application, and in particular, a predicted number of assignments and a corresponding predicted assignment unit size. A clustering-based approach is further applied to predict the size of an allocation of an application, using real-time execution for scaling, supplementation, and interpolation. A method runs another timing prediction model trained to predict adjustment parameters to refine a memory pool storage area size for processing a memory allocation request based on a predicted size of a memory unit and one or more application profile features associated with a requested application.

Techniques can include: receiving host write I / Os; and performing processing that persistently records the host write I / Os on a log device including a metadata log for storing metadata portions for the host write I / Os. The processing can include: aggregating, in a write aggregation queue, log write requests that write metadata portions for the host write I / Os in a segment of metadata log entries of the metadata log of the log device; and responsive to determining that i) the log write requests corresponding to the segment write an amount of metadata equal to a maximum size, or ii) a maximum amount of time has elapsed during said aggregating, sending an aggregated write request to the metadata log of the log device, wherein the aggregated write request writes the metadata portions to the segment of metadata log entries. The maximum size can denote an integrated unit size of the log device.

This application discloses a method, electronic device, storage medium, and product for inspecting and repairing mirrored volumes, relating to the field of storage technology. The method includes: receiving a volume repair command from a client, the volume repair command being used to perform an inspection and repair operation on a secondary copy volume in a mirrored volume corresponding to a target virtual disk; obtaining the storage unit size of a single storage unit, the logical block size of a single logical block, and the logical address range size corresponding to each domain of the secondary copy volume; when the mirrored volume is an unowned mirrored volume, generating a task request based on a preset starting logical block address, logical block size, storage unit size, logical address range size, and a first quantity; and distributing the task request to the owner node of each domain, so that each owner node performs an inspection and repair operation on the storage blocks to be repaired within its respective domain based on the task request. This application solves the problem of long processing paths for inspection and repair tasks on unowned mirrored volumes, improving the efficiency of performing inspection and repair operations.

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.

The invention discloses a mirror image volume inspection and repair method, electronic equipment, a storage medium and a product, and relates to the technical field of storage, the method comprises the steps that a volume repair command issued by a client is received, and the volume repair command is used for executing inspection and repair operation on an auxiliary copy volume in a mirror image volume corresponding to a target virtual disk; obtaining a storage unit size of a single storage unit of the auxiliary copy volume, a logic block size of a single logic block and a logic address interval size corresponding to each domain; when the mirror image volume is a non-attribution mirror image volume, generating a task request according to a preset initial logic block address, a logic block size, a storage unit size, a logic address interval size and a first number; and distributing the task request to the attribution node of each domain, so that each attribution node executes inspection repair operation on the to-be-repaired storage block in the respective domain based on the task request. The problem that the processing path of the inspection and repair task of the non-attribution mirror image volume is long is solved, and the efficiency of executing the inspection and repair operation is improved.

Techniques can include: receiving host write I / Os; and performing processing that persistently records the host write I / Os on a log device including a metadata log for storing metadata portions for the host write I / Os. The processing can include: aggregating, in a write aggregation queue, log write requests that write metadata portions for the host write I / Os in a segment of metadata log entries of the metadata log of the log device; and responsive to determining that i) the log write requests corresponding to the segment write an amount of metadata equal to a maximum size, or ii) a maximum amount of time has elapsed during said aggregating, sending an aggregated write request to the metadata log of the log device, wherein the aggregated write request writes the metadata portions to the segment of metadata log entries. The maximum size can denote an integrated unit size of the log device.

A system and method for storing data in a memory device. The method includes transmitting, to a host, information indicative of a first allowable maximum size of a first namespace associated with a first IU and a second allowable maximum size of a second namespace associated with a second IU. The first and the second IUs may be of different sizes. The includes comprise receiving configuration information comprising one or more instructions to: generate a first L2P table associated with the first IU based on the first allowable maximum size, and generate a second L2P table associated with the second IU based on the second allowable maximum size and generating the first L2P table and the second L2P table based on the configuration information; and causing first data and second data to be stored in the first namespace and the second namespace using the first and second L2P tables respectively.