Architectural extensions for memory mirroring at page granularity on demand
US-2024152281-A1 · May 9, 2024 · US
US9465735B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9465735-B2 |
| Application number | US-201314045784-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 3, 2013 |
| Priority date | Oct 3, 2013 |
| Publication date | Oct 11, 2016 |
| Grant date | Oct 11, 2016 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Systems and methods for uniformly interleaving memory accesses across physical channels of a memory space with a non-uniform storage capacity across the physical channels are disclosed. An interleaver is arranged in communication with one or more processors and a system memory. The interleaver identifies locations in a memory space supported by the memory channels and is responsive to logic that defines virtual sectors having a desired storage capacity. The interleaver accesses the asymmetric storage capacity uniformly across the virtual sectors in response to requests to access the memory space.
Opening claim text (preview).
What is claimed is: 1. A method for uniformly interleaving memory accesses to a memory space having a non-uniform storage capacity across physical channels, the method comprising: identifying when a multiple-channel memory architecture is provided an asymmetric storage capacity across the physical channels; using logic responsive to the identifying to define a number of virtual sectors of equal capacity; and applying an interleaving function via an interleaver that accesses the asymmetric storage capacity uniformly across the virtual sectors in response to requests to access the memory space, wherein the number of virtual sectors of equal capacity is fewer in number than a number of memory modules supporting the memory space. 2. The method of claim 1 , wherein a number of the physical channels is even and the number of virtual sectors of equal capacity is odd. 3. The method of claim 1 , wherein a number of the physical channels is odd and the number of virtual sectors of equal capacity is even. 4. The method of claim 1 , wherein the applying an interleaving function includes applying a spreading function. 5. The method of claim 4 , wherein the spreading function dynamically distributes memory accesses in a defined ratio between physical channels over the memory space. 6. The method of claim 1 , wherein the number of virtual sectors of equal capacity is greater than a number of memory modules supporting the memory space. 7. The method of claim 1 , wherein the memory space is supported by an odd number of memory modules of the same storage capacity. 8. The method of claim 1 , wherein the memory space is supported by an even number of memory modules with at least one memory module having a storage capacity that is different from the storage capacity of the remaining memory modules. 9. The method of claim 1 , wherein operations that access the memory space are supported at a data transfer rate to each of the physical channels that exceeds a non-interleaved data transfer rate. 10. The method of claim 1 , wherein operations that access the memory space via a first physical channel are supported at a first data transfer rate and operations that access the memory space via a second physical channel are supported at a second data transfer rate that is different from the first data transfer rate. 11. The method of claim 10 , wherein the first data transfer rate is a function of the second data transfer rate. 12. The method of claim 11 , wherein the first data transfer rate and the second data transfer rate are determined based on a number of virtual sectors supported by a physical channel. 13. A computing device, comprising: an interleaver arranged on a bus in communication with a processor and a system memory, the interleaver configured to identify locations in a memory space supported by at least two physical channels, the interleaver responsive to logic that identifies virtual sectors having a desired storage capacity; and at least one memory module coupled to the at least two physical channels, respectively, the memory space having a non-uniform storage capacity between the physical channels, wherein the interleaver accesses the non-uniform storage capacity uniformly across the virtual sectors in response to requests to access the memory space, wherein a number of virtual sectors of equal capacity is responsive to a parameter received in the processor. 14. The computing device of claim 13 , further comprising: a memory controller that signals the interleaver when the at least two physical channels are provided a disparate storage capacity between the at least two physical channels. 15. The computing device of claim 13 , wherein the interleaver applies an N-way spreading function, where N is an integer, the N-way spreading function dynamically distributing memory accesses in a defined ratio between physical channels over the memory space. 16. The computing device of claim 13 , wherein a number of virtual sectors of equal capacity is fewer in number than a number of memory modules supporting the memory space. 17. The computing device of claim 13 , wherein the memory space is supported by an odd number of memory modules of the same storage capacity. 18. The computing device of claim 13 , wherein operations that access the memory space are supported at a data transfer rate to each of the physical channels that exceeds a non-interleaved data transfer rate. 19. The computing device of claim 13 , wherein operations that access the memory space via a first physical channel are supported at a first data transfer rate and operations that access the memory space via a second physical channel are supported at a second data transfer rate that is different from the first data transfer rate. 20. The computing device of claim 13 , wherein a first data transfer rate is applied across a first set of physical channels and a second data transfer rate is applied across a second set of physical channels. 21. The computing device of claim 20 , wherein the first data transfer rate and the second data transfer rate are determined as a function of a number of virtual sectors supported by a physical memory channel. 22. A computing device, comprising: means for identifying a memory space arranged with non-uniform storage capacity across a multiple-channel memory access architecture; means for identifying a number of virtual sectors of equal storage capacity in the memory space; means for applying an interleaving function that uniformly accesses the virtual sectors in response to requests to access the memory space, wherein a number of virtual sectors of equal capacity is fewer in number than a number of memory modules supporting the memory space. 23. The computing device of claim 22 , wherein the memory space is supported by an integer number of memory modules. 24. The computing device of claim 23 , wherein at least one memory module has a storage capacity that is different than the storage capacity of the remaining memory modules. 25. The computing device of claim 22 , wherein the means for applying an interleaving function applies an N-way spreading function, where N is an integer. 26. The computing device of claim 25 , wherein the N-way spreading function dynamically distributes memory accesses in a defined ratio between physical channels over the memory space. 27. The computing device of claim 22 , wherein a number of virtual sectors of equal capacity is responsive to a parameter received in a processor. 28. The computing device of claim 22 , wherein the memory space is supported by an odd number of memory modules of the same storage capacity. 29. The computing device of claim 22 , wherein operations that access the memory space are supported at a data transfer rate to each of the physical channels that exceeds a non-interleaved data transfer rate. 30. The computing device of claim 22 , wherein operations that access the memory space via a first physical channel are supported at a first data transfer rate and operations that access the memory space via a second physical channel are supported at a second data transfer rate that is different from the first data transfer rate. 31. The computing device of claim 30 , wherein the first data transfer rate is a function of the second data transfer rate. 32. The com
Interleaved addressing · CPC title
with interleaved bank access · CPC title
Access to multiple memories · CPC title
Details of memory controller · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.