US 9,384,126 B1Grant
Methods and systems to avoid false negative results in bloom filters implemented in non-volatile data storage systems
Issue Date:2016-07-05
•30 Claims
•7 Drawing Sheets
Abstract
The various implementations described herein include systems, methods and/or devices used to avoid false negative results in Bloom filters implemented in non-volatile data storage systems. In one aspect, if an element is added to a Bloom filter using k hash functions, instead of requiring all k bits to be set before returning a positive result (e.g., indicating that the element is most likely present in the Bloom filter), the embodiments described herein return a positive result when at least k minus x (k−x) bit positions are set in the Bloom filter, where x is an integer greater than zero and less than k. In some embodiments, additional measures to avoid false negatives include performing a read check immediately after setting the k bits in the Bloom filter and/or using a conservative reading threshold voltage.
Metadata
Assignee
- SANDISK TECHNOLOGIES INC.
Inventors
- Steven Sprouse
- Yan Li
Application Information
Application Number:US 14/035,883
Filing Date:2013-09-24
Priority Date:2013-07-25
Art Unit:2132
Classifications
IPC:
G06F12/00G06F12/02G06F13/12
Field of Search:
G06F 12/0246G06F 13/12G06F 2212/7202Y10S 707/99933
Patent Drawings (7 sheets)
Description
Related Applications
[0001] This application claims the benefit of U.S. Provisional Patent Application No. 61/858,531, filed on Jul. 25, 2013, which is incorporated by reference herein.
Technical Field
[0002] The disclosed embodiments relate generally to memory systems, and in particular, to using non-volatile data storage systems to implement Bloom filters.
Background
[0003] 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. In an address-targeted write to memory, a host supplies an address and the data to be written. In an address-targeted read from memory, a host supplies an address from which to read. However, when memory is used to implement data structures such as Bloom filters, using address-targeted read and write methods to access memory is not ideal.
Summary
[0004] 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 avoid false negative results in Bloom filters implemented in non-volatile data storage systems (e.g., using one or more flash memory devices). In one aspect, if an element is added to a Bloom filter using k hash functions, instead of requiring all k bits to be set before returning a positive result (e.g., indicating that the element is most likely present in the Bloom filter), the embodiments described herein return a positive result when at least k minus x (k−x) bit positions are set in the Bloom filter, where x is an integer greater than zero and less than k. In some embodiments, additional measures to avoid false negatives include performing a read check immediately after setting the k bits in the Bloom filter and/or using a conservative reading threshold voltage.
Brief Description of the Drawings
[0005] 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.
[0006] FIG. 1 is a block diagram illustrating an implementation of a data storage system, in accordance with some embodiments.
[0007] FIG. 2 is a block diagram illustrating an implementation of a management module, in accordance with some embodiments.
[0008] FIG. 3 is a prophetic diagram of voltage distributions that may be found in a single-level flash memory cell (SLC) over time, in accordance with some embodiments.
[0009] FIGS. 4A-4C illustrate a flowchart representation of a method for data processing, in accordance with some embodiments.
[0010] 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.
Detailed Description
[0011] Many applications use a data structure called a Bloom filter to determine whether an element is a member of a set (e.g., whether an object is already physically present in a storage media). Bloom filter arrays (the storage aspect of a Bloom filter) can be implemented with dynamic random-access memory (DRAM), but this can become prohibitively expensive as the size of the set grows. In embodiments disclosed below, for applications where large Bloom filters are needed, NAND flash storage devices are used.
[0012] The various implementations described herein include systems, methods and/or devices used to avoid false negative results in Bloom filters implemented in non-volatile data storage systems (e.g., using one or more flash memory devices). Some implementations include systems, methods and/or devices to integrate Bloom filter functionality in the non-volatile data storage system, where if an element is added to a Bloom filter using k hash functions, instead of requiring all k bits to be set before returning a positive result (e.g., indicating that the element is most likely present in the Bloom filter), the embodiments described herein return a positive result when at least k minus x (k−x) bit positions are set in the Bloom filter, where x is an integer greater than zero and less than k. In some embodiments, additional measures to avoid false negatives include performing a read check immediately after setting the k bits in the Bloom filter and/or using a conservative reading threshold voltage.
[0013] More specifically, some implementations include a method for data processing. In some implementations, at a non-volatile data storage system, the method includes receiving from a host a first element for testing with respect to a Bloom filter, which is stored in a non-volatile storage medium of the non-volatile data storage system. The method further includes testing whether the first element is present in the Bloom filter, by (1) processing the first element with k distinct hash functions to generate a first set of k bit positions in the Bloom filter, where k is an integer greater than 2, (2) reading the first set of k bit positions from the Bloom filter, (3) returning a first result in accordance with a determination that at least k minus x (k−x) bit positions in the Bloom filter from the first set are set, where x is an integer greater than zero and less than k, and (4) returning a second result in accordance with a determination that y or more of the k bit positions in the Bloom filter from the first set are not set, where y is equal to x plus one (x+1).
[0014] In some embodiments, the method includes processing the first element with k distinct hash functions to generate the first set of k bit positions in the Bloom filter using one or more processors of the non-volatile data storage system.
[0015] In some embodiments, the method includes processing the first element with k distinct hash functions to generate the first set of k bit positions in the Bloom filter using k parallel processors of the non-volatile data storage system.
[0016] In some embodiments, the first element comprises an object.
[0017] In some embodiments, the first element comprises an n-bit fingerprint of an object, where n is at least 64.
[0018] In some embodiments, at the non-volatile data storage system, the method further includes receiving from the host a plurality of requests that specify respective elements. The method further includes, for each respective element specified by the received requests, (1) generating a respective set of k bit positions in the Bloom filter, using the k distinct hash functions, and (2) setting the respective set of k bit positions in the Bloom filter.
[0019] In some embodiments, the method further includes (1) after setting the respective set of k bit positions in the Bloom filter, performing a read check on the respective set of k bit positions in the Bloom filter to produce a read check result, and (2) if the read check result fails to meet predefined success criteria, performing a remedial action for the respective set of k bit positions in the Bloom filter.
[0020] In some embodiments, reading the first set of k bit positions from the Bloom filter includes reading the first set of k bit positions from the Bloom filter using a reading threshold voltage that is less than a default reading threshold voltage for reading data from the non-volatile storage medium of the non-volatile data storage system.
[0021] In some embodiments, the non-volatile storage medium includes one or more flash memory devices.
[0022] In some embodiments, the non-volatile data storage system is distinct from the host.
[0023] In some embodiments, the non-volatile data storage system is embedded in the host.
[0024] In another aspect, any of the methods described above are performed by a non-volatile data storage system comprising (1) a non-volatile storage medium storing a Bloom filter, (2) one or more processors, and (3) memory storing one or more programs, which when executed by the one or more processors cause the non-volatile data storage system to perform any of the methods described above.
[0025] 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 non-volatile data storage system, the one or more programs comprising instructions for causing the non-volatile data storage system to perform any of the methods described above.
[0026] In yet another aspect, a non-volatile data storage system is configured to process data in accordance with any of the methods described above. In some embodiments, the non-volatile data storage system includes means for receiving from a host a first element for testing with respect to a Bloom filter, wherein the Bloom filter is stored in a non-volatile storage medium of the non-volatile data storage system, and means for testing whether the first element is present in the Bloom filter, including (1) means for processing the first element with k distinct hash functions to generate a first set of k bit positions in the Bloom filter, where k is an integer greater than 2, (2) means for reading the first set of k bit positions from the Bloom filter, (3) means for returning a first result in accordance with a determination that at least k minus x (k−x) bit positions in the Bloom filter from the first set are set, where x is an integer greater than zero and less than k, and (4) means for returning a second result in accordance with a determination that y or more of the k bit positions in the Bloom filter from the first set are not set, where y is equal to x plus one (x+1).
[0027] 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.
[0028] FIG. 1 is a diagram of an implementation of a data storage system 100, in accordance with some embodiments. While some example features are illustrated, various other features have not been illustrated for the sake of brevity and so as not to obscure more pertinent aspects of the example implementations disclosed herein. To that end, as a non-limiting example, the data storage system 100 includes a memory controller 120, and a storage medium 130, and is used in conjunction with a computer system 110. In some implementations, storage medium 130 is a single flash memory device while in other implementations storage medium 130 includes a plurality of flash memory devices. In some implementations, storage medium 130 is NAND-type flash memory or NOR-type flash memory. Further, in some implementations memory controller 120 is a solid-state drive (SSD) controller. However, other types of storage media may be included in accordance with aspects of a wide variety of implementations.
[0029] Computer system 110 is coupled to memory controller 120 through data connections 101. However, in some implementations computer system 110 includes memory controller 120 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.
[0030] Storage medium 130 is coupled to memory controller 120 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, memory controller 120 and storage medium 130 are included in the same device as components thereof. Furthermore, in some implementations memory controller 120 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. Furthermore, as discussed in more detail below, flash memory devices can be configured to implement data structures such as Bloom filter array(s) 131.
[0031] A Bloom filter (e.g., Bloom filter array(s) 131) is a probabilistic data structure used to determine if an element “x” is a member of a set “S” with high probability. A Bloom filter is constructed using an N-bit array that is initially cleared, and has hash functions where 0≦Hash (x,k)≦N−1. For each element “x” in set “S,” k hash functions are computed, and the k corresponding bits in the N-bit array are set. In some embodiments, a Bloom filter is initially cleared by resetting the N-bit array to all zeros, and the k corresponding bits in the N-bit array are set to ones. In some embodiments, a Bloom filter is initially cleared by resetting the N-bit array to all ones, and the k corresponding bits in the N-bit array are set to zeros. While the labeling of memory cell states as having specific data values is somewhat arbitrary, with respect to flash memory devices, memory cells that have been reset are typically said to represent ones, and memory cells that have been set are typically said to represent zeros. However, any labeling or mapping of memory cell states to data values can be used, as long as it is used consistently.
[0032] As an example, to test an element “w” for membership in the set “S,” the k hash functions are generated for element “w” and the k bit positions are tested. In some embodiments, if the k bit positions are set, then the element “w” is most likely a member of set “S,” with a possibility of this membership being a “false positive.” A false positive is when the Bloom filter returns a result that an element is a member of the set “S,” when in actuality it is not. Bloom filters return fewer false positives when the number of elements in the set “S” is an order of magnitude smaller than the number of bits in the bit array. The probability of a false positive is given by equation (1):
(1−e−k(n+0.5)/(m−1))k (1)
(1−e−k(n+0.5)/(m−1))k (1)
[0033] In equation (1), k represents the number of hash functions per element, m represents the number of bits in the Bloom filter, and n is the number of elements stored in the Bloom filter.
[0034] In some circumstances, one or more of the k bit positions corresponding to a first element may be inadvertently reset (e.g., if a second element is deleted from the set that has one or more overlapping bit positions with the first element), causing subsequent testing for membership of the first element to return a “false negative.” A false negative is when the Bloom filter returns a result indicating that an element is not a member of the set, when in actuality it is. To avoid false negative results, instead of requiring all k bits to be set before returning a positive result (e.g., indicating that the element is most likely present in the Bloom filter), the embodiments described herein return a positive result when at least k minus x (k−x) bit positions are set in the Bloom filter, where x is an integer greater than zero and less than k. In the example above, if k is equal to 16 and x is equal to 2, to test an element “w” for membership in the set “S,” the 16 bit positions corresponding to element “w” are tested and if at least 14 of the 16 bit positions are set in the Bloom filter, a positive result is returned. In some embodiments, additional measures to avoid false negatives include performing a read check immediately after setting the k bits in the Bloom filter and/or using a conservative reading threshold voltage, as described below. In some embodiments, x is equal to 1.
[0035] Storage medium 130 is divided into a number of addressable and individually selectable blocks. In some implementations, the individually selectable 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.
[0036] For example, one block comprises any number of pages, for example, 64 pages, 128 pages, 256 pages or another suitable number of pages. Blocks are typically grouped into a plurality of zones. Each block zone can be independently managed to some extent, which increases the degree of parallelism for parallel operations and simplifies management of storage medium 130.
[0037] In some implementations, memory controller 120 includes a management module 121, a host interface 129, a storage medium interface (I/O) 128, and additional module(s) 125. Memory controller 120 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).
[0038] 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 memory controller 120. 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.
[0039] 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).
[0040] During an address-targeted 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.
[0041] An address-targeted read operation is initiated when computer system (host) 110 sends one or more host read commands on control line 111 to memory controller 120 requesting data from storage medium 130. Memory controller 120 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, memory controller 120 may resort to a number of remedial actions or provide an indication of an irresolvable error condition.
[0042] Bloom filter implementations using address-targeted write and read operations would require transferring large amounts of data between computer system (host) 110 and data storage system 100. For example, to add an object “X” to Bloom filter array(s) 131, computer system 110 would generate k hashes and then initiate k read-modify-write commands to data storage system 100. In some examples, this would require the sensing, transfer, modification, and write back of k×4 KB pages. As another example, to test an element for presence in Bloom filter array(s) 131, computer system 110 would initiate k read commands. Instead of using address-targeted write and read operations, which require computer system 110 to generate k hashes and/or initiate k commands to data storage system 100, Bloom filter functionality is integrated in data storage system 100, as described below and with reference to FIG. 2 .
[0043] When Bloom filter functionality is integrated in data storage system 100, computer system 110 is not required to generate k hashes and initiate k commands in order to add an object “X” to Bloom filter array(s) 131. Instead, in some implementations, computer system 110 transfers object “X” directly to data storage system 100 as an element to add to Bloom filter array(s) 131. In some implementations, computer system 110 generates a fingerprint of object “X” (e.g., an n-bit fingerprint of object “X,” where n is at least 64) and transfers the fingerprint of object “X” directly to data storage system 100 as an element to add to Bloom filter array(s) 131. For each element received from computer system 110 to add to Bloom filter array(s) 131, data storage system 100 generates k bit positions in Bloom filter array(s) 131, using k distinct hash functions, where k is an integer greater than 2. Further, data storage system 100 sets the k bit positions in Bloom filter array(s) 131 (e.g., using write circuitry in storage medium I/O 128). Thus, only a single host command (e.g., “Add Element”) is needed to add an element to Bloom filter array(s) 131, reducing data transfers between computer system 110 and memory controller 120.
[0044] Further, when Bloom filter functionality is integrated in data storage system 100, computer system 110 is not required to initiate k read commands in order to test whether an element is present in Bloom filter array(s) 131. Instead, similar to the process described above for adding an element to Bloom filter array(s) 131, in some implementations, computer system 110 transfers an element (e.g., object “X” or a fingerprint of object “X”) directly to data storage system 100 in order to test whether the element is present in Bloom filter array(s) 131. For each element received from computer system 110 for testing, data storage system 100 processes the element with k distinct hash functions to generate k bit positions in Bloom filter array(s) 131 and reads the k bit positions from Bloom filter array(s) 131 (e.g., using read circuitry in storage medium I/O 128). In some embodiments, data storage system 100 returns a first result in accordance with a determination that at least k minus x (k−x) bit positions are set, where x is an integer greater than zero and less than k, (e.g., indicating that the element is present in Bloom filter array(s) 131 with high probability) or returns a second result in accordance with a determination that at least a predetermined number (e.g., y or more, where y is equal to x plus one) of the k bit positions in the Bloom filter are not set (e.g., indicating that the element is not present in Bloom filter array(s) 131). Thus, only a single host command (e.g., “Test Element”) is needed to test for an element's presence in Bloom filter array(s) 131, reducing data transfers between computer system 110 and memory controller 120.
[0045] In some implementations, computer system 110 resets Bloom filter array(s) 131 with a single host command (e.g., “Reset Filter”). Data storage system 100 responds to a reset command by resetting Bloom filter array(s) 131 to an empty state. In some embodiments, Bloom filter array(s) 131 is cleared by resetting the array to all zeros. In some embodiments, Bloom filter array(s) 131 is cleared by resetting the array to all ones. As explained above, with respect to flash memory devices, memory cells that have been reset are typically said to represent ones.
[0046] When Bloom filter functionality is integrated in data storage system 100, data transfers between storage medium I/O 128 and storage medium 130 can also be reduced. In some embodiments, storage medium 130 is implemented using NAND flash memory. NAND flash memory devices have on-chip logical function capabilities with the ability to do simple bit-wise operations (e.g., AND, OR, INVERT, and XOR). Bloom filters require the ability to test and set single bits at a time. By using the NAND flash memory device's integrated logical function registers, these calculations are offloaded from the drive's processor(s) (e.g., CPUs 122), allowing for higher performance.
[0047] 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.
[0048] 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 and reading voltages) 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.”
[0049] FIG. 2 is a block diagram illustrating an exemplary management module 121, in accordance with some embodiments. Management module 121 typically includes one or more processing units (CPUs) 122 for executing modules, programs and/or instructions stored in memory 206 and thereby performing processing operations, memory 206, and one or more communication buses 208 for interconnecting these components. Communication buses 208 optionally include circuitry (sometimes called a chipset) that interconnects and controls communications between system components. Management module 121 is coupled to host interface 129, additional module(s) 125, and storage medium I/O 128 by communication buses 208. Memory 206 includes high-speed random access memory, such as DRAM, SRAM, DDR RAM or other random access solid state memory devices, and may include non-volatile memory, such as one or more magnetic disk storage devices, optical disk storage devices, flash memory devices, or other non-volatile solid state storage devices. Memory 206 optionally includes one or more storage devices remotely located from the CPU(s) 122. Memory 206, or alternately the non-volatile memory device(s) within memory 206, comprises a non-transitory computer readable storage medium. In some embodiments, memory 206, or the computer readable storage medium of memory 206 stores the following programs, modules, and data structures, or a subset thereof:
-
- [0050] a hash function generation module 216 that is used for processing an element with k distinct hash functions to generate k bit positions in a Bloom filter (e.g., Bloom filter array(s) 131,
FIG. 1 ); - [0051] an add element module 218 that is used for adding elements to the Bloom filter;
- [0052] a test element module 224 that is used for testing whether an element is present in the Bloom filter;
- [0053] a delete element module 232 that is used for deleting an element from the Bloom filter;
- [0054] a reset module 238 that is used for resetting the Bloom filter to an empty state; and
- [0055] a fingerprint module 240 that is used for generating an n-bit fingerprint of an object to be added to the Bloom filter, where n is at least 64.
- [0050] a hash function generation module 216 that is used for processing an element with k distinct hash functions to generate k bit positions in a Bloom filter (e.g., Bloom filter array(s) 131,
[0056] In some embodiments, the add element module 218 optionally includes the following modules or sub-modules, or a subset thereof:
-
- [0057] an add element processing module 220 that is used for processing the element to be added with k distinct hash functions to generate k bit positions in a Bloom filter and/or communicating with hash function generation module 216 to obtain the k bit positions; and
- [0058] a bit setting module 222 that is used for setting the k bit positions in the Bloom filter.
[0059] In some embodiments, the test element module 224 optionally includes the following modules or sub-modules, or a subset thereof:
-
- [0060] a test element processing module 226 that is used for processing the element to be tested with k distinct hash functions to generate k bit positions in a Bloom filter and/or communicating with hash function generation module 216 to obtain the k bit positions;
- [0061] a bit reading module 228 that is used for reading the k bit positions from the Bloom filter; and
- [0062] a test result module 230 that is used for returning a first result if at least k minus x bit positions in the Bloom filter are set, where x is an integer greater than zero and less than k, and returning a second result if at least a predetermined number (e.g., y or more, where y is equal to x plus one) of the k bit positions in the Bloom filter are not set.
[0063] In some embodiments, the delete element module 232 optionally includes the following modules or sub-modules, or a subset thereof:
-
- [0064] a delete element processing module 234 that is used for processing the element to be deleted with k distinct hash functions to generate k bit positions in a Bloom filter and/or communicating with hash function generation module 216 to obtain the k bit positions; and
- [0065] a bit resetting module 236 that is used for resetting the k bit positions in the Bloom filter.
[0066] 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 FIGS. 4A-4C .
[0067] Although FIG. 2 shows a management module 121, FIG. 2 is intended more as functional description of the various features which may be present in a management module than as a structural schematic of the embodiments described herein. In practice, and as recognized by those of ordinary skill in the art, items shown separately could be combined and some items could be separated.
[0068] As discussed below with reference to FIG. 3 , a single-level flash memory cell (SLC) stores one bit (“0” or “1”). Thus, the storage density of a SLC memory device is one bit of information per memory cell. A multi-level flash memory cell (MLC), however, can store two or more bits of information per cell by using different ranges within the total voltage range of the memory cell to represent a multi-bit bit-tuple. In turn, the storage density of a MLC memory device is multiple-bits per cell (e.g., two bits per memory cell).
[0069] FIG. 3 is a simplified, prophetic diagram of voltage distributions 300 found in a single-level flash memory cell (SLC) over time, in accordance with some embodiments. The voltage distributions 300 shown in FIG. 3 have been simplified for illustrative purposes. In this example, the SLC's voltage range extends approximately from a voltage, VSS, at a source terminal of an NMOS transistor to a voltage, VDD, at a drain terminal of the NMOS transistor. As such, voltage distributions 300 extend between VSS and VDD.
[0070] Sequential voltage ranges 301 and 302 between source voltage VSS and drain voltage VDD are used to represent corresponding bit values “1” and “0,” respectively. Each voltage range 301, 302 has a respective center voltage V1 301b, V0 302b. As described below, in many circumstances the memory cell current sensed in response to an applied reading threshold voltages is indicative of a memory cell voltage different from the respective center voltage V1 301b or V0 302b corresponding to the respective bit value written into the memory cell. Errors in cell voltage, and/or the cell voltage sensed when reading the memory cell, can occur during write operations, read operations, or due to “drift” of the cell voltage between the time data is written to the memory cell and the time a read operation is performed to read the data stored in the memory cell. For ease of discussion, these effects are collectively described as “cell voltage drift.” Each voltage range 301, 302 also has a respective voltage distribution 301a, 302a that may occur as a result of any number of a combination of error-inducing factors, examples of which are identified above.
[0071] In some implementations, a reading threshold voltage VR is applied between adjacent center voltages (e.g., applied proximate to the halfway region between adjacent center voltages V1 301b and V0 302b). Optionally, in some implementations, the reading threshold voltage is located between voltage ranges 301 and 302. In some implementations, reading threshold voltage VR is applied in the region proximate to where the voltage distributions 301a and 302a overlap, which is not necessarily proximate to the halfway region between adjacent center voltages V1 301b and V0 302b.
[0072] In some embodiments, rather than using reading threshold voltage VR, a conservative reading threshold voltage VC is used to avoid false negatives. By using a conservative reading threshold voltage VC, the read operation errs on the side of producing a data value that indicates the bit is set, thus reducing the likelihood of producing a data value that indicates the bit is not set when the bit should be set. In some embodiments, a conservative reading threshold voltage VC, which is less than the default reading threshold voltage VR, is used for reading data. Using conservative reading threshold voltage VC results in an increase in the voltage range that corresponds to the bit being set and a decrease in the voltage range that corresponds to the bit being not set (e.g., voltage range 302 increases to voltage range 304 and voltage range 301 decreases to voltage range 303). Since false negatives occur when one or more bits that should be set inadvertently become reset, using a conservative reading threshold voltage VC to err on the side of reading bits as set reduces the likelihood of false negatives. While using a conservative reading threshold voltage VC to err on the side of reading bits as set reduces the likelihood of false negatives, it also increases the likelihood of false positives. However, in Bloom filter usage, false positives are more acceptable than false negatives.
[0073] As explained above, a SLC memory device stores one bit of information (“0” or “1”) per memory cell. In some embodiments, a Bloom filter is implemented in a SLC memory device, and uses a single-level flash memory cell for each bit of the N-bit array of the Bloom filter. In some embodiments (e.g., using some types of flash memory), the Bloom filter is initially cleared by resetting each bit of the N-bit array to “1” and elements are added to the Bloom filter by setting the corresponding k bits generated from the k hash functions to “0.” In some embodiments, the Bloom filter is initially cleared by resetting each bit of the N-bit array to “0” and elements are added to the Bloom filter by setting the corresponding k bits generated from the k hash functions to “1.”
[0074] In order to increase storage density in flash memory, flash memory has developed from single-level (SLC) cell flash memory to multi-level cell (MLC) flash memory so that two or more bits can be stored by each memory cell. A MLC flash memory device is used to store multiple bits by using voltage ranges within the total voltage range of the memory cell to represent different bit-tuples. A MLC flash memory device is typically more error-prone than a SLC flash memory device created using the same manufacturing process because the effective voltage difference between the voltages used to store different data values is smaller for a MLC flash memory device. Moreover, due to any number of a combination of factors, such as electrical fluctuations, defects in the storage medium, operating conditions, device history, and/or write-read circuitry, a typical error includes a stored voltage level in a particular MLC being in a voltage range that is adjacent to the voltage range that would otherwise be representative of the correct storage of a particular bit-tuple. The impact of such errors can be reduced by gray-coding the data, such that adjacent voltage ranges represent single-bit changes between bit-tuples.
[0075] As explained above, a storage medium (e.g., storage medium 130, FIG. 1 ) 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, programming is performed on an entire page. In some embodiments, partial-page programming is used for writing smaller amounts of data. Using address-targeted partial-page programming, the number of operations (NOPs) is the maximum number of operations (e.g., the maximum number of times a partial page can be programmed) before an erase is required (e.g., erasure of the block containing the page). For the current technology, the maximum number of operations for SLC NAND memory devices is four and the maximum number of operations for MLC NAND memory devices is one. However, using the embodiments described here, a partial page may be written at least 1000 times before an erase is required. In some embodiments, for example, a word line may be written at least 1000 times before an erase is required, where the “writes” involve setting single bits (e.g., setting a bit from “1” to “0”), rather than writing both ones and zeros to the entire word line.
[0076] FIGS. 4A-4C illustrate a flowchart representation of a method 400 for data processing, in accordance with some embodiments. As noted above with respect to FIG. 1 , when a host (e.g., computer system 110, FIG. 1 , sometimes called a host) adds an element to a Bloom filter (e.g., Bloom filter array(s) 131), only a single host command is needed for each element. To add a plurality of elements to the Bloom filter, the host sends a plurality of requests with respective elements to be added. To test whether an element is present in the Bloom filter, the host sends a single host command, which initiates performance of method 400.
[0077] At least in some implementations, method 400 is performed by a non-volatile data storage system (e.g., data storage system 100, FIG. 1 ) or one or more components of the non-volatile data storage system (e.g., memory controller 120 and/or storage medium 130, FIG. 1 ). In some embodiments, method 400 is governed by instructions that are stored in a non-transitory computer readable storage medium and that are executed by one or more processors of a device, such as the one or more processing units (CPUs) 122 of management module 121, shown in FIGS. 1 and 2 .
[0078] A non-volatile data storage system (e.g., data storage system 100, FIG. 1 ) receives (402) from a host (e.g., computer system 110, FIG. 1 , sometimes called a host) a first element for testing with respect to a Bloom filter (e.g., Bloom filter array(s) 131, FIG. 1 ), wherein the Bloom filter is stored in a non-volatile storage medium (e.g., storage medium 130, FIG. 1 ) of the non-volatile data storage system. As noted above, in some implementations, only a single host command (e.g., “Test Element”) is needed to test whether the element is present in the Bloom filter.
[0079] In some embodiments, the non-volatile data storage system is (404) distinct from the host. For example, in some implementations, one or more components of the non-volatile data storage system (e.g., memory controller 120 and storage medium 130 of data storage system 100, FIG. 1 ) are distinct from and coupled to a host (e.g., computer system 110, FIG. 1 ) by one or more connections (e.g., connections 101 and control line 111, FIG. 1 ).
[0080] In some embodiments, the non-volatile data storage system is (406) embedded in the host. In some implementations, one or more components of the non-volatile data storage system (e.g., memory controller 120 and storage medium 130 of data storage system 100, FIG. 1 ) are included in a device as components thereof. Furthermore, in some implementations, one or more components of the non-volatile data storage system (e.g., memory controller 120 and storage medium 130 of data storage system 100, FIG. 1 ) 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 data storage system.
[0081] In some embodiments, the first element comprises (408) an object. In some implementations, for example, an object is a file (e.g., a 1 MB file). In some implementations, for example in data deduplication applications, an object is an email attachment in a forwarded email message. In some implementations, an object is mapped into an n-bit fingerprint by the non-volatile data storage system (e.g., data storage system 100, FIG. 1 ) before being processed for insertion in the Bloom filter. In some implementations, a fingerprint module (e.g., fingerprint module 240, FIG. 2 ) is used to generate an n-bit fingerprint of an object to be added to the Bloom filter or tested with respect to the Bloom filter, where n is at least 64, as described above with respect to FIG. 2 .
[0082] In some embodiments, the first element comprises (410) an n-bit fingerprint of an object, where n is at least 64. In some implementations, an object is mapped into an n-bit number by a host (e.g., computer system 110, FIG. 1 , sometimes called a host). In some implementations, for example, a 64-bit hash function is used to map data sets of variable length (e.g., a file or an email attachment) to data sets of a fixed length (e.g., 64 bits).
[0083] In some embodiments, the non-volatile storage medium comprises (412) one or more flash memory devices. In some implementations, the non-volatile storage medium (e.g., storage medium 130, FIG. 1 ) is a single flash memory device, while in other implementations, the non-volatile storage medium includes a plurality of flash memory devices. In some implementations, the non-volatile storage medium (e.g., storage medium 130, FIG. 1 ) is NAND-type flash memory or NOR-type flash memory.
[0084] Next, the non-volatile data storage system tests (414) whether the first element is present in the Bloom filter by processing (416) the first element with k distinct hash functions to generate a first set of k bit positions (sometimes called a first group of k bit positions) in the Bloom filter, where k is an integer greater than 2. As an example, if k is equal to 16, the non-volatile data storage system (e.g., data storage system 100, FIG. 1 ) processes the first element with 16 distinct hash functions to generate a first set of 16 bit positions in the Bloom filter (e.g., Bloom filter array(s) 131, FIG. 1 ). In some implementations, the first set of k bit positions in the Bloom filter is generated in firmware (e.g., in management module 121, FIGS. 1 and 2 ). In some implementations, the first set of k bit positions in the Bloom filter is generated in hardware (e.g., a hardware hash engine). In some implementations, the first set of k bit positions in the Bloom filter is generated by a hash function generation module (e.g., hash function generation module 216, FIG. 2 ) and/or a test element processing module (e.g., test element processing module 226, FIG. 2 ), as described above with respect to FIG. 2 .
[0085] In some embodiments, the non-volatile data storage system processes (418) the first element with k distinct hash functions to generate the first set of k bit positions in the Bloom filter using one or more processors of the non-volatile data storage system (e.g., CPUs 122, FIG. 1 ).
[0086] In some embodiments, the non-volatile data storage system processes (420) the first element with k distinct hash functions to generate the first set of k bit positions in the Bloom filter using k parallel processors of the non-volatile data storage system. In some other embodiments, the non-volatile data storage system processes the first element with k distinct hash functions to generate the first set of k bit positions in the Bloom filter using at least k/2 parallel processors of the non-volatile data storage system, while in yet other embodiments, the non-volatile data storage system processes the first element with k distinct hash functions to generate the first set of k bit positions in the Bloom filter using at least k/4 parallel processors of the non-volatile data storage system. In some implementations, the aforementioned one or more processors of the non-volatile data storage system (e.g., CPUs 122, FIG. 1 ) comprise parallel processors, and the first set of k bit positions in the Bloom filter is generated using the parallel processors.
[0087] The non-volatile data storage system further tests (414) whether the first element is present in the Bloom filter by reading (422) the first set of k bit positions from the Bloom filter. Using the example above where k is equal to 16, the non-volatile data storage system reads the set of 16 bit positions from the Bloom filter (e.g., Bloom filter array(s) 131, FIG. 1 ). In some implementations, the k bit positions are read from the Bloom filter using a bit reading module (e.g., bit reading module 228, FIG. 2 ), as described above with respect to FIG. 2 .
[0088] In some embodiments, the non-volatile data storage system reads (424) the first set of k bit positions from the Bloom filter using a reading threshold voltage that is less than a default reading threshold voltage (e.g., default reading threshold voltage VR, FIG. 3 ) for reading data from the non-volatile storage medium of the non-volatile data storage system. As explained above with reference to FIG. 3 , rather than using a default reading threshold voltage, a reading threshold voltage that is less than the default is used, resulting in the read operation erring on the side of producing a data value that indicates the bit is set, thus reducing the likelihood of producing a data value that indicates the bit is not set when the bit should be set.
[0089] Testing (414) whether the first element is present in the Bloom filter further includes returning (426) a first result in accordance with a determination that at least k minus x (k−x) bit positions in the Bloom filter from the first set are set, where x is an integer greater than zero and less than k. As an example, if k is equal to 16 and x is equal to 2, the non-volatile data storage system (e.g., data storage system 100, FIG. 1 ) returns a first result in accordance with a determination that at least 14 of the 16 bit positions in the Bloom filter (e.g., Bloom filter array(s) 131, FIG. 1 ) from the first set are set, indicating that the first element is present in the Bloom filter with high probability. In some implementations, the first result is returned (e.g., in accordance with a determination that at least k minus x (k−x) bit positions in the Bloom filter from the first set are set) using a test result module (e.g., test result module 230, FIG. 2 ), as described above with respect to FIG. 2 . In some embodiments, x is equal to 1.
[0090] Further, testing (414) whether the first element is present in the Bloom filter includes returning (428) a second result in accordance with a determination that y or more of the k bit positions in the Bloom filter from the first set are not set, where y is equal to x plus one (x+1). In some implementations, the non-volatile data storage system (e.g., data storage system 100, FIG. 1 ) returns a second result in accordance with a determination that y or more of the k bit positions in the Bloom filter (e.g., Bloom filter array(s) 131, FIG. 1 ) from the first set are not set, indicating that the first element is not present in the Bloom filter. Using the example above where k is equal to 16 and x is equal to 2, y is equal to x plus one (e.g., y=x+1), so y is equal to 3 and the non-volatile data storage system (e.g., data storage system 100, FIG. 1 ) returns a second result in accordance with a determination that 3 or more of the 16 bit positions in the Bloom filter (e.g., Bloom filter array(s) 131, FIG. 1 ) from the first set are not set, indicating that the first element is not present in the Bloom filter. In some implementations, the second result is returned (e.g., in accordance with a determination that y or more of the k bit positions in the Bloom filter from the first set are not set) using a test result module (e.g., test result module 230, FIG. 2 ), as described above with respect to FIG. 2 .
[0091] Optionally, the non-volatile data storage system (e.g., data storage system 100, FIG. 1 ) receives (430) from the host (e.g., computer system 110, FIG. 1 ) a plurality of requests that specify respective elements. In some implementations, the plurality of requests are requests to add respective elements to a Bloom filter (e.g., Bloom filter array(s) 131, FIG. 1 ). As noted above, in some implementations, only a single host command (e.g., “Add Element”) is needed to add a respective element to the Bloom filter. As an example, if three elements are to be added to the Bloom filter, the host would send three requests, the first request specifying the first element to be added to the Bloom filter, the second request specifying the second element to be added to the Bloom filter, and the third request specifying the third element to be added to the Bloom filter.
[0092] Next, for each respective element specified (432) by the received requests, the non-volatile data storage system generates (434) a respective set of k bit positions (sometimes called a respective group of k bit positions) in the Bloom filter, using the k distinct hash functions. As an example, if k is equal to 16, for a respective element specified in the received request, the non-volatile data storage system uses 16 distinct hash functions to generate a respective set of 16 bit positions in the Bloom filter. In some implementations, the respective set of k bit positions in the Bloom filter is generated in firmware (e.g., in management module 121, FIGS. 1 and 2 ). In some implementations, the respective set of k bit positions in the Bloom filter is generated in hardware (e.g., a hardware hash engine). In some implementations, the respective set of k bit positions in the Bloom filter is generated by a hash function generation module (e.g., hash function generation module 216, FIG. 2 ) and/or an add element processing module (e.g., add element processing module 220, FIG. 2 ), as described above with respect to FIG. 2 .
[0093] In some embodiments, the non-volatile data storage system generates the respective set of k bit positions in the Bloom filter using one or more processors of the non-volatile data storage system (e.g., CPUs 122, FIG. 1 ).
[0094] In some embodiments, the non-volatile data storage system generates the respective set of k bit positions in the Bloom filter using k parallel processors (or, alternatively, at least k/2 parallel processors, or at least k/4 parallel processors, as discussed above) of the non-volatile data storage system. In some implementations, the aforementioned one or more processors of the non-volatile data storage system (e.g., CPUs 122, FIG. 1 ) comprise parallel processors, and the respective set of k bit positions in the Bloom filter is generated using the parallel processors.
[0095] Furthermore, for each respective element specified (432) by the received requests, the non-volatile data storage system sets (436) the respective set of k bit positions in the Bloom filter (e.g., Bloom filter array(s) 131, FIG. 1 ).
[0096] Optionally, after setting the respective set of k bit positions in the Bloom filter, the non-volatile data storage system performs (438) a read check on the respective set of k bit positions in the Bloom filter to produce a read check result. In some implementations, a read check includes reading the respective set of k bit positions in the Bloom filter immediately after setting the respective set of k bit positions to determine whether there are any bit errors.
[0097] Next, in accordance with a determination that the read check result fails to meet predefined success criteria, the non-volatile data storage system performs (440) a remedial action for the respective set of k bit positions in the Bloom filter. In some embodiments, if the read check result indicates that there are no bit errors, the read check result meets the predefined success criteria, and if the read check result indicates that there are one or more bit errors, the read check result fails to meet the predefined success criteria. In some embodiments, the remedial action is repeating the operation of setting the respective set of k bit positions in the Bloom filter. In some other embodiments, the remedial action is repeating the operation of setting the one or more bit positions (of the k bit positions) in the Bloom filter for which the read check result failed to meet the predefined success criteria. Alternatively, in some embodiments, the remedial action includes copying the memory portion containing the respective set of k bit positions in the Bloom filter to an available portion of memory in the non-volatile storage medium (e.g., storage medium 130, FIG. 1 ).
[0098] In some implementations, with respect to any of the methods described above, the storage medium (e.g., storage medium 130, FIG. 1 ) is a single flash memory device, while in other implementations, the storage medium (e.g., storage medium 130, FIG. 1 ) includes a plurality of flash memory devices.
[0099] In some implementations, with respect to any of the methods described above, a data storage system includes a non-volatile storage medium (e.g., storage medium 130, FIG. 1 ), one or more processors (e.g., CPUs 122, FIGS. 1 and 2 ) and memory (e.g., memory 206, FIG. 2 ) storing one or more programs configured for execution by the one or more processors and configured to perform or control performance of any of the methods described above.
[0100] 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.
[0101] 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.
[0102] 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.
[0103] 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.
Claims
What is claimed is:
1. A data processing method, comprising:
at a non-volatile data storage system:
receiving from a host a first element for testing with respect to a Bloom filter, wherein the Bloom filter is stored in a non-volatile storage medium of the non-volatile data storage system;
testing whether the first element is present in the Bloom filter, by:
processing the first element with k distinct hash functions to generate a first set of k bit positions in the Bloom filter, where k is an integer greater than 2;
reading the first set of k bit positions from the Bloom filter;
returning a first result in accordance with a determination that at least k minus x (k−x) bit positions in the Bloom filter from the first set are set, where x is an integer greater than zero and less than k; and
returning a second result in accordance with a determination that y or more of the k bit positions in the Bloom filter from the first set are not set, where y is equal to x plus one (x+1).
2. The method of claim 1, including processing the first element with k distinct hash functions to generate the first set of k bit positions in the Bloom filter using one or more processors of the non-volatile data storage system.
3. The method of claim 1, including processing the first element with k distinct hash functions to generate the first set of k bit positions in the Bloom filter using k parallel processors of the non-volatile data storage system.
4. The method of claim 1, wherein the first element comprises an object.
5. The method of claim 1, wherein the first element comprises an n-bit fingerprint of an object, where n is at least 64.
6. The method of claim 1, further comprising:
at the non-volatile data storage system:
receiving from the host a plurality of requests that specify respective elements; and
for each respective element specified by the received requests:
generating a respective set of k bit positions in the Bloom filter, using the k distinct hash functions; and
setting the respective set of k bit positions in the Bloom filter.
7. The method of claim 6, further comprising:
after setting the respective set of k bit positions in the Bloom filter, performing a read check on the respective set of k bit positions in the Bloom filter to produce a read check result; and
in accordance with a determination that the read check result fails to meet predefined success criteria, performing a remedial action for the respective set of k bit positions in the Bloom filter.
8. The method of claim 1, wherein reading the first set of k bit positions from the Bloom filter comprises reading the first set of k bit positions from the Bloom filter using a reading threshold voltage that is less than a default reading threshold voltage for reading data from the non-volatile storage medium of the non-volatile data storage system.
9. The method of claim 1, wherein the non-volatile storage medium comprises one or more flash memory devices.
10. The method of claim 1, wherein the non-volatile data storage system is distinct from the host.
11. The method of claim 1, wherein the non-volatile data storage system is embedded in the host.
12. A non-volatile data storage system, comprising:
a non-volatile storage medium storing a Bloom filter;
one or more processors; and
memory storing one or more programs, which when executed by the one or more processors cause the non-volatile data storage system to:
receive from a host a first element for testing with respect to a Bloom filter, wherein the Bloom filter is stored in a non-volatile storage medium of the non-volatile data storage system;
test whether the first element is present in the Bloom filter, by:
processing the first element with k distinct hash functions to generate a first set of k bit positions in the Bloom filter, where k is an integer greater than 2;
reading the first set of k bit positions from the Bloom filter;
returning a first result in accordance with a determination that at least k minus x (k−x) bit positions in the Bloom filter from the first set are set, where x is an integer greater than zero and less than k; and
returning a second result in accordance with a determination that y or more of the k bit positions in the Bloom filter from the first set are not set, where y is equal to x plus one (x+1).
13. The system of claim 12, wherein the first set of k bit positions in the Bloom filter is generated using the one or more processors of the non-volatile data storage system.
14. The system of claim 12, wherein the one or more processors of the non-volatile data storage system comprise k parallel processors, and the first set of k bit positions in the Bloom filter is generated using the k parallel processors.
15. The system of claim 12, wherein the first element comprises an object.
16. The system of claim 12, wherein the first element comprises an n-bit fingerprint of an object, where n is at least 64.
17. The system of claim 12, wherein the one or more programs further include instructions that, when executed by the one or more processors, cause the non-volatile data storage system to:
receive from the host a plurality of requests that specify respective elements; and
for each respective element specified by the received requests:
generate a respective set of k bit positions in the Bloom filter, using the k distinct hash functions; and
set the respective set of k bit positions in the Bloom filter.
18. The system of claim 17, wherein the one or more programs further include instructions that, when executed by the one or more processors, cause the non-volatile data storage system to:
perform, after setting the respective set of k bit positions in the Bloom filter, a read check on the respective set of k bit positions in the Bloom filter to produce a read check result; and
perform, in accordance with a determination that the read check result fails to meet predefined success criteria, a remedial action for the respective set of k bit positions in the Bloom filter.
19. The system of claim 12, wherein reading the first set of k bit positions from the Bloom filter comprises reading the first set of k bit positions from the Bloom filter using a reading threshold voltage that is less than a default reading threshold voltage for reading data from the non-volatile storage medium of the non-volatile data storage system.
20. The system of claim 12, wherein the non-volatile storage medium comprises one or more flash memory devices.
21. The system of claim 12, wherein the non-volatile data storage system is distinct from the host.
22. The system of claim 12, wherein the non-volatile data storage system is embedded in the host.
23. A non-transitory computer readable storage medium storing one or more programs configured for execution by one or more processors of a non-volatile data storage system, the one or more programs comprising instructions for causing the non-volatile data storage system to:
receive from a host a first element for testing with respect to a Bloom filter, wherein the Bloom filter is stored in a non-volatile storage medium of the non-volatile data storage system;
test whether the first element is present in the Bloom filter, by:
processing the first element with k distinct hash functions to generate a first set of k bit positions in the Bloom filter, where k is an integer greater than 2;
reading the first set of k bit positions from the Bloom filter;
returning a first result in accordance with a determination that at least k minus x (k−x) bit positions in the Bloom filter from the first set are set, where x is an integer greater than zero and less than k; and
returning a second result in accordance with a determination that y or more of the k bit positions in the Bloom filter from the first set are not set, where y is equal to x plus one (x+1).
24. The non-transitory computer readable storage medium of claim 23, wherein the first set of k bit positions in the Bloom filter is generated using the one or more processors of the non-volatile data storage system.
25. The non-transitory computer readable storage medium of claim 23, wherein the first element comprises an object.
26. The non-transitory computer readable storage medium of claim 23, wherein the first element comprises an n-bit fingerprint of an object, where n is at least 64.
27. The non-transitory computer readable storage medium of claim 23, wherein the one or more programs further include instructions that, when executed by the one or more processors, cause the non-volatile data storage system to:
receive from the host a plurality of requests that specify respective elements; and
for each respective element specified by the received requests:
generate a respective set of k bit positions in the Bloom filter, using the k distinct hash functions; and
set the respective set of k bit positions in the Bloom filter.
28. The non-transitory computer readable storage medium of claim 27, wherein the one or more programs further include instructions that, when executed by the one or more processors, cause the non-volatile data storage system to:
perform, after setting the respective set of k bit positions in the Bloom filter, a read check on the respective set of k bit positions in the Bloom filter to produce a read check result; and
perform, in accordance with a determination that the read check result fails to meet predefined success criteria, a remedial action for the respective set of k bit positions in the Bloom filter.
29. The non-transitory computer readable storage medium of claim 23, wherein reading the first set of k bit positions from the Bloom filter comprises reading the first set of k bit positions from the Bloom filter using a reading threshold voltage that is less than a default reading threshold voltage for reading data from the non-volatile storage medium of the non-volatile data storage system.
30. The non-transitory computer readable storage medium of claim 23, wherein the non-volatile storage medium comprises one or more flash memory devices.
Patent Citations (422)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4173737(A) | 1979-11-01 | Skerlos et al. | Applicant |
| US4888750(A) | 1989-12-01 | Kryder et al. | Applicant |
| US4916652(A) | 1990-04-01 | Schwarz et al. | Applicant |
| US5129089(A) | 1992-07-01 | Nielsen | Applicant |
| US5270979(A) | 1993-12-01 | Harari et al. | Applicant |
| US5329491(A) | 1994-07-01 | Brown et al. | Applicant |
| US5381528(A) | 1995-01-01 | Brunelle | Applicant |
| US5519847(A) | 1996-05-01 | Fandrich et al. | Applicant |
| US5530705(A) | 1996-06-01 | Malone, Sr. | Applicant |
| US5537555(A) | 1996-07-01 | Landry et al. | Applicant |
| US5551003(A) | 1996-08-01 | Mattson et al. | Applicant |
| US5636342(A) | 1997-06-01 | Jeffries | Applicant |
| US5657332(A) | 1997-08-01 | Auclair et al. | Applicant |
| US5666114(A) | 1997-09-01 | Brodie et al. | Applicant |
| US5708849(A) | 1998-01-01 | Coke et al. | Applicant |
| US5765185(A) | 1998-06-01 | Lambrache et al. | Applicant |
| US5890193(A) | 1999-03-01 | Chevallier | Applicant |
| US5936884(A) | 1999-08-01 | Hasbun et al. | Applicant |
| US5943692(A) | 1999-08-01 | Marberg et al. | Applicant |
| US5982664(A) | 1999-11-01 | Watanabe | Applicant |
| US6000006(A) | 1999-12-01 | Bruce et al. | Applicant |
| US6006345(A) | 1999-12-01 | Berry, Jr. | Applicant |
| US6016560(A) | 2000-01-01 | Wada et al. | Applicant |
| US6018304(A) | 2000-01-01 | Bessios | Applicant |
| US6044472(A) | 2000-03-01 | Crohas | Applicant |
| US6070074(A) | 2000-05-01 | Perahia et al. | Applicant |
| US6119250(A) | 2000-09-01 | Nishimura et al. | Applicant |
| US6138261(A) | 2000-10-01 | Wilcoxson et al. | Applicant |
| US6182264(B1) | 2001-01-01 | Ott | Applicant |
| US6192092(B1) | 2001-02-01 | Dizon et al. | Applicant |
| US6295592(B1) | 2001-09-01 | Jeddeloh | Applicant |
| US6311263(B1) | 2001-10-01 | Barlow et al. | Applicant |
| US6408394(B1) | 2002-06-01 | Vander Kamp et al. | Applicant |
| US6412042(B1) | 2002-06-01 | Paterson et al. | Applicant |
| US6442076(B1) | 2002-08-01 | Roohparvar | Applicant |
| US6449625(B1) | 2002-09-01 | Wang | Applicant |
| US6484224(B1) | 2002-11-01 | Robins et al. | Applicant |
| US6516437(B1) | 2003-02-01 | Van Stralen et al. | Applicant |
| US6564285(B1) | 2003-05-01 | Mills et al. | Applicant |
| US6678788(B1) | 2004-01-01 | O'Connell | Applicant |
| US6757768(B1) | 2004-06-01 | Potter et al. | Applicant |
| US6775792(B2) | 2004-08-01 | Ulrich et al. | Applicant |
| US6810440(B2) | 2004-10-01 | Micalizzi, Jr. et al. | Applicant |
| US6836808(B2) | 2004-12-01 | Bunce et al. | Applicant |
| US6836815(B1) | 2004-12-01 | Purcell et al. | Applicant |
| US6842436(B2) | 2005-01-01 | Moeller | Applicant |
| US6865650(B1) | 2005-03-01 | Morley et al. | Applicant |
| US6871257(B2) | 2005-03-01 | Conley et al. | Applicant |
| US6895464(B2) | 2005-05-01 | Chow et al. | Applicant |
| US6966006(B2) | 2005-11-01 | Pacheco et al. | Applicant |
| US6978343(B1) | 2005-12-01 | Ichiriu | Applicant |
| US6980985(B1) | 2005-12-01 | Amer-Yahia et al. | Applicant |
| US6981205(B2) | 2005-12-01 | Fukushima et al. | Applicant |
| US6988171(B2) | 2006-01-01 | Beardsley et al. | Applicant |
| US7020017(B2) | 2006-03-01 | Chen et al. | Applicant |
| US7028165(B2) | 2006-04-01 | Roth et al. | Applicant |
| US7032123(B2) | 2006-04-01 | Kane et al. | Applicant |
| US7043505(B1) | 2006-05-01 | Teague et al. | Applicant |
| US7076598(B2) | 2006-07-01 | Wang | Applicant |
| US7100002(B2) | 2006-08-01 | Shrader | Applicant |
| US7102860(B2) | 2006-09-01 | Wenzel | Applicant |
| US7111293(B1) | 2006-09-01 | Hersh et al. | Applicant |
| US7126873(B2) | 2006-10-01 | See et al. | Applicant |
| US7133282(B2) | 2006-11-01 | Sone | Applicant |
| US7162678(B2) | 2007-01-01 | Saliba | Applicant |
| US7173852(B2) | 2007-02-01 | Gorobets et al. | Applicant |
| US7184446(B2) | 2007-02-01 | Rashid et al. | Applicant |
| US7275170(B2) | 2007-09-01 | Suzuki | Applicant |
| US7328377(B1) | 2008-02-01 | Lewis et al. | Applicant |
| US7516292(B2) | 2009-04-01 | Kimura et al. | Applicant |
| US7523157(B2) | 2009-04-01 | Aguilar, Jr. et al. | Applicant |
| US7527466(B2) | 2009-05-01 | Simmons | Applicant |
| US7529466(B2) | 2009-05-01 | Takahashi | Applicant |
| US7533214(B2) | 2009-05-01 | Aasheim et al. | Applicant |
| US7546478(B2) | 2009-06-01 | Kubo et al. | Applicant |
| US7566987(B2) | 2009-07-01 | Black et al. | Applicant |
| US7571277(B2) | 2009-08-01 | Mizushima | Applicant |
| US7574554(B2) | 2009-08-01 | Tanaka et al. | Applicant |
| US7596643(B2) | 2009-09-01 | Merry, Jr. et al. | Applicant |
| US7681106(B2) | 2010-03-01 | Jarrar et al. | Applicant |
| US7685494(B1) | 2010-03-01 | Varnica et al. | Applicant |
| US7707481(B2) | 2010-04-01 | Kirschner et al. | Applicant |
| US7761655(B2) | 2010-07-01 | Mizushima et al. | Applicant |
| US7765454(B2) | 2010-07-01 | Passint | Applicant |
| US7774390(B2) | 2010-08-01 | Shin | Applicant |
| US7840762(B2) | 2010-11-01 | Oh et al. | Applicant |
| US7870326(B2) | 2011-01-01 | Shin et al. | Applicant |
| US7890818(B2) | 2011-02-01 | Kong et al. | Applicant |
| US7913022(B1) | 2011-03-01 | Baxter | Applicant |
| US7925960(B2) | 2011-04-01 | Ho et al. | Applicant |
| US7934052(B2) | 2011-04-01 | Prins et al. | Applicant |
| US7945825(B2) | 2011-05-01 | Cohen et al. | Applicant |
| US7954041(B2) | 2011-05-01 | Hong et al. | Applicant |
| US7971112(B2) | 2011-06-01 | Murata | Applicant |
| US7974368(B2) | 2011-07-01 | Shieh et al. | Applicant |
| US7978516(B2) | 2011-07-01 | Olbrich et al. | Applicant |
| US7996642(B1) | 2011-08-01 | Smith | Applicant |
| US8006161(B2) | 2011-08-01 | Lestable et al. | Applicant |
| US8032724(B1) | 2011-10-01 | Smith | Applicant |
| US8041884(B2) | 2011-10-01 | Chang | Applicant |
| US8042011(B2) | 2011-10-01 | Nicolaidis et al. | Applicant |
| US8069390(B2) | 2011-11-01 | Lin | Applicant |
| US8190967(B2) | 2012-05-01 | Hong et al. | Applicant |
| US8250380(B2) | 2012-08-01 | Guyot | Applicant |
| US8254181(B2) | 2012-08-01 | Hwang et al. | Applicant |
| US8259506(B1) | 2012-09-01 | Sommer et al. | Applicant |
| US8312349(B2) | 2012-11-01 | Reche et al. | Applicant |
| US8412985(B1) | 2013-04-01 | Bowers et al. | Applicant |
| US8429436(B2) | 2013-04-01 | Fillingim et al. | Applicant |
| US8438459(B2) | 2013-05-01 | Cho et al. | Applicant |
| US8453022(B2) | 2013-05-01 | Katz | Applicant |
| US8627117(B2) | 2014-01-01 | Johnston | Applicant |
| US8634248(B1) | 2014-01-01 | Sprouse et al. | Applicant |
| US8694854(B1) | 2014-04-01 | Dar et al. | Applicant |
| US8724789(B2) | 2014-05-01 | Altberg et al. | Applicant |
| US8885434(B2) | 2014-11-01 | Kumar | Applicant |
| US8898373(B1) | 2014-11-01 | Kang et al. | Applicant |
| US8910030(B2) | 2014-12-01 | Goel | Applicant |
| US8923066(B1) | 2014-12-01 | Subramanian et al. | Applicant |
| US9043517(B1) | 2015-05-01 | Sprouse | Examiner |
| US9128690(B2) | 2015-09-01 | Lotzenburger et al. | Applicant |
| US2001/0050824(A1) | 2001-12-01 | Buch | Applicant |
| US2002/0024846(A1) | 2002-02-01 | Kawahara et al. | Applicant |
| US2002/0036515(A1) | 2002-03-01 | Eldridge et al. | Applicant |
| US2002/0083299(A1) | 2002-06-01 | Van Huben et al. | Applicant |
| US2002/0122334(A1) | 2002-09-01 | Lee et al. | Applicant |
| US2002/0152305(A1) | 2002-10-01 | Jackson et al. | Applicant |
| US2002/0162075(A1) | 2002-10-01 | Talagala et al. | Applicant |
| US2002/0165896(A1) | 2002-11-01 | Kim | Applicant |
| US2003/0041299(A1) | 2003-02-01 | Kanazawa et al. | Applicant |
| US2003/0043829(A1) | 2003-03-01 | Rashid et al. | Applicant |
| US2003/0079172(A1) | 2003-04-01 | Yamagishi et al. | Applicant |
| US2003/0088805(A1) | 2003-05-01 | Majni et al. | Applicant |
| US2003/0093628(A1) | 2003-05-01 | Matter et al. | Applicant |
| US2003/0163594(A1) | 2003-08-01 | Aasheim et al. | Applicant |
| US2003/0163629(A1) | 2003-08-01 | Conley et al. | Applicant |
| US2003/0188045(A1) | 2003-10-01 | Jacobson | Applicant |
| US2003/0189856(A1) | 2003-10-01 | Cho et al. | Applicant |
| US2003/0198100(A1) | 2003-10-01 | Matsushita et al. | Applicant |
| US2003/0204341(A1) | 2003-10-01 | Guliani et al. | Applicant |
| US2003/0212719(A1) | 2003-11-01 | Yasuda et al. | Applicant |
| US2004/0024957(A1) | 2004-02-01 | Lin et al. | Applicant |
| US2004/0024963(A1) | 2004-02-01 | Talagala et al. | Applicant |
| US2004/0057575(A1) | 2004-03-01 | Zhang et al. | Applicant |
| US2004/0062157(A1) | 2004-04-01 | Kawabe | Applicant |
| US2004/0073829(A1) | 2004-04-01 | Olarig | Applicant |
| US2004/0114265(A1) | 2004-06-01 | Talbert | Applicant |
| US2004/0143710(A1) | 2004-07-01 | Walmsley | Applicant |
| US2004/0148561(A1) | 2004-07-01 | Shen et al. | Applicant |
| US2004/0153902(A1) | 2004-08-01 | Machado et al. | Applicant |
| US2004/0167898(A1) | 2004-08-01 | Margolus et al. | Applicant |
| US2004/0181734(A1) | 2004-09-01 | Saliba | Applicant |
| US2004/0199714(A1) | 2004-10-01 | Estakhri et al. | Applicant |
| US2004/0237018(A1) | 2004-11-01 | Riley | Applicant |
| US2005/0060456(A1) | 2005-03-01 | Shrader et al. | Applicant |
| US2005/0060501(A1) | 2005-03-01 | Shrader | Applicant |
| US2005/0073884(A1) | 2005-04-01 | Gonzalez et al. | Applicant |
| US2005/0108588(A1) | 2005-05-01 | Yuan | Applicant |
| US2005/0114587(A1) | 2005-05-01 | Chou et al. | Applicant |
| US2005/0172065(A1) | 2005-08-01 | Keays | Applicant |
| US2005/0172207(A1) | 2005-08-01 | Radke et al. | Applicant |
| US2005/0193161(A1) | 2005-09-01 | Lee et al. | Applicant |
| US2005/0201148(A1) | 2005-09-01 | Chen et al. | Applicant |
| US2005/0231765(A1) | 2005-10-01 | So et al. | Applicant |
| US2005/0249013(A1) | 2005-11-01 | Janzen et al. | Applicant |
| US2005/0251617(A1) | 2005-11-01 | Sinclair et al. | Applicant |
| US2005/0257120(A1) | 2005-11-01 | Gorobets et al. | Applicant |
| US2005/0273560(A1) | 2005-12-01 | Hulbert et al. | Applicant |
| US2005/0289314(A1) | 2005-12-01 | Adusumilli et al. | Applicant |
| US2006/0010174(A1) | 2006-01-01 | Nguyen et al. | Applicant |
| US2006/0039196(A1) | 2006-02-01 | Gorobets et al. | Applicant |
| US2006/0039227(A1) | 2006-02-01 | Lai et al. | Applicant |
| US2006/0053246(A1) | 2006-03-01 | Lee | Applicant |
| US2006/0069932(A1) | 2006-03-01 | Oshikawa et al. | Applicant |
| US2006/0085671(A1) | 2006-04-01 | Majni et al. | Applicant |
| US2006/0087893(A1) | 2006-04-01 | Nishihara et al. | Applicant |
| US2006/0107181(A1) | 2006-05-01 | Dave et al. | Applicant |
| US2006/0136570(A1) | 2006-06-01 | Pandya | Applicant |
| US2006/0136681(A1) | 2006-06-01 | Jain et al. | Applicant |
| US2006/0156177(A1) | 2006-07-01 | Kottapalli et al. | Applicant |
| US2006/0195650(A1) | 2006-08-01 | Su et al. | Applicant |
| US2006/0244049(A1) | 2006-11-01 | Yaoi et al. | Applicant |
| US2006/0259528(A1) | 2006-11-01 | Dussud et al. | Applicant |
| US2006/0291301(A1) | 2006-12-01 | Ziegelmayer | Applicant |
| US2007/0011413(A1) | 2007-01-01 | Nonaka et al. | Applicant |
| US2007/0058446(A1) | 2007-03-01 | Hwang et al. | Applicant |
| US2007/0061597(A1) | 2007-03-01 | Holtzman et al. | Applicant |
| US2007/0076479(A1) | 2007-04-01 | Kim et al. | Applicant |
| US2007/0081408(A1) | 2007-04-01 | Kwon et al. | Applicant |
| US2007/0083697(A1) | 2007-04-01 | Birrell et al. | Applicant |
| US2007/0088716(A1) | 2007-04-01 | Brumme et al. | Applicant |
| US2007/0091677(A1) | 2007-04-01 | Lasser et al. | Applicant |
| US2007/0113019(A1) | 2007-05-01 | Beukema et al. | Applicant |
| US2007/0133312(A1) | 2007-06-01 | Roohparvar | Applicant |
| US2007/0147113(A1) | 2007-06-01 | Mokhlesi et al. | Applicant |
| US2007/0150790(A1) | 2007-06-01 | Gross et al. | Applicant |
| US2007/0156842(A1) | 2007-07-01 | Vermeulen et al. | Applicant |
| US2007/0157064(A1) | 2007-07-01 | Falik et al. | Applicant |
| US2007/0174579(A1) | 2007-07-01 | Shin | Applicant |
| US2007/0180188(A1) | 2007-08-01 | Fujibayashi et al. | Applicant |
| US2007/0180346(A1) | 2007-08-01 | Murin | Applicant |
| US2007/0201274(A1) | 2007-08-01 | Yu et al. | Applicant |
| US2007/0208901(A1) | 2007-09-01 | Purcell et al. | Applicant |
| US2007/0234143(A1) | 2007-10-01 | Kim | Applicant |
| US2007/0245061(A1) | 2007-10-01 | Harriman | Applicant |
| US2007/0245099(A1) | 2007-10-01 | Gray et al. | Applicant |
| US2007/0263442(A1) | 2007-11-01 | Cornwell et al. | Applicant |
| US2007/0277036(A1) | 2007-11-01 | Chamberlain et al. | Applicant |
| US2007/0279988(A1) | 2007-12-01 | Nguyen | Applicant |
| US2007/0291556(A1) | 2007-12-01 | Kamei | Applicant |
| US2007/0294496(A1) | 2007-12-01 | Goss et al. | Applicant |
| US2007/0300130(A1) | 2007-12-01 | Gorobets | Applicant |
| US2008/0013390(A1) | 2008-01-01 | Zipprich-Rasch | Applicant |
| US2008/0019182(A1) | 2008-01-01 | Yanagidaira et al. | Applicant |
| US2008/0022163(A1) | 2008-01-01 | Tanaka et al. | Applicant |
| US2008/0028275(A1) | 2008-01-01 | Chen et al. | Applicant |
| US2008/0043871(A1) | 2008-02-01 | Latouche et al. | Applicant |
| US2008/0052446(A1) | 2008-02-01 | Lasser et al. | Applicant |
| US2008/0056005(A1) | 2008-03-01 | Aritome | Applicant |
| US2008/0071971(A1) | 2008-03-01 | Kim et al. | Applicant |
| US2008/0077841(A1) | 2008-03-01 | Gonzalez et al. | Applicant |
| US2008/0077937(A1) | 2008-03-01 | Shin et al. | Applicant |
| US2008/0086677(A1) | 2008-04-01 | Yang et al. | Applicant |
| US2008/0112226(A1) | 2008-05-01 | Mokhlesi | Applicant |
| US2008/0141043(A1) | 2008-06-01 | Flynn et al. | Applicant |
| US2008/0144371(A1) | 2008-06-01 | Yeh et al. | Applicant |
| US2008/0147714(A1) | 2008-06-01 | Breternitz et al. | Applicant |
| US2008/0147964(A1) | 2008-06-01 | Chow et al. | Applicant |
| US2008/0147998(A1) | 2008-06-01 | Jeong | Applicant |
| US2008/0148124(A1) | 2008-06-01 | Zhang et al. | Applicant |
| US2008/0163030(A1) | 2008-07-01 | Lee | Applicant |
| US2008/0168191(A1) | 2008-07-01 | Biran et al. | Applicant |
| US2008/0168319(A1) | 2008-07-01 | Lee et al. | Applicant |
| US2008/0170460(A1) | 2008-07-01 | Oh et al. | Applicant |
| US2008/0229000(A1) | 2008-09-01 | Kim | Applicant |
| US2008/0229003(A1) | 2008-09-01 | Mizushima et al. | Applicant |
| US2008/0229176(A1) | 2008-09-01 | Arnez et al. | Applicant |
| US2008/0270680(A1) | 2008-10-01 | Chang | Applicant |
| US2008/0282128(A1) | 2008-11-01 | Lee et al. | Applicant |
| US2008/0285351(A1) | 2008-11-01 | Shlick et al. | Applicant |
| US2008/0313132(A1) | 2008-12-01 | Hao et al. | Applicant |
| US2009/0003058(A1) | 2009-01-01 | Kang | Applicant |
| US2009/0019216(A1) | 2009-01-01 | Yamada et al. | Applicant |
| US2009/0031083(A1) | 2009-01-01 | Willis et al. | Applicant |
| US2009/0037652(A1) | 2009-02-01 | Yu et al. | Applicant |
| US2009/0070608(A1) | 2009-03-01 | Kobayashi | Applicant |
| US2009/0116283(A1) | 2009-05-01 | Ha et al. | Applicant |
| US2009/0125671(A1) | 2009-05-01 | Flynn et al. | Applicant |
| US2009/0144598(A1) | 2009-06-01 | Yoon et al. | Applicant |
| US2009/0168525(A1) | 2009-07-01 | Olbrich et al. | Applicant |
| US2009/0172258(A1) | 2009-07-01 | Olbrich et al. | Applicant |
| US2009/0172259(A1) | 2009-07-01 | Prins et al. | Applicant |
| US2009/0172260(A1) | 2009-07-01 | Olbrich et al. | Applicant |
| US2009/0172261(A1) | 2009-07-01 | Prins et al. | Applicant |
| US2009/0172262(A1) | 2009-07-01 | Olbrich et al. | Applicant |
| US2009/0172308(A1) | 2009-07-01 | Prins et al. | Applicant |
| US2009/0172335(A1) | 2009-07-01 | Kulkarni et al. | Applicant |
| US2009/0172499(A1) | 2009-07-01 | Olbrich et al. | Applicant |
| US2009/0193058(A1) | 2009-07-01 | Reid | Applicant |
| US2009/0204823(A1) | 2009-08-01 | Giordano et al. | Applicant |
| US2009/0207660(A1) | 2009-08-01 | Hwang et al. | Applicant |
| US2009/0213649(A1) | 2009-08-01 | Takahashi et al. | Applicant |
| US2009/0222708(A1) | 2009-09-01 | Yamaga | Applicant |
| US2009/0228761(A1) | 2009-09-01 | Perlmutter et al. | Applicant |
| US2009/0249160(A1) | 2009-10-01 | Gao et al. | Applicant |
| US2009/0266521(A1) | 2009-10-01 | Ueno et al. | Applicant |
| US2009/0292972(A1) | 2009-11-01 | Seol et al. | Applicant |
| US2009/0296466(A1) | 2009-12-01 | Kim et al. | Applicant |
| US2009/0296486(A1) | 2009-12-01 | Kim et al. | Applicant |
| US2009/0310422(A1) | 2009-12-01 | Edahiro et al. | Applicant |
| US2009/0319864(A1) | 2009-12-01 | Shrader | Applicant |
| US2010/0002506(A1) | 2010-01-01 | Cho et al. | Applicant |
| US2010/0008175(A1) | 2010-01-01 | Sweere et al. | Applicant |
| US2010/0011261(A1) | 2010-01-01 | Cagno et al. | Applicant |
| US2010/0020620(A1) | 2010-01-01 | Kim et al. | Applicant |
| US2010/0037012(A1) | 2010-02-01 | Yano et al. | Applicant |
| US2010/0061151(A1) | 2010-03-01 | Miwa et al. | Applicant |
| US2010/0091535(A1) | 2010-04-01 | Sommer et al. | Applicant |
| US2010/0103737(A1) | 2010-04-01 | Park | Applicant |
| US2010/0110798(A1) | 2010-05-01 | Hoei et al. | Applicant |
| US2010/0118608(A1) | 2010-05-01 | Song et al. | Applicant |
| US2010/0138592(A1) | 2010-06-01 | Cheon | Applicant |
| US2010/0153616(A1) | 2010-06-01 | Garratt | Applicant |
| US2010/0161936(A1) | 2010-06-01 | Royer et al. | Applicant |
| US2010/0174959(A1) | 2010-07-01 | No et al. | Applicant |
| US2010/0199125(A1) | 2010-08-01 | Reche | Applicant |
| US2010/0199138(A1) | 2010-08-01 | Rho | Applicant |
| US2010/0202196(A1) | 2010-08-01 | Lee et al. | Applicant |
| US2010/0202239(A1) | 2010-08-01 | Moshayedi et al. | Applicant |
| US2010/0208521(A1) | 2010-08-01 | Kim et al. | Applicant |
| US2010/0262889(A1) | 2010-10-01 | Bains | Applicant |
| US2010/0281207(A1) | 2010-11-01 | Miller et al. | Applicant |
| US2010/0281342(A1) | 2010-11-01 | Chang et al. | Applicant |
| US2010/0332858(A1) | 2010-12-01 | Trantham et al. | Applicant |
| US2011/0010514(A1) | 2011-01-01 | Benhase et al. | Applicant |
| US2011/0051513(A1) | 2011-03-01 | Shen et al. | Applicant |
| US2011/0066597(A1) | 2011-03-01 | Mashtizadeh et al. | Applicant |
| US2011/0072302(A1) | 2011-03-01 | Sartore | Applicant |
| US2011/0078407(A1) | 2011-03-01 | Lewis | Applicant |
| US2011/0083060(A1) | 2011-04-01 | Sakurada et al. | Applicant |
| US2011/0099460(A1) | 2011-04-01 | Dusija et al. | Applicant |
| US2011/0113281(A1) | 2011-05-01 | Zhang et al. | Applicant |
| US2011/0122691(A1) | 2011-05-01 | Sprouse | Applicant |
| US2011/0131444(A1) | 2011-06-01 | Buch et al. | Applicant |
| US2011/0138260(A1) | 2011-06-01 | Savin | Applicant |
| US2011/0173378(A1) | 2011-07-01 | Filor et al. | Applicant |
| US2011/0179249(A1) | 2011-07-01 | Hsiao | Applicant |
| US2011/0199825(A1) | 2011-08-01 | Han et al. | Applicant |
| US2011/0205823(A1) | 2011-08-01 | Hemink et al. | Applicant |
| US2011/0213920(A1) | 2011-09-01 | Frost et al. | Applicant |
| US2011/0222342(A1) | 2011-09-01 | Yoon et al. | Applicant |
| US2011/0225346(A1) | 2011-09-01 | Goss et al. | Applicant |
| US2011/0228601(A1) | 2011-09-01 | Olbrich et al. | Applicant |
| US2011/0231600(A1) | 2011-09-01 | Tanaka et al. | Applicant |
| US2011/0239077(A1) | 2011-09-01 | Bai et al. | Applicant |
| US2011/0264843(A1) | 2011-10-01 | Haines et al. | Applicant |
| US2011/0271040(A1) | 2011-11-01 | Kamizono | Applicant |
| US2011/0283119(A1) | 2011-11-01 | Szu et al. | Applicant |
| US2011/0289125(A1) | 2011-11-01 | Guthery | Applicant |
| US2011/0320733(A1) | 2011-12-01 | Sanford et al. | Applicant |
| US2012/0011393(A1) | 2012-01-01 | Roberts et al. | Applicant |
| US2012/0017053(A1) | 2012-01-01 | Yang et al. | Applicant |
| US2012/0023144(A1) | 2012-01-01 | Rub | Applicant |
| US2012/0054414(A1) | 2012-03-01 | Tsai et al. | Applicant |
| US2012/0063234(A1) | 2012-03-01 | Shiga et al. | Applicant |
| US2012/0072639(A1) | 2012-03-01 | Goss et al. | Applicant |
| US2012/0096217(A1) | 2012-04-01 | Son et al. | Applicant |
| US2012/0110250(A1) | 2012-05-01 | Sabbag et al. | Applicant |
| US2012/0117317(A1) | 2012-05-01 | Sheffler et al. | Applicant |
| US2012/0151124(A1) | 2012-06-01 | Baek et al. | Applicant |
| US2012/0151253(A1) | 2012-06-01 | Horn | Applicant |
| US2012/0151294(A1) | 2012-06-01 | Yoo et al. | Applicant |
| US2012/0173797(A1) | 2012-07-01 | Shen | Applicant |
| US2012/0173826(A1) | 2012-07-01 | Takaku | Applicant |
| US2012/0185750(A1) | 2012-07-01 | Hayami | Applicant |
| US2012/0195126(A1) | 2012-08-01 | Roohparvar | Applicant |
| US2012/0203951(A1) | 2012-08-01 | Wood et al. | Applicant |
| US2012/0210095(A1) | 2012-08-01 | Nellans et al. | Applicant |
| US2012/0216079(A1) | 2012-08-01 | Fai et al. | Applicant |
| US2012/0233391(A1) | 2012-09-01 | Frost et al. | Applicant |
| US2012/0236658(A1) | 2012-09-01 | Byom et al. | Applicant |
| US2012/0239858(A1) | 2012-09-01 | Melik-Martirosian | Applicant |
| US2012/0239868(A1) | 2012-09-01 | Ryan et al. | Applicant |
| US2012/0239976(A1) | 2012-09-01 | Cometti et al. | Applicant |
| US2012/0259863(A1) | 2012-10-01 | Bodwin et al. | Applicant |
| US2012/0275466(A1) | 2012-11-01 | Bhadra et al. | Applicant |
| US2012/0278564(A1) | 2012-11-01 | Goss et al. | Applicant |
| US2012/0284574(A1) | 2012-11-01 | Avila et al. | Applicant |
| US2012/0284587(A1) | 2012-11-01 | Yu et al. | Applicant |
| US2013/0007073(A1) | 2013-01-01 | Varma | Applicant |
| US2013/0007343(A1) | 2013-01-01 | Rub et al. | Applicant |
| US2013/0007543(A1) | 2013-01-01 | Goss et al. | Applicant |
| US2013/0024735(A1) | 2013-01-01 | Chung et al. | Applicant |
| US2013/0031438(A1) | 2013-01-01 | Hu et al. | Applicant |
| US2013/0036418(A1) | 2013-02-01 | Yadappanavar et al. | Applicant |
| US2013/0038380(A1) | 2013-02-01 | Cordero et al. | Applicant |
| US2013/0047045(A1) | 2013-02-01 | Hu et al. | Applicant |
| US2013/0073924(A1) | 2013-03-01 | D'Abreu et al. | Applicant |
| US2013/0079942(A1) | 2013-03-01 | Smola et al. | Applicant |
| US2013/0086131(A1) | 2013-04-01 | Hunt et al. | Applicant |
| US2013/0086132(A1) | 2013-04-01 | Hunt et al. | Applicant |
| US2013/0094288(A1) | 2013-04-01 | Patapoutian et al. | Applicant |
| US2013/0111279(A1) | 2013-05-01 | Jeon et al. | Applicant |
| US2013/0111298(A1) | 2013-05-01 | Seroff et al. | Applicant |
| US2013/0117606(A1) | 2013-05-01 | Anholt et al. | Applicant |
| US2013/0121084(A1) | 2013-05-01 | Jeon et al. | Applicant |
| US2013/0124888(A1) | 2013-05-01 | Tanaka et al. | Applicant |
| US2013/0128666(A1) | 2013-05-01 | Avila et al. | Applicant |
| US2013/0132652(A1) | 2013-05-01 | Wood et al. | Applicant |
| US2013/0176784(A1) | 2013-07-01 | Cometti et al. | Applicant |
| US2013/0179646(A1) | 2013-07-01 | Okubo et al. | Applicant |
| US2013/0191601(A1) | 2013-07-01 | Peterson et al. | Applicant |
| US2013/0194865(A1) | 2013-08-01 | Bandic et al. | Applicant |
| US2013/0194874(A1) | 2013-08-01 | Mu et al. | Applicant |
| US2013/0232289(A1) | 2013-09-01 | Zhong et al. | Applicant |
| US2013/0254507(A1) | 2013-09-01 | Islam et al. | Applicant |
| US2013/0258738(A1) | 2013-10-01 | Barkon et al. | Applicant |
| US2013/0265838(A1) | 2013-10-01 | Li | Applicant |
| US2013/0282955(A1) | 2013-10-01 | Parker et al. | Applicant |
| US2013/0290611(A1) | 2013-10-01 | Biederman et al. | Applicant |
| US2013/0301373(A1) | 2013-11-01 | Tam | Applicant |
| US2013/0304980(A1) | 2013-11-01 | Nachimuthu et al. | Applicant |
| US2013/0343131(A1) | 2013-12-01 | Wu et al. | Applicant |
| US2013/0346672(A1) | 2013-12-01 | Sengupta et al. | Applicant |
| US2014/0013188(A1) | 2014-01-01 | Wu et al. | Applicant |
| US2014/0063905(A1) | 2014-03-01 | Ahn et al. | Applicant |
| US2014/0075133(A1) | 2014-03-01 | Li et al. | Applicant |
| US2014/0082261(A1) | 2014-03-01 | Cohen et al. | Applicant |
| US2014/0082456(A1) | 2014-03-01 | Liu | Applicant |
| US2014/0095775(A1) | 2014-04-01 | Talagala et al. | Applicant |
| US2014/0122818(A1) | 2014-05-01 | Hayasaka et al. | Applicant |
| US2014/0122907(A1) | 2014-05-01 | Johnston | Applicant |
| US2014/0136762(A1) | 2014-05-01 | Li | Examiner |
| US2014/0136883(A1) | 2014-05-01 | Cohen | Applicant |
| US2014/0136927(A1) | 2014-05-01 | Li et al. | Applicant |
| US2014/0143505(A1) | 2014-05-01 | Sim et al. | Applicant |
| US2014/0201596(A1) | 2014-07-01 | Baum et al. | Applicant |
| US2014/0223084(A1) | 2014-08-01 | Lee et al. | Applicant |
| US2014/0258755(A1) | 2014-09-01 | Stenfort | Applicant |
| US2014/0269090(A1) | 2014-09-01 | Flynn et al. | Applicant |
| US2014/0310494(A1) | 2014-10-01 | Higgins et al. | Applicant |
| US2014/0359381(A1) | 2014-12-01 | Takeuchi et al. | Applicant |
| US2015/0023097(A1) | 2015-01-01 | Khoueir et al. | Applicant |
| US2015/0153799(A1) | 2015-06-01 | Lucas et al. | Applicant |
| US2015/0153802(A1) | 2015-06-01 | Lucas et al. | Applicant |
| EP1299800 | 2003-04-01 | Applicant | |
| EP1465203(A1) | 2004-10-01 | Applicant | |
| EP1990921(A2) | 2008-11-01 | Applicant | |
| EP2386958(A1) | 2011-11-01 | Applicant | |
| EP2620946(A2) | 2013-07-01 | Applicant | |
| JP2002-532806(S) | 2002-10-01 | Applicant | |
| WO2007/036834(A2) | 2007-04-01 | Applicant | |
| WO2007/080586(A2) | 2007-07-01 | Applicant | |
| WO2008/075292 | 2008-06-01 | Applicant | |
| WO2008/121553(A1) | 2008-10-01 | Applicant | |
| WO2008/121577(A1) | 2008-10-01 | Applicant | |
| WO2009/028281(A1) | 2009-03-01 | Applicant | |
| WO2009/032945(A1) | 2009-03-01 | Applicant | |
| WO2009/058140(A1) | 2009-05-01 | Applicant | |
| WO2009/084724 | 2009-07-01 | Applicant | |
| WO2009/134576(A1) | 2009-11-01 | Applicant | |
| WO2011/024015 | 2011-03-01 | Applicant |
Non-Patent Literature (61)
- Barr, Introduction to Watchdog Timers, Oct. 2001, 3 pgs.Applicant
- Canim, Buffered Bloom ilters on Solid State Storage, ADMS*10, Singapore, Sep. 13-17, 2010, 8 pgs.Applicant
- Kang, A Multi-Channel Architecture for High-Performance NAND Flash-Based Storage System, J. Syst. Archit., 53, 9, Sep. 2007, 15 pgs.Applicant
- Kim, A Space-Efficient Flash Translation Layer for CompactFlash Systems, May 2002, 10 pgs.Applicant
- Lu, A Forest-structured Bloom Filter with Flash Memory, MSST 2011, Denver, CO, May 23-27, 2011, article, 6 pgs.Applicant
- Lu, A Forest-structured Bloom Filter with Flash Memory, MSST 2011, Denver, CO, May 23-27, 2011, presentation slides, 25 pgs.Applicant
- McLean, Information Technology—AT Attachment with Packet Interface Extension, Aug. 19, 1998, 339 pgs.Applicant
- Park, A High Performance Controller for NAND Flash-Based Solid State Disk (NSSD), Feb. 12-16, 2006, 4 pgs.Applicant
- Pliant Technology, International Search Report / Written Opinion, PCT/US08/88133, Mar. 19, 2009, 7 pgs.Applicant
- Pliant Technology, International Search Report / Written Opinion, PCT/US08/88136, Mar. 19, 2009, 7 pgs.Applicant
- Pliant Technology, International Search Report / Written Opinion, PCT/US08/88146, Feb. 26, 2009, 10 pgs.Applicant
- Pliant Technology, International Search Report / Written Opinion, PCT/US08/88154, Feb. 27, 2009, 8 pgs.Applicant
- Pliant Technology, International Search Report / Written Opinion, PCT/US08/88164, Feb. 13, 2009, 6 pgs.Applicant
- Pliant Technology, International Search Report / Written Opinion, PCT/US08/88206, Feb. 18, 2009, 8 pgs.Applicant
- Pliant Technology, International Search Report / Written Opinion, PCT/US08/88217, Feb. 19, 2009, 7 pgs.Applicant
- Pliant Technology, International Search Report / Written Opinion, PCT/US08/88229, Feb. 13, 2009, 7 pgs.Applicant
- Pliant Technology, International Search Report / Written Opinion, PCT/US08/88232, Feb. 19, 2009, 8 pgs.Applicant
- Pliant Technology, International Search Report / Written Opinion, PCT/US08/88236, Feb. 19, 2009, 7 pgs.Applicant
- Pliant Technology, International Search Report / Written Opinion, PCT/US2011/028637, Oct. 27, 2011, 11 pgs.Applicant
- Pliant Technology, Supplementary ESR, 08866997.3, Feb. 23, 2012, 6 pgs.Applicant
- SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/042764, Aug. 31, 2012, 12 pgs.Applicant
- SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/042771, Mar. 4, 2013, 14 pgs.Applicant
- SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/042775, Sep. 26, 2012, 8 pgs.Applicant
- SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/059447, Jun. 6, 2013, 12 pgs.Applicant
- SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/059453, Jun. 6, 2013, 12 pgs.Applicant
- Sandisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/059459, Feb. 14, 2013, 9 pgs.Applicant
- SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/065914, May 23, 2013, 7 pgs.Applicant
- SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/065916, Apr. 5, 2013, 7 pgs.Applicant
- SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/065919, Jun. 17, 2013, 8 pgs.Applicant
- 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.Applicant
- SanDisk Enterprise IP LLC, Office Action, CN 200880127623.8, Apr. 18, 2012, 12 pgs.Applicant
- SanDisk Enterprise IP LLC, Office Action, CN 200880127623.8, Dec. 31, 2012, 9 pgs.Applicant
- SanDisk Enterprise IP LLC, Office Action, JP 2010-540863, Jul. 24, 2012, 3 pgs.Applicant
- Watchdog Timer and Power Savin Modes, Microchip Technology Inc., 2005, 14 pgs.Applicant
- Zeidman, 1999 Verilog Designer's Library, 9 pgs.Applicant
- Ashkenazi et al., “Platform independent overall security architecture in multi-processor system-on-chip integrated circuits for use in mobile phones end handheld devices.” ScienceDirect, Computers and Electrical Engineering 133 (2007) 18 pages.Applicant
- Lee et al., “A Semi-Preemptive Garbage Collector for Solid State Drives,” Apr. 2011, IEEE, pp. 12-21.Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- Bayer, “Prefix B-Trees”, IP.Com Journal, IP.Com Inc., West Henrietta, NY, Mar. 30, 2007, 29 pages.Applicant
- 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.Applicant
- Oracle, “Oracle9i: Database Concepts”, Jul. 2001, http://docs.oracle.com/cd/A91202—01/901—doc/server.901/a88856.pdf, 49 pages.Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- 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).Applicant
- IBM Research-Zurich, “The Fundamental Limit of Flash Random Write Performance: Understanding, Analysis and Performance Modeling,” Mar. 31, 2010, pp. 1-15.Applicant
- Gasior, “Gigabyte's i-Ram storage device, Ram disk without the fuss,” The Tech Report, p. 1, Jan. 25, 2006, 5 pages.Applicant