The present invention relates generally to a non-volatile memory management system, and more particularly to a system for managing erase blocks within a non-volatile memory management system.
Flash memory devices have developed into a popular source of non-volatile memory for a wide range of electronic applications. Flash memory devices typically use a one-transistor memory cell that allows for high memory densities, high reliability, and low power consumption. Changes in threshold voltage of the cells, through programming of charge storage or trapping layers or other physical phenomena, determine the data value of each cell. Common uses for flash memory and other non-volatile memory include personal computers, personal digital assistants (PDAs), digital cameras, digital media players, digital recorders, games, appliances, vehicles, wireless devices, cellular telephones, and removable memory modules, and the uses for non-volatile memory continue to expand.
Flash memory typically utilizes one of two basic architectures that are known as NOR flash and NAND flash. The designation is derived from the logic used to read the devices. In NOR flash architecture, a column of memory cells are coupled in parallel with each memory cell coupled to a bit line. In NAND flash architecture, a column of memory cells are coupled in series with only the first memory cell of the column coupled to a bit line.
Flash memory and other non-volatile memories are often grouped into sections called “erase blocks.” Each of the cells within an erase block can be electrically programmed selectively by altering the threshold voltage of an individual cell from an initial state. However, cells of the erase block are erased, or reverted to their initial state, generally in a single operation across the entire block. Any data in the erase block that is desired to be retained by the memory device must first be copied to another location or buffer before performing the erase operation.
In part because of their large block sizes, NAND devices are primarily used for storing data, such as audio, video or image files. Such files are frequently read, but generally infrequently modified. Increasingly, however, NAND devices are being designed into embedded systems. Such systems have need for code and temporary parameter storage as well as data storage. However, code and parameter data requires relatively frequent modification, requiring frequent and extensive movement or buffering of the data in a block that is to be retained. As memory densities continue to increase, block sizes are also tending to increase, thus exacerbating this problem.
Thus, a need still remains for a non-volatile memory management system. In view of the expanding applications of non-volatile memory into dynamic data management systems, it is increasingly critical that answers be found to these problems. In view of the ever-increasing commercial competitive pressures, along with growing consumer expectations and the diminishing opportunities for meaningful product differentiation in the marketplace, it is critical that answers be found for these problems. Additionally, the need to reduce costs, improve efficiencies and performance, and meet competitive pressures adds an even greater urgency to the critical necessity for finding answers to these problems.
Solutions to these problems have been long sought but prior developments have not taught or suggested any solutions and, thus, solutions to these problems have long eluded those skilled in the art.
The present invention provides a method of operation of a non-volatile memory management system including: selecting a specific time period by a unit controller; establishing a first time pool having super blocks written during the specific time period; and promoting to a second time pool, the super blocks from the first time pool, at the lapse of the specific time period.
The present invention provides a non-volatile memory management system, including: a unit controller for selecting a specific time period; a non-volatile memory array configured by the unit controller for establishing a first time pool having super blocks written during the specific time period; and a system control random access memory coupled to the unit controller for promoting to a second time pool the super blocks from the first time pool at the lapse of the specific time period.
Certain embodiments of the invention have other steps or elements in addition to or in place of those mentioned above. The steps or elements will become apparent to those skilled in the art from a reading of the following detailed description when taken with reference to the accompanying drawings.
The following embodiments are described in sufficient detail to enable those skilled in the art to make and use the invention. It is to be understood that other embodiments would be evident based on the present disclosure, and that system, process, or mechanical changes may be made without departing from the scope of the present invention.
In the following description, numerous specific details are given to provide a thorough understanding of the invention. However, it will be apparent that the invention may be practiced without these specific details. In order to avoid obscuring the present invention, some well-known circuits, system configurations, and process steps are not disclosed in detail.
The drawings showing embodiments of the system are semi-diagrammatic and not to scale and, particularly, some of the dimensions are for the clarity of presentation and are shown exaggerated in the drawing FIGs. Similarly, although the views in the drawings for ease of description generally show similar orientations, this depiction in the FIGs. is arbitrary for the most part. Generally, the invention can be operated in any orientation.
The same numbers are used in all the drawing FIGs. to relate to the same elements. The embodiments have been numbered first embodiment, second embodiment, etc. as a matter of descriptive convenience and are not intended to have any other significance or provide limitations for the present invention.
The term “processing” as used herein includes the storage, manipulation, and retrieval of data on a flash memory system. The term “read disturb” is defined as the process of reducing the total charge held in a flash memory cell by reading its contents. Flash memory cells may become unreliable when the read disturb count is excessive. The term “solid state drive” (SSD) is defined to be a non-volatile memory system having an interface module that presents the non-volatile memory system, to a computer system, as a disk storage device.
The term “erase block” is defined to be a group of flash memory cells that can be accessed, written, read, or erased as a common entity. While the flash memory cells can contain discrete data bits, they are all erased, using common control lines, at approximately the same time.
The term “super block” is defined to mean a grouping of erase blocks into an organized segment in which the erase blocks share similar relative age, endurance, and retention characteristics. This grouping of similar performance erase blocks into super blocks allows the volume of information, used to track read disturbs, to be reduced to a manageable level. The tabling infrastructure and linkages between erase block wear levels and the number of reads to any given erase block can be managed at run time in a volatile random access memory (RAM). When it becomes time to power-off the drive, a secondary read disturb metric will be recorded for use at power-on. This secondary metric is the highest number of reads for any given erase block within a super block. Given that all of the erase blocks have relatively the same wear or age within a super block and that recycling can be done on an entire super block at a time, the need to recycle the most-read block is addressed. This also limits the number of read counts to be saved at power cycles to only one count per super block.
The term “module” referred to herein can include software, hardware, or a combination thereof in accordance with the context in which the term is used. For example, the software can be machine code, firmware, embedded code, and application software. Also for example, the hardware can be circuitry, processor, computer, integrated circuit, integrated circuit cores, a pressure sensor, an inertial sensor, a micro-electromechanical system (MEMS), passive devices, or a combination thereof.
Referring now to
A storage system interface 104 can be used to couple the data storage system 100 to a host interface 106. The storage system interface 104 can support protocol management and communication with the next level system. The storage system interface 104 can be a parallel advanced technology attachment (PATA), a serial advanced technology attachment (SATA), serial attached small computer system interface (SAS), personal computer interface express (PCI-E), or the like.
A unit controller 107 is coupled to the storage system interface 104 through a storage bus 108. The unit controller 107 can include a processor, interface logic, local storage, embedded memory, or a combination thereof. The unit controller 107 can communicate with the storage system interface 104 for supporting protocol management, exception handling, initialization, configuration management, or a combination thereof.
The unit controller 107 can also be coupled to a memory controller 110 through the storage bus 108. The memory controller 110 can receive set-up and configuration commands from the unit controller 107. During exception processing the unit controller 107 can closely manage the operation of the memory controller 110. The memory controller 110 can receive data transfer parameters directly from the storage system interface 104 or from the unit controller 107 as a result of processing protocol messages received through the storage system interface 104. The memory controller 110 is also coupled to a system control random access memory (SCRAM) 112, such as a volatile memory, through a volatile memory bus 114.
The system control random access memory 112 is defined as a volatile memory structure for maintaining system control information. Contents 113 of the system control random access memory 112 include metadata, configuration information, and system pointers. The system control random access memory 112 can be managed by the unit controller 107 through the memory controller 110.
It is understood that while the storage system interface 104, the unit controller 107, the memory controller 110, and the system control random access memory 112 are shown as separate functions any combination of them can be provided in a single integrated circuit. It is further understood that the bus structures shown are an example only and additional interconnects between the functions is possible.
The memory controller 110 is also coupled to a non-volatile memory array 116 through a primary storage bus 118. The non-volatile memory array 116 is defined as an array of NAND flash memory devices. It is understood that the array of the NAND flash memory devices can be contained in a single package or in multiple packages due to the total intended capacity of the non-volatile memory management system 100 and the technology node of the non-volatile memory array 116. NAND flash memory devices have a requirement to monitor the conditions that can impact the data read reliability. An erase block (not shown) in the non-volatile memory array 116 can be impacted by reads or writes to an adjacent erase block, the length of time the data has been written into the erase block, temperature, or the combination of all of these. Current approaches only consider the read or write disturbs in adjacent erase blocks without consideration for time or temperature.
The unit controller 107 can receive an indication of the current temperature and the operating voltage applied to the non-volatile memory array 116 by integrating a threshold sensor 120. Based on the input received from the threshold sensor 120, the unit controller 107 can determine an effective time, which indicates the adjusted data age of the erase blocks based on temperature, time since written, read/write disturbs, or a combination thereof.
It has been discovered that the unit controller 107 can configure the memory controller 110 to monitor the erase blocks in the non-volatile memory array 116 for conditions that can degrade the read performance of the erase blocks. The conditions that can degrade the read performance of the erase blocks can include the read/write disturbs, time, temperature, or the combination thereof. By considering all of these conditions, the unit controller 107 can calculate the effective time to optimize the movement of data from an initial erase block to a next erase block. The movement of the data initializes the effective time for the data now written into the next erase block.
Referring now to
The first time pool 202, the second time pool 206, and the Nth time pool 210 comprise the non-volatile memory array 116. The first time pool 202, the second time pool 206, and the Nth time pool 210 are each defined to be a group of erase blocks or super blocks that are written within a specific time period. It is understood that the number of erase blocks or super blocks grouped in the first time pool 202, the second time pool 206, and the Nth time pool 210 can differ based on activity of the host interface 106 during the specified time period. It is also understood that the group of erase blocks can constitute superblocks in high capacity devices. It is further understood that the unit controller 107 of
The unit processor 107 can instruct the memory controller 110 to group all of the erase blocks written within the specific time period into the first time pool 202. The unit processor 107 can calculate the effective time of the first time pool 202 based on read/write disturbs, elapsed time that data has been written into the oldest erase block in the first time pool 202, and the temperature in the operating environment of the first time pool 202.
It has been discovered that the unit controller 107 can calculate and save the effective time of the first time pool 202, the second time pool 206, and the Nth time pool 210 in the contents 113 of the system control random access memory 112. It has further been discovered that unit controller 107 can monitor the effective time of the Nth time pool 210 to determine when the data content of the erase blocks must be copied to a new group of erase blocks in order to preserve the data integrity of the non-volatile memory management system 100. It is understood that contents 113 of the system control random access memory 112 are saved to the non-volatile memory array 116 prior to power-off.
It has further been discovered that a solid state drive (SSD) can group erase blocks and super blocks, forming the first time pool 202, the second time pool 206, and the Nth time pool 210 of the blocks, according to how long the blocks will be able to reliably store data. This grouping can track when a block needs to be recycled for retention due to the age of the data written in the block, and only recycle those blocks that need it. When the block is recycled for some other reason, such as reclaiming space for new writes, managing read disturbs, wear leveling, or recovering from a fault, the recycled block can be taken out of the time pool in which it currently resides and put it the newest time pool.
It is understood that the number of the storage channels is not limited to the number shown in the
Referring now to
In order to maintain data integrity, in the non-volatile memory management system 100, all of the erase blocks in the Nth time pool 210 must be transferred to unused erase blocks that are assigned to the first time pool 202 of
It is understood that some of the parameters, such as the technology response to voltage level and temperature, required for calculating the data retention recycling threshold 306 and the data corruption threshold 308 can be loaded at the time of manufacture. During the operation of the non-volatile memory management system 100, an effective time 310 associated with the data written into the erase blocks can be accelerated beyond the chronological age 302. The effective time 310 can reflect an equivalent aging process of the erase blocks in the non-volatile memory array 116 as the wear due to read/write cycles, voltage, temperature, and time. As an example a new erase block when first written can have the effective time 310 match the chronological age 302, but as the erase block ages due to use the effective time 310 will increase at a faster rate than the chronological age 310.
It has been discovered that by not relying on only the chronological age 302 of the erase blocks the data of the erase blocks can be copied to new erase block before reaching the data corruption threshold 308. By monitoring the effective time 310 a recycle event 312 can initialize the data age 304 by copying the contents of the Nth time pool 210 to unused erase blocks allocated to the first time pool 202 before the data corruption threshold 308 can be reached.
Referring now to
It is understood that the selection of the specific time period 403 by the unit controller 107 of
At the end of the specific time period 403, all of the super blocks 402 that are in the first time pool 202 are promoted to the second time pool 206 and the first time pool 202 accepts the next grouping of the super blocks 402 from a spare group of super blocks 404. While the specific time period 403 is constant, the number of the super blocks 402 written by the storage system interface 104 can differ between one of the specific time period 403 and the next instance of the specific time period 403.
At the end of a second instance of the specific time period 403, the super blocks 402 in the second time pool are promoted to a third time pool 406 and the contents of the first time pool 202 are promoted to the second time pool 206. This process continues until the super blocks 402 are promoted to the Nth time pool 210 or the effective time 310 of
It has been discovered that the segmentation of the super blocks 402 based on the effective time 310 as calculated by the unit processor 107 of
It is understood that while only a few of the super blocks 402 are shown in each of the first time pool 202, the second time pool 206 and the Nth time pool 210 this is by way of example only and the actual number of the super blocks 402 can differ. It is further understood that during the promotion process between the time pools the unit processor just updates the contents 113 of
During a power event, the unit controller 107 can save the contents 113 in the non-volatile memory array 116. By saving the time pool association during power-off events, the unit controller can adjust the effective time 310 of the time pools upon power-on. The association of a super block to a given time pool can also be recorded in a metadata header by the unit controller 107 as it starts writing to new blocks, so at power-off time the time-pool associations are stored in the non-volatile memory array 116 already.
It has been discovered that the power-on adjustment of the effective time 310 can increase the data reliability because the wear, temperature, and operating voltage can vary a deterioration rate between the first time pool 202, the second time pool 206 and the Nth time pool 210. The early detection of the effective time 310 exceeding the data retention recycling threshold 306 can prevent the potential data loss when the erase blocks exceed the data corruption threshold 308.
Referring now to
The index address 501 includes a page/erase block address 502, an age measurement segment 504, and a test configuration segment 506. The page/erase block address 502 comprises a 32 bit field that can include a super block address, which can correspond to the first time pool 202 of
The age measurement segment 504 is a 32 bit field the comprises a data integrity portion 508 of 16 bits, a super block state portion 510 of two bits, and valid pages portion 512 of 14 bits. The age measurement segment 504 can provide the details required to calculate the effective time of the time pool to which it indexes.
The test configuration segment 506 can include technology aging information for the super blocks 402 of
Referring now to
The physical address field 604 can include a physical chip select 612 of two bits, a chip enable bit 614, and an erase block address 616 of 13 bits. The physical address field 604 can also be called a super block address 604. Referring now to
The flow then proceeds to a time complete module 706. The time complete module 706 determines whether the specific time period 403 of
The flow then proceeds to an Nth time pool used 710 decision block to determine whether the contents of the Nth time pool 210 of
An exit from interrupt module 716 completes the interrupt flow and can be entered from the time complete module 706, if the specific time period 403 has not elapsed, the Nth time pool used 710, if no super blocks are present in the Nth time pool 210, and the initiate recycling module 714, when the recycling of the super blocks from the Nth time pool 210 is underway.
The modules of the super block time pool update 701 can be implemented by combinational logic in discrete components, in an application specific integrated circuit, in combinational hardware supported by the unit processor 107 of
It has been discovered that the differences in the innate data retention capabilities of the erase blocks, caused by worn blocks that can't hold data reliably for as long, can be solve by grouping similarly worn erase blocks in time pools that will expire earlier than the newest time pool. This is important because the erase blocks don't age uniformly, and the time pool grouping allows uniform management of the erase blocks without having to promote the time pools for only the worst-case blocks.
Referring now to
The high priority input 804 is coupled to a read disturb detection module 810, which compares the number of read disturbs in each of the super blocks 808. When a super block 808 has exceeded the read disturb threshold it has been repeatedly read by the host system and constitutes a high priority to preserve the data for further use by the host interface 106 of
The lower priority input 806 is coupled to a data retention recycling module 812. The data retention recycling module receives any super blocks 402 that are attributed to the Nth time pool 210. The super blocks 402 from the Nth time pool 210 are submitted due to the deterioration of the data due to time and the environmental parameters. As such the preservation of the data for future use should occur at a lower priority.
Referring now to
The resulting method, process, apparatus, device, product, and/or system is straightforward, cost-effective, uncomplicated, highly versatile, accurate, sensitive, and effective, and can be implemented by adapting known components for ready, efficient, and economical manufacturing, application, and utilization.
Another important aspect of the present invention is that it valuably supports and services the historical trend of reducing costs, simplifying systems, and increasing performance.
These and other valuable aspects of the present invention consequently further the state of the technology to at least the next level.
While the invention has been described in conjunction with a specific best mode, it is to be understood that many alternatives, modifications, and variations will be apparent to those skilled in the art in light of the aforegoing description. Accordingly, it is intended to embrace all such alternatives, modifications, and variations that fall within the scope of the included claims. All matters hithertofore set forth herein or shown in the accompanying drawings are to be interpreted in an illustrative and non-limiting sense.
This application claims the benefit of U.S. Provisional Patent Application Ser. No. 61/530,809 filed Sep. 2, 2011, and the subject matter thereof is incorporated herein by reference thereto.
Number | Name | Date | Kind |
---|---|---|---|
4048481 | Bailey, Jr. et al. | Sep 1977 | A |
4839587 | Flatley et al. | Jun 1989 | A |
5034744 | Obinata | Jul 1991 | A |
5210854 | Beaverton et al. | May 1993 | A |
5311395 | McGaha et al. | May 1994 | A |
5450354 | Sawada et al. | Sep 1995 | A |
5479638 | Assar et al. | Dec 1995 | A |
5784174 | Fujino et al. | Jul 1998 | A |
5790828 | Jost | Aug 1998 | A |
5930504 | Gabel | Jul 1999 | A |
5949785 | Beasley | Sep 1999 | A |
5963983 | Sakakura et al. | Oct 1999 | A |
6091652 | Haehn et al. | Jul 2000 | A |
6275436 | Tobita et al. | Aug 2001 | B1 |
6345367 | Sinclair | Feb 2002 | B1 |
6356447 | Scafidi | Mar 2002 | B2 |
6381670 | Lee et al. | Apr 2002 | B1 |
6412080 | Fleming et al. | Jun 2002 | B1 |
6529997 | Debiez et al. | Mar 2003 | B1 |
6552581 | Gabara | Apr 2003 | B1 |
6587915 | Kim | Jul 2003 | B1 |
6618249 | Fairchild | Sep 2003 | B2 |
6661503 | Yamaguchi et al. | Dec 2003 | B1 |
6728913 | Parker | Apr 2004 | B1 |
6763424 | Conley | Jul 2004 | B2 |
6775792 | Ulrich et al. | Aug 2004 | B2 |
6778387 | Fairchild | Aug 2004 | B2 |
6850443 | Lofgren et al. | Feb 2005 | B2 |
6854070 | Johnson et al. | Feb 2005 | B2 |
6871304 | Hadjihassan et al. | Mar 2005 | B2 |
6903972 | Lasser et al. | Jun 2005 | B2 |
6906961 | Eggleston et al. | Jun 2005 | B2 |
6975028 | Wayburn et al. | Dec 2005 | B1 |
7082495 | DeWhitt et al. | Jul 2006 | B2 |
7107389 | Inagaki et al. | Sep 2006 | B2 |
7139864 | Bennett et al. | Nov 2006 | B2 |
7233497 | Simon et al. | Jun 2007 | B2 |
7243186 | Liang et al. | Jul 2007 | B2 |
7298888 | Hamar | Nov 2007 | B2 |
7330927 | Reeve et al. | Feb 2008 | B1 |
7333364 | Yu et al. | Feb 2008 | B2 |
7350101 | Nguyen et al. | Mar 2008 | B1 |
7355896 | Li et al. | Apr 2008 | B2 |
7434122 | Jo | Oct 2008 | B2 |
7441067 | Gorobets et al. | Oct 2008 | B2 |
7516267 | Coulson et al. | Apr 2009 | B2 |
7613871 | Tanaka et al. | Nov 2009 | B2 |
7620710 | Kottomtharayil et al. | Nov 2009 | B2 |
7620769 | Lee et al. | Nov 2009 | B2 |
7639532 | Roohparvar et al. | Dec 2009 | B2 |
7661054 | Huffman et al. | Feb 2010 | B2 |
7679948 | Park et al. | Mar 2010 | B2 |
7693422 | Alicherry et al. | Apr 2010 | B2 |
7738502 | Chang et al. | Jun 2010 | B2 |
7743216 | Lubbers et al. | Jun 2010 | B2 |
7818525 | Frost et al. | Oct 2010 | B1 |
7827348 | Lee et al. | Nov 2010 | B2 |
7830164 | Earle et al. | Nov 2010 | B2 |
7979614 | Yang | Jul 2011 | B1 |
8000135 | Perlmutter et al. | Aug 2011 | B1 |
8010738 | Chilton et al. | Aug 2011 | B1 |
8028123 | Kilzer et al. | Sep 2011 | B2 |
8046645 | Hsu et al. | Oct 2011 | B2 |
8051241 | Feldman et al. | Nov 2011 | B2 |
8072805 | Chou et al. | Dec 2011 | B2 |
8095724 | Ji et al. | Jan 2012 | B2 |
8095765 | Asnaashari et al. | Jan 2012 | B2 |
8117396 | Fair et al. | Feb 2012 | B1 |
8127202 | Cornwell et al. | Feb 2012 | B2 |
8145984 | Sommer et al. | Mar 2012 | B2 |
8154921 | Mokhlesi et al. | Apr 2012 | B2 |
8169825 | Shalvi et al. | May 2012 | B1 |
8209677 | Shintani et al. | Jun 2012 | B2 |
8219724 | Caruso et al. | Jul 2012 | B1 |
8219776 | Forhan et al. | Jul 2012 | B2 |
8228701 | Sokolov et al. | Jul 2012 | B2 |
8245101 | Olbrich et al. | Aug 2012 | B2 |
8250621 | Cha | Aug 2012 | B2 |
8254172 | Kan | Aug 2012 | B1 |
8259506 | Sommer et al. | Sep 2012 | B1 |
8289801 | Smith et al. | Oct 2012 | B2 |
8296534 | Gupta et al. | Oct 2012 | B1 |
8332578 | Frickey, III et al. | Dec 2012 | B2 |
8363413 | Paquette et al. | Jan 2013 | B2 |
8369141 | Sommer et al. | Feb 2013 | B2 |
8386700 | Olbrich et al. | Feb 2013 | B2 |
8386860 | Tseng et al. | Feb 2013 | B2 |
8407409 | Kawaguchi | Mar 2013 | B2 |
8464106 | Filor et al. | Jun 2013 | B2 |
8503238 | Wu et al. | Aug 2013 | B1 |
8601203 | Holbrook et al. | Dec 2013 | B2 |
8612804 | Kang et al. | Dec 2013 | B1 |
8661184 | Wood et al. | Feb 2014 | B2 |
8832506 | Griffin et al. | Sep 2014 | B2 |
20020056025 | Qiu et al. | May 2002 | A1 |
20020159285 | Morley et al. | Oct 2002 | A1 |
20030033308 | Patel et al. | Feb 2003 | A1 |
20030046603 | Harari et al. | Mar 2003 | A1 |
20030074592 | Hasegawa | Apr 2003 | A1 |
20030163633 | Aasheim et al. | Aug 2003 | A1 |
20040080985 | Chang et al. | Apr 2004 | A1 |
20040088511 | Bacon et al. | May 2004 | A1 |
20040252670 | Rong et al. | Dec 2004 | A1 |
20050021904 | Iaculo et al. | Jan 2005 | A1 |
20050038792 | Johnson | Feb 2005 | A1 |
20050073884 | Gonzalez et al. | Apr 2005 | A1 |
20050076102 | Chen et al. | Apr 2005 | A1 |
20050144516 | Gonzalez et al. | Jun 2005 | A1 |
20060015683 | Ashmore et al. | Jan 2006 | A1 |
20060020745 | Conley et al. | Jan 2006 | A1 |
20060022054 | Elhamias et al. | Feb 2006 | A1 |
20060136682 | Haridas et al. | Jun 2006 | A1 |
20060143365 | Kikuchi | Jun 2006 | A1 |
20060143475 | Herbert et al. | Jun 2006 | A1 |
20060253641 | Gatzemeier et al. | Nov 2006 | A1 |
20060256624 | Eggleston et al. | Nov 2006 | A1 |
20060282644 | Wong | Dec 2006 | A1 |
20060294574 | Cha | Dec 2006 | A1 |
20070050536 | Kolokowsky | Mar 2007 | A1 |
20070061511 | Faber | Mar 2007 | A1 |
20070067598 | Fujimoto | Mar 2007 | A1 |
20070083779 | Misaka et al. | Apr 2007 | A1 |
20070226592 | Radke | Sep 2007 | A1 |
20070234004 | Oshima et al. | Oct 2007 | A1 |
20070260811 | Merry, Jr. et al. | Nov 2007 | A1 |
20070263444 | Gorobets et al. | Nov 2007 | A1 |
20070276973 | Tan et al. | Nov 2007 | A1 |
20080046630 | Lasser | Feb 2008 | A1 |
20080052446 | Lasser et al. | Feb 2008 | A1 |
20080082736 | Chow et al. | Apr 2008 | A1 |
20080126720 | Danilak | May 2008 | A1 |
20080183918 | Dhokia et al. | Jul 2008 | A1 |
20080189588 | Tanaka et al. | Aug 2008 | A1 |
20080313505 | Lee et al. | Dec 2008 | A1 |
20090006900 | Lastras-Montano et al. | Jan 2009 | A1 |
20090019321 | Radke | Jan 2009 | A1 |
20090070651 | Diggs et al. | Mar 2009 | A1 |
20090083587 | Ng et al. | Mar 2009 | A1 |
20090089485 | Yeh | Apr 2009 | A1 |
20090091990 | Park et al. | Apr 2009 | A1 |
20090109786 | Ye et al. | Apr 2009 | A1 |
20090138654 | Sutardja | May 2009 | A1 |
20090146721 | Kurooka et al. | Jun 2009 | A1 |
20090157948 | Trichina et al. | Jun 2009 | A1 |
20090164702 | Kern | Jun 2009 | A1 |
20090164710 | Choi et al. | Jun 2009 | A1 |
20090172262 | Olbrich et al. | Jul 2009 | A1 |
20090179707 | Higashino | Jul 2009 | A1 |
20090228634 | Nakamura et al. | Sep 2009 | A1 |
20090228761 | Perlmutter et al. | Sep 2009 | A1 |
20090259819 | Chen et al. | Oct 2009 | A1 |
20090259896 | Hsu et al. | Oct 2009 | A1 |
20090271562 | Sinclair | Oct 2009 | A1 |
20090287975 | Kim et al. | Nov 2009 | A1 |
20090300238 | Panabaker et al. | Dec 2009 | A1 |
20090323419 | Lee et al. | Dec 2009 | A1 |
20090327581 | Coulson | Dec 2009 | A1 |
20090327591 | Moshayedi | Dec 2009 | A1 |
20100017650 | Chin et al. | Jan 2010 | A1 |
20100023674 | Aviles | Jan 2010 | A1 |
20100050053 | Wilson et al. | Feb 2010 | A1 |
20100122019 | Flynn et al. | May 2010 | A1 |
20100128537 | Suhail et al. | May 2010 | A1 |
20100138592 | Cheon | Jun 2010 | A1 |
20100165689 | Rotbard et al. | Jul 2010 | A1 |
20100169541 | Freikorn | Jul 2010 | A1 |
20100172179 | Gorobets et al. | Jul 2010 | A1 |
20100174845 | Gorobets et al. | Jul 2010 | A1 |
20100217898 | Priborsky et al. | Aug 2010 | A1 |
20100217915 | O'Connor et al. | Aug 2010 | A1 |
20100228928 | Asnaashari et al. | Sep 2010 | A1 |
20100262792 | Hetzler et al. | Oct 2010 | A1 |
20100262795 | Hetzler et al. | Oct 2010 | A1 |
20100262875 | Hetzler et al. | Oct 2010 | A1 |
20100287328 | Feldman et al. | Nov 2010 | A1 |
20100293367 | Berke et al. | Nov 2010 | A1 |
20100312954 | Jeon et al. | Dec 2010 | A1 |
20100318719 | Keays et al. | Dec 2010 | A1 |
20100332726 | Wang | Dec 2010 | A1 |
20110002224 | Tamura | Jan 2011 | A1 |
20110016239 | Stenfort | Jan 2011 | A1 |
20110055468 | Gonzalez et al. | Mar 2011 | A1 |
20110066788 | Eleftheriou et al. | Mar 2011 | A1 |
20110072423 | Fukata | Mar 2011 | A1 |
20110078393 | Lin | Mar 2011 | A1 |
20110099342 | Ozdemir | Apr 2011 | A1 |
20110131365 | Zhang et al. | Jun 2011 | A1 |
20110131447 | Prakash et al. | Jun 2011 | A1 |
20110132000 | Deane et al. | Jun 2011 | A1 |
20110145473 | Maheshwari | Jun 2011 | A1 |
20110161775 | Weingarten | Jun 2011 | A1 |
20110190963 | Glassl et al. | Aug 2011 | A1 |
20110191522 | Condict et al. | Aug 2011 | A1 |
20110191649 | Lim et al. | Aug 2011 | A1 |
20110209032 | Choi et al. | Aug 2011 | A1 |
20110238892 | Tsai et al. | Sep 2011 | A1 |
20110239088 | Post | Sep 2011 | A1 |
20110258496 | Tseng et al. | Oct 2011 | A1 |
20110314219 | Ulrich et al. | Dec 2011 | A1 |
20110320687 | Belluomini et al. | Dec 2011 | A1 |
20120008401 | Katz et al. | Jan 2012 | A1 |
20120011336 | Saika | Jan 2012 | A1 |
20120047318 | Yoon et al. | Feb 2012 | A1 |
20120047320 | Yoo et al. | Feb 2012 | A1 |
20120047409 | Post et al. | Feb 2012 | A1 |
20120066450 | Yochai et al. | Mar 2012 | A1 |
20120124046 | Provenzano | May 2012 | A1 |
20120124273 | Goss et al. | May 2012 | A1 |
20120151260 | Zimmermann et al. | Jun 2012 | A1 |
20120170365 | Kang et al. | Jul 2012 | A1 |
20120213004 | Yun et al. | Aug 2012 | A1 |
20120216085 | Weingarten et al. | Aug 2012 | A1 |
20120236656 | Cometti | Sep 2012 | A1 |
20120239858 | Melik-Martirosian | Sep 2012 | A1 |
20120254686 | Esumi et al. | Oct 2012 | A1 |
20120266048 | Chung et al. | Oct 2012 | A1 |
20120278530 | Ebsen | Nov 2012 | A1 |
20120284587 | Yu et al. | Nov 2012 | A1 |
20120297113 | Belluomini et al. | Nov 2012 | A1 |
20120311402 | Tseng et al. | Dec 2012 | A1 |
20120324191 | Strange et al. | Dec 2012 | A1 |
20120331207 | Lassa et al. | Dec 2012 | A1 |
20130007380 | Seekins et al. | Jan 2013 | A1 |
20130007543 | Goss et al. | Jan 2013 | A1 |
20130054881 | Ellis et al. | Feb 2013 | A1 |
20130060994 | Higgins et al. | Mar 2013 | A1 |
20130073788 | Post et al. | Mar 2013 | A1 |
20130080691 | Weingarten et al. | Mar 2013 | A1 |
20130094289 | Sridharan et al. | Apr 2013 | A1 |
20130100600 | Yin et al. | Apr 2013 | A1 |
20130124792 | Melik-Martirosian et al. | May 2013 | A1 |
20130151753 | Jeon et al. | Jun 2013 | A1 |
20130198436 | Bandic et al. | Aug 2013 | A1 |
20130238833 | Vogan et al. | Sep 2013 | A1 |
20130265825 | Lassa | Oct 2013 | A1 |
20130332791 | Chu | Dec 2013 | A1 |
20140108891 | Strasser et al. | Apr 2014 | A1 |
20140129874 | Zaltsman et al. | May 2014 | A1 |
20140208174 | Ellis et al. | Jul 2014 | A1 |
Number | Date | Country |
---|---|---|
1 956 489 | Aug 2008 | EP |
1 990 921 | Nov 2008 | EP |
2 498 259 | Sep 2012 | EP |
2012129859 | Jul 2012 | JP |
WO 2009042298 | Apr 2009 | WO |
WO 2011156466 | Dec 2011 | WO |
Entry |
---|
Shiraz et al., “Block Aging Prevention Technique (BAP) for Flash Based Solid State Disks,” 7th International Conference on Emerging Technologies (ICET), Sep. 5, 2011, 6 pages. |
Ulinketec, “ATA Command Table (in Alphabetic Order),” Feb. 6, 2011, https://web.archive.org/web/20110206060820/http://www.ulinktech.com/downloads/AT, 6 pages. |
International Search Report and Written Opinion dated May 14, 2014, received in International Patent Application No. PCT/US2014/017168, which corresponds to U.S. Appl. No. 14/076,115, 6 pages (Fitzpatrick). |
International Search Report and Written Opinion dated May 14, 2014, received in International Patent Application No. PCT/US2014/017169, which corresponds to U.S. Appl. No. 14/076,148, 6 pages (Fitzpatrick). |
International Search Report dated Mar. 25, 2014, received in International Patent Application No. PCT/US2013/072400, which corresponds to U.S. Appl. No. 13/690,337, 3 pages (Ellis). |
International Search Report and Written Opinion dated Jun. 12, 2014, received in PCT/US2014/018972, which corresponds to U.S. Appl. No. 13/779,352, 12 pages (Schmier). |
Invitation to Pay Additional Fees dated Jul. 25, 2014, received in International Patent Application No. PCT/US2014/021290, which corresponds to U.S. Appl. No. 13/791,797, 8 pages (Dean). |
International Search Report and Written Opinion dated Jul. 31, 2014, received in International Patent Application No. PCT/US2014/031465, which corresponds to U.S. Appl. No. 13/851,928, 13 pages (Ellis). |
International Search Report and Written Opinion dated Jul. 31, 2014, received in International Patent Application No. PCT/US2014/033876, which corresponds to U.S. Appl. No. 13/861,326, 9 pages (Fitzpatrick). |
Cooke, “Introduction to Flash Memory (T1A),” Flash Memory Summit, Aug. 22, 2008, Micron Technology, Inc., 102 pages. |
Gal et al., “Algorithms and Data Structures for Flash Memories,” ACM Computing Surveys, Jun. 2005, vol. 37, No. 2, 30 pages. |
IBM Corporation, “Systems Management, Work Management,” Version 5, Release 4, 9th Edition, Feb. 2006, pp. 1-21. |
O'Brien, “SMART Storage Systems Optimus SAS Enterprise SSD Review,” SMART Storage Systems, Oct. 9, 2012, 44 pages. |
Spanjer, “Flash Management—Why and How?” Smart Modular Technologies, Nov. 2009, http://www.scantec.de/fileadmin/pdf/Smart—Modular/Flash-Management.pdf, 14 pages. |
Texas Instruments, “Power Management IC for Digital Set Top Boxes,” SLVSA10A, Sep. 2009, pp. 1-22. |
International Search Report and Written Opinion dated Dec. 20, 2013, received in PCT/US2013/045282, which corresponds to U.S. Appl. No. 13/493,949, 7 pages (Ellis). |
Narayanan et al., “Migrating Server Storage to SSDs: Analysis of Tradeoffs,” Computer Systems, Apr. 2009, 12 pages. |
Tai et al, “Prolongation of Lifetime and the Evaluation Method of Dependable SSD,” 25 International Symposium on Defect and Fault Tolerance in VLSI Systems, 2010, NJ, USA, 8 pages. |
Tseng et al., “Understanding the Impact of Power Loss on Flash Memory,” DAC'11, Jun. 5-10, 2011, San Diego, California, 6 pages. |
Yimo et al., “WeLe—RAID: A SSD-Based RAID for System Endurance and Performance,” Jan. 2011, Network and Parallel Computing, Springer, 14 pages. |
International Search Report and Written Opinion dated Jan. 9, 2015, received in International Patent Application No. PCT/US2014/049731, which corresponds to U.S. Appl. No. 14/334,324, 9 pages (Fitzpatrick). |
International Search Report and Written Opinion dated Nov. 7, 2014, received in International Patent Application No. PCT/US2014/049732, which corresponds to U.S. Appl. No. 14/334,350, 13 pages (Fitzpatrick). |
International Search Report and Written Opinion dated Oct. 17, 2014, received in International Patent Application No. PCT/US2014/049734, which corresponds to U.S. Appl. No. 14/332,259, 8 pages (Higgins). |
International Search Report and Written Opinion dated Oct. 23, 2014, received in International Patent Application No. PCT/US2014/049736, which corresponds to U.S. Appl. No. 14/446,249 8 pages (Fitzpatrick). |
International Search Report and Written Opinion dated Aug. 22, 2014, received in International Patent Application No. PCT/US2014/032978, which corresponds to U.S. Appl. No. 14/081,992, 10 pages (Ellis). |
International Search Report and Written Opinion dated Feb. 18, 2015, received in International Patent Application No. PCT/US2014/065401, which corresponds to U.S. Appl. No. 14/082,031, 9 pages (Higgins). |
International Search Report dated Apr. 15, 2014, received in International Patent Application No. PCT/US2013/078340, which corresponds to U.S. Appl. No. 13/746,542, 11 pages (Ellis). |
International Search Report and Written Opinion dated Nov. 5, 2014, received in International Patent Application No. PCT/US2014/049282, which corresponds to U.S. Appl. No. 13/957,407 12 pages (Fitzpatrick). |
Number | Date | Country | |
---|---|---|---|
20130060994 A1 | Mar 2013 | US |
Number | Date | Country | |
---|---|---|---|
61530809 | Sep 2011 | US |