Patent Grant
9652381
The disclosed embodiments relate generally to non-volatile data storage systems, and in particular, to enabling garbage collection of a sub-block of an erase block in a non-volatile data storage device.
Semiconductor memory devices, including flash memory, typically utilize memory cells to store data as an electrical value, such as an electrical charge or voltage. A flash memory cell, for example, includes a single transistor with a floating gate that is used to store a charge representative of a data value. Flash memory is a non-volatile data storage device that can be electrically erased and reprogrammed. Non-volatile memory retains stored information even when not powered, as opposed to volatile memory, which requires power to maintain the stored information. Increases in storage density have been facilitated in various ways, including increasing the density of memory cells on a chip enabled by manufacturing developments, and transitioning from single-level flash memory cells to multi-level flash memory cells, so that two or more bits can be stored by each flash memory cell.
Garbage collection is a process of memory management that reclaims portions of memory that no longer contain valid data. Using flash memory as an example, data is written to flash memory in units called pages, which are made up of multiple memory cells. However, flash memory is erased in larger units called blocks, which are made up of multiple pages. If some pages of a first block contain invalid data, those pages cannot be overwritten until the whole block containing those pages is erased. The process of garbage collection reads and re-writes the pages with valid data from the first block into a second block and then erases the first block. After garbage collection, the second block contains pages with valid data and free pages that are available for new data to be written. Since garbage collection involves re-writing valid data from one block to another, it results in “write amplification,” which is the ratio of total bytes (or any other unit of data) written to flash memory in a flash-based storage system to total bytes written by host system(s) to the flash-based storage system. Reducing write amplification, through improved garbage collection, improves the life and performance of a flash-based storage system.
Various implementations of systems, methods and devices within the scope of the appended claims each have several aspects, no single one of which is solely responsible for the attributes described herein. Without limiting the scope of the appended claims, after considering this disclosure, and particularly after considering the section entitled “Detailed Description” one will understand how the aspects of various implementations are used to enable garbage collection of a sub-block of a storage medium in a storage device. In one aspect, a trigger parameter (e.g., read-disturb count) and a vulnerability criterion (e.g., read-disturb threshold) are utilized in a garbage collection scheme.
So that the present disclosure can be understood in greater detail, a more particular description may be had by reference to the features of various implementations, some of which are illustrated in the appended drawings. The appended drawings, however, merely illustrate the more pertinent features of the present disclosure and are therefore not to be considered limiting, for the description may admit to other effective features.
In accordance with common practice the various features illustrated in the drawings may not be drawn to scale. Accordingly, the dimensions of the various features may be arbitrarily expanded or reduced for clarity. In addition, some of the drawings may not depict all of the components of a given system, method or device. Finally, like reference numerals may be used to denote like features throughout the specification and figures.
The various implementations described herein include systems, methods and/or devices used to enable garbage collection of a sub-block of a storage medium in a storage device. Some implementations include systems, methods and/or devices for utilizing trigger parameters and vulnerability criteria in a garbage collection scheme.
More specifically, some implementations include a method of garbage collection for a storage medium in a storage system. In some implementations, the method includes determining a first trigger parameter in accordance with one or more operating conditions of a first sub-block of an erase block in the storage medium and determining a second trigger parameter in accordance with one or more operating conditions of a second sub-block of the erase block in the storage medium. In accordance with a determination that the first trigger parameter meets a first vulnerability criterion, garbage collection of the first sub-block is enabled, and in accordance with a determination that the second trigger parameter meets a second vulnerability criterion, garbage collection of the second sub-block is enabled.
An example of a trigger parameter, determined in accordance with one or more operating conditions of a sub-block of an erase block, is a read disturb count or read operation count, for the sub-block. More specifically, the one or more operating conditions are read operations being perform on data in the sub-block, and possibly in one or more neighboring sub-blocks or in one or more word lines neighboring the sub-block, and the trigger parameter is a count of those operations. Optionally, the count is a “straight,” un-weighted count of read operations in a region of the storage medium corresponding to the sub-block. In some other implementations, however, the count is a weighted count, with read operations in some locations (e.g., in word lines spaced apart from the sub-block by a predefined number of intervening word lines) having a lower count weight than read operations in other locations (e.g., in the sub-block).
In some embodiments, the storage device includes one or more flash memory devices.
In some embodiments, the storage device includes one or more three-dimensional (3D) memory devices and circuitry associated with operation of memory elements in the one or more 3D memory devices. Furthermore, in some implementations, the circuitry and one or more memory elements in a respective 3D memory device, of the one or more 3D memory devices, are on the same substrate (e.g., a silicon substrate).
In some embodiments, the first sub-block is a portion of the erase block and the second sub-block is another portion of the erase block.
In some embodiments, the first vulnerability criterion is determined in accordance with one or more characteristics of the first sub-block.
In some implementations, the storage device enables garbage collection of the first sub-block in accordance with a determination that the erase block or a memory portion that includes the erase block meets predefined age criteria and a determination that the first trigger parameter meets a first vulnerability criterion.
In some embodiments, garbage collection includes writing from the first sub-block to a second erase block in the storage medium, wherein the second erase block is distinct from the erase block, and invalidating the first sub-block in the erase block (i.e., invalidating any valid data remaining in the first sub-block when the first sub-block is garbage collected).
In some embodiments, the storage device enables garbage collection for a parity stripe that includes the first sub-block, wherein the parity stripe includes a plurality of sub-blocks across a plurality of erase blocks in the storage medium.
In some embodiments, the second vulnerability criterion is determined in accordance with one or more characteristics of the second sub-block. In some implementations, the first vulnerability criterion is distinct from the second vulnerability criterion.
In some circumstances, garbage collection of the first sub-block is performed prior to garbage collection of the second sub-block.
In another aspect, the method includes determining a first trigger parameter in accordance with one or more operating conditions of a first sub-block of an erase block in the storage medium. In accordance with a determination that the first trigger parameter meets a first vulnerability criterion, garbage collection of the first sub-block is enabled. Furthermore, the method includes determining whether the erase block meets predefined garbage collection scheduling criteria. In accordance with a determination that the erase block meets said garbage collection scheduling criteria, garbage collection of the erase block is enabled.
In some embodiments, the storage device includes one or more flash memory devices.
In some embodiments, the storage device includes one or more three-dimensional (3D) memory devices and circuitry associated with operation of memory elements in the one or more 3D memory devices. Furthermore, in some implementations, the circuitry and one or more memory elements in a respective 3D memory device, of the one or more 3D memory devices, are on the same substrate (e.g., a silicon substrate).
In some embodiments, garbage collection includes writing from the first sub-block to a second erase block in the storage medium, wherein the second erase block is distinct from the erase block, and invalidating the first sub-block in the erase block.
In yet another aspect, a storage device includes one or more processors and memory storing one or more programs to be executed by the one or more processors. The one or more programs include instructions for determining a first trigger parameter in accordance with one or more operating conditions of a first sub-block of an erase block in the storage medium, and determining a second trigger parameter in accordance with one or more operating conditions of a second sub-block of the erase block in the storage medium. Furthermore, the one or more programs include instructions for enabling garbage collection of the first sub-block in accordance with a determination that the first trigger parameter meets a first vulnerability criterion, and enabling garbage collection of the second sub-block in accordance with a determination that the second trigger parameter meets a second vulnerability criterion.
In some embodiments, the storage device is further configured to operate in accordance with any of the methods described herein.
In yet another aspect, a storage device includes a means for determining a first trigger parameter in accordance with one or more operating conditions of a first sub-block of an erase block in the storage medium, and a means for determining a second trigger parameter in accordance with one or more operating conditions of a second sub-block of the erase block in the storage medium. Furthermore, the storage device includes a means for enabling, in accordance with a determination that the first trigger parameter meets a first vulnerability criterion, garbage collection of the first sub-block, and a means for enabling, in accordance with a determination that the second trigger parameter meets a second vulnerability criterion, garbage collection of the second sub-block.
In some embodiments, the storage device is further configured to operate in accordance with any of the methods described herein.
In yet another aspect, a storage system includes a storage medium, one or more processors, and memory storing one or more programs, which when executed by the one or more processors cause the storage system to perform or control performance of any of the methods described herein.
In yet another aspect, a non-transitory computer readable storage medium stores one or more programs configured for execution by one or more processors of a storage device, the one or more programs including instructions for performing any of the methods described herein.
Numerous details are described herein in order to provide a thorough understanding of the example implementations illustrated in the accompanying drawings. However, some embodiments may be practiced without many of the specific details, and the scope of the claims is only limited by those features and aspects specifically recited in the claims. Furthermore, well-known methods, components, and circuits have not been described in exhaustive detail so as not to unnecessarily obscure more pertinent aspects of the implementations described herein.
Computer system 110 is coupled to storage controller 124 through data connections 101. However, in some implementations computer system 110 includes storage controller 124 as a component and/or a sub-system. Computer system 110 may be any suitable computer device, such as a computer, a laptop computer, a tablet device, a netbook, an internet kiosk, a personal digital assistant, a mobile phone, a smart phone, a gaming device, a computer server, or any other computing device. Computer system 110 is sometimes called a host or host system. In some implementations, computer system 110 includes one or more processors, one or more types of memory, a display and/or other user interface components such as a keyboard, a touch screen display, a mouse, a track-pad, a digital camera and/or any number of supplemental devices to add functionality.
Storage medium 130 is coupled to storage controller 124 through connections 103. Connections 103 are sometimes called data connections, but typically convey commands in addition to data, and optionally convey metadata, error correction information and/or other information in addition to data values to be stored in storage medium 130 and data values read from storage medium 130. In some implementations, however, storage controller 124 and storage medium 130 are included in the same device as components thereof. Furthermore, in some implementations storage controller 124 and storage medium 130 are embedded in a host device, such as a mobile device, tablet, other computer or computer controlled device, and the methods described herein are performed by the embedded memory controller. Storage medium 130 may include any number (i.e., one or more) of memory devices including, without limitation, non-volatile semiconductor memory devices, such as flash memory. For example, flash memory devices can be configured for enterprise storage suitable for applications such as cloud computing, or for caching data stored (or to be stored) in secondary storage, such as hard disk drives. Additionally and/or alternatively, flash memory can also be configured for relatively smaller-scale applications such as personal flash drives or hard-disk replacements for personal, laptop and tablet computers. In some embodiments, storage medium 130 includes one or more three-dimensional (3D) memory devices, as further defined herein.
Storage medium 130 is divided into a number of addressable and individually selectable blocks, such as selectable portion 131. In some implementations, the individually selectable blocks (sometimes referred to as “erase blocks”) are the minimum size erasable units in a flash memory device. In other words, each block contains the minimum number of memory cells that can be erased simultaneously. Each block is usually further divided into a plurality of pages and/or word lines, where each page or word line is typically an instance of the smallest individually accessible (readable) portion in a block. In some implementations (e.g., using some types of flash memory), the smallest individually accessible unit of a data set, however, is a sector, which is a subunit of a page. That is, a block includes a plurality of pages, each page contains a plurality of sectors, and each sector is the minimum unit of data for reading data from the flash memory device. The number of pages included in each block varies from one implementation to another; examples are 64, 128 and 256 pages, but other numbers of pages per block are suitable in some implementations.
A sub-block is smaller than an individually selectable block and is a subset of an individually selectable block. For example, in some embodiments, a sub-block is a page. Furthermore, in some embodiments, a sub-block is a word line (or all the pages in a word line). In other embodiments, a sub-block is any sub-portion of an erase block, such as a contiguous group of word lines, sometimes herein called a zone. In some embodiments, a zone is a grouping of two or more pages of an erase block, where a respective erase block includes multiple zones. For example, as described with respect to
In some embodiments, a sub-block of a block in a three-dimensional memory device (see, for example,
In some implementations, storage controller 124 includes a management module 121, a host interface 129, a storage medium interface (I/O) 128, and additional module(s) 125. Storage controller 124 may include various additional features that have not been illustrated for the sake of brevity and so as not to obscure more pertinent features of the example implementations disclosed herein, and a different arrangement of features may be possible. Host interface 129 provides an interface to computer system 110 through data connections 101. Similarly, storage medium I/O 128 provides an interface to storage medium 130 though connections 103. In some implementations, storage medium I/O 128 includes read and write circuitry, including circuitry capable of providing reading signals to storage medium 130 (e.g., reading threshold voltages for NAND-type flash memory).
In some implementations, management module 121 includes one or more processing units (CPUs, also sometimes called processors) 122 configured to execute instructions in one or more programs (e.g., in management module 121). In some implementations, the one or more CPUs 122 are shared by one or more components within, and in some cases, beyond the function of storage controller 124. Management module 121 is coupled to host interface 129, additional module(s) 125 and storage medium I/O 128 in order to coordinate the operation of these components.
Additional module(s) 125 are coupled to storage medium I/O 128, host interface 129, and management module 121. As an example, additional module(s) 125 may include an error control module to limit the number of uncorrectable errors inadvertently introduced into data during writes to memory or reads from memory. In some embodiments, additional module(s) 125 are executed in software by the one or more CPUs 122 of management module 121, and, in other embodiments, additional module(s) 125 are implemented in whole or in part using special purpose circuitry (e.g., to perform encoding and decoding functions).
During a write operation, host interface 129 receives data to be stored in storage medium 130 from computer system 110. The data held in host interface 129 is made available to an encoder (e.g., in additional module(s) 125), which encodes the data to produce one or more codewords. The one or more codewords are made available to storage medium I/O 128, which transfers the one or more codewords to storage medium 130 in a manner dependent on the type of storage medium being utilized.
A read operation is initiated when computer system (host) 110 sends one or more host read commands on control line 111 to storage controller 124 requesting data from storage medium 130. Storage controller 124 sends one or more read access commands to storage medium 130, via storage medium I/O 128, to obtain raw read data in accordance with memory locations (addresses) specified by the one or more host read commands. Storage medium I/O 128 provides the raw read data (e.g., comprising one or more codewords) to a decoder (e.g., in additional module(s) 125). If the decoding is successful, the decoded data is provided to host interface 129, where the decoded data is made available to computer system 110. In some implementations, if the decoding is not successful, storage controller 124 may resort to a number of remedial actions or provide an indication of an irresolvable error condition.
Flash memory devices utilize memory cells to store data as electrical values, such as electrical charges or voltages. Each flash memory cell typically includes a single transistor with a floating gate that is used to store a charge, which modifies the threshold voltage of the transistor (i.e., the voltage needed to turn the transistor on). The magnitude of the charge, and the corresponding threshold voltage the charge creates, is used to represent one or more data values. In some implementations, during a read operation, a reading threshold voltage is applied to the control gate of the transistor and the resulting sensed current or voltage is mapped to a data value.
The terms “cell voltage” and “memory cell voltage,” in the context of flash memory cells, means the threshold voltage of the memory cell, which is the minimum voltage that needs to be applied to the gate of the memory cell's transistor in order for the transistor to conduct current. Similarly, reading threshold voltages (sometimes also called reading signals, reading voltages, and/or read thresholds) applied to a flash memory cells are gate voltages applied to the gates of the flash memory cells to determine whether the memory cells conduct current at that gate voltage. In some implementations, when a flash memory cell's transistor conducts current at a given reading threshold voltage, indicating that the cell voltage is less than the reading threshold voltage, the raw data value for that read operation is a “1,” and otherwise the raw data value is a “0.”
As explained above, a storage medium (e.g., storage medium 130) is divided into a number of addressable and individually selectable blocks and each block is optionally (but typically) further divided into a plurality of pages and/or word lines and/or sectors. While erasure of a storage medium is performed on a block basis, in many embodiments, reading and programming of the storage medium is performed on a smaller subunit of a block (e.g., on a page basis, word line basis, or sector basis). In some embodiments, the smaller subunit of a block consists of multiple memory cells (e.g., single-level cells or multi-level cells). In some embodiments, programming is performed on an entire page. In some embodiments, a multi-level cell (MLC) NAND flash typically has four possible states per cell, yielding two bits of information per cell. Further, in some embodiments, a MLC NAND has two page types: (1) a lower page (sometimes called fast page), and (2) an upper page (sometimes called slow page).
As an example, if data is written to a storage medium in pages, but the storage medium is erased in blocks, pages in the storage medium may contain invalid (e.g., stale) data, but those pages cannot be overwritten until the whole block containing those pages is erased. In order to write to the pages with invalid data, the pages with valid data in that block are read and re-written to a new block and the old block is erased (or put on a queue for erasing). This process is called garbage collection. After garbage collection, the new block contains pages with valid data and free pages that are available for new data to be written, and the old block that was erased is also available for new data to be written. Since flash memory can only be programmed and erased a limited number of times, the efficiency of the algorithm used to pick the next block(s) to re-write and erase has a significant impact on the lifetime and reliability of flash-based storage systems.
Write amplification is a phenomenon where the actual amount of physical data written to a storage medium (e.g., storage medium 130) is a multiple of the logical amount of data intended to be written by a host (e.g., computer system 110, sometimes called a host). As discussed above, when a storage medium must be erased before it can be re-written, the garbage collection process to perform these operations results in re-writing data one or more times. This multiplying effect increases the number of writes required over the life of a storage medium, which shortens the time it can reliably operate. The formula to calculate the write amplification of a storage system is given by equation (1):
Further, operating at higher temperatures may cause retention charge loss on blocks that are cold (e.g., idle for an extended period of time from the last program command). Read patrolling is utilized to manage this operation retention issue.
With the scaling of process nodes to sub-nanometer levels, the endurance of storage mediums (e.g., NAND flash memories) is declining. Endurance degradation may result from drifting of cell voltages due to program disturb (e.g., during write operations), over programming, read disturb (e.g., during read operations), and retention effects. In order to maintain the reliability of the storage medium and avoid data loss, a storage system can be configured to use background read patrol mechanisms and read disturb counts to determine when the data in a block should be relocated before it becomes ECC uncorrectable.
Each of the above identified elements may be stored in one or more of the previously mentioned memory devices, and corresponds to a set of instructions for performing a function described above. The above identified modules or programs (i.e., sets of instructions) need not be implemented as separate software programs, procedures or modules, and thus various subsets of these modules may be combined or otherwise re-arranged in various embodiments. In some embodiments, memory 206 may store a subset of the modules and data structures identified above. Furthermore, memory 206 may store additional modules and data structures not described above. In some embodiments, the programs, modules, and data structures stored in memory 206, or the computer readable storage medium of memory 206, provide instructions for implementing any of the methods described below with reference to
Although
As shown, each of pages 304, 306 is further designated as valid (e.g., 304-3), invalid (e.g., 304-2), available (e.g., 304-7), or vulnerable (e.g., 304-5). Pages designated valid and pages designated vulnerable both contain valid data, while pages designed invalid pages designated available do not contain valid data. Stated another way, vulnerable pages are a subclass of valid pages. In some embodiments, the above designations apply to sub-blocks. Pages are just one example of sub-blocks.
In
In particular, garbage collection of a first sub-block of a first erase block (e.g., page 304-5 of erase block 300-1) is performed in accordance with a determination that a first trigger parameter (e.g., a read-disturb count) meets a first vulnerability criterion (e.g., a read-disturb threshold). Detailed discussions of trigger parameters and vulnerability criteria are provided below with respect to
As illustrated, performing garbage collection of the first sub-block includes writing (310) a copy of the data of the first sub-block into an available page of a second erase block (e.g., writing the data of page 304-5 into page 306-n of erase block 300-2). In some implementations, after copying the data of the first sub-block, the first sub-block (e.g., page 304-5) in the first erase block is invalidated (not shown), and the new sub-block (e.g., page 306-n) of the second erase block which includes the copied data is designated as valid.
Optionally, as described in greater detail with respect to
In a variation of the scheme shown in
In yet another variation, each zone 302 includes a plurality of sub-blocks, and each sub-block includes a plurality of pages. This is similar to the scheme shown in
Furthermore, in some implementations, one or more sub-blocks in a block are of different size than other sub-blocks in the same block. For example, a particularly vulnerable page or word line can be its own sub-block, while other sub-blocks of the same block contain multiple pages or word lines and thus are multiple times as large as the sub-block that is particularly vulnerable. In another example of sub-blocks having different sizes and different vulnerability criterions, one sub-block can be a subset of another, larger sub-block, with the smaller sub-block having a distinct vulnerability criterion than the larger sub-block. In this way, the smaller sub-block can be configured to protect data in a particularly vulnerable portion of a block by assigning it a different vulnerability criterion (e.g., a smaller read count threshold) than the larger sub-block.
In some implementations, garbage collecting only a sub-block of an erase block (and, optionally, garbage collecting the entire erase block at a later time) reduces the impact of garbage collection on the endurance of a storage medium. In particular, the data integrity of vulnerable sub-blocks is maintained without further wearing the storage medium.
In some embodiments, column 400 includes storage elements (e.g., SLC or MLC flash memory cells) formed within multiple layers of materials that are formed on a substrate 408 (e.g., a silicon substrate). To illustrate,
In some embodiments, column 400 further includes a structure 402. To form structure 402, an etch process is performed to etch through layers of column 400 to form an etched region (e.g., a cavity, such as a “memory hole”). After etching through layers of column 400 to form the etched region, the etched region is filled with one or more materials to form structure 402. For example, structure 402 has a circular or substantially circular shape. In this example, a cross section of structure 402 that is perpendicular to a surface of substrate 408 is circular.
In some embodiments, column 400 includes multiple storage elements, such as representative storage elements 404 and 406 (e.g., SLC or MLC flash memory cells). For example, storage element 404 is included in a first physical page of a first word line of storage medium 130 in
In some embodiments, structure 402 has a variation. For example, as illustrated in
By identifying location 420, accuracy of operations at storage medium 130 can be improved. For example, by identifying location 420, storage elements 404 and 406 may be associated with different ECC parameters and/or different memory access parameters to compensate for differences in physical characteristics of storage elements 404 and 406 due to tapering of structure 402. Differences in physical characteristics of storage elements are described further with reference to
In some embodiments, control gates 452 and 460 and oxide region 458 are formed within multiple layers of storage medium 130. For example, control gate 452 is formed within a polysilicon layer, oxide region 458 is formed within an oxide layer, and control gate 460 is formed within another polysilicon layer. In some embodiments, control gates 452 and 460 and oxide region 458 are formed within one or more “physical layers” of storage medium 130. For example, a physical layer includes control gate 452 and oxide region 458.
It should be appreciated that one or more additional materials may be formed within structure 402. For example, charge trap structure 454 is separated from control gate 452 and conductive channel 456 by a gate dielectric, such as a silicon oxide. In some embodiments, charge trap structure 454 includes an insulating material, such as silicon nitride. In some embodiments, conductive channel 456 includes a conductive material, such as a metal (e.g., copper).
In some embodiments, portion 450 is biased to write a value to storage element 404 and to sense a value stored at storage element 404. In some embodiments, portion 450 is biased to write a value to storage element 406 and to sense a value stored at storage element 406. For example, charge is injected into or drained from charge trap structure 454 by biasing control gate 452 relative to conductive channel 456. In this example, the amount of charge in charge trap structure 454 affects the amount of current through conductive channel 456 during a read operation of storage element 404 and indicates one or more bit values stored in storage element 404. As another example, charge is injected into or drained from charge trap structure 454 by biasing control gate 460 relative to conductive channel 456. In this example, the amount of charge in charge trap structure 454 affects the amount of current through conductive channel 456 during a read operation of storage element 406 and indicates a state of storage element 406. The state of storage element 406 corresponds to one or more bit values stored by storage element 406.
Alternatively or additionally, in accordance with some embodiments, a variation of structure 402 causes gate-to-channel distance 466 associated with storage element 404 to be greater than gate-to-channel distance 468 associated with storage element 406. In this case, charge trap structure 454 has a greater taper effect than conductive channel 456. During a write operation that programs a state of storage element 404, a greater voltage (relative to storage element 406) is applied to control gate 452 to accumulate charge within charge trap structure 454 (e.g., by drawing electrons from conductive channel 456 to within charge trap structure 454). Therefore, tapering of structure 402 causes programming operations of storage element 404 to differ relative to storage element 406, which can result in an “incorrect” state being programmed to and/or sensed from storage element 404. The tapering of structure 402 also makes storage element 406 more vulnerable to read disturbs than storage element 404. Thus, a vulnerability criterion of sub-blocks for enabling garbage collection (as described in greater detail below with respect to
In
In
In
In some embodiments, level 610 intersects each of blocks 500, 604, and 606 at a common level k. Alternatively, in some embodiments, depending on the particular fabrication process used to fabricate 3D memory device 600, level 610 intersects two or more of blocks 500, 604, and 606 at different locations. As an example, level 610 intersects block 500 at a first distance from substrate 408, intersects block 604 at a second distance from substrate 408, and intersects block 606 at a third distance from substrate 408. In this example, level 610 corresponds to a “non-uniform” plane, such as an inclined plane.
In some embodiments, storage controller 124 or a component thereof (e.g., location determination module 218,
In some embodiments, location determination module 218 determines the variation location for each column or block of storage medium 130 upon the first power-on of storage medium 130. In some embodiments, storage controller 124 or a component thereof (e.g., location update module 219,
In some embodiments, location table 220 stores a determined location 420 for each block of storage medium 130 indicating the end of a taper region for columns within a respective block. For example, for the respective block, determined location 420 indicates a page or word line at which the taper region ends relative to the substrate. In some embodiments, location table 220 stores a determined location 420 for each column of storage medium 130 indicating the end of a taper region for a respective column. For example, for the respective column, determined location 420 indicates a page or word line at which the taper region ends relative to the substrate. As such, in some embodiments, storage controller 124 is able to selectively encode, write, read, and/or decode data from pages or word lines above and below determined location 420 for the respective column. For example, for the respective column, data written to pages or word lines above determined location 420 are encoded with a first ECC technique, and data written to pages or word lines below determined location 420 are encoded with a second ECC technique.
In
In some embodiments, 3D memory device 700 includes multiple erase blocks, including a first block (block 0) 750, a second block (block 1) 752, and a third block (block 2) 754. In
In some embodiments, read/write circuitry 760 (i.e., read/write circuitry 135 or alternatively read/write circuitry within storage medium I/O 128) is coupled with conductive channels via multiple conductive lines, illustrated as a first bit line (BL0) 730, a second bit line (BL1) 732, and a third bit line (BL2) 734 at a “top” end of the conducive channels (e.g., relative to substrate 704) and a first source line (SL0) 740, a second source line (SL1) 742, and a third source line (SL2) 744) at a “bottom” end of the conductive channels (e.g., relative to substrate 704). In
In some embodiments, each of bit lines 730-734 and each of source lines 740-744 are coupled with the same end (e.g., the top end or the bottom end) of different conductive channels. For example, a respective bit line is coupled with the top of conductive channel 792 and a respective source line is coupled with the top of conductive channel 712. Continuing with this example, the bottom of conductive channel 792 is coupled (e.g., electrically coupled) to the bottom of conductive channel 712. Accordingly, in this example, conductive channel 792 and conductive channel 712 are coupled in series and are coupled with the respective bit line and the respective source line.
Although each of the conductive channels (e.g., conductive channels 712, 792) in
In some embodiments, read/write circuitry 760 receives memory operation commands from storage controller 124 (e.g., a read command from data read module 212, a write command from data write module 214, or an erase command from data erase module 216). For example, data is stored in storage elements coupled with word line 728 and read/write circuitry 760 reads bit values from these storage elements. As another example, the read/write circuitry 760 applies selection signals to control lines coupled with word lines 720-728, bit lines 730-734, and source lines 740-742 to cause a programming voltage (e.g., a voltage pulse or series of voltage pulses associated with a threshold voltage) to be applied across selected storage element(s) of the selected word line (e.g., fourth word line 728) so as to write/program data to the selected storage element(s).
For example, during a read operation, storage controller 124 receives a request from the host (e.g., computer system 110,
At least in some embodiments, method 800 is performed by a storage device (e.g., storage device 120,
A storage device (e.g., storage device 120,
Trigger parameters determined in accordance with one or more operating conditions at least partially serve to identify “weak” sub-blocks, which are more likely than other sub-blocks to suffer reduced or impaired data retention, and which are candidates for garbage collection, as described herein. As described in greater detail above with respect to
In some embodiments, the first trigger parameter is a read-disturb count of the first sub-block. For example, as previously described, performing a read operation of a respective page disturbs adjacent pages, and therefore increases a read-disturb count of the sub-block(s) containing those adjacent pages. In some implementations, a read-disturb count is maintained by the storage device for each sub-block. For example, in some implementations, performing a read operation of a page of a respective sub-block (e.g., zone 302-1,
In some embodiments, the first trigger parameter is a data retention parameter of the first sub-block, a set of data retention parameters, or a combination of data retention parameters. Data retention parameters include, for example, an error metric corresponding to a number of detected data errors in a sub-block (e.g., a bit error rate), and a stability metric corresponding to one or more threshold voltages (e.g., shifting read, write, and/or erase threshold voltages for the first sub-block). Furthermore, in some implementations, data retention parameters include a program-erase (PE) cycle count (e.g., of an erase block) and/or other information relating to the accumulated wear of a storage medium 130, or a portion thereof (e.g., selectable portion 131,
As described previously, in some embodiments, the storage device regularly performs background monitoring activities (e.g., with state information module 230,
In another example, state information module 230 executes instructions for performing a read patrol operation on a sub-block (e.g., page 304-4,
Furthermore, in some implementations, background monitoring activities are performed according to a pre-defined schedule that is set based on information from state information table 230 and/or characterization table 234 (storing characteristics of a sub-block, which are described in greater detail below). For example, a read patrol operation is performed more frequently on a sub-block that has been identified as vulnerable, based on a read-disturb count of the sub-block (e.g., a read-disturb count of the sub-block exceeds a threshold, vulnerability criteria being described in greater detail below), and optionally in combination with the location of the sub-block relative to the substrate of the storage medium (e.g., WL0720,
In some embodiments, the storage device includes (804) one or more flash memory devices. Stated another way, in some embodiments the storage device includes a storage medium (e.g., storage medium 130,
In some embodiments, the storage device includes (806) one or more three-dimensional (3D) memory devices and circuitry associated with operation of memory elements in the one or more 3D memory devices. Stated another way, in some embodiments the storage device includes a storage medium (e.g., storage medium 130,
Furthermore, in some implementations, the circuitry and one or more memory elements in a respective 3D memory device, of the one or more 3D memory devices, are (808) on the same substrate (e.g., a silicon substrate). In some embodiments, the substrate is a wafer on which the material layers of the one or more memory elements are deposited and/or in which the one or more memory elements are formed. In some embodiments, the substrate is a carrier substrate which is attached to the one or more memory elements after they are formed. As a non-limiting example, in some embodiments, the substrate includes a semiconductor such as silicon.
The storage device determines (810) a second trigger parameter in accordance with one or more operating conditions of a second sub-block of the erase block in the storage medium (a detailed discussion of which can be found above with respect to the first trigger parameter).
In some embodiments, the first sub-block is a portion of the erase block and the second sub-block is (812) another portion of the erase block. Thus, in some implementations, the first sub-block and the second sub-block are distinct portions of the same erase block (e.g., in
In accordance with a determination that the first trigger parameter meets (814) a first vulnerability criterion, the storage device enables (820) garbage collection of the first sub-block. In some embodiments, vulnerability criteria are one or more pre-defined threshold limits for the trigger parameters described above. In some implementations, if a trigger parameter of a sub-block meets a corresponding vulnerability criterion, the sub-block is designated as vulnerable. In some implementations, for example, the first vulnerability criterion is a threshold on a read-disturb count of the first sub-block (e.g., read-disturb count limit of 100), while in some other implementations, the first vulnerability criterion is a threshold number of data errors detected in the first sub-block by performing a read patrol operation (e.g., eighty erroneous bits in page of size 4K bytes,
In other example, a weighted combination of trigger parameters, is compared with a threshold to determine if garbage collection should be enabled for the first sub-block. An example of weighted combination of trigger parameters is:
where N is the number of trigger parameters (e.g., N=2, 3 or 4), “trigger_parameteri” is the ith trigger parameter, αi is a weight for the ith trigger parameter, and thresholdi is a threshold or subtractive factor for the ith trigger parameter. In this example, the weighted combination is computed and then compared with a predefined threshold to determine if garbage collection should be enabled for the first sub-block.
In some embodiments, the first vulnerability criterion is determined (816) in accordance with one or more characteristics of the first sub-block. The one or more characteristics are intrinsic qualities of a flash memory device that impact data retention. In some implementations, the first vulnerability criterion is determined in accordance with a physical location of a sub-block (e.g., a distance of between the first sub-block and the substrate of the storage medium). For example, for the reasons explained above with respect to
Furthermore, in some implementations, the first vulnerability criterion is determined in accordance with the zone (of a plurality of zones in an erase block) to which the first sub-block corresponds. For example, in erase block 300-1 (
In some embodiments, “enabling garbage collection” of a sub-block is different from the actual garbage collection of the sub-block, which occurs after garbage collection of the sub-block is enabled. In some implementations, enabling garbage collection of a sub-block is implemented by adding the sub-block to a queue or list of sub-blocks scheduled for garbage collection. A garbage collection process executed by the storage device's controller or management module or memory channel controller, performs the actual garbage collection of sub-blocks for which garbage collection has been enabled. Such garbage collection can be deferred in order to execute other memory operations, for example, in accordance with memory operation scheduling criteria implemented by the storage device.
In some embodiments, garbage collection includes writing (822) a copy of valid data from the first sub-block to a second erase block in the storage medium, wherein the second erase block is distinct from the erase block, and invalidating (824) the first sub-block in the erase block (i.e., invalidating any valid data remaining in the first sub-block when the first sub-block is garbage collected). An example of garbage collection is illustrated and described in greater detail with respect to
Optionally, in some implementations, the storage device enables garbage collection of the first sub-block in accordance with a determination that the erase block or a memory portion that includes the erase block meets predefined age criteria (818) and a determination that the first trigger parameter meets the first vulnerability criterion (see 814). In some implementations, age criteria include one or more threshold limits on a program-erase (PE) cycle count, an age (e.g., determined with reference to a date of manufacture for the storage device), and/or other age-related metrics for an erase block, or a memory portion that includes the erase block. As a non-limiting example, garbage collection of page 304-4 (
In some embodiments, the storage device enables (826) garbage collection for a parity stripe that includes the first sub-block, wherein the parity stripe includes a plurality of sub-blocks across a plurality of erase blocks in the storage medium. In some embodiments, for example, a parity stripe spans multiple erase blocks (e.g., a super block), and in order to maintain parity protection, when garbage collection is enabled for the first sub-block (e.g., a page in a first erase block), garbage collection is also enabled for the entire parity stripe that includes the first sub-block (e.g., other pages in one or more other erase blocks).
In accordance with a determination that the second trigger parameter meets (828) a second vulnerability criterion, the storage device enables (834) garbage collection of the second sub-block. In a non-limiting example, the second sub-block has a read-disturb count that which exceeds a read-disturb threshold of 225,000, and thus garbage collection of both the second sub-block is enabled. In some circumstances, enabling garbage of the second sub-block occurs without enabling garbage collection of the first sub-block, because the second trigger parameter meets the second vulnerability criterion while the first trigger parameter does not (or does not yet) meet the first vulnerability criterion.
In some embodiments, the second vulnerability criterion is determined (830) in accordance with one or more characteristics of the second sub-block. See the above discussion of sub-block characteristics and vulnerability criteria. In some implementations, the first vulnerability criterion is distinct (832) from the second vulnerability criterion.
Optionally, in some implementations, garbage collection of the first sub-block is performed (836) prior to (or without) garbage collection of the second sub-block. For example, in some implementations, the second trigger parameter meets the second vulnerability criterion after the first trigger parameter meets the first vulnerability criterion, and thus garbage collection of the second sub-block (e.g., erase block 304-1) is performed at a later time than garbage collection for a first sub-block (e.g., page 304-5).
Method 800 reduces the impact of garbage collection on the endurance of the storage medium, because data stored in vulnerable sub-blocks of an erase block is preserved without erasing the entire erase block (at least until a separate decision is made to garbage collect the remaining valid data in the erase block).
At least in some embodiments, method 900 is performed by a storage device (e.g., storage device 120,
A storage device (e.g., storage device 120,
In some embodiments, the storage device includes (904) one or more flash memory devices. Stated another way, in some embodiments the storage device includes a storage medium (e.g., storage medium 130,
In some embodiments, the storage device includes (906) one or more three-dimensional (3D) memory devices and circuitry associated with operation of memory elements in the one or more 3D memory devices. Stated another way, in some embodiments, the storage device includes a storage medium (e.g., storage medium 130,
Furthermore, in some implementations, the circuitry and one or more memory elements in a respective 3D memory device, of the one or more 3D memory devices, are (908) on the same substrate (e.g., a silicon substrate). In some embodiments, the substrate is a wafer, or a portion (e.g., a die) of a wafer, on which the material layers of the one or more memory elements are deposited and/or in which the one or more memory elements are formed. In some embodiments, the substrate is a carrier substrate which is attached to the one or more memory elements after they are formed. As a non-limiting example, in some embodiments, the substrate includes a semiconductor such as silicon.
In accordance with a determination that the first trigger parameter meets (910) a first vulnerability criterion, the storage device enables (912) garbage collection of the first sub-block. Vulnerability criteria are discussed in greater detail above with respect to
Furthermore, the storage device determines (918) whether the erase block meets predefined garbage collection scheduling criteria. In accordance with a determination that the erase block meets said garbage collection scheduling criteria, the storage device enables (920) garbage collection of the erase block. In some implementations, the garbage collection scheduling criteria include a determination that the amount of valid data remaining in the erase block falls below a threshold. In some implementations, the garbage collection scheduling criteria include a determination that the erase block is one of N erase blocks in the storage device having the least amount of valid data, where N (a positive integer) is the number of erase blocks needed by the storage device to be available for storing data.
Semiconductor memory devices include volatile memory devices, such as dynamic random access memory (“DRAM”) or static random access memory (“SRAM”) devices, non-volatile memory devices, such as resistive random access memory (“ReRAM”), electrically erasable programmable read only memory (“EEPROM”), flash memory (which can also be considered a subset of EEPROM), ferroelectric random access memory (“FRAM”), and magnetoresistive random access memory (“MRAM”), and other semiconductor elements capable of storing information. Each type of memory device may have different configurations. For example, flash memory devices may be configured in a NAND or a NOR configuration.
The memory devices can be formed from passive and/or active elements, in any combinations. By way of non-limiting example, passive semiconductor memory elements include ReRAM device elements, which in some embodiments include a resistivity switching storage element, such as an anti-fuse, phase change material, etc., and optionally a steering element, such as a diode, etc. Further by way of non-limiting example, active semiconductor memory elements include EEPROM and flash memory device elements, which in some embodiments include elements containing a charge storage region, such as a floating gate, conductive nanoparticles, or a charge storage dielectric material.
Multiple memory elements may be configured so that they are connected in series or so that each element is individually accessible. By way of non-limiting example, flash memory devices in a NAND configuration (NAND memory) typically contain memory elements connected in series. A NAND memory array may be configured so that the array is composed of multiple strings of memory in which a string is composed of multiple memory elements sharing a single bit line and accessed as a group. Alternatively, memory elements may be configured so that each element is individually accessible (e.g., a NOR memory array). NAND and NOR memory configurations are exemplary, and memory elements may be otherwise configured.
The semiconductor memory elements located within and/or over a substrate may be arranged in two or three dimensions, such as a two dimensional memory structure or a three dimensional memory structure.
In a two dimensional memory structure, the semiconductor memory elements are arranged in a single plane or a single memory device level. Typically, in a two dimensional memory structure, memory elements are arranged in a plane (e.g., in an x-z direction plane) which extends substantially parallel to a major surface of a substrate that supports the memory elements. The substrate may be a wafer over or in which the layer of the memory elements are formed or it may be a carrier substrate which is attached to the memory elements after they are formed. As a non-limiting example, the substrate may include a semiconductor such as silicon.
The memory elements may be arranged in the single memory device level in an ordered array, such as in a plurality of rows and/or columns. However, the memory elements may be arrayed in non-regular or non-orthogonal configurations. The memory elements may each have two or more electrodes or contact lines, such as bit lines and word lines.
A three dimensional memory array is arranged so that memory elements occupy multiple planes or multiple memory device levels, thereby forming a structure in three dimensions (i.e., in the x, y and z directions, where the y direction is substantially perpendicular and the x and z directions are substantially parallel to the major surface of the substrate).
As a non-limiting example, a three dimensional memory structure may be vertically arranged as a stack of multiple two dimensional memory device levels. As another non-limiting example, a three dimensional memory array may be arranged as multiple vertical columns (e.g., columns extending substantially perpendicular to the major surface of the substrate, i.e., in the y direction) with each column having multiple memory elements in each column. The columns may be arranged in a two dimensional configuration (e.g., in an x-z plane), resulting in a three dimensional arrangement of memory elements with elements on multiple vertically stacked memory planes. Other configurations of memory elements in three dimensions can also constitute a three dimensional memory array.
By way of non-limiting example, in a three dimensional NAND memory array, the memory elements may be coupled together to form a NAND string within a single horizontal (e.g., x-z) memory device level. Alternatively, the memory elements may be coupled together to form a vertical NAND string that traverses across multiple horizontal memory device levels. Other three dimensional configurations can be envisioned wherein some NAND strings contain memory elements in a single memory level while other strings contain memory elements which span through multiple memory levels. Three dimensional memory arrays may also be designed in a NOR configuration and in a ReRAM configuration.
Typically, in a monolithic three dimensional memory array, one or more memory device levels are formed above a single substrate. Optionally, the monolithic three dimensional memory array may also have one or more memory layers at least partially within the single substrate. As a non-limiting example, the substrate may include a semiconductor such as silicon. In a monolithic three dimensional array, the layers constituting each memory device level of the array are typically formed on the layers of the underlying memory device levels of the array. However, layers of adjacent memory device levels of a monolithic three dimensional memory array may be shared or have intervening layers between memory device levels.
Then again, two dimensional arrays may be formed separately and then packaged together to form a non-monolithic memory device having multiple layers of memory. For example, non-monolithic stacked memories can be constructed by forming memory levels on separate substrates and then stacking the memory levels atop each other. The substrates may be thinned or removed from the memory device levels before stacking, but as the memory device levels are initially formed over separate substrates, the resulting memory arrays are not monolithic three dimensional memory arrays. Further, multiple two dimensional memory arrays or three dimensional memory arrays (monolithic or non-monolithic) may be formed on separate chips and then packaged together to form a stacked-chip memory device.
Associated circuitry is typically required for operation of the memory elements and for communication with the memory elements. As non-limiting examples, memory devices may have circuitry used for controlling and driving memory elements to accomplish functions such as programming and reading. This associated circuitry may be on the same substrate as the memory elements and/or on a separate substrate. For example, a controller for memory read-write operations may be located on a separate controller chip and/or on the same substrate as the memory elements.
The term “three-dimensional memory device” (or 3D memory device) is herein defined to mean a memory device having multiple memory layers or multiple levels (e.g., sometimes called multiple memory device levels) of memory elements, including any of the following: a memory device having a monolithic or non-monolithic 3D memory array, some non-limiting examples of which are described above; or two or more 2D and/or 3D memory devices, packaged together to form a stacked-chip memory device, some non-limiting examples of which are described above.
One of skill in the art will recognize that this invention is not limited to the two dimensional and three dimensional exemplary structures described but cover all relevant memory structures within the spirit and scope of the invention as described herein and as understood by one of skill in the art.
In some implementations, with respect to any of the methods described above, the storage medium (e.g., storage medium 130,
In some implementations, with respect to any of the methods described above, a storage system includes a storage medium (e.g., storage medium 130,
In some implementations, with respect to any of the methods described above, a device operable to perform garbage collection includes a storage medium interface (e.g., storage medium I/O 128,
It will be understood that, although the terms “first,” “second,” etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first contact could be termed a second contact, and, similarly, a second contact could be termed a first contact, which changing the meaning of the description, so long as all occurrences of the “first contact” are renamed consistently and all occurrences of the second contact are renamed consistently. The first contact and the second contact are both contacts, but they are not the same contact.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the claims. As used in the description of the embodiments and the appended claims, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will also be understood that the term “and/or” as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
As used herein, the term “if” may be construed to mean “when” or “upon” or “in response to determining” or “in accordance with a determination” or “in response to detecting,” that a stated condition precedent is true, depending on the context. Similarly, the phrase “if it is determined [that a stated condition precedent is true]” or “if [a stated condition precedent is true]” or “when [a stated condition precedent is true]” may be construed to mean “upon determining” or “in response to determining” or “in accordance with a determination” or “upon detecting” or “in response to detecting” that the stated condition precedent is true, depending on the context.
The foregoing description, for purpose of explanation, has been described with reference to specific implementations. However, the illustrative discussions above are not intended to be exhaustive or to limit the claims to the precise forms disclosed. Many modifications and variations are possible in view of the above teachings. The implementations were chosen and described in order to best explain principles of operation and practical applications, to thereby enable others skilled in the art.
This application claims priority to U.S. Provisional Application Ser. No. 62/014,461, filed Jun. 19, 2014, which is incorporated herein by reference in its entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4173737 | Skerlos et al. | Nov 1979 | A |
| 4888750 | Kryder et al. | Dec 1989 | A |
| 4916652 | Schwarz et al. | Apr 1990 | A |
| 5129089 | Nielsen | Jul 1992 | A |
| 5270979 | Harari et al. | Dec 1993 | A |
| 5329491 | Brown et al. | Jul 1994 | A |
| 5381528 | Brunelle | Jan 1995 | A |
| 5404485 | Ban | Apr 1995 | A |
| 5488702 | Byers et al. | Jan 1996 | A |
| 5519847 | Fandrich et al. | May 1996 | A |
| 5530705 | Malone | Jun 1996 | A |
| 5537555 | Landry | Jul 1996 | A |
| 5551003 | Mattson et al. | Aug 1996 | A |
| 5636342 | Jeffries | Jun 1997 | A |
| 5657332 | Auclair et al. | Aug 1997 | A |
| 5666114 | Brodie et al. | Sep 1997 | A |
| 5708849 | Coke et al. | Jan 1998 | A |
| 5765185 | Lambrache et al. | Jun 1998 | A |
| 5890193 | Chevaliier | Mar 1999 | A |
| 5930188 | Roohparvar | Jul 1999 | A |
| 5936884 | Hasbun et al. | Aug 1999 | A |
| 5943692 | Marberg et al. | Aug 1999 | A |
| 5946714 | Miyauchi | Aug 1999 | A |
| 5982664 | Watanabe | Nov 1999 | A |
| 6000006 | Bruce et al. | Dec 1999 | A |
| 6006345 | Berry, Jr. | Dec 1999 | A |
| 6016560 | Wada et al. | Jan 2000 | A |
| 6018304 | Bessios | Jan 2000 | A |
| 6044472 | Crohas | Mar 2000 | A |
| 6070074 | Perahia et al. | May 2000 | A |
| 6104304 | Clark et al. | Aug 2000 | A |
| 6119250 | Nishimura et al. | Sep 2000 | A |
| 6138261 | Wilcoxson et al. | Oct 2000 | A |
| 6182264 | Ott | Jan 2001 | B1 |
| 6192092 | Dizon et al. | Feb 2001 | B1 |
| 6260120 | Blumenau et al. | Jul 2001 | B1 |
| 6295592 | Jeddeloh et al. | Sep 2001 | B1 |
| 6311263 | Barlow et al. | Oct 2001 | B1 |
| 6408394 | Vander Kamp et al. | Jun 2002 | B1 |
| 6412042 | Paterson et al. | Jun 2002 | B1 |
| 6442076 | Roohparvar | Aug 2002 | B1 |
| 6449625 | Wang | Sep 2002 | B1 |
| 6484224 | Robins et al. | Nov 2002 | B1 |
| 6516437 | Van Stralen et al. | Feb 2003 | B1 |
| 6564285 | Mills et al. | May 2003 | B1 |
| 6647387 | McKean et al. | Nov 2003 | B1 |
| 6678788 | O'Connell | Jan 2004 | B1 |
| 6728879 | Atkinson | Apr 2004 | B1 |
| 6757768 | Potter et al. | Jun 2004 | B1 |
| 6775792 | Ulrich et al. | Aug 2004 | B2 |
| 6810440 | Micalizzi, Jr. et al. | Oct 2004 | B2 |
| 6836808 | Bunce et al. | Dec 2004 | B2 |
| 6836815 | Purcell et al. | Dec 2004 | B1 |
| 6842436 | Moeller | Jan 2005 | B2 |
| 6865650 | Morley et al. | Mar 2005 | B1 |
| 6871257 | Conley et al. | Mar 2005 | B2 |
| 6895464 | Chow et al. | May 2005 | B2 |
| 6934755 | Saulpaugh et al. | Aug 2005 | B1 |
| 6966006 | Pacheco et al. | Nov 2005 | B2 |
| 6978343 | Ichiriu | Dec 2005 | B1 |
| 6980985 | Amer-Yahia et al. | Dec 2005 | B1 |
| 6981205 | Fukushima et al. | Dec 2005 | B2 |
| 6988171 | Beardsley et al. | Jan 2006 | B2 |
| 7020017 | Chen et al. | Mar 2006 | B2 |
| 7024514 | Mukaida et al. | Apr 2006 | B2 |
| 7028165 | Roth et al. | Apr 2006 | B2 |
| 7032123 | Kane et al. | Apr 2006 | B2 |
| 7043505 | Teague et al. | May 2006 | B1 |
| 7076598 | Wang | Jul 2006 | B2 |
| 7100002 | Shrader et al. | Aug 2006 | B2 |
| 7102860 | Wenzel | Sep 2006 | B2 |
| 7111293 | Hersh et al. | Sep 2006 | B1 |
| 7126873 | See et al. | Oct 2006 | B2 |
| 7133282 | Sone | Nov 2006 | B2 |
| 7155579 | Neils et al. | Dec 2006 | B1 |
| 7162678 | Saliba | Jan 2007 | B2 |
| 7173852 | Gorobets et al. | Feb 2007 | B2 |
| 7184446 | Rashid et al. | Feb 2007 | B2 |
| 7212440 | Gorobets | May 2007 | B2 |
| 7269755 | Moshayedi et al. | Sep 2007 | B2 |
| 7275170 | Suzuki | Sep 2007 | B2 |
| 7295479 | Yoon et al. | Nov 2007 | B2 |
| 7328377 | Lewis et al. | Feb 2008 | B1 |
| 7426633 | Thompson et al. | Sep 2008 | B2 |
| 7486561 | Mokhlesi | Feb 2009 | B2 |
| 7516292 | Kimura et al. | Apr 2009 | B2 |
| 7523157 | Aguilar, Jr. et al. | Apr 2009 | B2 |
| 7527466 | Simmons | May 2009 | B2 |
| 7529466 | Takahashi | May 2009 | B2 |
| 7533214 | Aasheim et al. | May 2009 | B2 |
| 7546478 | Kubo et al. | Jun 2009 | B2 |
| 7566987 | Black et al. | Jul 2009 | B2 |
| 7571277 | Mizushima | Aug 2009 | B2 |
| 7574554 | Tanaka et al. | Aug 2009 | B2 |
| 7596643 | Merry et al. | Sep 2009 | B2 |
| 7669003 | Sinclair et al. | Feb 2010 | B2 |
| 7681106 | Jarrar et al. | Mar 2010 | B2 |
| 7685494 | Varnica et al. | Mar 2010 | B1 |
| 7707481 | Kirschner et al. | Apr 2010 | B2 |
| 7761655 | Mizushima et al. | Jul 2010 | B2 |
| 7765454 | Passint | Jul 2010 | B2 |
| 7774390 | Shin | Aug 2010 | B2 |
| 7809836 | Mihm et al. | Oct 2010 | B2 |
| 7840762 | Oh et al. | Nov 2010 | B2 |
| 7870326 | Shin et al. | Jan 2011 | B2 |
| 7890818 | Kong et al. | Feb 2011 | B2 |
| 7913022 | Baxter | Mar 2011 | B1 |
| 7925960 | Ho et al. | Apr 2011 | B2 |
| 7934052 | Prins et al. | Apr 2011 | B2 |
| 7945825 | Cohen et al. | May 2011 | B2 |
| 7954041 | Hong et al. | May 2011 | B2 |
| 7971112 | Murata | Jun 2011 | B2 |
| 7974368 | Shieh et al. | Jul 2011 | B2 |
| 7978516 | Olbrich | Jul 2011 | B2 |
| 7996642 | Smith | Aug 2011 | B1 |
| 8006161 | Lestable et al. | Aug 2011 | B2 |
| 8032724 | Smith | Oct 2011 | B1 |
| 8041884 | Chang | Oct 2011 | B2 |
| 8042011 | Nicolaidis et al. | Oct 2011 | B2 |
| 8069390 | Lin | Nov 2011 | B2 |
| 8190967 | Hong et al. | May 2012 | B2 |
| 8250380 | Guyot | Aug 2012 | B2 |
| 8254181 | Hwang et al. | Aug 2012 | B2 |
| 8259506 | Sommer et al. | Sep 2012 | B1 |
| 8261020 | Krishnaprasad et al. | Sep 2012 | B2 |
| 8312349 | Reche et al. | Nov 2012 | B2 |
| 8385117 | Sakurada et al. | Feb 2013 | B2 |
| 8412985 | Bowers et al. | Apr 2013 | B1 |
| 8429436 | Fillingim et al. | Apr 2013 | B2 |
| 8438459 | Cho et al. | May 2013 | B2 |
| 8453022 | Katz | May 2013 | B2 |
| 8473680 | Pruthi | Jun 2013 | B1 |
| 8510499 | Banerjee | Aug 2013 | B1 |
| 8531888 | Chilappagari et al. | Sep 2013 | B2 |
| 8554984 | Yano et al. | Oct 2013 | B2 |
| 8627117 | Johnston | Jan 2014 | B2 |
| 8634248 | Sprouse et al. | Jan 2014 | B1 |
| 8694854 | Dar et al. | Apr 2014 | B1 |
| 8724789 | Altberg et al. | May 2014 | B2 |
| 8775741 | de la Iglesia | Jul 2014 | B1 |
| 8788778 | Boyle | Jul 2014 | B1 |
| 8832384 | de la Iglesia | Sep 2014 | B1 |
| 8874992 | Desireddi et al. | Oct 2014 | B2 |
| 8885434 | Kumar | Nov 2014 | B2 |
| 8898373 | Kang et al. | Nov 2014 | B1 |
| 8909894 | Singh et al. | Dec 2014 | B1 |
| 8910030 | Goel | Dec 2014 | B2 |
| 8923066 | Subramanian et al. | Dec 2014 | B1 |
| 9043517 | Sprouse et al. | May 2015 | B1 |
| 9128690 | Lotzenburger et al. | Sep 2015 | B2 |
| 9329789 | Chu et al. | May 2016 | B1 |
| 20010026949 | Ogawa et al. | Oct 2001 | A1 |
| 20010050824 | Buch | Dec 2001 | A1 |
| 20020024846 | Kawahara et al. | Feb 2002 | A1 |
| 20020032891 | Yada et al. | Mar 2002 | A1 |
| 20020036515 | Eldridge et al. | Mar 2002 | A1 |
| 20020083299 | Van Huben et al. | Jun 2002 | A1 |
| 20020099904 | Conley | Jul 2002 | A1 |
| 20020116651 | Beckert et al. | Aug 2002 | A1 |
| 20020122334 | Lee et al. | Sep 2002 | A1 |
| 20020152305 | Jackson et al. | Oct 2002 | A1 |
| 20020162075 | Talagala et al. | Oct 2002 | A1 |
| 20020165896 | Kim | Nov 2002 | A1 |
| 20030041299 | Kanazawa et al. | Feb 2003 | A1 |
| 20030043829 | Rashid | Mar 2003 | A1 |
| 20030079172 | Yamagishi et al. | Apr 2003 | A1 |
| 20030088805 | Majni et al. | May 2003 | A1 |
| 20030093628 | Matter et al. | May 2003 | A1 |
| 20030163594 | Aasheim et al. | Aug 2003 | A1 |
| 20030163629 | Conley et al. | Aug 2003 | A1 |
| 20030188045 | Jacobson | Oct 2003 | A1 |
| 20030189856 | Cho et al. | Oct 2003 | A1 |
| 20030198100 | Matsushita et al. | Oct 2003 | A1 |
| 20030204341 | Guliani et al. | Oct 2003 | A1 |
| 20030212719 | Yasuda et al. | Nov 2003 | A1 |
| 20030225961 | Chow et al. | Dec 2003 | A1 |
| 20040024957 | Lin et al. | Feb 2004 | A1 |
| 20040024963 | Talagala et al. | Feb 2004 | A1 |
| 20040057575 | Zhang et al. | Mar 2004 | A1 |
| 20040062157 | Kawabe | Apr 2004 | A1 |
| 20040073829 | Olarig | Apr 2004 | A1 |
| 20040085849 | Myoung et al. | May 2004 | A1 |
| 20040114265 | Talbert | Jun 2004 | A1 |
| 20040143710 | Walmsley | Jul 2004 | A1 |
| 20040148561 | Shen et al. | Jul 2004 | A1 |
| 20040153902 | Machado et al. | Aug 2004 | A1 |
| 20040158775 | Shibuya et al. | Aug 2004 | A1 |
| 20040167898 | Margolus et al. | Aug 2004 | A1 |
| 20040181734 | Saliba | Sep 2004 | A1 |
| 20040199714 | Estakhri et al. | Oct 2004 | A1 |
| 20040210706 | In et al. | Oct 2004 | A1 |
| 20040237018 | Riley | Nov 2004 | A1 |
| 20050060456 | Shrader et al. | Mar 2005 | A1 |
| 20050060501 | Shrader | Mar 2005 | A1 |
| 20050073884 | Gonzalez et al. | Apr 2005 | A1 |
| 20050108588 | Yuan | May 2005 | A1 |
| 20050114587 | Chou et al. | May 2005 | A1 |
| 20050138442 | Keller, Jr. et al. | Jun 2005 | A1 |
| 20050144358 | Conley et al. | Jun 2005 | A1 |
| 20050144361 | Gonzalez et al. | Jun 2005 | A1 |
| 20050144367 | Sinclair | Jun 2005 | A1 |
| 20050144516 | Gonzalez et al. | Jun 2005 | A1 |
| 20050154825 | Fair | Jul 2005 | A1 |
| 20050172065 | Keays | Aug 2005 | A1 |
| 20050172207 | Radke et al. | Aug 2005 | A1 |
| 20050193161 | Lee et al. | Sep 2005 | A1 |
| 20050201148 | Chen et al. | Sep 2005 | A1 |
| 20050210348 | Totsuka | Sep 2005 | A1 |
| 20050231765 | So et al. | Oct 2005 | A1 |
| 20050249013 | Janzen et al. | Nov 2005 | A1 |
| 20050251617 | Sinclair et al. | Nov 2005 | A1 |
| 20050257120 | Gorobets et al. | Nov 2005 | A1 |
| 20050273560 | Hulbert et al. | Dec 2005 | A1 |
| 20050281088 | Ishidoshiro et al. | Dec 2005 | A1 |
| 20050289314 | Adusumilli et al. | Dec 2005 | A1 |
| 20060010174 | Nguyen et al. | Jan 2006 | A1 |
| 20060039196 | Gorobets et al. | Feb 2006 | A1 |
| 20060039227 | Lai et al. | Feb 2006 | A1 |
| 20060053246 | Lee | Mar 2006 | A1 |
| 20060062054 | Hamilton et al. | Mar 2006 | A1 |
| 20060069932 | Oshikawa et al. | Mar 2006 | A1 |
| 20060085671 | Majni et al. | Apr 2006 | A1 |
| 20060087893 | Nishihara et al. | Apr 2006 | A1 |
| 20060103480 | Moon et al. | May 2006 | A1 |
| 20060107181 | Dave et al. | May 2006 | A1 |
| 20060136570 | Pandya | Jun 2006 | A1 |
| 20060136655 | Gorobets et al. | Jun 2006 | A1 |
| 20060136681 | Jain et al. | Jun 2006 | A1 |
| 20060156177 | Kottapalli et al. | Jul 2006 | A1 |
| 20060184738 | Bridges et al. | Aug 2006 | A1 |
| 20060195650 | Su et al. | Aug 2006 | A1 |
| 20060209592 | Li et al. | Sep 2006 | A1 |
| 20060224841 | Terai et al. | Oct 2006 | A1 |
| 20060244049 | Yaoi et al. | Nov 2006 | A1 |
| 20060259528 | Dussud et al. | Nov 2006 | A1 |
| 20060265568 | Burton | Nov 2006 | A1 |
| 20060291301 | Ziegelmayer | Dec 2006 | A1 |
| 20070011413 | Nonaka et al. | Jan 2007 | A1 |
| 20070033376 | Sinclair et al. | Feb 2007 | A1 |
| 20070058446 | Hwang et al. | Mar 2007 | A1 |
| 20070061597 | Holtzman et al. | Mar 2007 | A1 |
| 20070076479 | Kim et al. | Apr 2007 | A1 |
| 20070081408 | Kwon et al. | Apr 2007 | A1 |
| 20070083697 | Birrell et al. | Apr 2007 | A1 |
| 20070088716 | Brumme et al. | Apr 2007 | A1 |
| 20070091677 | Lasser et al. | Apr 2007 | A1 |
| 20070101096 | Gorobets | May 2007 | A1 |
| 20070106679 | Perrin et al. | May 2007 | A1 |
| 20070113019 | Beukema | May 2007 | A1 |
| 20070133312 | Roohparvar | Jun 2007 | A1 |
| 20070147113 | Mokhlesi et al. | Jun 2007 | A1 |
| 20070150790 | Gross et al. | Jun 2007 | A1 |
| 20070156842 | Vermeulen et al. | Jul 2007 | A1 |
| 20070157064 | Falik et al. | Jul 2007 | A1 |
| 20070174579 | Shin | Jul 2007 | A1 |
| 20070180188 | Fujibayashi et al. | Aug 2007 | A1 |
| 20070180346 | Murin | Aug 2007 | A1 |
| 20070191993 | Wyatt | Aug 2007 | A1 |
| 20070201274 | Yu et al. | Aug 2007 | A1 |
| 20070204128 | Lee et al. | Aug 2007 | A1 |
| 20070208901 | Purcell et al. | Sep 2007 | A1 |
| 20070234143 | Kim | Oct 2007 | A1 |
| 20070245061 | Harriman | Oct 2007 | A1 |
| 20070245099 | Gray et al. | Oct 2007 | A1 |
| 20070263442 | Cornwell et al. | Nov 2007 | A1 |
| 20070268754 | Lee et al. | Nov 2007 | A1 |
| 20070277036 | Chamberlain et al. | Nov 2007 | A1 |
| 20070279988 | Nguyen | Dec 2007 | A1 |
| 20070291556 | Kamei | Dec 2007 | A1 |
| 20070294496 | Goss et al. | Dec 2007 | A1 |
| 20070300130 | Gorobets | Dec 2007 | A1 |
| 20080013390 | Zipprich-Rasch | Jan 2008 | A1 |
| 20080019182 | Yanagidaira et al. | Jan 2008 | A1 |
| 20080022163 | Tanaka et al. | Jan 2008 | A1 |
| 20080028275 | Chen et al. | Jan 2008 | A1 |
| 20080043871 | Latouche et al. | Feb 2008 | A1 |
| 20080052446 | Lasser et al. | Feb 2008 | A1 |
| 20080052451 | Pua et al. | Feb 2008 | A1 |
| 20080056005 | Aritome | Mar 2008 | A1 |
| 20080059602 | Matsuda et al. | Mar 2008 | A1 |
| 20080071971 | Kim et al. | Mar 2008 | A1 |
| 20080077841 | Gonzalez et al. | Mar 2008 | A1 |
| 20080077937 | Shin et al. | Mar 2008 | A1 |
| 20080086677 | Yang et al. | Apr 2008 | A1 |
| 20080112226 | Mokhlesi | May 2008 | A1 |
| 20080141043 | Flynn et al. | Jun 2008 | A1 |
| 20080144371 | Yeh et al. | Jun 2008 | A1 |
| 20080147714 | Breternitz et al. | Jun 2008 | A1 |
| 20080147964 | Chow et al. | Jun 2008 | A1 |
| 20080147998 | Jeong | Jun 2008 | A1 |
| 20080148124 | Zhang et al. | Jun 2008 | A1 |
| 20080163030 | Lee | Jul 2008 | A1 |
| 20080168191 | Biran et al. | Jul 2008 | A1 |
| 20080168319 | Lee et al. | Jul 2008 | A1 |
| 20080170460 | Oh et al. | Jul 2008 | A1 |
| 20080180084 | Dougherty et al. | Jul 2008 | A1 |
| 20080209282 | Lee et al. | Aug 2008 | A1 |
| 20080229000 | Kim | Sep 2008 | A1 |
| 20080229003 | Mizushima et al. | Sep 2008 | A1 |
| 20080229176 | Arnez et al. | Sep 2008 | A1 |
| 20080270680 | Chang | Oct 2008 | A1 |
| 20080282128 | Lee et al. | Nov 2008 | A1 |
| 20080285351 | Shlick et al. | Nov 2008 | A1 |
| 20080313132 | Hao et al. | Dec 2008 | A1 |
| 20080320110 | Pathak | Dec 2008 | A1 |
| 20090003046 | Nirschl et al. | Jan 2009 | A1 |
| 20090003058 | Kang | Jan 2009 | A1 |
| 20090019216 | Yamada et al. | Jan 2009 | A1 |
| 20090031083 | Willis et al. | Jan 2009 | A1 |
| 20090037652 | Yu et al. | Feb 2009 | A1 |
| 20090070608 | Kobayashi | Mar 2009 | A1 |
| 20090116283 | Ha et al. | May 2009 | A1 |
| 20090125671 | Flynn et al. | May 2009 | A1 |
| 20090144598 | Yoon et al. | Jun 2009 | A1 |
| 20090158288 | Fulton et al. | Jun 2009 | A1 |
| 20090168525 | Olbrich et al. | Jul 2009 | A1 |
| 20090172258 | Olbrich et al. | Jul 2009 | A1 |
| 20090172259 | Prins et al. | Jul 2009 | A1 |
| 20090172260 | Olbrich et al. | Jul 2009 | A1 |
| 20090172261 | Prins et al. | Jul 2009 | A1 |
| 20090172262 | Olbrich et al. | Jul 2009 | A1 |
| 20090172308 | Prins et al. | Jul 2009 | A1 |
| 20090172335 | Kulkarni et al. | Jul 2009 | A1 |
| 20090172499 | Olbrich et al. | Jul 2009 | A1 |
| 20090193058 | Reid | Jul 2009 | A1 |
| 20090204823 | Giordano et al. | Aug 2009 | A1 |
| 20090207660 | Hwang et al. | Aug 2009 | A1 |
| 20090213649 | Takahashi et al. | Aug 2009 | A1 |
| 20090222708 | Yamaga | Sep 2009 | A1 |
| 20090228761 | Perlmutter et al. | Sep 2009 | A1 |
| 20090235128 | Eun et al. | Sep 2009 | A1 |
| 20090249160 | Gao et al. | Oct 2009 | A1 |
| 20090251962 | Yun et al. | Oct 2009 | A1 |
| 20090268521 | Ueno et al. | Oct 2009 | A1 |
| 20090292972 | Seol et al. | Nov 2009 | A1 |
| 20090296466 | Kim et al. | Dec 2009 | A1 |
| 20090296486 | Kim et al. | Dec 2009 | A1 |
| 20090310422 | Edahiro et al. | Dec 2009 | A1 |
| 20090319864 | Shrader | Dec 2009 | A1 |
| 20100002506 | Cho et al. | Jan 2010 | A1 |
| 20100008175 | Sweere et al. | Jan 2010 | A1 |
| 20100011261 | Cagno et al. | Jan 2010 | A1 |
| 20100020620 | Kim et al. | Jan 2010 | A1 |
| 20100037012 | Yano et al. | Feb 2010 | A1 |
| 20100054034 | Furuta et al. | Mar 2010 | A1 |
| 20100061151 | Miwa et al. | Mar 2010 | A1 |
| 20100091535 | Sommer et al. | Apr 2010 | A1 |
| 20100103737 | Park | Apr 2010 | A1 |
| 20100110798 | Hoei et al. | May 2010 | A1 |
| 20100115206 | de la Iglesia et al. | May 2010 | A1 |
| 20100118608 | Song et al. | May 2010 | A1 |
| 20100138592 | Cheon | Jun 2010 | A1 |
| 20100153616 | Garratt | Jun 2010 | A1 |
| 20100161936 | Royer et al. | Jun 2010 | A1 |
| 20100174959 | No et al. | Jul 2010 | A1 |
| 20100185807 | Meng et al. | Jul 2010 | A1 |
| 20100199027 | Pucheral et al. | Aug 2010 | A1 |
| 20100199125 | Reche | Aug 2010 | A1 |
| 20100199138 | Rho | Aug 2010 | A1 |
| 20100202196 | Lee et al. | Aug 2010 | A1 |
| 20100202239 | Moshayedi et al. | Aug 2010 | A1 |
| 20100208521 | Kim et al. | Aug 2010 | A1 |
| 20100257379 | Wang et al. | Oct 2010 | A1 |
| 20100262889 | Bains | Oct 2010 | A1 |
| 20100281207 | Miller et al. | Nov 2010 | A1 |
| 20100281342 | Chang et al. | Nov 2010 | A1 |
| 20100306222 | Freedman et al. | Dec 2010 | A1 |
| 20100332858 | Trantham et al. | Dec 2010 | A1 |
| 20100332863 | Johnston | Dec 2010 | A1 |
| 20110010514 | Benhase et al. | Jan 2011 | A1 |
| 20110022779 | Lund et al. | Jan 2011 | A1 |
| 20110022819 | Post et al. | Jan 2011 | A1 |
| 20110051513 | Shen et al. | Mar 2011 | A1 |
| 20110066597 | Mashtizadeh et al. | Mar 2011 | A1 |
| 20110066806 | Chhugani et al. | Mar 2011 | A1 |
| 20110072207 | Jin et al. | Mar 2011 | A1 |
| 20110072302 | Sartore | Mar 2011 | A1 |
| 20110078407 | Lewis | Mar 2011 | A1 |
| 20110078496 | Jeddeloh | Mar 2011 | A1 |
| 20110083060 | Sakurada et al. | Apr 2011 | A1 |
| 20110099460 | Dusija et al. | Apr 2011 | A1 |
| 20110113281 | Zhang et al. | May 2011 | A1 |
| 20110122691 | Sprouse | May 2011 | A1 |
| 20110131444 | Buch et al. | Jun 2011 | A1 |
| 20110138260 | Savin | Jun 2011 | A1 |
| 20110173378 | Filor et al. | Jul 2011 | A1 |
| 20110179249 | Hsiao | Jul 2011 | A1 |
| 20110199825 | Han et al. | Aug 2011 | A1 |
| 20110205823 | Hemink et al. | Aug 2011 | A1 |
| 20110213920 | Frost et al. | Sep 2011 | A1 |
| 20110222342 | Yoon et al. | Sep 2011 | A1 |
| 20110225346 | Goss et al. | Sep 2011 | A1 |
| 20110225347 | Goss et al. | Sep 2011 | A1 |
| 20110228601 | Olbrich et al. | Sep 2011 | A1 |
| 20110231600 | Tanaka et al. | Sep 2011 | A1 |
| 20110239077 | Bai et al. | Sep 2011 | A1 |
| 20110264843 | Haines et al. | Oct 2011 | A1 |
| 20110271040 | Kamizono | Nov 2011 | A1 |
| 20110283119 | Szu et al. | Nov 2011 | A1 |
| 20110289125 | Guthery | Nov 2011 | A1 |
| 20110320733 | Sanford et al. | Dec 2011 | A1 |
| 20120011393 | Roberts et al. | Jan 2012 | A1 |
| 20120017053 | Yang et al. | Jan 2012 | A1 |
| 20120023144 | Rub | Jan 2012 | A1 |
| 20120026799 | Lee | Feb 2012 | A1 |
| 20120054414 | Tsai et al. | Mar 2012 | A1 |
| 20120063234 | Shiga et al. | Mar 2012 | A1 |
| 20120072639 | Goss et al. | Mar 2012 | A1 |
| 20120096217 | Son et al. | Apr 2012 | A1 |
| 20120110250 | Sabbag et al. | May 2012 | A1 |
| 20120117317 | Sheffler | May 2012 | A1 |
| 20120117397 | Kolvick et al. | May 2012 | A1 |
| 20120124273 | Goss et al. | May 2012 | A1 |
| 20120131286 | Faith et al. | May 2012 | A1 |
| 20120151124 | Baek et al. | Jun 2012 | A1 |
| 20120151253 | Horn | Jun 2012 | A1 |
| 20120151294 | Yoo et al. | Jun 2012 | A1 |
| 20120173797 | Shen | Jul 2012 | A1 |
| 20120173826 | Takaku | Jul 2012 | A1 |
| 20120185750 | Hayami | Jul 2012 | A1 |
| 20120195126 | Roohparvar | Aug 2012 | A1 |
| 20120203804 | Burka et al. | Aug 2012 | A1 |
| 20120203951 | Wood et al. | Aug 2012 | A1 |
| 20120210095 | Nellans et al. | Aug 2012 | A1 |
| 20120216079 | Fai et al. | Aug 2012 | A1 |
| 20120233391 | Frost et al. | Sep 2012 | A1 |
| 20120236658 | Byom et al. | Sep 2012 | A1 |
| 20120239858 | Melik-Martirosian | Sep 2012 | A1 |
| 20120239868 | Ryan et al. | Sep 2012 | A1 |
| 20120239976 | Cometti et al. | Sep 2012 | A1 |
| 20120246204 | Nalla et al. | Sep 2012 | A1 |
| 20120259863 | Bodwin et al. | Oct 2012 | A1 |
| 20120275466 | Bhadra et al. | Nov 2012 | A1 |
| 20120278564 | Goss et al. | Nov 2012 | A1 |
| 20120284574 | Avila et al. | Nov 2012 | A1 |
| 20120284587 | Yu et al. | Nov 2012 | A1 |
| 20120297122 | Gorobets | Nov 2012 | A1 |
| 20130007073 | Varma | Jan 2013 | A1 |
| 20130007343 | Rub et al. | Jan 2013 | A1 |
| 20130007381 | Palmer | Jan 2013 | A1 |
| 20130007543 | Goss et al. | Jan 2013 | A1 |
| 20130024735 | Chung et al. | Jan 2013 | A1 |
| 20130031438 | Hu et al. | Jan 2013 | A1 |
| 20130036418 | Yadappanavar et al. | Feb 2013 | A1 |
| 20130038380 | Cordero et al. | Feb 2013 | A1 |
| 20130047045 | Hu et al. | Feb 2013 | A1 |
| 20130058145 | Yu et al. | Mar 2013 | A1 |
| 20130070527 | Sabbag et al. | Mar 2013 | A1 |
| 20130073784 | Ng et al. | Mar 2013 | A1 |
| 20130073798 | Kang et al. | Mar 2013 | A1 |
| 20130073924 | D'Abreu et al. | Mar 2013 | A1 |
| 20130079942 | Smola et al. | Mar 2013 | A1 |
| 20130086131 | Hunt et al. | Apr 2013 | A1 |
| 20130086132 | Hunt et al. | Apr 2013 | A1 |
| 20130094288 | Patapoutian et al. | Apr 2013 | A1 |
| 20130103978 | Akutsu | Apr 2013 | A1 |
| 20130110891 | Ogasawara et al. | May 2013 | A1 |
| 20130111279 | Jeon et al. | May 2013 | A1 |
| 20130111298 | Seroff et al. | May 2013 | A1 |
| 20130117606 | Anholt et al. | May 2013 | A1 |
| 20130121084 | Jeon et al. | May 2013 | A1 |
| 20130124792 | Melik-Martirosian et al. | May 2013 | A1 |
| 20130124888 | Tanaka et al. | May 2013 | A1 |
| 20130128666 | Avila et al. | May 2013 | A1 |
| 20130132647 | Melik-Martirosian | May 2013 | A1 |
| 20130132652 | Wood et al. | May 2013 | A1 |
| 20130159609 | Haas et al. | Jun 2013 | A1 |
| 20130176784 | Cometti et al. | Jul 2013 | A1 |
| 20130179646 | Okubo et al. | Jul 2013 | A1 |
| 20130191601 | Peterson et al. | Jul 2013 | A1 |
| 20130194865 | Bandic et al. | Aug 2013 | A1 |
| 20130194874 | Mu et al. | Aug 2013 | A1 |
| 20130232289 | Zhong et al. | Sep 2013 | A1 |
| 20130238576 | Binkert et al. | Sep 2013 | A1 |
| 20130254498 | Adachi et al. | Sep 2013 | A1 |
| 20130254507 | Islam et al. | Sep 2013 | A1 |
| 20130258738 | Barkon et al. | Oct 2013 | A1 |
| 20130265838 | Li | Oct 2013 | A1 |
| 20130282955 | Parker et al. | Oct 2013 | A1 |
| 20130290611 | Biederman et al. | Oct 2013 | A1 |
| 20130297613 | Yu | Nov 2013 | A1 |
| 20130301373 | Tam | Nov 2013 | A1 |
| 20130304980 | Nachimuthu et al. | Nov 2013 | A1 |
| 20130314988 | Desireddi et al. | Nov 2013 | A1 |
| 20130343131 | Wu et al. | Dec 2013 | A1 |
| 20130346672 | Sengupta et al. | Dec 2013 | A1 |
| 20140013027 | Jannyavula Venkata et al. | Jan 2014 | A1 |
| 20140013188 | Wu et al. | Jan 2014 | A1 |
| 20140025864 | Zhang et al. | Jan 2014 | A1 |
| 20140032890 | Lee et al. | Jan 2014 | A1 |
| 20140063905 | Ahn et al. | Mar 2014 | A1 |
| 20140067761 | Chakrabarti et al. | Mar 2014 | A1 |
| 20140071761 | Sharon et al. | Mar 2014 | A1 |
| 20140075133 | Li et al. | Mar 2014 | A1 |
| 20140082261 | Cohen et al. | Mar 2014 | A1 |
| 20140082310 | Nakajima | Mar 2014 | A1 |
| 20140082456 | Liu et al. | Mar 2014 | A1 |
| 20140082459 | Li et al. | Mar 2014 | A1 |
| 20140095775 | Talagala et al. | Apr 2014 | A1 |
| 20140101389 | Nellans et al. | Apr 2014 | A1 |
| 20140115238 | Xi et al. | Apr 2014 | A1 |
| 20140122818 | Hayasaka et al. | May 2014 | A1 |
| 20140122907 | Johnston | May 2014 | A1 |
| 20140136762 | Li et al. | May 2014 | A1 |
| 20140136883 | Cohen | May 2014 | A1 |
| 20140136927 | Li et al. | May 2014 | A1 |
| 20140143505 | Sim et al. | May 2014 | A1 |
| 20140153333 | Avila et al. | Jun 2014 | A1 |
| 20140157065 | Ong | Jun 2014 | A1 |
| 20140173224 | Fleischer et al. | Jun 2014 | A1 |
| 20140181458 | Loh et al. | Jun 2014 | A1 |
| 20140201596 | Baum et al. | Jul 2014 | A1 |
| 20140223084 | Lee et al. | Aug 2014 | A1 |
| 20140244578 | Winkelstraeter | Aug 2014 | A1 |
| 20140258755 | Stenfort | Sep 2014 | A1 |
| 20140269090 | Flynn et al. | Sep 2014 | A1 |
| 20140310494 | Higgins et al. | Oct 2014 | A1 |
| 20140359044 | Davis et al. | Dec 2014 | A1 |
| 20140359381 | Takeuchi et al. | Dec 2014 | A1 |
| 20150023097 | Khoueir et al. | Jan 2015 | A1 |
| 20150032967 | Udayashankar et al. | Jan 2015 | A1 |
| 20150037624 | Thompson et al. | Feb 2015 | A1 |
| 20150153799 | Lucas et al. | Jun 2015 | A1 |
| 20150153802 | Lucas et al. | Jun 2015 | A1 |
| 20150212943 | Yang et al. | Jul 2015 | A1 |
| 20150268879 | Chu | Sep 2015 | A1 |
| 20150286438 | Simionescu et al. | Oct 2015 | A1 |
| Number | Date | Country |
|---|---|---|
| 1 299 800 | Apr 2003 | EP |
| 1 465 203 | Oct 2004 | EP |
| 1 990 921 | Nov 2008 | EP |
| 2 386 958 | Nov 2011 | EP |
| 2 620 946 | Jul 2013 | EP |
| 2002-532806 | Oct 2002 | JP |
| WO 2007036834 | Apr 2007 | WO |
| WO 2007080586 | Jul 2007 | WO |
| WO 2008075292 | Jun 2008 | WO |
| WO 2008121553 | Oct 2008 | WO |
| WO 2008121577 | Oct 2008 | WO |
| WO 2009028281 | Mar 2009 | WO |
| WO 2009032945 | Mar 2009 | WO |
| WO 2009058140 | May 2009 | WO |
| WO 2009084724 | Jul 2009 | WO |
| WO 2009134576 | Nov 2009 | WO |
| WO 2011024015 | Mar 2011 | WO |
| Entry |
|---|
| International Search Report and Written Opinion dated Jul. 25, 2014, received in International Patent Application No. PCT/US2014/029453, which corresponds to U.S. Appl. No. 13/963,444, 9 pages (Frayer). |
| Barr. “Introduction to Watchdog Timers,” Oct. 2001 3 pgs. |
| Canim, “Buffered Bloom Filters on Solid State Storage,” ADMS*10, Singapore, Sep. 13-17, 2010, 8 pgs. |
| Kang, “A Multi-Channel Architecture for High-Performance NAND Flash-Based Storage System,” J. Syst. Archit., vol. 53, Issue 9, Sep. 2007, 15 pgs. |
| Kim, “A Space-Efficient Flash Translation Layer for CompactFlash Systems,” May 2002, lEEE vol. 48, No. 2, 10 pgs. |
| Lu, “A Forest-structured Bloom Filter with Flash Memory,” MSST 2011, Denver, CO, May 23-27, 2011, article, 6 pgs. |
| Lu, “A Forest-structured Bloom Filter with Flash Memory,” MSST 2011, Denver, CO, May 27, 2011, presentation slides, 25 pgs. |
| McLean, “information Technology-AT Attachment with Packet Interface Extension,” Aug. 19, 1998, 339 pgs. |
| Microchip Technology, “Section 10. Watchdog Timer and Power-Saving Modes,” 2005, 14 pages. |
| Park et al., “A High Performance Controller for NAND Flash-Based Solid State Disk (NSSD),” Proceedings of Non-Volatile Semiconductor Memory Workshop, Feb. 2006. 4 pgs. |
| International Search Report and Written Opinion, dated Mar. 19, 2009 received in International Patent Application No. PCT/US08/88133, which corresponds to U.S. Appl. No. 12/082,202, 7 pgs (Prins). |
| International Search Report and Written Opinion, dated Mar. 19, 2009, received in International Patent Application No. PCT/US08/88136, which corresponds to U.S. Appl. No. 12/082,205, 7 pgs (Olbrich). |
| International Search Report and Written Opinion dated Feb. 26, 2009, received in International Patent Application No. PCT/US08/88146, which corresponds to U.S. Appl. No. 12/082,221, 10 pgs (Prins). |
| Internationai Search Report and Written Opinion dated Feb. 27, 2009, received in International Patent Application No. PCT/US2008/088154, which corresponds to U.S. Appl. No. 12/082,207, 8 pgs (Prins). |
| International Search Report and Written Opinion dated Feb. 13,. 2009, received in International Patent Application No. PCT/US08/88164, which corresponds to U.S. Appl. No. 12/082,220, 6 pgs (Olbrich). |
| International Search Report and Written Opinion dated Feb. 18, 2009, received in International Patent Application No. PCT/US08/88206, which corresponds to U.S. Appl. No. 12/082,206, 8 pgs (Prins). |
| International Search Report and Written Opinion dated Feb. 19, 2009, received in International Patent Application No. PCT/US08/88217, which corresponds to U.S. Appl. No. 12/082,204, 7 pgs (Olbrich). |
| International Search Report and Written Opinion dated Feb. 13, 2009 received in International Patent Application No. PCT/US08/88229, which corresponds to U.S. Appl. No. 12/082,223, 7 pgs (Olbrich). |
| International Search Report and Written Opinion dated Feb. 19, 2009, received in International Patent Application No. PCT/US08/88232, which corresponds to U.S. Appl. No. 12/082,222, 8 pgs (Olbrich). |
| International Search Report and Written Opinion dated Feb. 19, 2009, received in International Patent Application No. PCT/US08/88236, which corresponds to U.S. Appl. No. 12/082,203, 7 pgs (Olbrich). |
| International Search Report and Written Opinion dated Oct. 27, 2011, received in International Patent Application No. PCT/US2011/028637, which corresponds to U.S. Appl. No. 12/728,200, 11 pgs (Olbrich). |
| European Search Report dated Feb. 23, 2012, received in European Patent Application No. 08866997.3, which corresponds to U.S. Appl. No. 12/082,207, 6 pgs (Prins). |
| International Search Report and Written Opinion dated Mar. 7, 2014, received in International Patent Application No. PCT/US2013/074772, which corresponds to U.S. Appl. No. 13/831,218, 10 pages (George). |
| International Search Report and Written Opinion dated Mar. 24, 2014, received in International Patent Application No. PCT/US2013/074777, which corresponds to U.S. Appl. No. 13/831,308, 10 pages. (George). |
| International Search Report and Written Opinion dated Mar. 7, 2014, received in International Patent Application No. PCT/US2013/074779, which corresponds to U.S. Appl. No. 13/831,374, 8 pages (George). |
| International Search Report and Written Opinion dated Aug. 31, 2012, received in International Patent Application PCT/US2012/042784, which corresponds to U.S. Appl. No. 13/285,873,12 pgs (Frayer). |
| International Search Report and Written Opinion dated Mar. 4, 2013, received in PCT/US2012/042771, which corresponds to U.S. Appl. No. 13/286,012, 14 pgs (Stonelake). |
| International Search Report and Written Opinion dated Sep. 26, 2012, received in International Patent Application No. PCT/US2012/042775, which corresponds to U.S. Appl. No. 13/285,892, 8 pgs (Weston-Lewis et al.). |
| International Search Report and Written Opinion dated Jun. 6, 2013, received in International Patent Application No. PCT/US2012/059447, which corresponds to U.S. Appl. No. 13/602,031, 12 pgs (Tai). |
| International Search Report and Written Opinion dated Jun. 6, 2013, received in International Patent Application No. PCT/US2012/059453, which corresponds to U.S. Appl. No. 13/602,039,12 pgs (Frayer). |
| International Search Report and Written Opinion dated Feb. 14, 2013, received in International Patent Application No. PCT/US2012/059459, which corresponds to U.S. Appl. No. 13/602,047, 9 pgs (Tai). |
| International Search Report and Written Opinion dated May 23, 2013, received in International Patent Application No. PCT/US2012/065914, which corresponds to U.S. Appl. No. 13/679,963, 7 pgs (Frayer). |
| International Search Report and Written Opinion dated Apr. 5, 2013 received in International Patent Application No. PCT/US2012/065916, which corresponds to U.S. Appl. No. 13/679,969, 7 pgs (Frayer). |
| International Search Report and Written Opinion dated Jun. 17, 2013, received in International Patent Application No. PCT/US2012/065919, which corresponds to U.S. Appl. No. 13/679,970, 8 pgs (Frayer). |
| SanDisk Enterprise IP LLC, Notification of the Decision to Grant a Patent Right for Patent for Invention, CN 200880127623.8, Jul. 4, 2013, 1 pg. |
| SanDisk Enterprise IP LLC, Office Action, CN 200880127623.8, Apr. 18, 2012, 12 pgs. |
| SanDisk Enterprise IP LLC, Office Action, CN 200880127623.8, Dec. 31, 2012, 9 pgs. |
| SanDisk Enterprise IP LLC, Office Action, JP 2010-540863, Jul, 24, 2012, 3 pgs. |
| Zeidman, 1999 Verilog Designer's Library, 9 pgs. |
| International Search Report and Written Opinion dated Jul. 23, 2015, received in International Patent Application No. PCT/US2015/030850, which corresponds to U.S. Appl. No. 14/298,843, 12 pages (Ellis). |
| Ashkenazi et al., “Platform independent overall security architecture in multi-processor system-on-chip integrated circuits for use in mobile phones and handheld devices,” ScienceDirect, Computers and Electrical Engineering 33 (2007), 18 pages. |
| Bayer, “Prefix B-Trees”, IP.com Journal, IP.com Inc., West Henrietta, NY, Mar. 30, 2007, 29 pages. |
| Bhattacharjee et al., “Efficient Index Compression in DB2 LUW”, IBM Research Report, Jun. 23, 2009, http://domino.research.ibm.com/library/cyberdig.nsf/papers/40B2C45876D0D747852575E100620CE7/$File/rc24815.pdf, 13 pages. |
| Lee et al., “A Semi-Preemptive Garbage Collector for Solid State Drives,” Apr. 2011, IEEE, pp. 12-21. |
| Oracle, “Oracle9i: Database Concepts”, Jul. 2001, http://docs.oracle.com/cd/A91202—01/901—doc/server.901/a88856.pdf, 49 pages. |
| Office Action dated Feb. 17, 2015, received in Chinese Patent Application No. 201210334987.1, which corresponds to U.S. Appl. No. 12/082,207, 9 pages (Prins). |
| International Search Report and Written Opinion dated May 4, 2015, received in International Patent Application No. PCT/US2014/065987, which corresponds to U.S. Appl. No. 14/135,400, 12 pages (George). |
| International Search Report and Written Opinion dated Mar. 17, 2015, received in International Patent Application No. PCT/US2014/067467, which corresponds to U.S. Appl. No. 14/135,420, 13 pages (Lucas). |
| International Search Report and Written Opinion dated Apr. 20, 2015, received in International Patent Application No. PCT/US2014/063949, which corresponds to U.S. Appl. No. 14/135,433, 21 pages (Delpapa). |
| International Search Report and Written Opinion dated Mar. 9, 2015, received in International Patent Application No. PCT/US2014/059747, which corresponds to U.S. Appl. No. 14/137,440, 9 pages (Fitzpatrick). |
| International Search Report and Written Opinion dated Jun. 8, 2015, received in International Patent Application No. PCT/US2015/018252, which corresponds to U.S. Appl. No. 14/339,072, 9 pages (Busch). |
| International Search Report and Written Opinion dated Jun. 2, 2015, received in International Patent Application No. PCT/US2015/018255, which corresponds to U.S. Appl. No. 14/336,967, 14 pages (Chander). |
| International Search Report and Written Opinion dated Jun. 30, 2015, received in International Patent Application No. PCT/US2015/023927, which corresponds to U.S. Appl. No. 14/454,687, 11 pages (Kadayam). |
| Invitation to Pay Additional Fees dated Feb. 13, 2015, received in International Patent Application No. PCT/US2014/063949, which corresponds to U.S. Appl. No. 14/135,433, 6 pages (Delpapa). |
| International Search Report and Written Opinion dated Jan. 21, 2015, received in International Application No. PCT/US2014/059748, which corresponds to U.S. Appl. No. 14/137,511, 13 pages (Dancho). |
| International Search Report and Written Opinion dated Feb. 18, 2015, received in International Application No. PCT/US2014/066921, which corresponds to U.S. Appl. No. 14/135,260, 13 pages (Fitzpatrick). |
| Gasior, “Gigabyte's i-Ram storage device, Ram disk without the fuss,” The Tech Report, p. 1, Jan. 25, 2006, 5 pages. |
| IBM Research-Zurich, “The Fundamental Limit of Flash Random Write Performance: Understanding, Analysis and Performance Modeling,” Mar. 31, 2010, pp. 1-15. |
| Oestreicher et al., “Object Lifetimes in Java Card,” 1999, USENIX, 10 pages. |
| International Preliminary Report on Patentability dated May 24, 2016, received in International Patent Application No. PCT/US2014/065987, which corresponds to U.S. Appl. No. 14/135,400, 9 pages (George). |
| International Search Report and Written Opinion dated Sep. 14, 2015, received in International Patent Application No. PCT/US2015/036807, which corresponds to U.S. Appl. No. 14/311,152, 9 pages (Higgins). |
| Office Action dated Apr. 25, 2016, received in Chinese Patent Application No. 201280066282.4, which corresponds to U.S. Appl. No. 13/602,047, 8 pages (Tai). |
| Office Action dated Dec. 8, 2014, received in Chinese Patent Application No. 201180021660.2, which corresponds to U.S. Appl. No. 12/726,200, 7 pages (Olbrich). |
| Office Action dated Jul. 31, 2015, received in Chinese Patent Application No. 201180021660.2, which corresponds to U.S. Appl. No. 12/726,200, 9 pages (Olbrich). |
| International Preliminary Report on Patentability dated Dec. 6, 2016, received in International Patent Application No. PCT/US2015/030850, which corresponds to U.S. Appl. No. 14/298,843, 8 pages (Ellis). |
| International Preliminary Report on Patentability dated Dec. 20, 2016, received in International Patent Application No. PCT/US2015/036807, which corresponds to U.S. Appl. No. 14/311,152, 6 pages (Higgins). |
| Number | Date | Country | |
|---|---|---|---|
| 20150370701 A1 | Dec 2015 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62014461 | Jun 2014 | US |
