Data correlation-aware erasure code memory replacement method and equipment and memory system

Abstract

The invention discloses a data correlation-aware erasure code memory replacement method and equipment and a memory system, and belongs to the field of computer storage. The method comprises the stepsof: (1) loading data blocks into a memory according to the sequence of read requests, and storing the data blocks in a copy mode; (2) carrying out garbage collection if the number of the executed readrequests reaches a threshold K2, and then shifting to the step (4); otherwise, shifting to the step (3); (3) carrying out erasure code filing if the number reaches a threshold K1, so that associateddata blocks are located in a same strip, and then shifting to the step (4); otherwise, directly shifting to the step (4); and (4) ending the operation if the user request is executed; otherwise, acquiring the next unexecuted read request as the current read request, and shifting to the step (1). By increasing the probability that the data blocks in the same strip are eliminated at the same time, updating expenditure caused by replacement after filing can be reduced, and user access delay is reduced.

Description

technical field [0001] The invention belongs to the field of computer storage, and more specifically relates to a data correlation-aware erasure code memory replacement method, device and memory system. Background technique [0002] In order to speed up data reading and reduce user access latency, more and more data is stored in memory. For example, scientific computing places intermediate result sets in memory for low-latency access. The memory has the characteristics of data volatility. When temporary failures such as power failure and system crash occur, the data in the memory will be lost. Therefore, it is necessary to use copies or erasure codes for fault tolerance. The copy fault-tolerant method is simple and efficient, and can improve the access parallelism, but the space utilization rate is low, while the erasure code guarantees the same fault tolerance as the copy, and its space utilization rate is high, but the access parallelism is low. In order to ensure high f...

AI Technical Summary

Problems solved by technology

Existing erasure coded archiving schemes only focus on reducing the transmission traffic during archiving, without considering the update overhead caused by eliminating cold data blocks due to insuffi

Images