A computer-implemented method includes refreshing a set of memory channels in a memory system substantially simultaneously, each memory channel refreshing a rank that is distinct from each of the other ranks being refreshed. Further, the method includes marking a memory channel from the set of memory channels as being unavailable for the rank being refreshed in the memory channel. In one or more examples, the method further includes blocking a fetch command to the memory channel for the rank being refreshed in the memory channel.
Legal claims defining the scope of protection, as filed with the USPTO.
2. The computer-implemented method of claim 1, further comprising blocking a fetch command to the first memory channel for the rank a being refreshed in the first memory channel.
3. The computer-implemented method of claim 2, wherein in response to the fetch command being blocked and an error in a third memory channel that is different from the first memory channel, the fetch command is repeated for the third rank being refreshed in the third memory channel.
5. The computer-implemented method of claim 4, further comprising, in response to an error during reconstructing the fetch data, reissuing the fetch command to the first memory channel for the rank a being refreshed in the first memory channel.
6. The computer-implemented method of claim 4, further comprising, in response to an error during reconstructing the fetch data, reissuing the fetch command to all of the available memory channels for the rank a.
7. The computer-implemented method of claim 1, wherein the memory system is a redundant array of independent memory (RAIM) error correcting code memory system.
9. The system of claim 8, further comprising blocking a fetch command to the first memory channel for the rank a being refreshed in the first memory channel.
10. The system of claim 9, wherein in response to the fetch command being blocked and an uncorrectable error in a third memory channel that is different from the first memory channel, the fetch command is repeated for the third rank being refreshed in the third memory channel.
12. The system of claim 11, wherein the method further comprises, in response to an error during reconstructing the fetch data, reissuing the fetch command to the first memory channel for the rank a.
13. The system of claim 11, wherein the method further comprises, in response to an error during reconstructing the fetch data, reissuing the fetch command to all of the available memory channels for the rank a being refreshed in the first memory channel.
14. The system of claim 8, wherein a mark for the memory channel can include an indication of a correctable error check or of an uncorrectable error check.
16. The computer program product of claim 15, further comprising blocking a fetch command to the memory channel for the rank a being refreshed in the first memory channel.
17. The computer program product of claim 16, wherein in response to the fetch command being blocked and an uncorrectable error in a third memory channel that is different from the first memory channel, the fetch command is repeated for the third rank being refreshed in the third memory channel.
19. The computer program product of claim 18, wherein the method further comprises, in response to an error during reconstructing the fetch data, reissuing the fetch command to the first memory channel for the rank a being refreshed in the first memory channel.
20. The computer program product of claim 18, wherein the method further comprises, in response to an error during reconstructing the fetch data, reissuing the fetch command to all of the available memory channels for the rank a.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
January 13, 2020
December 6, 2022
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.