Memory system including a controller and processors associated with memory devices

Information

  • Patent Grant
  • 8924661
  • Patent Number
    8,924,661
  • Date Filed
    Sunday, January 17, 2010
    14 years ago
  • Date Issued
    Tuesday, December 30, 2014
    10 years ago
Abstract
A data storage system includes a plurality of non-volatile memory devices arranged in one or more sets, a main controller and one or more processors. The main controller is configured to accept commands from a host and to convert the commands into recipes. Each recipe includes a list of multiple memory operations to be performed sequentially in the non-volatile memory devices belonging to one of the sets. Each of the processors is associated with a respective set of the non-volatile memory devices, and is configured to receive one or more of the recipes from the main controller and to execute the memory operations specified in the received recipes in the non-volatile memory devices belonging to the respective set.
Description
FIELD OF THE INVENTION

The present invention relates generally to data storage, and particularly to distributed data storage in multiple memory devices.


BACKGROUND OF THE INVENTION

Several types of memory devices, such as Flash memories, use arrays of analog memory cells for storing data. Each analog memory cell stores a quantity of an analog value, also referred to as a storage value, such as an electrical charge or voltage. This analog value represents the information stored in the cell. In Flash memories, for example, each analog memory cell holds a certain amount of electrical charge. The range of possible analog values is typically divided into intervals, each interval corresponding to one or more data bit values. Data is written to an analog memory cell by writing a nominal analog value that corresponds to the desired bit or bits.


Some memory devices, commonly referred to as Single-Level Cell (SLC) devices, store a single bit of information in each memory cell, i.e., each memory cell can be programmed to assume two possible programming levels. Higher-density devices, often referred to as Multi-Level Cell (MLC) devices, store two or more bits per memory cell, i.e., can be programmed to assume more than two possible programming levels.


Flash memory devices are described, for example, by Bez et al., in “Introduction to Flash Memory,” Proceedings of the IEEE, volume 91, number 4, April, 2003, pages 489-502, which is incorporated herein by reference. Multi-level Flash cells and devices are described, for example, by Eitan et al., in “Multilevel Flash Cells and their Trade-Offs,” Proceedings of the 1996 IEEE International Electron Devices Meeting (IEDM), New York, N.Y., pages 169-172, which is incorporated herein by reference. The paper compares several kinds of multilevel Flash cells, such as common ground, DINOR, AND, NOR and NAND cells.


Eitan et al., describe another type of analog memory cell called Nitride Read Only Memory (NROM) in “Can NROM, a 2-bit, Trapping Storage NVM Cell, Give a Real Challenge to Floating Gate Cells?” Proceedings of the 1999 International Conference on Solid State Devices and Materials (SSDM), Tokyo, Japan, Sep. 21-24, 1999, pages 522-524, which is incorporated herein by reference. NROM cells are also described by Maayan et al., in “A 512 Mb NROM Flash Data Storage Memory with 8 MB/s Data Rate”, Proceedings of the 2002 IEEE International Solid-State Circuits Conference (ISSCC 2002), San Francisco, Calif., Feb. 3-7, 2002, pages 100-101, which is incorporated herein by reference. Other exemplary types of analog memory cells are Floating Gate (FG) cells, Ferroelectric RAM (FRAM) cells, magnetic RAM (MRAM) cells, Charge Trap Flash (CTF) and phase change RAM (PRAM, also referred to as Phase Change Memory—PCM) cells. FRAM, MRAM and PRAM cells are described, for example, by Kim and Koh in “Future Memory Technology including Emerging New Memories,” Proceedings of the 24th International Conference on Microelectronics (MIEL), Nis, Serbia and Montenegro, May 16-19, 2004, volume 1, pages 377-384, which is incorporated herein by reference.


Some memory systems store data in a plurality of memory devices using multiple processors or controllers. For example, U.S. Patent Application Publication 2009/0172257, whose disclosure is incorporated herein by reference, describes a mass storage system and method for breaking a host command into a hierarchy of data structures. Different types of data structures are designed to handle different phases of tasks required by the host command, and multiple data structures are sometimes used to handle portions of the host command in parallel. Disclosed embodiments include a Flash memory controller designed to allow a high degree of pipelining and parallelism.


U.S. Patent Application Publication 2009/0172261, whose disclosure is incorporated herein by reference, describes a storage controller containing multiple processors. The processors are divided into groups, each of which handles a different stage of a pipelined process of performing host reads and writes. In one embodiment, the storage controller operates with a Flash memory module, and includes multiple parallel pipelines that allow plural host commands to be handled simultaneously.


SUMMARY OF THE INVENTION

An embodiment of the present invention provides a data storage system, including:


a plurality of non-volatile memory devices arranged in one or more sets;


a main controller, which is configured to accept commands from a host, and to convert the commands into recipes, each recipe including a list of multiple memory operations to be performed sequentially in the non-volatile memory devices belonging to one of the sets; and


one or more processors, each of which processors is associated with a respective set of the non-volatile memory devices and is configured to receive one or more of the recipes from the main controller and to execute the memory operations specified in the received recipes in the non-volatile memory devices belonging to the respective set.


In some embodiments, the memory operations in each recipe access multiple memory pages in the non-volatile memory devices. In an embodiment, the main controller is configured to generate a recipe that instructs a given processor to perform at least one action selected from a group of actions consisting of reading multiple pages from the non-volatile memory devices, writing multiple pages in the non-volatile memory devices, and erasing one or more memory areas in the non-volatile memory devices. In another embodiment, the main controller is configured to generate a recipe that instructs a given processor to copy multiple pages from one or more first locations in the non-volatile memory devices to a second location in the non-volatile memory devices. The recipe may instruct the given processor to modify at least one of the pages read from the first locations and to write the modified pages to the second location.


In a disclosed embodiment, the main controller is configured to generate a recipe that instructs a given processor to read first data from a first location in the non-volatile memory devices, to use the first data as an address pointing to a second location in the non-volatile memory devices, and to read second data from the second location using the address. In an embodiment, the system includes a volatile memory coupled to the main controller, and a given processor is configured to store in the volatile memory data that is used in executing the received recipes. In another embodiment, a volatile memory is coupled to the main controller, and the main controller is configured to generate a recipe that instructs a given processor to read first data from the volatile memory, to read second data from the non-volatile memory devices, to merge the first and second data, and to write the merged first and second data into the non-volatile memory devices. In yet another embodiment, each processor is configured to send to the main controller a request for exchanging data between the processor and the main controller, and the main controller is configured to exchange the data with the processor responsively to the request.


In some embodiments, the commands accepted from the host specify logical addresses, and the main controller is configured to translate the logical addresses into respective physical storage locations in the non-volatile memory devices, and to specify the memory operations in the recipes using the physical storage locations. In an embodiment, each processor is configured to store in the non-volatile memory devices given data and a logical address corresponding to the given data, to receive a recipe, which instructs the processor to retrieve the given data from the non-volatile memory devices and indicates the logical address, to read the given data and the logical address from the non-volatile memory devices, and to report an error responsively to detecting a mismatch between the logical address indicated in the recipe and the logical address read from the non-volatile memory devices. In another embodiment, each processor is configured to store in the non-volatile memory devices given data and a logical address corresponding to the given data, and, when copying the given data to an alternative physical storage location in the non-volatile memory devices, to read the logical address of the given data from the non-volatile memory devices and to indicate to the main controller that the read logical address in associated with the alternative physical storage location.


In a disclosed embodiment, the main controller is configured to assign respective priorities to the recipes, and each processor is configured to execute the recipes in accordance with the priorities. Additionally or alternatively, each processor is configured to receive two or more of the recipes in a first order, and to execute the recipes in a second order, different from the first order. In another embodiment, each processor is configured to identify that a first recipe includes a first write operation addressed to a given location in the non-volatile memory devices, and that a second recipe includes a second write operation, which is addressed to the given location and is subsequent to the first write operation, and to inhibit execution of the first write operation.


In still another embodiment, each processor is configured to identify that a first recipe includes a first read operation addressed to a given location in the non-volatile memory devices, and that a second recipe includes a second read operation, which is addressed to the given location and is subsequent to the first read operation, and to inhibit execution of the second read operation. In an embodiment, each processor is configured to identify that a first recipe includes a write operation that writes a value to a given location in the non-volatile memory devices, and that a second recipe includes a read operation that is addressed to the given location and is subsequent to the first write operation, and to serve the read operation from an internally-buffered version of the value obtained from the write operation, without applying the read operation to the non-volatile memory devices.


In some embodiments, the non-volatile memory devices include multiple analog memory cells arranged in groups, the system includes a volatile memory coupled to the main controller, and the main controller is configured to store in the volatile memory respective values of at least one property of the memory cells for at least some of the groups, and, when producing a recipe that addresses a given group, to indicate in the recipe a value of the property for the given group. In an embodiment, each processor is configured to extract the value of the property from the received recipe, and to execute the memory operations specified in the recipe responsively to the extracted value. In a disclosed embodiment, the at least one property includes Programming and Verification (PV) levels used in programming the memory cells, read thresholds used in reading the memory cells, endurance measures of the memory cells, elapsed times since latest programming of the memory cells, estimates of read disturb in the memory cells, and/or time-temperature integral values computed over the memory cells. In an embodiment, the main controller is configured to store in the volatile memory one or more read threshold values applicable to each of at least some of the groups, and to update the read threshold values during operation of the system.


In another embodiment, the main controller is configured to convert a given host command to a set of one or more recipes, and to send a command completion indication to the host after sending the set of the recipes to the processors, irrespective of execution of the recipes in the set. In yet another embodiment, a volatile memory is coupled to the main controller, and the main controller is configured to store in the volatile memory a linked list of data items representing data, each data item including a portion of the data and a pointer to a next data item on the list, and to generate a recipe that instructs a given processor to store the data in the non-volatile memory devices and points to a first data item on the list. In an embodiment, the given processor is configured to store the data by reading each data item from the volatile memory, storing the respective portion of the data in the non-volatile memory devices, extracting the pointer to the next data item from the read data item, and reading the next data item from the volatile memory responsively to the pointer.


There is additionally provided, in accordance with an embodiment of the present invention, a method for data storage, including:


accepting commands from a host for data storage in a plurality of non-volatile memory devices arranged in one or more sets;


converting the commands into recipes, each recipe including a list of multiple memory operations to be performed sequentially in the non-volatile memory devices belonging to one of the sets; and


executing the recipes using one or more processors, each of which processors is associated with a respective set of the non-volatile memory devices, receives one or more of the recipes, and executes the memory operations specified in the received recipes in the non-volatile memory devices belonging to the respective set.


The present invention will be more fully understood from the following detailed description of the embodiments thereof, taken together with the drawings in which:





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram that schematically illustrates a memory system, in accordance with an embodiment of the present invention; and



FIGS. 2-4 are flow charts that schematically illustrate methods for data storage, in accordance with embodiments of the present invention.



FIG. 5 illustrates an embodiment of computing system.





DETAILED DESCRIPTION OF EMBODIMENTS
Overview

Embodiments of the present invention that are described hereinbelow provide improved data storage systems and associated methods. The disclosed techniques store data in a plurality of non-volatile memory devices using a hierarchical configuration of processors, typically comprising multiple processors operating in parallel. In some embodiments, a memory system (e.g., a Solid State Disk—SSD) comprises a main controller and one or more processors. The non-volatile memory devices are arranged in one or more sets, and each processor is assigned to store data in the memory devices belonging to one of the sets.


The main controller receives data storage commands from a host, and converts the commands into recipes for execution by the processors. Each recipe comprises a list of multiple memory operations (e.g., page write and page read operations), to be performed sequentially in the memory devices belonging to one of the sets. Each processor receives one or more of the recipes from the main controller, and executes the memory operations specified in the received recipes in its respective set of non-volatile memory devices.


Various kinds of recipes can be defined and executed. Example recipes are recipes that write multiple pages in the non-volatile memory devices, recipes that read multiple pages from the non-volatile memory devices, recipes that erase certain memory areas and recipes that copy multiple pages from one location to another in the non-volatile memory devices. Several additional types of recipes are described herein. Typically although not necessarily, the memory operations in each recipe access multiple different pages. In a typical implementation, the host commands specify logical addresses, and the main controller converts the logical addresses into physical addresses when generating the recipes.


In some embodiments, each processor executes the recipes it receives from the main controller in an efficient manner, such as by optimizing the order in which the recipes are executed, identifying and eliminating superfluous memory operations in the recipes, and defining priorities among recipes or recipe types. Several example techniques are described herein.


The hierarchical system configurations described herein enable the main controller to operate at a high level of recipes, and relieve the main controller from direct management of the non-volatile memory devices. In some embodiments, the processors have considerable processing power and are capable of performing complex data storage operations, such as error detection and correction. In addition, the processors are typically autonomous in deciding when and how to execute the recipes they receive. As a result, the techniques described herein are highly scalable and can achieve high storage throughput and small latency. Moreover, the system configurations described herein are flexible and modular in adapting to different system needs and specifications. Using these configurations, a memory system can be dimensioned to match different system requirements with little or no modification to the individual system components.


System Description


FIG. 1 is a block diagram that schematically illustrates a multi-device memory system 20, in accordance with an embodiment of the present invention. System 20 accepts data for storage from a host 24 and stores it in memory, and retrieves data from memory and provides it to the host. In the present example, system comprises a Solid-State Disk (SSD) that stores data for a host computer. In alternative embodiments, however, system 20 may be used in any other suitable application and with any other suitable host, such as in computing devices, cellular phones or other communication terminals, removable memory modules such as Disk-On-Key (DOK) devices, Secure Digital (SD) cards, Multi-Media Cards (MMC) and embedded MMC (eMMC), digital cameras, music and other media players and/or any other system or device in which data is stored and retrieved.


System 20 comprises multiple non-volatile memory devices 28, each comprising multiple analog memory cells 32. In the present example, devices 28 comprise NAND Flash devices, although various other suitable solid state memory types, such as NOR and Charge Trap Flash (CTF) Flash cells, phase change RAM (PRAM, also referred to as Phase Change Memory—PCM), Nitride Read Only Memory (NROM), Ferroelectric RAM (FRAM), magnetic RAM (MRAM) and/or Dynamic RAM (DRAM) cells, can also be used.


In the context of the present patent application and in the claims, the term “analog memory cell” is used to describe any memory cell that holds a continuous, analog value of a physical parameter, such as an electrical voltage or charge. Any suitable type of analog memory cells, such as the types listed above, can be used. In the present example, each memory device 28 comprises a non-volatile memory of NAND Flash cells. The charge levels stored in the cells and/or the analog voltages or currents written into and read out of the cells are referred to herein collectively as analog values or storage values. Although the embodiments described herein mainly address threshold voltages, the methods and systems described herein may be used with any other suitable kind of storage values.


In each memory device 28, data is stored in memory cells 32 by programming the cells to assume respective memory states, which are also referred to as programming levels. The programming levels are selected from a finite set of possible levels, and each level corresponds to a certain nominal storage value. For example, a 2 bit/cell MLC can be programmed to assume one of four possible programming levels by writing one of four possible nominal storage values into the cell. Memory cells 32 are typically arranged in one or more memory arrays (“planes”), each comprising multiple rows and columns. The memory cells in each row are connected to a respective word line, and the memory cells in each column are connected to a respective bit line.


Each memory array is typically divided into multiple pages, i.e., groups of memory cells that are programmed and read simultaneously. Pages are sometimes sub-divided into sectors. In some embodiments, each page occupies an entire row of the array, i.e., an entire word line. For two-bit-per-cell devices, for example, each word line stores two pages. In alternative embodiments, each row (word line) can be divided into two or more pages. For example, in some devices each row is divided into two pages, one comprising the odd-order cells and the other comprising the even-order cells. In an example implementation, a two-bit-per-cell memory device may have four pages per row, a three-bit-per-cell memory device may have six pages per row, and a four-bit-per-cell memory device may have eight pages per row.


Typically, a given memory device comprises multiple erasure blocks (also referred to as memory blocks), i.e., groups of memory cells that are erased together. Each memory device 28 may comprise a packaged device or an unpackaged semiconductor chip or die. A typical SSD may comprise a number of 4 GB devices. Generally, however, system 20 may comprise any suitable number of memory devices of any desired type and size.


Each memory device 28 comprises an internal NAND controller 36, which stores data in the memory cells of the device. Each NAND controller 36 performs data storage and retrieval in its respective memory device in response to NAND commands. Each NAND command typically specifies writing or reading of a single memory page in the memory device. The interface with the NAND controllers may comprise, for example, the Open NAND Flash Interface Specification, revision 2.2, Oct. 7, 2009, which is incorporated herein by reference. Alternatively, NAND controllers 36 may be controlled using any other suitable standard or protocol.


In system 20, data storage in memory devices 28 is carried out by a hierarchical configuration of processors and controllers, whose operation is described in detail below. The disclosed schemes provide a high degree of parallelization of storage tasks, and therefore achieves high storage throughput with small latency.


Memory devices 28 in system 20 are arranged in subsets. A Memory Signal Processor (MSP) 40 is associated with each subset and performs data storage and retrieval in the subset. In some embodiments, each MSP 40 comprises an Error Correction Code (ECC) unit 44, which encodes the data for storage with a suitable ECC, and decodes the ECC of data retrieved from memory. In some embodiments, the subsets of memory devices 28 (each with its respective MSP) are aggregated into groups that are referred to as channels.


System 20 comprises a main controller 52, which manages the system operation. Main controller 52 comprises multiple channel controllers 48, each responsible for data storage and retrieval in a respective channel. The main controller accepts commands from host 24 to store and/or retrieve data, and communicates with the MSPs in order to carry out these commands. Typically, the communication between the main controller and the channel controllers, between the channel controllers and MSPs, and between the MSPs and the NAND controllers, comprise both data and control aspects.


In some embodiments, main controller 52 comprises a host interface processor 53 and a main processor 54. The host interface processor forwards host commands between main controller 54 and host 24, and forwards data between the MSPs and the host. Main processor 54 executes the host commands using the techniques described herein, performs Flash management functions on memory devices 28, and communicates with the MSPs. In alternative embodiments, any other suitable main controller configuration can also be used. For example, Flash management functions may be partitioned between main processor 54 and MSPs 40. In some embodiments, the system comprises volatile memory, in the present example one or more Dynamic Random Access Memory (DRAM) devices 56, connected to main controller 52. The role of DRAM 56 in the storage methods described herein is described in detail further below. In an embodiment, host interface controller 53 bridges data between the host and the DRAM.


In an example embodiment, system 20 comprises a total of eight channel controllers 48 and thirty-two MSPs 40, i.e., each channel controller manages four MSPs. In this configuration, each MSP may manage between one and eight memory devices 28. A given memory device 28 may comprise multiple dies. Alternatively, however, any other suitable numbers of channel controllers, MSPs and memory devices can also be used. The number of memory devices managed by each MSP may differ, for example, according to the storage capacity of system 20 and the storage density of devices 28. In some embodiments, the channel controllers may be omitted. In these embodiments, the main controller stores and retrieves data by communicating directly with the MSPs.


The functions of NAND controllers 36, MSPs 40, channel controllers 48 and main controller 52 may be implemented, for example, using software running on suitable Central Processing Units (CPUs), using hardware (e.g., state machines or other logic), or using a combination of software and hardware elements. In some embodiments, NAND controllers 36, MSPs 40, channel controllers 48 and/or main controller 52 may comprise general-purpose processors, which are programmed in software to carry out the functions described herein. The software may be downloaded to the processors in electronic form, over a network, for example, or it may, alternatively or additionally, be provided and/or stored on tangible media, such as magnetic, optical, or electronic memory.


The system configuration of FIG. 1 is an example configuration, which is shown purely for the sake of conceptual clarity. In alternative embodiments, any other suitable memory system configuration can also be used. Elements that are not necessary for understanding the principles of the present invention, such as various interfaces, addressing circuits, timing and sequencing circuits and debugging circuits, have been omitted from the figure for clarity.


In the exemplary system configuration shown in FIG. 1, the channel controllers are comprised in the main controller, and the main controller, MSPs and memory devices are implemented as separate Integrated Circuits (ICs). In an alternative embodiment, memory devices 28, MSPs 40, channel controllers 48 and main controller 52 may be implemented as separate ICs. Alternatively, each subset of devices 28 with its respective MSP, can be fabricated on a common die or device. Further alternatively, the MSPs, channel controllers and main controller may be fabricated in a common Multi-Chip Package (MCP) or System-on-Chip (SoC), separate from memory devices 28 and DRAM 56. In alternative embodiments, the elements of system 20 can be partitioned into packaged ICs or semiconductor dies in any other suitable way.


Further alternatively, some or all of the functionality of main controller 52 can be implemented in software and carried out by a processor or other element of the host system. In some embodiments, host 24 and main controller 52 may be fabricated on the same die, or on separate dies in the same device package. Although the embodiments described herein refer to multiple parallel processors (MSPs), the disclosed techniques can also be used in a system configuration comprising only a single MSP.


The hierarchical system configuration of FIG. 1 is flexible in adapting to different system needs and specifications. For example, different capacity requirements may require different numbers of MSPs and memory devices, but have little effect on the main controller. Different throughput requirements can be met by changing the number of MSPs, without necessarily modifying the main controller or memory devices. Host interface changes typically affect the main controller but not the MSPs or memory devices. Adaptation to different kinds of memory devices usually affects the MSPs but has little or no effect on the main controller. The MSPs typically share the main controller's resources (e.g., DRAM), and therefore changing the number of MSPs usually does not require changes in the main processor. As such, system 20 can be dimensioned or adapted to different needs or specifications in a modular fashion, with minimal modifications of individual system elements.


Recipe-Based MSP Operation

In system 20, main controller 52 receives commands from host 24 to store and retrieve data. The main controller carries out the host commands in a parallelized and efficient manner using the hierarchical structure of channel controllers 48 and MSPs 40. Main controller 52 translates the host commands into recipes, and provides the recipes to the MSPs for execution. Each recipe comprises a list of multiple memory operations, which are to be executed sequentially in a certain subset of memory devices 28. (As noted above, each subset of memory devices is controlled by a respective MSP.) The main controller sends to each MSP recipes, which specify memory operations that are to be applied to the memory devices in the subset managed by that MSP. Each MSP receives the recipes addressed thereto, and the MSPs execute their designated recipes concurrently.



FIG. 2 is a flow chart that schematically illustrates a method for data storage, in accordance with an embodiment of the present invention. The method begins with host 24 sending host commands to main controller 52 of system 20, at a command input step 60. Main controller 52 translates the host commands into recipes, at a recipe generation step 64. The main controller sends the recipes to the MSPs via the channel controllers, at a recipe sending step 68. The MSPs execute the recipes, at a recipe execution step 72. Each MSP translates each of its recipes into a sequence of NAND commands, and issues the NAND commands to the appropriate memory devices 28. The memory devices accept and execute the NAND commands, at a NAND command execution step 76. In each memory device 28, NAND controller 36 accepts the NAND commands addressed thereto and executes them. Following execution of the NAND commands, results of the commands (e.g., retrieved data, acknowledgements of successful data storage and/or error messages) are forwarded from the memory devices back to the MSPs, channel controllers and/or main controller, at a result forwarding step 80.


Main controller 52 may generate various kinds of recipes for execution by the MSPs. Typically although not necessarily, the memory instructions in each recipe access multiple memory pages in memory devices 28. The term “access multiple pages” in the present context means, for example, write or read multiple memory pages. For example, a “multiple write” recipe instructs the MSP to write a body of data, typically comprising multiple pages, sequentially into a specified address range in memory devices 28. A “multiple read” recipe instructs the MSP to read a body of data, typically comprising multiple pages, sequentially from a specified address range in memory devices 28. A “multiple copy” recipe instructs the MSP to copy a body of data, typically comprising multiple pages, from a certain address range in memory devices 28 to another address range in the memory devices.


In some embodiments, the “multiple copy” recipe instructs the MSP to modify some of the read data or apply certain processing to the read data, before writing it to the destination address range. In some embodiments, the “multiple copy” recipe instructs the MSP to read the data from two or more different address ranges. This sort of recipe is useful, for example, for implementing “garbage collection” operations that collect the valid pages from two or more blocks and write them into another block.


Each of the above-described recipes instructs the MSP to read multiple pages and/or write multiple pages. Another example of recipe is a “multiple erase” recipe, which instructs the MSP to erase one or more memory areas, e.g., multiple erasure blocks. Several additional examples of recipes, which can be used in system 20, are described further below.


Typically, the commands received from host 24 specify data storage and readout using logical addresses. When translating the host commands into the recipes, main controller 52 translates the logical addresses into physical addresses, i.e., physical storage locations in memory devices 28. Any suitable logical-to-physical translation (often referred to as Logical Block Addressing—LBA) can be used. Thus, the recipes generated by the main controller specify the memory operations using physical addresses (e.g., block and page indices in memory devices 28). Typically, MSPs 40 operate according to the physical addresses, and the translation to and from logical addresses is performed at the main controller.


In some embodiments, main controller 52 stores information that is to be used by the recipes in DRAM 56 (or in other volatile memory). In these embodiments, the recipes specify that the appropriate information is to be read from the DRAM or written into the DRAM by the MSPs. For example, the “multiple write” recipe may specify that a body of data is to be read from a specified address range in DRAM 56 and stored in a specified address range in devices 28.


Typically, each MSP 40 operates as a master toward the memory devices it controls. In some embodiments, a given MSP may operate as a master toward the channel controller, as well. For example, the MSP may request data transfer services from the channel controller. In an example embodiment, when executing (or preparing to execute) a programming recipe, the MSP may send to the channel controller a request to send it data for programming from the main controller. In response to such a request, the channel controller typically retrieves the requested data from DRAM 56 of the main controller and sends the data to the MSP.


As another example, when executing a reading recipe, the MSP may request the channel controller to read the data (which was previously read from memory devices 28) from the MSP's buffers and send it to the main controller. In response to such a request, the channel controller typically reads the appropriate data from the MSP's buffers and sends the data to the main controller. Using these techniques, the channel controllers can relieve the MSPs and the main controller from some communication tasks, and the system can therefore operate more efficiently.


In some embodiments, a given host command is translated to multiple recipes executed by multiple MSPs. For example, when the host interface processor receives a read command from the host, the main processor may translate this command into multiple recipes, each instructing a certain MSP to read data from its designated memory devices. The MSPs execute their respective recipes and send the read data to the host interface processor. The host interface processor collects the data, orders it and sends it to the host. When all data is collected, the host interface processor sends a “command complete” indication to the host. In some embodiments, the host interface processor sends the “command complete” indication to the host as soon as all recipes corresponding to a given host command have been sent to the MSPs, without waiting for acknowledgements from the MSPs or for actual completion of recipe execution, for further improving performance.


Recipe Processing in the MSP

Typically, each MSP 40 is autonomous in deciding when and how it will execute the recipes received from the channel controller. This autonomy enables the MSPs to execute the recipes in an efficient manner. For example, a given MSP may control and modify the order in which it executes the recipes received from the channel controller. In other words, the MSP does not necessarily execute the recipes in the same order they are received from the channel controller.


The MSP may set the recipe execution order based on various criteria. For example, the MSP may set the recipe execution order to optimize the utilization of system resources, e.g., bus utilization, utilization of logic units such as the ECC encoder and/or decoder or error detection circuitry in unit 44, or utilization of different memory devices 28. As another example, the MSP may modify the recipe execution order in a way that consolidates multiple random read (or random write) operations into a single sequential read (or write) operation. This technique utilizes the memory devices and their interfaces more efficiently. As yet another example, the MSP may modify the recipe execution order in a way that reduces peak power consumption. Additionally or alternatively, the MSP may set the execution order of the recipes based on any other suitable criterion. In some embodiments, the MSP modifies the order in which pages are programmed or read within a given recipe. Page re-ordering of this sort sometimes assists in reducing interference between memory cells. For example, in some memory devices, data is programmed using an iterative Programming and Verification (P&V) process. In a typical P&V process, the memory device circuitry applies a sequence of programming pulses to the memory cells in a given word line, and verifies the threshold voltages of the cells after each pulse. Programming continues for those cells that have not yet reached their intended threshold voltages.


When programming a memory device word line by word line, the P&V process inherently compensates for interference caused to the present word line by previously-programmed word lines. The P&V process typically cannot compensate for interference from word lines that are programmed later. Thus, in some scenarios it is advantageous to read data in reverse order to the order in which it was programmed. For example, if the data was programmed into the memory device in ascending order of word lines, it may be advantageous to read the data is descending order of word lines, and vice versa. In some embodiments, the MSP sets the order in which pages are read to be the inverse of the order in which the pages were written.


In some embodiments, the MSP applies an interference cancellation process that cancels the interference in a given word line based on the threshold voltages or data of neighboring word lines. Interference cancellation techniques are described, for example, in PCT International Publications WO 2007/132453, 2007/132457 and 2008/026203, whose disclosures are incorporated herein by reference. In these embodiments, the MSP may set the order in which pages are read in a given recipe, so that pages that potentially cause interference to a given page are read adjacently to the interfered page. This technique enables the interference cancellation process to use smaller buffers, and/or to apply interference cancellation using a larger number of neighboring word lines. Alternatively, the MSP may modify the order in which pages are programmed or read in a given recipe based on any other suitable criterion.


In some embodiments, the MSP may eliminate some of the read or write operations specified in recipes by considering multiple recipes jointly. For example, if the MSP identifies two or more write operations to the same physical address in different recipes, it may execute only the latest write operation and discard the others. As another example, if the MSP identifies two or more read operations from the same physical address in different recipes, it may execute only the earliest read operation and discard the others. As yet another example, the MSP may detect a program operation that writes data to a certain physical address in one recipe, and a later read operation that reads the data from the same physical address in another recipe. In such a case, the MSP may read the data from its internal buffers instead of reading it from memory devices 28. Additionally or alternatively, the MSP may decide to eliminate read and/or write operations when executing the recipes, based on any other suitable logic. These techniques enable the MSP to avoid superfluous or unnecessary access to memory devices 28, and therefore improve system performance.


Additionally or alternatively, different recipes or recipe types may be assigned different priorities, and the MSPs may execute the recipes according to their priorities. For example, an MSP may be in the process of executing a certain recipe, when another recipe is received from the main controller. If the priority of the newly-arriving recipe is higher than the priority of the currently-executed recipe, the MSP may temporarily suspend execution of the currently-executed recipe, execute the higher-priority recipe, and then resume execution of the suspended recipe. This technique can be used, for example, by assigning a relatively low priority to recipes having long execution times. Shorter recipes can be assigned higher priorities, and thus need not suffer long delays.


Additional Recipe Types

In some embodiments, the main controller may send a “merge and write” recipe that requests the MSP to write data into a specified address range in memory devices 28. In the “merge and write” recipe, part of the data resides in a certain address range in DRAM 56, while another part of the data resides in a certain address range in memory devices 28. The “merge and write” recipe can be used, for example, to copy a body of data from one location to another in memory devices 28, while replacing part of the data with data provided by the main controller.



FIG. 3 is a flow chart that schematically illustrates a method for data storage, in accordance with an embodiment of the present invention. The method begins with MSP 40 receiving a “merge and write” recipe from main controller 52, at a merge and write input step 90. The recipe typically specifies (1) an address range in DRAM 56 in which a first part of the data is stored, (2) an address range in memory devices 28 in which a second part of the data is stored, and (3) an address range in memory devices 28 in which the merged data is to be stored. The MSP reads the first part of the data from DRAM 56, typically using the channel controller services, at a first readout step 94. The MSP reads the second part of the data from memory devices 28, at a second readout step 98. The MSP them merges the first and second parts, and writes the merged data to memory devices 28, at a merge and write output step 102.


The description of FIG. 3 assumes that the internal memory of MSP 40 is sufficient for holding both parts of the data in order to perform the merging operation. This assumption typically holds for small data sizes, e.g., when reading a page from memory devices 28, and replacing a sector in this page with data from DRAM 56. When the total size of the first and second data parts exceeds the internal storage capacity of MSP 40, the MSP may store the data temporarily in DRAM 56 and perform the merging operation using the DRAM.


In some embodiments, the main controller generates an “indirect read” recipe. The “indirect read” recipe specifies a physical address, whose content indicates (e.g., points to) the address from which data is to be retrieved. In other words, the “indirect read” recipe instructs the MSP to perform the following:

    • Read a physical address X specified in the recipe.
    • Decode the data read from physical address X, and use the decoded data as another physical address Y.
    • Read physical address Y, and return the data read from physical address Y as the recipe output.


The “indirect read” recipe is an example of a recipe in which the MSP decodes the retrieved data and uses this data in order to configure the operations in the recipe. In alternative embodiments, other types of recipes may modify the recipe operation based on the read data in any other suitable way.


Efficient Recipe Execution Using Main Controller DRAM

In some embodiments, MSPs 40 use DRAM 56 as an external memory resource when executing recipes. Typically, the available memory space in DRAM 56 is considerably larger than the internal memory of the MSP, and using the DRAM enables the MSPs to execute recipes more efficiently. Consider, for example, a “multiple copy” recipe that instructs a given MSP to copy N pages from one location to another in memory devices 28. In the present example, the MSP is able to buffer internally only up to K pages, K<N.


It is possible in principle for the MSP to read a group of K pages at a time, and write it to its destination before reading the next group. Alternatively, however, the MSP can read all N pages sequentially and store them in DRAM 56. Then, the MSP can program the N pages sequentially from the DRAM to their destination in memory devices 28. Reading and writing all N pages sequentially is considerably more efficient, for example since it enables to MSP to operate in a pipeline and use the memory devices' cache commands. Thus, the copying speed is increased.


Some host commands involve transferring large amounts of data from DRAM 56 to memory devices 28. The data may be addressed to multiple memory devices and MSP, and therefore often involves generation and execution of multiple recipes. Executing such commands may result in considerable computation and communication load on the main controller. In some embodiments, system 20 relieves most of this computation and communication load by transferring more functions to the channel controllers and MSPs.


For example, in some embodiments the main controller formats data for storage as a linked list of data items, referred to as cache lines. Each cache line is stored in a certain location in DRAM 56. Each cache line holds a portion of the data, and a pointer to the location in DRAM 56 of the next cache line. In order to store the data, the main controller sends to a given MSP a program recipe which comprises a pointer to the first cache line in the list. Note that no data is typically transferred in this recipe, only the pointer.


Upon receiving this recipe, the MSP requests the channel controller to prepare the first cache line. The channel controller reads the requested cache line from the DRAM and sends it to the MSP. The MSP stores the data from the cache line in memory devices 28. In addition, the MSP extracts the pointer to the next cache line from the present cache line data, and uses this pointer to request the channel controller to prepare the next cache line. The process continues until the entire list of cache lines has been transferred from DRAM 56 to memory devices 28. When storage is completed, the MSP issues a “program complete” notification. As can be appreciated, most of the processing load in this process is shifted to the MSP and channel controller.


In alternative embodiments, the MSP can store any other suitable data in DRAM 56, as part of the recipe execution. Typically, the recipes produced by main controller 52 instruct the MSPs as to how to use the DRAM.


Recipe Execution Using Memory Cell Properties Stored in DRAM

In some embodiments, main controller 52 stores in DRAM 56 certain properties of groups of memory cells 32, e.g., of erasure blocks or even individual word lines. MSPs 40 may use the information stored in DRAM 56 when executing recipes. In some embodiments, the main controller indicates the memory cell properties as part of the recipe. Alternatively, the MSP may query the information stored in the DRAM when executing the recipe.


For example, memory devices 28 may program the memory cells using a P&V process, as described above. In a typical P&V process, the cell threshold voltages are compared with certain Programming Verification (PV) levels, which indicate the desired threshold voltages corresponding to the different programming states. The optimal PV levels may differ from one group of memory cells to another, and/or vary over time, for various reasons. In some embodiments, main controller 52 stores the desired PV levels to be used with different cell groups (e.g., PV levels for each erasure block) in DRAM 56. When the main controller generates a recipe for programming data in a certain cell group, the main controller may indicate the PV levels to be used in programming the cell group in question. The recipe format may include a field dedicated for this purpose. When executing such a recipe, the MSP instructs the NAND controller to apply the PV levels specified in the recipe.


As another example, data is typically read from analog memory cells by comparing the cells' threshold voltages to certain read thresholds. The optimal read threshold values may vary over time, and/or between one cell group to another, for various reasons. In some embodiments, the main controller stores the read threshold values to be used for reading different cell groups (e.g., read thresholds for each erasure block) in DRAM 56. When the main controller generates a recipe for reading data from a certain cell group, the main controller may indicate the read thresholds to be used in programming the cell group in question. The recipe format may include a field dedicated for this purpose. When executing such a recipe, the MSP instructs the NAND controller to apply the read thresholds specified in the recipe.


In some embodiments, the optimal read threshold values are calculated by the MSPs and provided to the main controller for storage in the DRAM. Any suitable method for calculating read thresholds can be used. Example methods are described in PCT International Publication WO 2007/132457, cited above, and PCT International Publications WO 2008/111058 and 2008/053472, whose disclosures are incorporated herein by reference. The main controller may send a given MSP a “read threshold acquisition” recipe, which contains a list of memory operations that determine the optimal read thresholds in a given block or other cell group.


Other examples of properties of memory cell groups that can be stored in DRAM 56 comprise the endurance of the cell group (e.g., the number of programming and erasure cycles the cell group has gone through), the time that elapsed since the last programming of the cell group, the estimated read disturb (or other interference) in the cell group, an integral of the cell group temperature over time (which is a measure of the cell group's wear level), and/or any other suitable property. Any of these properties can be reported to the MSPs as part of the recipes, and the MSPs can configure the readout or programming operations in any suitable way based on the reported properties.



FIG. 4 is a flow chart that schematically illustrates a method for data storage, in accordance with an embodiment of the present invention. The method begins with main controller 52 storing properties of different groups of memory cells, at a property storage step 110. When generating a recipe to be applied to a certain group of memory cells, the main controller inserts the properties of the cell group in question into the recipe, at a property specification step 114. The main controller sends the recipe, including the specified properties, to one of the MSPs, at a recipe forwarding step 118. The MSP executes the recipe based on the memory cell group properties reported in the recipe, at an execution step 122.


Additional Variations and Embodiments

As noted above, main controller 52 typically translates the logical addresses specified in the host commands into physical addresses, and uses the physical addresses when generating the recipes. In some embodiments, system 20 uses this translation to ensure that the correct data in memory devices 28 is being accessed. In an example embodiment, at least some of the recipes comprise a field in which the main controller indicates the logical address of the data. When programming data (e.g., a block) in memory devices 28, the MSP stores the logical address indicated in the “write” recipe together with the data. When requesting to read the data, the main controller indicates the logical address of the data as part of the “read” recipe. In response to the “read” recipe, the MSP reads the data, extracts the logical address from the read data, and compares the extracted logical address with the logical address indicated in the “read” recipe. If the stored logical address does not match the logical address indicated in the “read” recipe, the MSP issues an error message.


In some embodiments, MSPs 40 copy memory pages from one location to another in memory devices 28 during operation of system 20. These copy operations may comprise, for example, “garbage collection” operations in which the MSP copies valid pages from one block to another in order to free sparsely-programmed blocks for erasure. As noted above, the main controller typically holds a logical-to-physical address mapping, for translating the logical addresses specified by the host into physical addresses in memory devices 28.


When performing the above-described copy operations by the MSPs, the logical-to-physical address mapping in the main controller should be updated to reflect the updated physical locations of the copied data. This task is often complex, since the logical-to-physical address mapping typically comprises a very large number of entries, and the main controller has no straightforward way of determining which logical addresses should be mapped to new physical locations.


As noted above, the MSP stores the logical address indicated in the “write” recipe together with the data in memory devices 28. In some embodiments, system 20 uses this information to update the logical-to-physical address mapping in an efficient manner. In an example process, the MSP receives a recipe that instructs it to copy data from certain source physical addresses to respective destination physical addresses. When copying a given page, the MSP extracts and records the logical address corresponding to this page (which has been stored together with the data by the “write” recipe”). After completing the copy recipe, the MSP sends to the main controller a list of the logical addresses that were subjected to the copy operations, and the respective new physical addresses to which the logical addresses should now correspond. The main controller updates its logical-to-physical address mapping based on this information. Using this technique, the main controller need not search or otherwise determine which logical addresses were affected by the copy operations, since the logical addresses are provided explicitly be the MSPs.


As noted above, the main controller may hold in DRAM a data structure that records the optimal read threshold values for different groups of memory cells (e.g., for different blocks). The main controller and/or MSPs may manage and update this information during system operation in any suitable way. In some embodiments, the read thresholds of a certain block can be adjusted during each read operation from the block. In an embodiment, whenever the MSP reads a certain word line from a given block, it updates the main controller with the read thresholds that were found to be optimal in that read operation. The main controller updates the data structure in DRAM 56 accordingly. Thus, when the MSP will encounter another read operation from the same block in the future, it can perform the readout using the read thresholds that were previously found to be optimal for the block. This technique assumes that the differences in read threshold values between different word lines in a block are relatively small (or that the differences can be compensated for using other means).


Additionally or alternatively, when the MSP calculates an initial estimate of the read thresholds with no prior information, or using read thresholds that highly non-optimal, it reports the read thresholds found to be optimal to the main controller. The main controller updates the data structure in DRAM 56 accordingly. Acquisition may be performed for a given word line in a block. This technique is useful, for example, when large differences exist in the read threshold values between different word lines in the block. In some embodiments, the main controller or MSP may initiate an acquisition process for blocks for which no read threshold information exists in the data structure. These acquisition attempts may be performed, for example, during idle times of the system. This technique increases the likelihood of finding up-to-date read threshold information regarding a given block in the data structure.


It will be appreciated that the embodiments described above are cited by way of example, and that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention includes both combinations and sub-combinations of the various features described hereinabove, as well as variations and modifications thereof which would occur to persons skilled in the art upon reading the foregoing description and which are not disclosed in the prior art.


Refer to the system described in FIG. 5. A Memory Controller is connected to N Memory devices. The Memory Controller is connected to a Host that controls the system. The Host has more memory resources, as it is connected to an external DRAM.


An example for such a system is a Cellular Phone, where the Host is the processor that controls the system and the Memory Controller is an eMMC/SD controller that implements the storage functionality. In this example, the eMMC/SD controller has limited memory resources, whereas the Host has a large amount of DRAM.


Generally, there can be a few Memory Controllers connected to one Host. The Memory Controller can reside on the same die of the Memory Device, on the same die as the Host, on a different die, that reside in the same Multi-Chip Package (MCP), or on different packages. It is also possible that all entities reside on the same die.


In the proposed method, the Memory Controller stores and retrieves data that is required for its functionality to/from the DRAM connected to the Host. The Host and the Memory Controller are connected via so called Memory I/F 2. Examples for such interfaces are: NAND I/F, uSD I/F, eMMC I/F, UFS I/F, SATA I/F, USB I/F. Usually the Host is the Master, while the Memory Controller is the slave. As a result, the Memory Controller cannot send commands to the Host, asking to store or retrieve data. Therefore, it is suggested that the Memory Controller will use a signal, for example, the ready/busy signal line in the NAND I/F, to indicated the Host it requires to store/retrieve data.


Whenever the Host sends a read or write command to the Memory Controller, it also includes Meta-Data, to exchange data between the two components.


The host may store the parameters required by the Memory Controller in the DRAM. For example, every time the Memory Controller performs page read, it transfers to the host the read thresholds besides the data. The Host stores the read thresholds in its DRAM. When the host instructs the Memory Controller to read, it also transfers the read thresholds. This enables faster operation of the Memory Controller.

Claims
  • 1. A data storage system, comprising: a host coupled to a volatile system memory;a plurality of non-volatile memory devices arranged in one or more sets, wherein each non-volatile memory device of the plurality of non-volatile memory devices includes multiple analog memory cells arranged in groups;a main controller configured to: accept commands from the host;signal the host to retrieve and send to the main controller information items stored in the volatile system memory relating to respective groups of the analog memory cells, responsive to the acceptance of the commands;receive, from the host, the information items; andgenerate recipes dependent upon the received information items, wherein each recipe includes a list of multiple memory operations to be performed sequentially in one or more of the plurality of non-volatile memory devices belonging to one of the sets; andone or more processors, wherein each of the one or more processors is associated with a respective set of one or more of the plurality of non-volatile memory devices and is configured to:receive one or more of the recipes from the main controller;assign a priority to each recipe of the one or more recipes dependent upon execution times of each recipe of the one or more recipes; andcause execution of memory operations that comprise the one or more recipes dependent upon the priority assigned to each recipe of the one or more recipes;wherein the execution of the memory operations occurs in the one or more of the plurality of non-volatile memory devices belonging to the respective set for that processor.
  • 2. The system according to claim 1, wherein the memory operations comprising each recipe access multiple memory pages in the plurality of non-volatile memory devices upon execution.
  • 3. The system according to claim 1, wherein the main controller is configured to generate a recipe that instructs a given one of the one or more processors to perform at least one action selected from a group of actions comprising reading multiple pages from the plurality of non-volatile memory devices, writing multiple pages in the plurality of non-volatile memory devices, and erasing one or more memory areas in the plurality of non-volatile memory devices.
  • 4. The system according to claim 1, wherein the main controller is configured to generate a recipe that instructs a given one of the one or more processors to copy multiple pages from one or more first locations in the plurality of non-volatile memory devices to a second location in the plurality of non-volatile memory devices.
  • 5. The system according to claim 4, wherein the recipe instructs the given one of the one or more processors to modify at least one of the pages read from the first locations and to write the modified pages to the second location.
  • 6. The system according to claim 1, wherein the main controller is configured to generate a recipe that instructs a given one of the one or more processors to: read first data from a first location in the plurality of non-volatile memory devices;use the first data as an address pointing to a second location in the plurality of non-volatile memory devices; andread second data from the second location using the address.
  • 7. The system according to claim 1, wherein each of the one or more processors is configured to send to the main controller a request for exchanging data between that processor and the main controller, and wherein the main controller is configured to exchange the data with that processor responsively to the request.
  • 8. The system according to claim 1, wherein the commands accepted from the host specify logical addresses, and wherein the main controller is configured to translate the logical addresses into respective physical storage locations in the plurality of non-volatile memory devices and is configured to specify the physical storage locations in the recipes.
  • 9. The system according to claim 8, wherein each one of the one or more processors is configured to: store in the plurality of non-volatile memory devices given data and a logical address corresponding to the given data;receive a recipe instructing that processor to retrieve the given data from the plurality of non-volatile memory devices, wherein the recipe indicates the logical address;read the given data and the logical address from the plurality non-volatile memory devices; anddetect an error condition corresponding to a mismatch between the logical address indicated in the recipe and the logical address read from the plurality of non-volatile memory devices.
  • 10. The system according to claim 1, wherein the main controller is configured to assign respective priorities to the recipes, and wherein each of the one or more processors is configured to execute the recipes in accordance with the priorities.
  • 11. The system according to claim 1, wherein each of the one or more processors is configured to receive two or more of the recipes in a first order, and is configured to execute the recipes in a second order different from the first order.
  • 12. The system according to claim 1, wherein each of the one or more processors is configured to: identify that a first recipe comprises a first write operation addressed to a given location in the plurality of non-volatile memory devices;identify that a second recipe comprises a second write operation that is subsequent to the first write operation, wherein the second write operation is addressed to-the given location in the plurality of non-volatile memory devices; andinhibit execution of the first write operation.
  • 13. The system according to claim 1, wherein each of the one or more processors is configured to: identify that a first recipe comprises a first read operation addressed to a given location in the plurality of non-volatile memory devices;identify that a second recipe comprises a second read operation that is subsequent to the first read operation, wherein the read operation comprises an address to the given location in the plurality of non-volatile memory devices; andinhibit execution of the second read operation.
  • 14. The system according to claim 1, wherein each of the one or more processors is configured to: identify that a first recipe comprises a write operation that writes a value to a given location in the plurality of non-volatile memory devices;identify that a second recipe comprises a read operation that is addressed to the given location and is subsequent to the first write operation; andexecute the read operation using an internally-buffered version of the value obtained from the write operation, without applying the read operation to the plurality of non-volatile memory devices.
  • 15. The system according to claim 1, wherein the one or more processors are configured to extract the information items from the recipe addressing a given group and cause execution, in the plurality of non-volatile memory devices, of memory operations specified in the recipe responsive to the extracted value.
  • 16. The system according to claim 1, wherein the information items comprises at least one property type selected from a group of types comprising: Programming and Verification (PV) levels used in programming the memory cells, read thresholds used in reading the memory cells, endurance measures of the memory cells, elapsed times since latest programming of the memory cells, estimates of read disturb in the memory cells, and time-temperature integral values computed over the memory cells.
  • 17. The system according to claim 1, wherein the main controller is configured to convert a given host command to a set of one or more recipes and send a command completion indication to the host after sending the set of the recipes to the one or more processors, irrespective of execution of the recipes in the set.
  • 18. The system according to claim 1, further comprising a volatile memory coupled to the main controller, wherein the main controller is configured to: store in the volatile memory a linked list of data items representing data, each data item comprising a portion of the data and a pointer to a next data item on the list; andgenerate a recipe that instructs a given one of the one or more processors to store the data in the plurality of non-volatile memory devices and points to a first data item on the linked list of data items.
  • 19. A method for data storage, comprising: accepting commands from a host at a main controller, wherein the commands relate to data storage in a plurality of non-volatile memory devices arranged in one or more sets;wherein the plurality of non-volatile memory devices include multiple analog memory cells arranged in groups;signaling, by the main controller, to the host to retrieve information items relating to the groups of analog memory cells from a volatile system memory and send the information items to the main controller;receiving, by the main controller, the information items;converting, by the main controller, the commands into recipes dependent upon the received information items, wherein each recipe includes a list of multiple memory operations to be performed sequentially in one or more of the plurality of non-volatile memory devices belonging to one of the sets;receiving, by at least one processor of one or more processors, the one or more recipeswherein each of the one or more processors is associated with a respective set of the plurality of non-volatile memory devices;assigning, by the at least one processor of the one or more processors, a priority to each recipe of the one or more recipes dependent upon a respective execution time of each recipe of the one or more recipes;executing, by the at least one processor of the one or more processors, memory operations specified in the one or more of the recipes in the plurality of non-volatile memory devices belonging to the respective set for the at least one processor dependent upon the priority assigned to each recipe of the one or more recipes.
  • 20. The method according to claim 19, wherein the memory operations specified in each recipe access multiple memory pages in the plurality of non-volatile memory devices upon execution.
  • 21. The method according to claim 19, wherein converting the commands into the recipes comprises generating a recipe that instructs a given one of the one or more processors to perform at least one action selected from a group of actions comprising: reading multiple pages from the plurality of non-volatile memory devices, writing multiple pages in the plurality of non-volatile memory devices, and erasing one or more memory areas in the plurality of non-volatile memory devices.
  • 22. The method according to claim 19, wherein converting the commands into the recipes comprises generating a recipe that instructs a given one of the one or more processors to copy multiple pages from one or more first locations in the plurality of non-volatile memory devices to a second location in the plurality of non-volatile memory devices.
  • 23. The method according to claim 22, wherein the recipe instructs the given one of the one or more processors to modify at least one of the pages read from the first locations and to write the modified pages to the second location.
  • 24. The method according to claim 19, wherein converting the commands into the recipes comprises generating a recipe that instructs a given one of the one or more processors to: read first data from a first location in the plurality of non-volatile memory devices;use the first data as an address pointing to a second location in the plurality of non-volatile memory devices; andread second data from the second location using the address.
  • 25. The method according to claim 19, wherein the commands accepted from the host specify logical addresses, and wherein converting the commands into the recipes comprises translating the logical addresses into respective physical storage locations in the plurality of non-volatile memory devices.
  • 26. The method according to claim 25, wherein executing the one or more of the recipes comprises: storing in the plurality of non-volatile memory devices given data and a logical address corresponding to the given data;in association with copying the given data to an alternative physical storage location in the plurality of non-volatile memory devices, reading the logical address of the given data from the plurality of non-volatile memory devices and determining that the read logical address is associated with the alternative physical storage location.
  • 27. The method according to claim 19, wherein converting the commands into the recipes comprises assigning respective priorities to the recipes and wherein executing the one or more of the recipes comprises executing the one or more of the recipes in accordance with their respective priorities.
  • 28. The method according to claim 19, wherein executing the one or more of the recipes comprises receiving two or more of the recipes in a first order and executing the recipes in a second order, different from the first order.
  • 29. The method according to claim 19, wherein executing the one or more of the recipes comprises: identifying that a first recipe comprises a first write operation addressed to a given location in the plurality of non-volatile memory devices;identifying that a second recipe comprises a second write operation that is subsequent to the first write operation, wherein the second write operation comprises an address of the given location in the plurality of non-volatile memory devices; andinhibiting execution of the first write operation.
  • 30. The method according to claim 19, wherein executing the one or more of the recipes comprises: identifying that a first recipe comprises a first read operation addressed to a given location in the plurality of non-volatile memory devices;identifying that a second recipe comprises a second read operation that is subsequent to the first read operation, wherein the second read operation comprises an address of the given location in the plurality of non-volatile memory devices; andinhibiting execution of the second read operation.
  • 31. The method according to claim 19, wherein the information items comprise at least one of: Programming and Verification (PV) levels used in programming the memory cells, read thresholds used in reading the memory cells, endurance measures of the memory cells, elapsed times since latest programming of the memory cells, estimates of read disturb in the memory cells, and time-temperature integral values computed over the memory cells.
  • 32. The method according to claim 19, further comprising storing one or more read threshold values applicable to each of one or more of the groups and updating the one or more read threshold values.
  • 33. The method according to claim 19, wherein converting the commands into the recipes comprises converting a given host command to a set of one or more recipes and sending a command completion indication to the host after sending the set of the one or more recipes to the one or more processors, irrespective of execution of the recipes in the set.
  • 34. The method according to claim 19, wherein converting the commands into the recipes comprises storing in volatile memory a linked list of data items representing data, each data item comprising a portion of the data and a pointer to a next data item on the list, and generating a recipe that instructs a given one of the one or more processors to store the data in the plurality of non-volatile memory devices and points to a first data item on the linked list of data items.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Patent Application 61/145,562, filed Jan. 18, 2009, U.S. Provisional Patent Application 61/163,133, filed Mar. 25, 2009, U.S. Provisional Patent Application 61/163,138, filed Mar. 25, 2009, and U.S. Provisional Patent Application 61/294,498, filed Jan. 13, 2010, whose disclosures are incorporated herein by reference.

US Referenced Citations (571)
Number Name Date Kind
3668631 Griffith et al. Jun 1972 A
3668632 Oldham Jun 1972 A
4058851 Scheuneman Nov 1977 A
4112502 Scheuneman Sep 1978 A
4394763 Nagano et al. Jul 1983 A
4413339 Riggle et al. Nov 1983 A
4556961 Iwahashi et al. Dec 1985 A
4558431 Satoh Dec 1985 A
4608687 Dutton Aug 1986 A
4654847 Dutton Mar 1987 A
4661929 Aoki et al. Apr 1987 A
4768171 Tada Aug 1988 A
4811285 Walker et al. Mar 1989 A
4899342 Potter et al. Feb 1990 A
4910706 Hyatt Mar 1990 A
4993029 Galbraith et al. Feb 1991 A
5056089 Furuta et al. Oct 1991 A
5077722 Geist et al. Dec 1991 A
5126808 Montalvo et al. Jun 1992 A
5163021 Mehrotra et al. Nov 1992 A
5172338 Mehrotra et al. Dec 1992 A
5182558 Mayo Jan 1993 A
5182752 DeRoo et al. Jan 1993 A
5191584 Anderson Mar 1993 A
5200959 Gross et al. Apr 1993 A
5237535 Mielke et al. Aug 1993 A
5272669 Samachisa et al. Dec 1993 A
5276649 Hoshita et al. Jan 1994 A
5287469 Tsuboi Feb 1994 A
5365484 Cleveland et al. Nov 1994 A
5388064 Khan Feb 1995 A
5416646 Shirai May 1995 A
5416782 Wells et al. May 1995 A
5446854 Khalidi et al. Aug 1995 A
5450424 Okugaki et al. Sep 1995 A
5469444 Endoh et al. Nov 1995 A
5473753 Wells et al. Dec 1995 A
5479170 Cauwenberghs et al. Dec 1995 A
5508958 Fazio et al. Apr 1996 A
5519831 Holzhammer May 1996 A
5532962 Auclair et al. Jul 1996 A
5533190 Binford et al. Jul 1996 A
5541886 Hasbun Jul 1996 A
5600677 Citta et al. Feb 1997 A
5638320 Wong et al. Jun 1997 A
5657332 Auclair et al. Aug 1997 A
5675540 Roohparvar Oct 1997 A
5682352 Wong et al. Oct 1997 A
5687114 Khan Nov 1997 A
5696717 Koh Dec 1997 A
5726649 Tamaru et al. Mar 1998 A
5726934 Tran et al. Mar 1998 A
5742752 De Koening Apr 1998 A
5748533 Dunlap et al. May 1998 A
5748534 Dunlap et al. May 1998 A
5751637 Chen et al. May 1998 A
5761402 Kaneda et al. Jun 1998 A
5798966 Keeney Aug 1998 A
5799200 Brant et al. Aug 1998 A
5801985 Roohparvar et al. Sep 1998 A
5838832 Barnsley Nov 1998 A
5860106 Domen et al. Jan 1999 A
5867114 Barbir Feb 1999 A
5867428 Ishii et al. Feb 1999 A
5867429 Chen et al. Feb 1999 A
5877986 Harari et al. Mar 1999 A
5889937 Tamagawa Mar 1999 A
5901089 Korsh et al. May 1999 A
5909449 So et al. Jun 1999 A
5912906 Wu et al. Jun 1999 A
5930167 Lee et al. Jul 1999 A
5937424 Leak et al. Aug 1999 A
5942004 Cappelletti Aug 1999 A
5946716 Karp et al. Aug 1999 A
5956743 Bruce et al. Sep 1999 A
5969986 Wong et al. Oct 1999 A
5982668 Ishii et al. Nov 1999 A
5991517 Harari et al. Nov 1999 A
5995417 Chen et al. Nov 1999 A
6009014 Hollmer et al. Dec 1999 A
6009016 Ishii et al. Dec 1999 A
6023425 Ishii et al. Feb 2000 A
6034891 Norman Mar 2000 A
6040993 Chen et al. Mar 2000 A
6041430 Yamauchi Mar 2000 A
6073204 Lakhani et al. Jun 2000 A
6101614 Gonzales et al. Aug 2000 A
6128237 Shirley et al. Oct 2000 A
6134140 Tanaka et al. Oct 2000 A
6134143 Norman Oct 2000 A
6134631 Jennings Oct 2000 A
6141261 Patti Oct 2000 A
6151246 So et al. Nov 2000 A
6157573 Ishii et al. Dec 2000 A
6166962 Chen et al. Dec 2000 A
6169691 Pasotti et al. Jan 2001 B1
6178466 Gilbertson et al. Jan 2001 B1
6185134 Tanaka et al. Feb 2001 B1
6209113 Roohparvar Mar 2001 B1
6212654 Lou et al. Apr 2001 B1
6219276 Parker Apr 2001 B1
6219447 Lee et al. Apr 2001 B1
6222762 Guterman et al. Apr 2001 B1
6230233 Lofgren et al. May 2001 B1
6240458 Gilbertson May 2001 B1
6259627 Wong Jul 2001 B1
6275419 Guterman et al. Aug 2001 B1
6278632 Chevallier Aug 2001 B1
6279069 Robinson et al. Aug 2001 B1
6288944 Kawamura Sep 2001 B1
6292394 Cohen et al. Sep 2001 B1
6301151 Engh et al. Oct 2001 B1
6304486 Yano Oct 2001 B1
6307776 So et al. Oct 2001 B1
6314044 Sasaki et al. Nov 2001 B1
6317363 Guterman et al. Nov 2001 B1
6317364 Guterman et al. Nov 2001 B1
6345004 Omura et al. Feb 2002 B1
6360346 Miyauchi et al. Mar 2002 B1
6363008 Wong Mar 2002 B1
6363454 Lakhani et al. Mar 2002 B1
6366496 Torelli et al. Apr 2002 B1
6385092 Ishii et al. May 2002 B1
6392932 Ishii et al. May 2002 B1
6396742 Korsh et al. May 2002 B1
6397364 Barkan May 2002 B1
6405323 Lin et al. Jun 2002 B1
6405342 Lee Jun 2002 B1
6418060 Yang et al. Jul 2002 B1
6442585 Dean et al. Aug 2002 B1
6445602 Kokudo et al. Sep 2002 B1
6452838 Ishii et al. Sep 2002 B1
6456528 Chen Sep 2002 B1
6466476 Wong et al. Oct 2002 B1
6467062 Barkan Oct 2002 B1
6469931 Ban et al. Oct 2002 B1
6480948 Virajpet et al. Nov 2002 B1
6490236 Fukuda et al. Dec 2002 B1
6522580 Chen et al. Feb 2003 B2
6525952 Araki et al. Feb 2003 B2
6532556 Wong et al. Mar 2003 B1
6538922 Khalid et al. Mar 2003 B1
6549464 Tanaka et al. Apr 2003 B2
6553510 Pekny Apr 2003 B1
6558967 Wong May 2003 B1
6560152 Cernea May 2003 B1
6567311 Ishii et al. May 2003 B2
6577539 Iwahashi Jun 2003 B2
6584012 Banks Jun 2003 B2
6615307 Roohparvar Sep 2003 B1
6621739 Gonzalez et al. Sep 2003 B2
6640326 Buckingham et al. Oct 2003 B1
6643169 Rudelic et al. Nov 2003 B2
6646913 Micheloni et al. Nov 2003 B2
6678192 Gongwer et al. Jan 2004 B2
6683811 Ishii et al. Jan 2004 B2
6687155 Nagasue Feb 2004 B2
6707748 Lin et al. Mar 2004 B2
6708257 Bao Mar 2004 B2
6714449 Khalid Mar 2004 B2
6717847 Chen Apr 2004 B2
6725321 Sinclair et al. Apr 2004 B1
6731557 Beretta May 2004 B2
6732250 Durrant May 2004 B2
6738293 Iwahashi May 2004 B1
6751766 Guterman et al. Jun 2004 B2
6757193 Chen et al. Jun 2004 B2
6774808 Hibbs et al. Aug 2004 B1
6781877 Cernea et al. Aug 2004 B2
6804805 Rub Oct 2004 B2
6807095 Chen et al. Oct 2004 B2
6807101 Ooishi et al. Oct 2004 B2
6809964 Moschopoulos et al. Oct 2004 B2
6819592 Noguchi et al. Nov 2004 B2
6829167 Tu et al. Dec 2004 B2
6845052 Ho et al. Jan 2005 B1
6851018 Wyatt et al. Feb 2005 B2
6851081 Yamamoto Feb 2005 B2
6856546 Guterman et al. Feb 2005 B2
6862218 Guterman et al. Mar 2005 B2
6870767 Rudelic et al. Mar 2005 B2
6870773 Noguchi et al. Mar 2005 B2
6873552 Ishii et al. Mar 2005 B2
6879520 Hosono et al. Apr 2005 B2
6882567 Wong Apr 2005 B1
6894926 Guterman et al. May 2005 B2
6907497 Hosono et al. Jun 2005 B2
6925009 Noguchi et al. Aug 2005 B2
6930925 Guo et al. Aug 2005 B2
6934188 Roohparvar Aug 2005 B2
6937511 Hsu et al. Aug 2005 B2
6958938 Noguchi et al. Oct 2005 B2
6963505 Cohen Nov 2005 B2
6972993 Conley et al. Dec 2005 B2
6988175 Lasser Jan 2006 B2
6992932 Cohen Jan 2006 B2
6999344 Hosono et al. Feb 2006 B2
7002843 Guterman et al. Feb 2006 B2
7006379 Noguchi et al. Feb 2006 B2
7012835 Gonzalez et al. Mar 2006 B2
7020017 Chen et al. Mar 2006 B2
7023735 Ban et al. Apr 2006 B2
7031210 Park et al. Apr 2006 B2
7031214 Tran Apr 2006 B2
7031216 You Apr 2006 B2
7039846 Hewitt et al. May 2006 B2
7042766 Wang et al. May 2006 B1
7054193 Wong May 2006 B1
7054199 Lee et al. May 2006 B2
7057958 So et al. Jun 2006 B2
7065147 Ophir et al. Jun 2006 B2
7068539 Guterman et al. Jun 2006 B2
7071849 Zhang Jul 2006 B2
7072222 Ishii et al. Jul 2006 B2
7079555 Baydar et al. Jul 2006 B2
7088615 Guterman et al. Aug 2006 B2
7099194 Tu et al. Aug 2006 B2
7102924 Chen et al. Sep 2006 B2
7113432 Mokhlesi Sep 2006 B2
7130210 Bathul et al. Oct 2006 B2
7139192 Wong Nov 2006 B1
7139198 Guterman et al. Nov 2006 B2
7145805 Ishii et al. Dec 2006 B2
7151692 Wu Dec 2006 B2
7158058 Yu Jan 2007 B1
7161836 Wan et al. Jan 2007
7170781 So et al. Jan 2007 B2
7170802 Cernea et al. Jan 2007 B2
7173859 Hemink Feb 2007 B2
7177184 Chen Feb 2007 B2
7177195 Gonzalez et al. Feb 2007 B2
7177199 Chen et al. Feb 2007 B2
7177200 Ronen et al. Feb 2007 B2
7184338 Nagakawa et al. Feb 2007 B2
7187195 Kim Mar 2007 B2
7187592 Guterman et al. Mar 2007 B2
7190614 Wu Mar 2007 B2
7193898 Cernea Mar 2007 B2
7193921 Choi et al. Mar 2007 B2
7196644 Anderson et al. Mar 2007 B1
7196928 Chen Mar 2007 B2
7196933 Shibata Mar 2007 B2
7197594 Raz et al. Mar 2007 B2
7200062 Kinsely et al. Apr 2007 B2
7210077 Brandenberger et al. Apr 2007 B2
7221592 Nazarian May 2007 B2
7224613 Chen et al. May 2007 B2
7231474 Helms et al. Jun 2007 B1
7231562 Ohlhoff et al. Jun 2007 B2
7243275 Gongwer et al. Jul 2007 B2
7254690 Rao Aug 2007 B2
7254763 Aadsen et al. Aug 2007 B2
7257027 Park Aug 2007 B2
7259987 Chen et al. Aug 2007 B2
7266026 Gongwer et al. Sep 2007 B2
7266069 Chu Sep 2007 B2
7269066 Nguyen et al. Sep 2007 B2
7272757 Stocken Sep 2007 B2
7274611 Roohparvar Sep 2007 B2
7277355 Tanzana Oct 2007 B2
7280398 Lee et al. Oct 2007 B1
7280409 Misumi et al. Oct 2007 B2
7280415 Hwang et al. Oct 2007 B2
7283399 Ishii et al. Oct 2007 B2
7289344 Chen Oct 2007 B2
7301807 Khalid et al. Nov 2007 B2
7301817 Li et al. Nov 2007 B2
7308525 Lasser et al. Dec 2007 B2
7310255 Chan Dec 2007 B2
7310269 Shibata Dec 2007 B2
7310271 Lee Dec 2007 B2
7310272 Mokhesi et al. Dec 2007 B1
7310347 Lasser Dec 2007 B2
7312727 Feng et al. Dec 2007 B1
7321509 Chen et al. Jan 2008 B2
7328384 Kulkarni et al. Feb 2008 B1
7342831 Mokhlesi et al. Mar 2008 B2
7343330 Boesjes et al. Mar 2008 B1
7345924 Nguyen et al. Mar 2008 B2
7345928 Li Mar 2008 B2
7349263 Kim et al. Mar 2008 B2
7356755 Fackenthal Apr 2008 B2
7363420 Lin et al. Apr 2008 B2
7365671 Anderson Apr 2008 B1
7373452 Suh May 2008 B2
7388781 Litsyn et al. Jun 2008 B2
7397697 So et al. Jul 2008 B2
7405974 Yaoi et al. Jul 2008 B2
7405979 Ishii et al. Jul 2008 B2
7408804 Hemink et al. Aug 2008 B2
7408810 Aritome et al. Aug 2008 B2
7409473 Conley et al. Aug 2008 B2
7409623 Baker et al. Aug 2008 B2
7420847 Li Sep 2008 B2
7433231 Aritome Oct 2008 B2
7433697 Karaoguz et al. Oct 2008 B2
7434111 Sugiura et al. Oct 2008 B2
7437498 Ronen Oct 2008 B2
7440324 Mokhlesi Oct 2008 B2
7440331 Hemink Oct 2008 B2
7441067 Gorobetz et al. Oct 2008 B2
7447970 Wu et al. Nov 2008 B2
7450421 Mokhlesi et al. Nov 2008 B2
7453737 Ha Nov 2008 B2
7457163 Hemink Nov 2008 B2
7457897 Lee et al. Nov 2008 B1
7460410 Nagai et al. Dec 2008 B2
7460412 Lee et al. Dec 2008 B2
7466592 Mitani et al. Dec 2008 B2
7468907 Kang et al. Dec 2008 B2
7468911 Lutze et al. Dec 2008 B2
7469049 Feng Dec 2008 B1
7471581 Tran et al. Dec 2008 B2
7483319 Brown Jan 2009 B2
7487329 Hepkin et al. Feb 2009 B2
7487394 Forhan et al. Feb 2009 B2
7492641 Hosono et al. Feb 2009 B2
7508710 Mokhlesi Mar 2009 B2
7526711 Orio Apr 2009 B2
7539061 Lee May 2009 B2
7539062 Doyle May 2009 B2
7551492 Kim Jun 2009 B2
7558109 Brandman et al. Jul 2009 B2
7558839 McGovern Jul 2009 B1
7568135 Cornwell et al. Jul 2009 B2
7570520 Kamei et al. Aug 2009 B2
7574555 Porat et al. Aug 2009 B2
7590002 Mokhlesi et al. Sep 2009 B2
7593259 Kim Sep 2009 B2
7594093 Kancherla Sep 2009 B1
7596707 Vemula Sep 2009 B1
7609787 Jahan et al. Oct 2009 B2
7613043 Cornwell et al. Nov 2009 B2
7616498 Mokhlesi et al. Nov 2009 B2
7619918 Aritome Nov 2009 B2
7631245 Lasser Dec 2009 B2
7633798 Sarin et al. Dec 2009 B2
7633802 Mokhlesi Dec 2009 B2
7639532 Roohparvar et al. Dec 2009 B2
7644347 Alexander et al. Jan 2010 B2
7652922 Kim et al. Jan 2010 B2
7656734 Thorp et al. Feb 2010 B2
7660158 Aritome Feb 2010 B2
7660183 Ware et al. Feb 2010 B2
7661000 Ueda et al. Feb 2010 B2
7661054 Huffman et al. Feb 2010 B2
7665007 Yang et al. Feb 2010 B2
7680987 Clark et al. Mar 2010 B1
7733712 Walston et al. Jun 2010 B1
7742351 Inoue et al. Jun 2010 B2
7761624 Karamcheti et al. Jul 2010 B2
7797609 Neuman Sep 2010 B2
7810017 Radke Oct 2010 B2
7848149 Gonzalez et al. Dec 2010 B2
7869273 Lee et al. Jan 2011 B2
7885119 Li Feb 2011 B2
7904783 Brandman et al. Mar 2011 B2
7928497 Yaegashi Apr 2011 B2
7929549 Talbot Apr 2011 B1
7930515 Gupta et al. Apr 2011 B2
7945825 Cohen et al. May 2011 B2
7978516 Olbrich et al. Jul 2011 B2
8014094 Jin Sep 2011 B1
8037380 Cagno et al. Oct 2011 B2
8040744 Gorobets et al. Oct 2011 B2
8065583 Radke Nov 2011 B2
20010002172 Tanaka et al. May 2001 A1
20010006479 Ikehashi et al. Jul 2001 A1
20020038440 Barkan Mar 2002 A1
20020056064 Kidorf et al. May 2002 A1
20020118574 Gongwer et al. Aug 2002 A1
20020133684 Anderson Sep 2002 A1
20020166091 Kidorf et al. Nov 2002 A1
20020174295 Ulrich et al. Nov 2002 A1
20020196510 Hietala et al. Dec 2002 A1
20030002348 Chen et al. Jan 2003 A1
20030103400 Van Tran Jun 2003 A1
20030161183 Van Tran Aug 2003 A1
20030189856 Cho et al. Oct 2003 A1
20040057265 Mirabel et al. Mar 2004 A1
20040057285 Cernea et al. Mar 2004 A1
20040083333 Chang et al. Apr 2004 A1
20040083334 Chang et al. Apr 2004 A1
20040105311 Cernea et al. Jun 2004 A1
20040114437 Li Jun 2004 A1
20040160842 Fukiage Aug 2004 A1
20040223371 Roohparvar Nov 2004 A1
20050007802 Gerpheide Jan 2005 A1
20050013165 Ban Jan 2005 A1
20050024941 Lasser et al. Feb 2005 A1
20050024978 Ronen Feb 2005 A1
20050030788 Parkinson et al. Feb 2005 A1
20050086574 Fackenthal Apr 2005 A1
20050121436 Kamitani et al. Jun 2005 A1
20050144361 Gonzalez et al. Jun 2005 A1
20050157555 Ono et al. Jul 2005 A1
20050162913 Chen Jul 2005 A1
20050169051 Khalid et al. Aug 2005 A1
20050189649 Maruyama et al. Sep 2005 A1
20050213393 Lasser Sep 2005 A1
20050224853 Ohkawa Oct 2005 A1
20050240745 Iyer et al. Oct 2005 A1
20050243626 Ronen Nov 2005 A1
20060004952 Lasser Jan 2006 A1
20060028875 Avraham et al. Feb 2006 A1
20060028877 Meir Feb 2006 A1
20060101193 Murin May 2006 A1
20060106972 Gorobets et al. May 2006 A1
20060107136 Gongwer et al. May 2006 A1
20060129750 Lee et al. Jun 2006 A1
20060133141 Gorobets Jun 2006 A1
20060156189 Tomlin Jul 2006 A1
20060179334 Brittain et al. Aug 2006 A1
20060190699 Lee Aug 2006 A1
20060203546 Lasser Sep 2006 A1
20060218359 Sanders et al. Sep 2006 A1
20060221692 Chen Oct 2006 A1
20060221705 Hemink et al. Oct 2006 A1
20060221714 Li et al. Oct 2006 A1
20060239077 Park et al. Oct 2006 A1
20060239081 Roohparvar Oct 2006 A1
20060256620 Nguyen et al. Nov 2006 A1
20060256626 Werner et al. Nov 2006 A1
20060256891 Yuan et al. Nov 2006 A1
20060268609 Kim et al. Nov 2006 A1
20060271748 Jain et al. Nov 2006 A1
20060285392 Incarnati et al. Dec 2006 A1
20060285396 Ha Dec 2006 A1
20070006013 Moshayedi et al. Jan 2007 A1
20070019481 Park Jan 2007 A1
20070033581 Tomlin et al. Feb 2007 A1
20070047314 Goda et al. Mar 2007 A1
20070047326 Nguyen et al. Mar 2007 A1
20070050536 Kolokowsky Mar 2007 A1
20070058446 Hwang et al. Mar 2007 A1
20070061502 Lasser et al. Mar 2007 A1
20070067667 Ikeuchi et al. Mar 2007 A1
20070074093 Lasser Mar 2007 A1
20070076502 Pyeon et al. Apr 2007 A1
20070086239 Litsyn et al. Apr 2007 A1
20070086260 Sinclair Apr 2007 A1
20070089034 Litsyn et al. Apr 2007 A1
20070091677 Lasser et al. Apr 2007 A1
20070091694 Lee et al. Apr 2007 A1
20070103978 Conley et al. May 2007 A1
20070103986 Chen May 2007 A1
20070104211 Opsasnick May 2007 A1
20070109845 Chen May 2007 A1
20070109849 Chen May 2007 A1
20070115726 Cohen et al. May 2007 A1
20070118713 Guterman et al. May 2007 A1
20070143378 Gorobetz Jun 2007 A1
20070143531 Atri Jun 2007 A1
20070159889 Kang et al. Jul 2007 A1
20070159892 Kang et al. Jul 2007 A1
20070159907 Kwak Jul 2007 A1
20070168837 Murin Jul 2007 A1
20070171714 Wu et al. Jul 2007 A1
20070183210 Choi et al. Aug 2007 A1
20070189073 Aritome Aug 2007 A1
20070195602 Fong et al. Aug 2007 A1
20070206426 Mokhlesi Sep 2007 A1
20070208904 Hsieh et al. Sep 2007 A1
20070226599 Motwani Sep 2007 A1
20070233939 Kim Oct 2007 A1
20070236990 Aritome Oct 2007 A1
20070253249 Kang et al. Nov 2007 A1
20070256620 Viggiano et al. Nov 2007 A1
20070263455 Cornwell et al. Nov 2007 A1
20070266232 Rodgers et al. Nov 2007 A1
20070271424 Lee et al. Nov 2007 A1
20070280000 Fujiu et al. Dec 2007 A1
20070291571 Balasundaram Dec 2007 A1
20070297234 Cernea et al. Dec 2007 A1
20080010395 Mylly et al. Jan 2008 A1
20080025121 Tanzawa Jan 2008 A1
20080043535 Roohparvar Feb 2008 A1
20080049504 Kasahara et al. Feb 2008 A1
20080049506 Guterman Feb 2008 A1
20080052446 Lasser et al. Feb 2008 A1
20080055993 Lee Mar 2008 A1
20080080243 Edahiro et al. Apr 2008 A1
20080082730 Kim et al. Apr 2008 A1
20080089123 Chae et al. Apr 2008 A1
20080104309 Cheon et al. May 2008 A1
20080104312 Lasser May 2008 A1
20080109590 Jung et al. May 2008 A1
20080115017 Jacobson May 2008 A1
20080123420 Brandman et al. May 2008 A1
20080123426 Lutze et al. May 2008 A1
20080126686 Sokolov et al. May 2008 A1
20080130341 Shalvi et al. Jun 2008 A1
20080148115 Sokolov et al. Jun 2008 A1
20080151618 Sharon et al. Jun 2008 A1
20080151667 Miu et al. Jun 2008 A1
20080158958 Sokolov et al. Jul 2008 A1
20080181001 Shalvi Jul 2008 A1
20080198650 Shalvi et al. Aug 2008 A1
20080198654 Toda Aug 2008 A1
20080209116 Caulkins Aug 2008 A1
20080209304 Winarski et al. Aug 2008 A1
20080215798 Sharon et al. Sep 2008 A1
20080219050 Shalvi et al. Sep 2008 A1
20080239093 Easwar et al. Oct 2008 A1
20080239812 Abiko et al. Oct 2008 A1
20080253188 Aritome Oct 2008 A1
20080263262 Sokolov et al. Oct 2008 A1
20080263676 Mo et al. Oct 2008 A1
20080270730 Lasser et al. Oct 2008 A1
20080282106 Shalvi et al. Nov 2008 A1
20080288714 Salomon et al. Nov 2008 A1
20090013233 Radke Jan 2009 A1
20090024905 Shalvi et al. Jan 2009 A1
20090034337 Aritome Feb 2009 A1
20090043831 Antonopoulos et al. Feb 2009 A1
20090043951 Shalvi et al. Feb 2009 A1
20090049234 Oh et al. Feb 2009 A1
20090073762 Lee et al. Mar 2009 A1
20090086542 Lee et al. Apr 2009 A1
20090089484 Chu Apr 2009 A1
20090091979 Shalvi Apr 2009 A1
20090094930 Schwoerer Apr 2009 A1
20090106485 Anholt Apr 2009 A1
20090112949 Ergan et al. Apr 2009 A1
20090132755 Radke May 2009 A1
20090144600 Perlmutter et al. Jun 2009 A1
20090150894 Huang et al. Jun 2009 A1
20090157950 Selinger Jun 2009 A1
20090157964 Kasorla et al. Jun 2009 A1
20090158126 Perlmutter et al. Jun 2009 A1
20090168524 Golov et al. Jul 2009 A1
20090172257 Prins et al. Jul 2009 A1
20090172261 Prins et al. Jul 2009 A1
20090193184 Yu et al. Jul 2009 A1
20090199074 Sommer et al. Aug 2009 A1
20090204824 Lin et al. Aug 2009 A1
20090204872 Yu et al. Aug 2009 A1
20090213653 Perlmutter et al. Aug 2009 A1
20090213654 Perlmutter et al. Aug 2009 A1
20090225595 Kim Sep 2009 A1
20090228761 Perlmutter et al. Sep 2009 A1
20090240872 Perlmutter et al. Sep 2009 A1
20090248964 Yano et al. Oct 2009 A1
20090265509 Klein Oct 2009 A1
20090300227 Nochimowski et al. Dec 2009 A1
20090323412 Mokhlesi et al. Dec 2009 A1
20090327608 Eschmann Dec 2009 A1
20100017650 Chin et al. Jan 2010 A1
20100034022 Dutta et al. Feb 2010 A1
20100057976 Lasser Mar 2010 A1
20100061151 Miwa et al. Mar 2010 A1
20100082883 Chen et al. Apr 2010 A1
20100083247 Kanevsky et al. Apr 2010 A1
20100110580 Takashima May 2010 A1
20100131697 Alrod et al. May 2010 A1
20100142268 Aritome Jun 2010 A1
20100142277 Yang et al. Jun 2010 A1
20100169547 Ou Jul 2010 A1
20100169743 Vogan et al. Jul 2010 A1
20100174847 Paley et al. Jul 2010 A1
20100174851 Leibowitz et al. Jul 2010 A1
20100211803 Lablans Aug 2010 A1
20100287217 Borchers et al. Nov 2010 A1
20110010489 Yeh Jan 2011 A1
20110060969 Ramamoorthy et al. Mar 2011 A1
20110066793 Burd Mar 2011 A1
20110075482 Shepard et al. Mar 2011 A1
20110107049 Kwon et al. May 2011 A1
20110149657 Haratsch et al. Jun 2011 A1
20110199823 Bar-Or et al. Aug 2011 A1
20110302354 Miller Dec 2011 A1
Foreign Referenced Citations (43)
Number Date Country
0783754 Jul 1997 EP
1434236 Jun 2004 EP
1605509 Dec 2005 EP
9610256 Apr 1996 WO
9828745 Jul 1998 WO
02100112 Dec 2002 WO
03100791 Dec 2003 WO
2007046084 Apr 2007 WO
2007132452 Nov 2007 WO
2007132453 Nov 2007 WO
2007132456 Nov 2007 WO
2007132457 Nov 2007 WO
2007132458 Nov 2007 WO
2007146010 Dec 2007 WO
2008026203 Mar 2008 WO
2008053472 May 2008 WO
2008053473 May 2008 WO
2008068747 Jun 2008 WO
2008077284 Jul 2008 WO
2008083131 Jul 2008 WO
2008099958 Aug 2008 WO
2008111058 Sep 2008 WO
2008124760 Oct 2008 WO
2008139441 Nov 2008 WO
2009037691 Mar 2009 WO
2009037697 Mar 2009 WO
2009038961 Mar 2009 WO
2009050703 Apr 2009 WO
2009053961 Apr 2009 WO
2009053962 Apr 2009 WO
2009053963 Apr 2009 WO
2009063450 May 2009 WO
2009072100 Jun 2009 WO
2009072101 Jun 2009 WO
2009072102 Jun 2009 WO
2009072103 Jun 2009 WO
2009072104 Jun 2009 WO
2009072105 Jun 2009 WO
2009074978 Jun 2009 WO
2009074979 Jun 2009 WO
2009078006 Jun 2009 WO
2009095902 Aug 2009 WO
2011024015 Mar 2011 WO
Non-Patent Literature Citations (104)
Entry
Jedec Standard JESD84-C44, “Embedded MultiMediaCard (e•MMC) Mechanical Standard, with Optional Reset Signal”, Jedec Solid State Technology Association, USA, Jul. 2009.
Jedec, “UFS Specification”, version 0.1, Nov. 11, 2009.
SD Group and SD Card Association, “SD Specifications Part 1 Physical Layer Specification”, version 3.01, draft 1.00, Nov. 9, 2009.
Compaq et al., “Universal Serial Bus Specification”, revision 2.0, Apr. 27, 2000.
Serial ATA International Organization, “Serial ATA Revision 3.0 Specification”, Jun. 2, 2009.
Gotou, H., “An Experimental Confirmation of Automatic Threshold Voltage Convergence in a Flash Memory Using Alternating Word-Line Voltage Pulses”, IEEE Electron Device Letters, vol. 18, No. 10, pp. 503-505, Oct. 1997.
Numonyx, “M25PE16: 16-Mbit, page-erasable serial flash memory with byte-alterability, 75 MHz SPI bus, standard pinout”, Apr. 2008.
Hong et al., “NAND Flash-based Disk Cache Using SLC/MLC Combined Flash Memory”, 2010 International Workshop on Storage Network Architecture and Parallel I/Os, pp. 21-30, USA, May 3, 2010.
Kim et al., “Multi-bit Error Tolerant Caches Using Two-Dimensional Error Coding”, Proceedings of the 40th Annual ACM/IEEE International Symposium on Microarchitecture (MICRO-40), Chicago, USA, Dec. 1-5, 2007.
Engineering Windows 7, “Support and Q&A for Solid-State Drives”, e7blog, May 5, 2009.
Micron Technology Inc., “Memory Management in NAND Flash Arrays”, Technical Note, year 2005.
Kang et al., “A Superblock-based Flash Translation Layer for NAND Flash Memory”, Proceedings of the 6th ACM & IEEE International Conference on Embedded Software, pp. 161-170, Seoul, Korea, Oct. 22-26, 2006.
Park et al., “Sub-Grouped Superblock Management for High-Performance Flash Storages”, IEICE Electronics Express, vol. 6, No. 6, pp. 297-303, Mar. 25, 2009.
“How to Resolve “Bad Super Block: Magic Number Wrong” in BSD”, Free Online Articles Director Article Base, posted Sep. 5, 2009.
UBUNTU Forums, “Memory Stick Failed IO Superblock”, posted Nov. 11, 2009.
Super User Forums, “SD Card Failure, can't read superblock”, posted Aug. 8, 2010.
Agrell et al., “Closest Point Search in Lattices”, IEEE Transactions on Information Theory, vol. 48, No. 8, pp. 2201-2214, Aug. 2002.
Bez et al., “Introduction to Flash memory”, Proceedings of the IEEE, vol. 91, No. 4, pp. 489-502, Apr. 2003.
Blahut, R.E., “Theory and Practice of Error Control Codes,” Addison-Wesley, May 1984, section 3.2, pp. 47-48.
Chang, L., “Hybrid Solid State Disks: Combining Heterogeneous NAND Flash in Large SSDs”, ASPDAC, Jan. 2008.
Cho et al., “Multi-Level NAND Flash Memory with Non-Uniform Threshold Voltage Distribution,” IEEE International Solid-State Circuits Conference (ISSCC), San Francisco, CA, Feb. 5-7, 2001, pp. 28-29 and 424.
Databahn™, “Flash memory controller IP”, Denali Software, Inc., 1994 https://www.denali.com/en/products/databahn—flash.jsp.
Datalight, Inc., “FlashFX Pro 3.1 High Performance Flash Manager for Rapid Development of Reliable Products”, Nov. 16, 2006.
Duann, N., Silicon Motion Presentation “SLC & MLC Hybrid”, Flash Memory Summit, Santa Clara, USA, Aug. 2008.
Eitan et al., “Can NROM, a 2-bit, Trapping Storage NVM Cell, Give a Real Challenge to Floating Gate Cells?”, Proceedings of the 1999 International Conference on Solid State Devices and Materials (SSDM), pp. 522-524, Tokyo, Japan 1999.
Eitan et al., “Multilevel Flash Cells and their Trade-Offs”, Proceedings of the 1996 IEEE International Electron Devices Meeting (IEDM), pp. 169-172, New York, USA 1996.
Engh et al., “A self adaptive programming method with 5 mV accuracy for multi-level storage in FLASH”, pp. 115-118, Proceedings of the IEEE 2002 Custom Integrated Circuits Conference, May 12-15, 2002.
Goodman et al., “On-Chip ECC for Multi-Level Random Access Memories,” Proceedings of the IEEE/CAM Information Theory Workshop, Ithaca, USA, Jun. 25-29, 1989.
Han et al., “An Intelligent Garbage Collection Algorithm for Flash Memory Storages”, Computational Science and Its Applications—ICCSA 2006, vol. 3980/2006, pp. 1019-1027, Springer Berlin / Heidelberg, Germany, May 11, 2006.
Han et al., “CATA: A Garbage Collection Scheme for Flash Memory File Systems”, Ubiquitous Intelligence and Computing, vol. 4159/2006, pp. 103-112, Springer Berlin / Heidelberg, Aug. 25, 2006.
Horstein, “On the Design of Signals for Sequential and Nonsequential Detection Systems with Feedback,” IEEE Transactions on Information Theory IT-12:4 (Oct. 1966), pp. 448-455.
Jung et al., In “A 117 mm.sup.2 3.3V Only 128 Mb Multilevel NAND Flash Memory for Mass Storage Applications,” IEEE Journal of Solid State Circuits, (11:31), Nov. 1996, pp. 1575-1583.
Kawaguchi et al. 1995. A flash-memory based file system. In Proceedings of the USENIX 1995 Technical Conference , New Orleans, Louisiana. 155-164.
Kim et al., “Future Memory Technology including Emerging New Memories”, Proceedings of the 24th International Conference on Microelectronics (MIEL), vol. 1, pp. 377-384, Nis, Serbia and Montenegro, May 16-19, 2004.
Lee et al., “Effects of Floating Gate Interference on NAND Flash Memory Cell Operation”, IEEE Electron Device Letters, vol. 23, No. 5, pp. 264-266, May 2002.
Maayan et al., “A 512 Mb NROM Flash Data Storage Memory with 8 MB/s Data Rate”, Proceedings of the 2002 IEEE International Solid-State circuits Conference (ISSCC 2002), pp. 100-101, San Francisco, USA, Feb. 3-7, 2002.
Mielke et al., “Recovery Effects in the Distributed Cycling of Flash Memories”, IEEE 44th Annual International Reliability Physics Symposium, pp. 29-35, San Jose, USA, Mar. 2006.
Onfi, “Open NAND Flash Interface Specification,” revision 1.0, Dec. 28, 2006.
Phison Electronics Corporation, “PS8000 Controller Specification (for SD Card)”, revision 1.2, Document No. S-07018, Mar. 28, 2007.
Shalvi, et al., “Signal Codes,” Proceedings of the 2003 IEEE Information Theory Workshop (ITW'2003), Paris, France, Mar. 31-Apr. 4, 2003.
Shiozaki, A., “Adaptive Type-II Hybrid Broadcast ARQ System”, IEEE Transactions on Communications, vol. 44, Issue 4, pp. 420-422, Apr. 1996.
Suh et al., “A 3.3V 32Mb NAND Flash Memory with Incremental Step Pulse Programming Scheme”, IEEE Journal of Solid-State Circuits, vol. 30, No. 11, pp. 1149-1156, Nov. 1995.
ST Microelectronics, “Bad Block Management in NAND Flash Memories”, Application note AN-1819, Geneva, Switzerland, May 2004.
ST Microelectronics, “Wear Leveling in Single Level Cell NAND Flash Memories,” Application note AN-1822 Geneva, Switzerland, Feb. 2007.
Takeuchi et al., “A Double Level VTH Select Gate Array Architecture for Multi-Level NAND Flash Memories”, Digest of Technical Papers, 1995 Symposium on VLSI Circuits, pp. 69-70, Jun. 8-10, 1995.
Takeuchi et al., “A Multipage Cell Architecture for High-Speed Programming Multilevel NAND Flash Memories”, IEEE Journal of Solid State Circuits, vol. 33, No. 8, Aug. 1998.
Wu et al., “eNVy: A non-Volatile, Main Memory Storage System”, Proceedings of the 6th International Conference on Architectural support for programming languages and operating systems, pp. 86-87, San Jose, USA, 1994.
International Application PCT/IL2007/000575 Patentability report dated Mar. 26, 2009.
International Application PCT/IL2007/000575 Search Report dated May 30, 2008.
International Application PCT/IL2007/000576 Patentability Report dated Mar. 19, 2009.
International Application PCT/IL2007/000576 Search Report dated Jul. 7, 2008.
International Application PCT/IL2007/000579 Patentability report dated Mar. 10, 2009.
International Application PCT/IL2007/000579 Search report dated Jul. 3, 2008.
International Application PCT/IL2007/000580 Patentability Report dated Mar. 10, 2009.
International Application PCT/IL2007/000580 Search Report dated Sep. 11, 2008.
International Application PCT/IL2007/000581 Patentability Report dated Mar. 26, 2009.
International Application PCT/IL2007/000581 Search Report dated Aug. 25, 2008.
International Application PCT/IL2007/001059 Patentability report dated Apr. 19, 2009.
International Application PCT/IL2007/001059 Search report dated Aug. 7, 2008.
International Application PCT/IL2007/001315 search report dated Aug. 7, 2008.
International Application PCT/IL2007/001315 Patentability Report dated May 5, 2009.
International Application PCT/IL2007/001316 Search report dated Jul. 22, 2008.
International Application PCT/IL2007/001316 Patentability Report dated May 5, 2009.
International Application PCT/IL2007/001488 Search report dated Jun. 20, 2008.
International Application PCT/IL2008/000329 Search report dated Nov. 25, 2008.
International Application PCT/IL2008/000519 Search report dated Nov. 20, 2008.
International Application PCT/IL2008/001188 Search Report dated Jan. 28, 2009.
International Application PCT/IL2008/001356 Search Report dated Feb. 3, 2009.
International Application PCT/IL2008/001446 Search report dated Feb. 20, 2009.
U.S. Appl. No. 11/949,135 Official Action dated Oct. 2, 2009.
U.S. Appl. No. 12/019,011 Official Action dated Nov. 20, 2009.
Sommer, N., U.S. Appl. No. 12/171,797 “Memory Device with Non-Uniform Programming Levels” filed Jul. 11, 2008.
Shalvi et al., U.S. Appl. No. 12/251,471 “Compensation for Voltage Drifts in Analog Memory Cells” filed Oct. 15, 2008.
Sommer et al., U.S. Appl. No. 12/497,707 “Data Storage in Analog Memory Cells with Protection Against Programming Interruption” filed Jul. 6, 2009.
Winter et al., U.S. Appl. No. 12/534,893 “Improved Data Storage in Analog Memory Cells Using Modified Pass Voltages” filed Aug. 4, 2009.
Winter et al. U.S. Appl. No. 12/534,898 “Data Storage Using Modified Voltages” filed Aug. 4, 2009.
Shalvi et al., U.S. Appl. No. 12/551,583 “Segmented Data Storage” filed Sep. 1, 2009.
Shalvi et al., U.S. Appl. No. 12/551,567 “Reliable Data Storage in Analog Memory Cells Subjected to Long Retention Periods” filed Sep. 1, 2009.
Perlmutter et al., U.S. Appl. No. 12/558,528 “Estimation of Memory Cell Read Thresholds by Sampling Inside Programming Level Distribution Intervals” filed Sep. 13, 2009.
Sokolov, D., U.S. Appl. No. 12/579,430 “Efficient Programming of Analog Memory Cell Devices” filed Oct. 15, 2009.
Shalvi, O., U.S. Appl. No. 12/579,432 “Efficient Data Storage in Storage Device Arrays” filed Oct. 15, 2009.
Sommer et al., U.S. Appl. No. 12/607,078 “Data Scrambling in Memory Devices” filed Oct. 28, 2009.
Sommer et al., U.S. Appl. No. 12/607,085 “Data Scrambling Schemes for Memory Devices” filed Oct. 28, 2009.
Shalvi et al., U.S. Appl. No. 12/618,732 “Storage at M Bits/Cell Density in N Bits/Cell Analog Memory Cell Devices, M>N” filed Nov. 15, 2009.
Sommer et al., U.S. Appl. No. 12/649,358 “Efficient Readout Schemes for Analog Memory Cell Devices” filed Dec. 30, 2009.
Sommer et al., U.S. Appl. No. 12/649,360 “Efficient Readout Schemes for Analog Memory Cell Devices Using Multiple Read Threshold Sets” filed Dec. 30, 2009.
Rotbard et al., U.S. Appl. No. 12/649,382 “Rejuvenation of Analog Memory Cells” filed Dec. 30, 2009.
Shachar et al., U.S. Appl. No. 12/688,883 “Hierarchical data storage system” filed Jan. 17, 2010.
Ankolekar et al., “Multibit Error-Correction Methods for Latency-Constrained Flash Memory Systems”, IEEE Transactions on Device and Materials Reliability, vol. 10, No. 1, pp. 33-39, Mar. 2010.
Berman et al., “Mitigating Inter-Cell Coupling Effects in MLC NAND Flash via Constrained Coding”, Flash Memory Summit, Santa Clara, USA, Aug. 19, 2010.
CN Patent Application # 200780026181.3 Official Action dated Apr. 8, 2011.
Chinese Patent Application # 200780026181.3 Official Action dated Mar. 7, 2012.
Chinese Patent Application # 200780026094.8 Official Action dated Feb. 2, 2012.
Budilovsky et al., “Prototyping a High-Performance Low-Cost Solid-State Disk”, SYSTOR—The 4th Annual International Systems and Storage Conference, Haifa, Israel, May 30-Jun. 1, 2011.
NVM Express Protocol, “NVM Express”, Revision 1.0b, Jul. 12, 2011.
SCSI Protocol, “Information Technology—SCSI Architecture Model-5 (SAM-5)”, INCITS document T10/2104-D, revision 01, Jan. 28, 2009.
SAS Protocol, “Information Technology—Serial Attached SCSI-2 (SAS-2)”, INCITS document T10/1760-D, revision 15a, Feb. 22, 2009.
Wei, L., “Trellis-Coded Modulation With Multidimensional Constellations”, IEEE Transactions on Information Theory, vol. IT-33, No. 4, pp. 483-501, Jul. 1987.
Conway et al., “Sphere Packings, Lattices and Groups”, 3rd edition, chapter 4, pp. 94-135, Springer, New York, USA 1998.
Chinese Patent Application # 200780040493.X Official Action dated Jun. 15, 2011.
Huffman, A., “Non-Volatile Memory Host Controller Interface (NVMHCI)”, Specification 1.0, Apr. 14, 2008.
Panchbhai et al., “Improving Reliability of NAND Based Flash Memory Using Hybrid SLC/MLC Device”, Project Proposal for CSci 8980—Advanced Storage Systems, University of Minnesota, USA, Spring 2009.
Shalvi et al., U.S. Appl. No. 12/822,207 “Adaptive Over-Provisioning in Memory Systems” filed Jun. 24, 2010.
International Search Report and Written Opinion from PCT/2013/056069, mailed Nov. 29, 2013, Apple Inc., pp. 1-9.
Provisional Applications (4)
Number Date Country
61145562 Jan 2009 US
61163133 Mar 2009 US
61163138 Mar 2009 US
61294498 Jan 2010 US