It is necessary to introduce the conception of cache refresh which has been stated in pervious sections. Cache
refresh contains several steps: First, detecting the status of a memory cell before its current run out. Then, supplement that exhausted state by rewriting it. The whole process is executed sequentially in the cache block. In computer architecture theory, data in Cache follow the rules of
temporal locality. During the execution of a program, processor access pattern tends to be "cluster". That is to say,
data being used is generally referenced again very frequently. Furthermore, once a data in STT-L1 cache ceases being accessed by CPU, it will be finally replaced by other data