Memories may be included in a variety of apparatuses, such as computers or other devices, including but not limited to portable memory devices, solid state drives, personal digital assistants, music players, cameras, phones, wireless devices, displays, chip sets, set top boxes, gaming systems, vehicles, and appliances. Memories may be volatile, where power is needed to store date, and non-volatile, where data is stored even if power is not provided to the memory, or combinations of volatile and non-volatile memory. There are many different types of volatile and non-volatile memory including random-access memory (RAM), read only memory (ROM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), flash memory, and resistance variable memory, among others.
Memories, such as resistance variable memory devices, may be used as non-volatile memory for a wide range of electronic devices. Resistance variable memory devices may include, for example, phase change memory (PCM) or resistive memory, among others. In some instances, it may be desirable to use PCM to implement random access memory. As a result of the limitations of using PCM as RAM replacement, operation of PCMs in memory systems may be restricted and/or require additional mechanisms for operation. For example, blocks of PCMs may be limited to a relatively low number of write operations compared to RAM and may require additional housekeeping mechanisms (e.g., wear leveling operations, refresh operations) to ensure feasible RAM replacement.
Apparatuses and methods for commands to perform wear leveling operations are described herein. Certain details are set forth below to provide a sufficient understanding of embodiments of the invention. However, it will be clear to one having skill in the art that embodiments of the invention may be practiced without these particular details. Moreover, the particular embodiments of the present invention described herein are provided by way of example and should not be used to limit the scope of the invention to these particular embodiments. In other instances, well-known circuits, control signals, timing protocols, and software operations have not been shown in detail in order to avoid unnecessarily obscuring the invention.
The memory 120 may be configured to perform operations (e.g., read operations, write operations, or wear leveling operations) in response to received memory commands and/or addresses provided by the host 110. By way of example, the memory 120 may provide data to the host 110 over the data bus 135 responsive to a read command, and may store data received over the data bus 135 responsive to a write command. As another example, the memory 120 may perform a wear leveling operation responsive to a wear leveling command, described further below.
The memory 120 may further provide information to the host 110 over the data bus 135. Information provided by the memory 120 to the host 110 may, for instance, be included in an acknowledgement provided to the host 110 in response to one or more commands. Acknowledgements may, for instance, be provided following a variable latency period. With reference to
In some examples, the memory 120 may be configured to track write operations performed by the memory 120. In particular, the memory 120 may track a “global write count,” or the number of write operations performed by the memory 120 since the memory 120 last performed a wear leveling operation. Once the global write count has exceeded a threshold, the memory 120 may recommend the host 110 provide a wear leveling command. In some instances, the memory 120 may selectively ignore wear leveling commands based on the global write count. The memory 120 may, for instance, ignore wear leveling commands if the global write count does not exceed a threshold.
Additionally or alternatively, in some examples, the memory 120 may be configured to track a number of write operations performed on each block of an array associated with the memory 120. In particular, the memory 120 may track a “local write count” for each block, or a number of write operations performed by the memory 120 on each block since the memory 120 last performed a wear leveling operation. Once a local write count has exceeded a threshold, the memory 120 may recommend the host 110 provide a wear leveling command, and in some instances, the memory 120 may selectively ignore wearing commands based on the local write count. In this manner, the memory 120 may recommend the host 110 provide a wear leveling command in response to performing an operation at a particular block (e.g., maximum cycled block) a particular number of times since last performing a wear leveling operation.
The memory control unit 310 may be configured to control operation of the one or more components of the memory 300. By way of example, the memory control unit 310 may be coupled to the buffer 320 and the array 330 and may be configured to control operation of the buffer 320 and the array 330. The memory control unit 310 may be configured to receive commands and addresses from the CA bus 130 and the buffer 320 may be configured to receive information from the data bus 135 and provide information to the data bus 135. The memory control unit 310 may be configured to cause data (e.g., write data or read data) to be provided between the buffer 320 and the array 330 over the data bus 340 in response to received commands and addresses. For example, in response to a write command, the memory control unit 310 may cause write data to be provided from the buffer 320 to the array 330. Similarly, in response to a read command, the memory control unit 310 may cause read data to be provided from the array 330 to the buffer 320.
The memory control unit 310 may further be configured to perform wear leveling operations. Generally, the memory control unit 310 may be configured to perform wear leveling operations in accordance with static wear leveling, dynamic wear leveling, or a combination thereof. Accordingly, performing a wear leveling operation may include reallocating data between various blocks of the memory array 330 and/or reassigning one or more addresses (e.g., block addresses) corresponding thereto. In some examples, performing a wear leveling operation may include storing addresses in one or more address registers 312. The address registers 312 may be volatile or non-volatile registers and may be included in the memory control unit 310, as illustrated, and/or may be located in one or more other components of the memory 300.
The memory control unit 310 may include wear leveling logic 315 for performing a wear leveling operation. The wear leveling logic 315 may be implemented in hardware, software, or combinations thereof. By way of example, the memory control unit 310 may be implemented, at least in part, using a controller, and the wear leveling logic 315 may be stored in non-volatile memory of the controller as one or more computer-readable instructions executable by one or more processing units (e.g., processors) of the memory control unit 310.
In some embodiments, the memory control unit 310 may further be configured to set one or more status bits of a register. For example, the memory control unit 310 may be configured to set a bit of the flag status register 350 having a logic state indicating whether a wear leveling operation is being performed (e.g., the bit of the flag status register 350 having a logic state of “1”). In another example, the memory control unit 310 may be configured to set a bit of the flag status register 350 indicating whether a wear leveling operation is recommended (e.g., the bit of the flag status register 350 having a logic state of “1”). Acknowledgements provided to the host 110 may be based on one or more bits of the flag status register, and accordingly, whether an acknowledgement recommends the host 110 provide a wear leveling command may be based on a bit of the flag status register 350. The bit of the flag status register 350 indicating whether a wear leveling operation is recommended may be set by the memory control unit 310 based on a number of write commands performed since a wear leveling operation was last performed. Additionally or alternatively, the logic state of the bit written by the memory control unit 310 may be set based on an amount of time since a wear leveling operation was performed. The memory 110 may provide information indicative of the state of each bit of the flag status register 350 in response to a read flag status register (RFSR) command to the memory 300.
As described, the memory 300 may track (e.g., count) a global write count indicative of the number of write operations performed by the memory 300 since a wear leveling operation was last performed by the memory 300 and/or may track local write counts indicative of the number of write operations performed at each block of an array associated with the memory 300, such as the array 330. By way of example, the global write count and/or the local write counts may be tracked using a counter 311 located in the memory control unit 310. Responsive to the global write count and/or a local write count exceeding a threshold, the memory control unit 310 may recommend the host 110 provide a wear leveling command. In some examples, the counter 311 may alternatively be stored in the buffer 320, or any other component of the memory 300.
Further, while the memory control unit 310 may perform wear leveling operations in response to commands provided by the host 110, in some instances the memory control unit 310 may automatically perform wear leveling operations. By way of example, the memory control unit 310 may perform a wear leveling operation in response to the global write count exceeding a threshold. The global write count threshold causing the memory control unit 310 to automatically perform a wear leveling operation may exceed the global write count threshold causing the memory control unit 310 to recommend the host 110 provide a wear leveling command. As an example, a global write count of 10,000 write operations may cause the memory control unit 310 to recommend the host 110 provide a wear leveling command, for instance by setting a bit of the flag status register 350 having an appropriate logic state, and a global write count of 100,000 write operations may cause the memory control unit to automatically perform a wear leveling operation. As another example, the memory control unit 310 may perform a wear leveling operation in response to a local write count exceeding a threshold. A local write count threshold causing the memory control unit 310 to automatically perform a wear leveling operation may exceed the local write count threshold causing the memory control unit 310 to recommend the host 110 provide a wear leveling command. In other examples, the memory control unit 310 may not automatically perform wear leveling operations, or the memory control unit 310 may be configured to selectively perform wear leveling operations automatically, for instance, based on a control signal or command provided by the host 110.
The array 330 may comprise any array known in the art, now or in the future, and as described, may be divided into blocks. The array 330 may include a volatile portion of memory, a non-volatile portion of memory (e.g., PCM memory), or a combination thereof. The array 330 may include a data structure for tracking various attributes of the array 330 over time. By way of example, the array 330 may include an address map 332 that includes information specifying the relationship between logical addresses of the array 330 and physical addresses of the array 330. The logical addresses may be related to the addresses provided to the memory by the host, such as the addresses associated with a read command and a write command. As another example, the array 330 may include a write count map 334 that includes information that may indicate a number of write operations performed on each block of the array 330, for instance, over a life of the array 330. In some examples, the address map 332 and the write count map 334 may additionally or alternatively be stored in the memory control unit 310. The memory control unit 310 may be configured to read and/or modify the address map 332 and the write count map 334.
At step 405, the memory control unit 310 may identify a maximum cycled block and a spare block of the array 504. The maximum cycled block may be a block having a highest write count of each of the blocks array 504 as indicated by the write count map 506. The spare block may be any block in the array 504 that may be used as a spare wear leveling block. The spare block may be any block not storing any data and/or blocks designated as not storing persistent data.
With reference to
In turn, the memory control unit 310 may identify a logical address LBAM and a physical address PBAM in the address map 502 associated with the identified maximum cycled block. Similarly, the memory control unit 310 may identify a spare block and identify a logical address SPARE and a physical address PBAi associated with the identified spare block. At step 410, the memory control unit 310 may store the logical address LBAM and the physical address PBAM in the address registers 508. As illustrated in
With reference to
With reference to
At step 430, the memory control unit 310 may identify a minimum cycled block. The minimum cycled block may be a block having a lowest write count of each of the blocks BLOCK0-BLOCK7 of array 504 as indicated by the write count map 506. With reference to
With reference to
With reference to
Accordingly, the memory control unit 310 may perform a wear leveling operation such that the logical address LBAm may be associated with the physical address PBAM and thus the maximum cycled block of the array 504. Additionally, the logical address SPARE may be associated with the physical address PBAm and thus the minimum cycled block BLOCK3 of the array 504, and the logical address LBAM may be associated with the physical address PBAi and thus becoming the spare block of the array 504. Assigning addresses in this manner may, for instance, more evenly distribute write operations among blocks BLOCK0-BLOCK7 of the array 504 and thereby provide prolonged operation of the array 504.
While the method 400 has been described as including particular steps in a particular order, in some examples, steps of the method 400 may be performed in any order and further may include additional steps and/or omit one or more described steps. In some examples, for instance, the maximum and minimum cycled blocks may be identified at a same time and logical and/or physical addresses of the maximum and minimum cycled blocks may be stored simultaneously in address registers 508.
From the foregoing it will be appreciated that, although specific embodiments of the invention have been described herein for purposes of illustration, various modifications may be made without deviating from the spirit and scope of the invention. Accordingly, the invention is not limited except as by the appended claims.
This application is a divisional of U.S. patent application Ser. No. 14/288,663, filed May 28, 2014. This application is incorporated by reference herein in its entirety and for any purposes.
Number | Name | Date | Kind |
---|---|---|---|
5287469 | Tsuboi | Feb 1994 | A |
5369616 | Wells et al. | Nov 1994 | A |
5822244 | Hansen et al. | Oct 1998 | A |
6000006 | Bruce | Dec 1999 | A |
6026034 | Suzuki et al. | Feb 2000 | A |
6552956 | Shibata | Apr 2003 | B2 |
6629224 | Suzuki et al. | Sep 2003 | B1 |
6879540 | Maruyama et al. | Apr 2005 | B2 |
6996016 | Oh | Feb 2006 | B2 |
7139673 | Vashi et al. | Nov 2006 | B1 |
7579683 | Falik et al. | Aug 2009 | B1 |
7624209 | Ansari et al. | Nov 2009 | B1 |
7865658 | Lasser et al. | Jan 2011 | B2 |
8004884 | Franceschini et al. | Aug 2011 | B2 |
8250417 | Feeley | Aug 2012 | B2 |
8478930 | Syu | Jul 2013 | B1 |
8582356 | Abdulla | Nov 2013 | B2 |
8902684 | Kwean | Dec 2014 | B2 |
9042156 | Nakura et al. | May 2015 | B2 |
9734097 | Mirichigni et al. | Aug 2017 | B2 |
9754648 | Mirichigni et al. | Sep 2017 | B2 |
10067890 | Mirichigni et al. | Sep 2018 | B2 |
10163472 | Mirichigni et al. | Dec 2018 | B2 |
10740263 | Mirichigni et al. | Aug 2020 | B2 |
10885957 | Mirichigni et al. | Jan 2021 | B2 |
20020006074 | Roohparvar | Jan 2002 | A1 |
20020168816 | Shibata | Nov 2002 | A1 |
20040098549 | Dorst | May 2004 | A1 |
20050068812 | Oh | Mar 2005 | A1 |
20060028883 | Shimoyama | Feb 2006 | A1 |
20060069812 | Osborne | Mar 2006 | A1 |
20060268619 | Chen | Nov 2006 | A1 |
20060282717 | Suda | Dec 2006 | A1 |
20070005829 | Fujimoto | Jan 2007 | A1 |
20070005922 | Swaminathan et al. | Jan 2007 | A1 |
20070145151 | Nakamura et al. | Jun 2007 | A1 |
20070150688 | Osborne et al. | Jun 2007 | A1 |
20070156991 | Gould et al. | Jul 2007 | A1 |
20070208904 | Hsieh et al. | Sep 2007 | A1 |
20070217253 | Kim et al. | Sep 2007 | A1 |
20080117682 | Byeon | May 2008 | A1 |
20080155301 | Ahvenainen et al. | Jun 2008 | A1 |
20080162798 | Lofgren | Jul 2008 | A1 |
20080270811 | Chow et al. | Oct 2008 | A1 |
20080313505 | Lee | Dec 2008 | A1 |
20080320214 | Ma et al. | Dec 2008 | A1 |
20090044190 | Tringali et al. | Feb 2009 | A1 |
20090235025 | Kondo | Sep 2009 | A1 |
20090265514 | Biles et al. | Oct 2009 | A1 |
20100013675 | Bennett | Jan 2010 | A1 |
20100023675 | Chen et al. | Jan 2010 | A1 |
20100124090 | Arai | May 2010 | A1 |
20100124102 | Lee et al. | May 2010 | A1 |
20100161880 | You | Jun 2010 | A1 |
20100161932 | Stern et al. | Jun 2010 | A1 |
20100172179 | Gorobets et al. | Jul 2010 | A1 |
20100174955 | Carnevale et al. | Jul 2010 | A1 |
20100269118 | Arimilli et al. | Oct 2010 | A1 |
20110035536 | Shim et al. | Feb 2011 | A1 |
20110047319 | Jeon et al. | Feb 2011 | A1 |
20110072190 | Borracini et al. | Mar 2011 | A1 |
20110145483 | Sudo | Jun 2011 | A1 |
20110153900 | Zitlaw | Jun 2011 | A1 |
20110170354 | DeCaro et al. | Jul 2011 | A1 |
20110197014 | Yeh | Aug 2011 | A1 |
20110238866 | Zitlaw | Sep 2011 | A1 |
20110289255 | Wang et al. | Nov 2011 | A1 |
20120017053 | Yang et al. | Jan 2012 | A1 |
20120054419 | Chen et al. | Mar 2012 | A1 |
20120066434 | Zitlaw | Mar 2012 | A1 |
20120117303 | Carannante et al. | May 2012 | A1 |
20120124317 | Mirichigni et al. | May 2012 | A1 |
20120131263 | Yeh | May 2012 | A1 |
20120131304 | Franceschini et al. | May 2012 | A1 |
20120173809 | Ko et al. | Jul 2012 | A1 |
20120179860 | Falanga et al. | Jul 2012 | A1 |
20120213005 | Lee | Aug 2012 | A1 |
20120216085 | Weingarten et al. | Aug 2012 | A1 |
20120265922 | Post et al. | Oct 2012 | A1 |
20120314498 | Feeley | Dec 2012 | A1 |
20120324141 | Seong et al. | Dec 2012 | A1 |
20120331207 | Lassa et al. | Dec 2012 | A1 |
20130036253 | Baltar | Feb 2013 | A1 |
20130058175 | Lin et al. | Mar 2013 | A1 |
20130159766 | D'Abreu et al. | Jun 2013 | A1 |
20130191704 | Eleftheriou et al. | Jul 2013 | A1 |
20130282967 | Ramanujan | Oct 2013 | A1 |
20140013028 | Rametta | Jan 2014 | A1 |
20140082259 | Yeh | Mar 2014 | A1 |
20140089562 | Deguchi et al. | Mar 2014 | A1 |
20140122822 | Mirichigni et al. | May 2014 | A1 |
20140136771 | Cornwell et al. | May 2014 | A1 |
20140215129 | Kuzmin et al. | Jul 2014 | A1 |
20140281182 | Mirichigni et al. | Sep 2014 | A1 |
20150067232 | Fontana | Mar 2015 | A1 |
20150095551 | Confalonieri et al. | Apr 2015 | A1 |
20150100744 | Mirichigni | Apr 2015 | A1 |
20150106551 | Kim | Apr 2015 | A1 |
20150363120 | Chen | Dec 2015 | A1 |
20170309318 | Mirichigni et al. | Oct 2017 | A1 |
20170329534 | Mirichigni et al. | Nov 2017 | A1 |
20180349302 | Mirichigni et al. | Dec 2018 | A1 |
20190080733 | Mirichigni et al. | Mar 2019 | A1 |
Number | Date | Country |
---|---|---|
1497604 | May 2004 | CN |
1860460 | Nov 2006 | CN |
101030166 | Sep 2007 | CN |
102789423 | Nov 2012 | CN |
2005108395 | Apr 2005 | JP |
20090094333 | Sep 2009 | KR |
20110014923 | Feb 2011 | KR |
Entry |
---|
English Translation of Notice of Preliminary Rejection dated Jan. 21, 2019 for Korean application No. 10-2016-7036706. |
International Search Report and Written dated Jul. 14, 2015 received for PCT/US2015/027490. |
Notice of Preliminary Rejection dated Mar. 21, 2018 for Korean Application No. 10-2016-7036706. |
Restriction Requirement dated Nov. 26, 2018 for Chinese application No. 201580028254.7. |
“available” —Definition from Wiktionary, the free dictionary—Archived revision by Tuvalkin (talk | contribs) as of 21:49, Jan. 5, 2012. https://en.wiktionary.org/w/index/php?title=available&oldid=15765189 Downloaded Jan. 13, 2016, Jan. 5, 2012. |
English Translation of First Office Action for CN application No. 201580028254.7 dated Mar. 27, 2019 pp. all. |
Notice of Final Rejection for KR application No. 10-2016-7036706 dated Sep. 28, 2018, pp. all. |
“JEDEC—Low Power Double Data Rate 2 (LPDDR2)”, Feb. 2010. |
Qureshi, et al., “Enhancing Lifetime and Security of PCM-Based Main Memory with Start-Gap Wearing Leveling”, Microarchitecture, 2009 42nd Annual IEEE/ACM International Symposium, Dec. 12-16, 2009, 14-23. |
English translation of Office Action for Application No. 201580028254.7, dated Sep. 18, 2019. |
Final Rejection for CN Application No. 201580028254.7, dated Apr. 3, 2020. |
Number | Date | Country | |
---|---|---|---|
20190347012 A1 | Nov 2019 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14288663 | May 2014 | US |
Child | 16523860 | US |