US20090013148A1 - Block addressing for parallel memory arrays - Google Patents

Block addressing for parallel memory arrays Download PDF

Info

Publication number
US20090013148A1
US20090013148A1 US11/773,321 US77332107A US2009013148A1 US 20090013148 A1 US20090013148 A1 US 20090013148A1 US 77332107 A US77332107 A US 77332107A US 2009013148 A1 US2009013148 A1 US 2009013148A1
Authority
US
United States
Prior art keywords
memory
blocks
addresses
array
address
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US11/773,321
Other languages
English (en)
Inventor
David Eggleston
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
US Bank NA
Original Assignee
Micron Technology Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Micron Technology Inc filed Critical Micron Technology Inc
Priority to US11/773,321 priority Critical patent/US20090013148A1/en
Assigned to MICRON TECHNOLOGY, INC. reassignment MICRON TECHNOLOGY, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: EGGLESTON, DAVID
Priority to CN2008801022316A priority patent/CN101772810B/zh
Priority to PCT/US2008/068849 priority patent/WO2009006442A1/en
Priority to KR1020107002399A priority patent/KR101573089B1/ko
Priority to TW097124899A priority patent/TWI376601B/zh
Publication of US20090013148A1 publication Critical patent/US20090013148A1/en
Priority to US14/616,468 priority patent/US9436609B2/en
Assigned to U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT reassignment U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT SECURITY INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: MICRON TECHNOLOGY, INC.
Assigned to MORGAN STANLEY SENIOR FUNDING, INC., AS COLLATERAL AGENT reassignment MORGAN STANLEY SENIOR FUNDING, INC., AS COLLATERAL AGENT PATENT SECURITY AGREEMENT Assignors: MICRON TECHNOLOGY, INC.
Assigned to U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT reassignment U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT CORRECTIVE ASSIGNMENT TO CORRECT THE REPLACE ERRONEOUSLY FILED PATENT #7358718 WITH THE CORRECT PATENT #7358178 PREVIOUSLY RECORDED ON REEL 038669 FRAME 0001. ASSIGNOR(S) HEREBY CONFIRMS THE SECURITY INTEREST. Assignors: MICRON TECHNOLOGY, INC.
Assigned to JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT reassignment JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT SECURITY INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: MICRON SEMICONDUCTOR PRODUCTS, INC., MICRON TECHNOLOGY, INC.
Assigned to MICRON TECHNOLOGY, INC. reassignment MICRON TECHNOLOGY, INC. RELEASE BY SECURED PARTY (SEE DOCUMENT FOR DETAILS). Assignors: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT
Assigned to MICRON TECHNOLOGY, INC. reassignment MICRON TECHNOLOGY, INC. RELEASE BY SECURED PARTY (SEE DOCUMENT FOR DETAILS). Assignors: MORGAN STANLEY SENIOR FUNDING, INC., AS COLLATERAL AGENT
Assigned to MICRON TECHNOLOGY, INC., MICRON SEMICONDUCTOR PRODUCTS, INC. reassignment MICRON TECHNOLOGY, INC. RELEASE BY SECURED PARTY (SEE DOCUMENT FOR DETAILS). Assignors: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Abandoned legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023—Free address space management
    • G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
    • G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0844—Multiple simultaneous or quasi-simultaneous cache accessing
    • G06F12/0853—Cache with multiport tag or data arrays
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/10—Address translation
    • G06F12/1072—Decentralised address translation, e.g. in distributed shared memory systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/061—Improving I/O performance
    • G06F3/0611—Improving I/O performance in relation to response time
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0614—Improving the reliability of storage systems
    • G06F3/0619—Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638—Organizing or formatting or addressing of data
    • G06F3/064—Management of blocks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
    • G06F3/0656—Data buffering arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671—In-line storage system
    • G06F3/0683—Plurality of storage devices
    • G06F3/0688—Non-volatile semiconductor memory arrays
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C29/00—Checking stores for correct operation ; Subsequent repair; Testing stores during standby or offline operation
    • G11C29/70—Masking faults in memories by using spares or by reconfiguring
    • G11C29/76—Masking faults in memories by using spares or by reconfiguring using address translation or modifications
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C8/00—Arrangements for selecting an address in a digital store
    • G11C8/12—Group selection circuits, e.g. for memory block selection, chip selection, array selection
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/0292—User address space allocation, e.g. contiguous or non contiguous base addressing using tables or multilevel address translation means
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/10—Providing a specific technical effect
    • G06F2212/1016—Performance improvement
    • G06F2212/1024—Latency reduction
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/20—Employing a main memory using a specific memory technology
    • G06F2212/202—Non-volatile memory
    • G06F2212/2022—Flash memory
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/28—Using a specific disk cache architecture
    • G06F2212/283—Plural cache memories
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/72—Details relating to flash memory management
    • G06F2212/7201—Logical to physical mapping or translation of blocks or pages
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/72—Details relating to flash memory management
    • G06F2212/7208—Multiple device management, e.g. distributing data over multiple flash devices

Definitions

  • Embodiments of the invention generally relate to integrated circuits.
  • embodiments of the invention relate to memory circuits.
  • Semiconductor memory devices are ubiquitous in digital electronics devices. Examples of these devices include computers, cameras, digital media players, games, personal digital assistants, mobile phones, navigation devices, non-volatile storage products, and the like. Examples of non-volatile storage products include CompactFlash (CF) cards, MultiMedia cards (MMC), secure digital (SD) cards, Flash PC cards (e.g., ATA Flash cards), SmartMedia cards, solid-state disks (SSDs), hybrid hard drives, and memory sticks.
  • CF CompactFlash
  • MMC MultiMedia cards
  • SD secure digital
  • Flash PC cards e.g., ATA Flash cards
  • SmartMedia cards solid-state disks (SSDs), hybrid hard drives, and memory sticks.
  • Semiconductor memory provides storage and retrieval of data.
  • RAM random access memory
  • DRAM dynamic random access memory
  • SDRAM flash memory
  • EEPROM electrically erasable programmable read only memory
  • MRAM magnetoresistive random access memory
  • ferroelectric memory ferroelectric memory
  • the memory cells of a memory device are arranged in one or more arrays and are accessed by activation of appropriate word lines (rows) and bit lines (columns).
  • word lines rows
  • bit lines column lines
  • each cell stores a single bit of data.
  • some cells such as flash memory cells, can store data in more than one level (more than one bit per cell).
  • Memory devices can also be organized into pages and further into blocks.
  • NAND flash is generally organized into blocks and pages. This organization can also be found in NOR flash, electrically erasable programmable read only memory (EEPROM), and programmable read only memory (PROM).
  • EEPROM electrically erasable programmable read only memory
  • PROM programmable read only memory
  • the sizes of the blocks and pages can vary in a very broad range.
  • GB gigabyte
  • One example of a 2 gigabyte (GB) memory array has 2,048 blocks, each block having 64 pages, with each page having 2,112 bytes, including 2,048 data bytes and 64 spare bytes (not including spare blocks, pages, rows, columns, etc.).
  • FIG. 1 this is illustrated in FIG. 1 .
  • Bad or unusable memory cells can be identified during test. For example, a memory cell can fail for being stuck in a particular logic state, for not meeting a timing specification, or the like. During production, these failures can be mapped and corrected by substitution of defective rows and/or columns with extra or redundant rows and/or columns in an array. This type of failure is typically handled by the permanent mapping of internal addresses for individual rows and addresses within an array and is transparent to the end user.
  • Cells can also fail in the field. For example, many non-volatile memory types can wear out over multiple write cycles. Some memory devices can also include error correction codes (ECC), and are tolerant of bad cells within correctable limits. Unless correctable by some form of error correction, bad or unusable memory cells should not be used. Bad or unusable memory cells can affect the usability of higher order memory units. For example, bad cells can cause a row to be unusable, and the page(s) of the row to be unusable. Blocks of memory can also have spare pages to replace bad pages. When an insufficient number of pages for a block is available, the entire block may be marked as a bad block, and none of the pages of that block are typically accessible.
  • ECC error correction codes
  • Bad blocks can be marked in a bad block table. For example, if a block is determined to be bad during production test, a repair procedure can be used to replace the bad block with a spare block.
  • two or more arrays store data from or provide data to a data bus. It can take longer to write to or read from a page of data to or from an array 202 , 204 than to or from a cache register 206 , 208 .
  • the memories can be arranged such that a page from one array 202 is written to or read first, then a page from a second array 204 is written to or read, then a new page is written to or read from the first array 202 , and so forth. This is known as “ping-ponging,” and is fast because the data from the alternate array can be preloaded into the applicable cache register 206 , 208 while the data from the other cache is being written or read.
  • registers 210 , 212 can assist with the writing or the fetching of data. If the arrays 202 , 204 are on the same chip, the cache registers 206 , 208 can be shared, i.e., there would typically be only one cache register.
  • the preloading may not occur efficiently.
  • address lines that are provided to the two chips are typically shared, and the least significant bit (LSB) of an address line is redundant.
  • LSB least significant bit
  • a row decoder is also typically shared among the multiple arrays.
  • a repair solution can map a different block to the same logical address as a good block.
  • the activation of a different set of row lines for the replacement block can considerably lengthen write or read times because, for example, two different physical memory locations are then accessed from within the memory device for writing or reading. This is shown in FIG. 3 .
  • FIG. 3 illustrates an example of a conventional technique for pairing blocks from two different memory arrays 302 , 304 . More than two memory arrays can be “paired” or matched, i.e., associated for storage and retrieval together. In another example, 4 arrays or 8 arrays are “paired.”
  • the first four blocks ( 1 A- 4 A) 306 , 308 , 310 , 312 from memory array A 302 are good.
  • a first block 1 B 314 , a second block 2 B 316 , and a fourth block 4 B 320 from memory array B 304 are good.
  • a third block 3 B 318 of memory array B 304 is bad.
  • the first block 1 A 306 and the first block 1 B 314 are paired.
  • the second block 2 A 308 and the second block 2 B 316 are paired.
  • the fourth block 4 A 312 and the fourth block 4 B 320 are paired.
  • the third block 3 A 310 from array A 302 is not paired with the third block 3 B 318 from array B 304 because the third block 3 B 318 is bad and is not usable. Rather, the third block 3 A 310 is paired with another block XB 322 from array B.
  • the good blocks at the end (by physical address) of an array are spare blocks, and the other block XB 322 that is used is selected from one of the spare blocks.
  • block XB 322 can be the 2,050-th block of an array specified to have at least 2,048 good blocks.
  • the third block 3 A 310 and the other block XB 322 are at different physical addresses, and when pages of data are stored to or retrieved from each, the pages from the third block 3 A 310 and the pages from the block XB 322 are internally accessed using two separate accesses and without “ping-ponging.” This reduces performance.
  • the technique illustrated in FIG. 3 typically uses some form of internal controller intervention to select the replacement block(s) and to combine data from separate internal memory reads, which further slows down access.
  • multiple arrays for data is common. In systems with multiple channels of data, there can be data from multiple arrays for a data stream.
  • Another example where blocks can be paired is when a data bus is relatively wide, such as in a 32-bit wide data bus, and each of four memory arrays handles 8 bits of the 32 bits of data.
  • FIG. 4 illustrates an example of a conventional technique for pairing blocks from two different memory arrays 402 , 404 .
  • the entire physical address of a bad block is skipped, and the next physical address with two or more good blocks is used.
  • This technique still typically uses controller intervention to manage the jump in physical addresses.
  • the first four blocks ( 1 A- 4 A) 406 , 408 , 410 , 412 from memory array A 402 are good.
  • a first block 1 B 414 , a second block 2 B 416 , and a fourth block 4 B 420 from memory array B 404 are good.
  • a third block 3 B 418 of memory array B 404 is bad.
  • the first block 1 A 406 and the first block 1 B 414 are paired.
  • the second block 2 A 408 and the second block 2 B 416 are paired.
  • the fourth block 4 A 412 and the fourth block 4 B 420 are paired.
  • the third block 3 A 410 from array A 402 is not paired with the third block 3 B 418 from array B 404 because the third block 3 B 418 is bad and is not usable.
  • the third block 3 A 410 while good, is left unpaired and unused. This preserves the ability of the arrays 402 , 404 to “ping-pong” for speed when reading the various pages of associated blocks as the paired blocks arranged in this manner use the same physical addresses and are accessible with activation of the same rows of a shared row decoder.
  • the third block 3 A 410 is not utilized despite its viability and is effectively treated as a bad block. This decreases the number of available blocks for an array, and if the effective number of good blocks falls below the minimum specified, this can decrease the production yield and increase the cost of production.
  • FIG. 1 illustrates a memory architecture with multiple pages and blocks within arrays.
  • FIG. 2 illustrates reading from multiple memories for fast access or for parallel access.
  • FIG. 3 illustrates a prior art technique of pairing blocks from different memory arrays, which results in relatively slow access to data.
  • FIG. 4 illustrates a prior art technique of pairing blocks from different memory arrays, which results in inefficient utilization of memory space.
  • FIG. 5 illustrates an example of collectively mapping blocks for two arrays.
  • FIG. 6 illustrates an example of collectively mapping blocks for four arrays.
  • FIG. 7 illustrates an example of a controller, an address translator, and a memory device.
  • FIG. 8 is a schematic of a memory chip with address translators.
  • FIG. 9 illustrates an example of a lookup table (LUT) for implementation of address translation.
  • FIG. 10 is a flowchart generally illustrating collective block mapping.
  • FIG. 11 is a flowchart generally illustrating block mapping within an array.
  • FIGS. 12A and 12B illustrate examples of memory maps.
  • One embodiment of the invention provides associative mapping of the blocks of two or more memory arrays such that data, such as pages of data, from good blocks of the two or more memory arrays can be written or read in an alternating manner for speed or can be written to read in parallel for providing data to relatively wide data channels. For example, this obviates controller intervention to access associated data spread among disparate rows and can increase the throughput of data by providing, where configured, the ability to alternate reading of data from two or more arrays. For example, while data from one array is being loaded to a cache, data from another array that has already been loaded to the cache can be read.
  • the mapped blocks correspond to the smallest erasable entity of a flash device.
  • the mapped blocks correspond to a relatively large number of memory cells. In addition, relatively few of the good blocks of an array go unused.
  • FIG. 5 illustrates an example of collectively mapping blocks for two arrays.
  • the principles and advantages of the collective mapping can be applied to a very wide range of numbers of arrays.
  • FIG. 6 illustrates an example of collectively mapping blocks for four arrays.
  • the status of a block as good or bad can be determined during manufacture or later in the field.
  • a wide variety of techniques can be used to determine whether a block is good or bad.
  • An applicable technique will be readily determined by one of ordinary skill in the art.
  • ECC error correction codes
  • the good blocks of the arrays are logically addressed together so that an accessing electronic processing unit, such as a controller, processor, CPU, or other device, can read data rapidly in parallel from the arrays without having to make address jumps or having to read data from arrays separately.
  • the good blocks are logically rearranged to form consecutively addressable good blocks of memory.
  • the mapping is performed such that the good blocks are mapped to relatively low addresses, and the bad blocks or unused spare blocks, if any, are mapped to relatively high addresses.
  • the mapping for the unused blocks (bad block or spare blocks) is not critical. Examples will be described below in connection with FIGS. 12A and 12B .
  • row decoders for a memory device are not shared among the arrays. This permits independent row addressing of blocks of memory from the arrays. Such programming of a row decoder or an address translator to skip over bad blocks in an array and retain a contiguous mapping of good blocks can be readily accommodated at production test.
  • the repair of blocks that fail in the field can also be accommodated.
  • a bank of fuses can be used to store a repair solution. Fuses can be programmed to identify a logical address range corresponding to an original block that has gone bad. When the logical address range is encountered, a good block (previously redundant) is substituted for the bad block.
  • the fuses can be Flash-based fuses, which permit the reprogramming of repair solutions for field-based repairs.
  • the blocks of array A 502 and array B 504 are collectively associated.
  • Array A 502 and array B 504 can be on the same chip or on different chips.
  • the blocks of array A 502 and array B 504 have logical addresses 506 , 508 and have internal addresses 510 , 512 .
  • the logical addresses 506 , 508 are used by devices that access the memory, such as controllers, processors, CPUs, and the like.
  • the internal addresses 510 , 512 relate to the original physical addresses within the arrays.
  • FIG. 5 will generally be described using the internal addresses 510 , 512 as the references for the blocks.
  • blocks with internal addresses 1 A 514 , 2 A 516 , 3 A 518 , 4 A 520 , 5 A 522 , 6 A 524 , 7 A 526 , and 8 A 528 are shown.
  • Blocks 1 A 514 , 2 A 516 , 3 A 518 , 4 A 520 , 5 A 522 , 7 A 526 , and 8 A 528 are good, and block 6 A 524 is bad.
  • blocks with internal addresses 1 B 530 , 2 B 532 , 3 B 534 , 4 B 536 , 5 B 538 , 6 B 540 , 7 B 542 , and 8 B 544 are shown. Blocks 1 B 530 , 2 B 532 , 4 B 536 , 5 B 538 , 7 B 542 , and 8 B 544 are good, and blocks 3 B 534 and 6 B 540 are bad.
  • Block 1 A 514 is paired with block 1 B 530 , and both are mapped at the starting logical address for the blocks, which is typically 0 for the first page of the block.
  • Block 2 A 516 is paired with block 2 B 532 , and both are mapped at the next block address, i.e., the second logical block address for the first page. This is typically a fixed offset from 0 and typically varies depending on the number of pages for a block.
  • Block 3 B 534 which is bad, is not intentionally paired and is mapped to an unused address, such as to an address near the end of the range of addresses for the array.
  • the mapping process remaps the bad blocks starting with the last available block addresses first (highest addresses) and progressively maps bad blocks to lower addresses as the bad blocks are encountered. This permits the good blocks to be mapped in a first contiguous address space at the beginning (starting block address) for the blocks of the array, and the bad blocks to be mapped in a second contiguous address space at the end of the address range.
  • the mapping of the good blocks to a relatively large contiguous address space provides a relatively large usable memory area for the user.
  • other techniques for separating the logical addresses for the good blocks from the bad blocks will be readily determined by one of ordinary skill in the art.
  • Block 3 A 518 is paired with block 4 B 536 , and both are mapped to the third logical block address. With remapping and the use of separate row decoders for each array, block 3 A 518 and block 4 B 536 can both be mapped to the same logical address 508 and accessed at the same time even though internally within the arrays 502 , 504 , the blocks 518 , 536 are at disparate internal addresses as determined by row count within the arrays 502 , 504 .
  • Block 4 A 520 is paired with block 5 B 538 , and is mapped to the fourth logical block address.
  • Block 5 A 522 is paired with block 7 B 542 , and mapped to the fifth logical block address.
  • Block 6 A 524 is bad, not paired, and is mapped towards the end of the addresses for the array A 502 .
  • Block 6 B 540 is bad, not paired, and is mapped towards the end of the addresses for the array B 504 .
  • Block 7 A 526 is paired with block 8 B 544 and is mapped to the sixth logical block address.
  • each pair of good blocks has a matching logical address 506 , 508 and blocks from both arrays 502 , 504 are available to be accessed at the same time for rapid access to data by, for example, data writes to or reads of consecutive addresses.
  • the pages of data from array A 502 are interleaved with pages of data from array B 504 to permit the controller to “ping-pong” back and forth between the arrays 502 , 504 when writing or reading pages of data.
  • FIG. 6 illustrates an example of collectively mapping blocks for four arrays 602 , 604 , 606 , 608 .
  • the collective mapping for the first four good blocks for each array 602 , 604 , 606 , 608 is shown.
  • arrays typically have many blocks, e.g., thousands.
  • the blocks will be referenced in the following discussion via their internal addresses (e.g., physical row address), which are mapped to logical addresses, which are used by hosts, such as controllers, processors, and the like. Even when matched blocks are at disparate physical addresses (disparate by rows), the matched blocks can be written to or read from at the same time without separate writes or reads, which improves memory performance.
  • the illustrated portion of array A 602 has four blocks 1 A 610 , 2 A 612 , 3 A 614 , 4 A 616 , all of which are good.
  • Array B 604 has good blocks 1 B 620 , 2 B 622 , 3 B 624 and 5 B 628 .
  • Block 4 B 626 is not good.
  • Array C 606 has good blocks 1 C 630 , 3 C 634 , 4 C 636 , and 5 C 638 .
  • Block 2 C 632 is not good.
  • Array D has good blocks 1 D 640 , 2 D 642 , 3 D 644 , and 5 D 648 .
  • Block 4 D 646 is not good.
  • Block 1 A 610 , block 1 B 620 , block 1 C 630 , and block 1 D 640 are matched.
  • Block 2 A 612 , block 2 B 622 , block 3 C 634 and block 2 D 642 are matched.
  • Block 3 A 614 , block 3 B 624 , block 4 C 636 , and block 3 D 644 are matched.
  • Block 4 A 616 , block 5 B 628 , block 5 C 638 , and block 5 D 648 are matched.
  • Block 4 B 626 , block 2 C 632 , and block 4 D 646 are bad blocks and are mapped to an address space outside of the contiguous address spaces used for the good blocks.
  • the bad blocks can be mapped to the end of the address space.
  • the matching or “pairing” of the blocks described above preserves the continuity of addresses for accessing memory, which permits reading blocks of memory quickly by alternating among the arrays and/or permits reading data from arrays in parallel.
  • the blocks do not have to be mapped in sequential internal address order in order to retain the benefit of consecutive logical addresses.
  • the data is addressed sequentially as seen by a controller, processor, or CPU, but the actual ordering of the physical blocks within a memory chip can vary and will typically be transparent to the controller or processor.
  • the mapping is implemented using fuses, such as Flash fuses, to store mapping data.
  • the mapping can be initially determined during production test and updated in the field.
  • the fuses lie outside of a row decoder, but impact the decoding solution.
  • the fuses can be part of an address translator circuit, can be part of an override circuit that overrides normal row decoding, or the like.
  • the fuses provide programmability of a row decoder itself.
  • FIG. 7 illustrates an example of a controller 702 , an address translator 704 , and a memory device(s) 706 .
  • the controller 702 represents a controller or other processor that uses the memory device 706 .
  • Other controllers or processors can also use the memory device 706 via, for example, direct memory access (DMA) 708 .
  • the address translator 704 provides mapping and/or remapping as applicable of the addresses for the blocks of the memory device 706 .
  • the address translator 704 is outside the memory device 706 as shown in FIG. 7 . This permits off-the-shelf memory device(s) 706 to be used, and permits relatively many memory devices 706 to be used per address translator 704 .
  • the address translator 704 is part of the memory device 706 . It should be noted that a single memory device 706 can store multiple memory arrays.
  • the address translator 704 can alternatively be integrated with the controller 702 , be integrated with a DMA controller, or be a separate chip.
  • the address translator translates or maps logical addresses as seen by devices using the memory device 706 , such as the controller 702 , into the addresses used to retrieve data from the memory device 706 .
  • the mapping information can be stored in a lookup table (LUT).
  • the blocks of a memory are addressed (block portion of addresses) towards the most significant bit (msb) portions addresses, while pages (if present) and bytes are addressed toward the least significant bit (lsb) portions of the addresses.
  • pages of arrays are intended to be read in a “ping-pong” manner, then their address translation can be varied accordingly.
  • FIG. 8 is a schematic of a memory chip 800 with an address translator 802 .
  • the memory chip 800 has memory array A 804 and memory array B 806 .
  • miscellaneous supporting circuits for memory array B 806 are not shown, and in one embodiment are the same as that described for memory array A 804 .
  • the two arrays 804 , 806 can share a cache register 808 .
  • the address translator 802 receives logical addresses as an input and provides translated addresses as an output.
  • the logical addresses can originate from, for example, a controller, processor, CPU, or the like, coupled to an input/output circuit 809 .
  • the translation function of the address translator can be selectively enabled or disabled via an enable signal 810 .
  • the address translator 802 can also have a mode for programming and a mode for normal usage, which can be selected with a program signal 812 .
  • the address translator 802 can be programmed during production test to map good blocks to a contiguous address space.
  • Outputs of the address translator 802 are provided to an address latch 814 for array A 804 and to another address latch (not shown) for array B 806 .
  • the mapping between array A 804 and array B 806 can be different, so the addresses that are latched can also be different.
  • the address translator 802 typically does not have to translate every bit of an address bus, but should at least translate the address bits used for selecting blocks.
  • An output of the address latch A 814 is provided as an input to a row decoder 816 .
  • the row decoder 816 for memory array A 804 is independent from the row decoder for memory array B 806 . This permits disparate physical pages of data (different by physical row address) from memory array A 804 and memory array B 806 to be accessed at the same time with a common logical address.
  • the row decoder 816 can also be mapped to correct for bad memory locations in rows and/or columns. For example, if a block goes bad in the field, a bank of fuses can be programmed to detect the address range for the bad block and substitute an otherwise redundant block to repair the array.
  • the row decoder 816 selects appropriate rows for reading of data. For example, in the context of NAND Flash, the row decoder 816 can activate a particular row (also known as wordline), and other related rows can be turned “on” such that the particular cells of the selected row can be written or read.
  • An output of the address latch 814 is also provided as an input to a column decoder 818 .
  • the addresses for the row decoder 816 are translated by the address translator 802 , but the addresses for the column decoder 818 are not translated.
  • Sense/driver circuits 820 communicate with the column decoder 818 and array A 804 to write data to or read data from array A 804 .
  • Data buffers/latches 822 store data from the input/output circuit 809 for storage in memory array A 804
  • data registers 824 , 826 store data retrieved from memory array A 804 , memory array B 806 , respectively.
  • the cache register 808 provides data from the data registers 824 , 826 for fast access to the data. If memory array A 804 and memory array B 806 are not on the same chip, then the cache register 808 will typically not be shared.
  • FIG. 9 illustrates an example of a lookup table (LUT) 902 for an implementation of address translation.
  • the lookup table 902 is implemented as a programmable non-volatile memory, such as EEPROM or Flash memory (NOR or NAND).
  • an address translator 904 is implemented by programming the lookup table 902 during production test, and using the programmed lookup table during operation.
  • the lookup table 902 is also reprogrammable in the field such as via firmware or state machine control.
  • the lookup table 902 can alternatively be implemented by a volatile memory device, such as static RAM, that is loaded with the appropriate data before use, which can provide faster speed during use.
  • the address translator 904 receives a logical address 906 as an input, and provides two or more addresses 908 , 909 as outputs.
  • the logical address 906 does not need to be the full address, e.g., can be the portion of the addresses for addressing blocks.
  • One address 908 can be for addressing data of one array, and another address 909 can be for addressing data of the other array of the pair.
  • addresses for both arrays are translated for efficient access of data for the CPU. For example, a CPU can read data faster if the data is available at contiguous addresses.
  • the addresses for an array can remain untranslated, and the addresses for the good blocks of the other arrays translated to match with the untranslated addresses of the untranslated array.
  • the address translator 904 can be configured to pass through the logical address 906 to one or more translated addresses 908 , 909 without modification.
  • the translated addresses 908 , 909 can be different from each other so that data from blocks of disparate addresses can be efficiently retrieved.
  • a logical address 906 can be applied to the lookup table 902 as an address to a memory location, and the translated address 908 can be retrieved from the stored data of the lookup table 902 .
  • the lookup table 902 has maps for two arrays. In another embodiment, the lookup table 902 can store maps for more than two arrays. In addition, the lookup table 902 can be alternatively be configured to store each map for each array in separate tables.
  • a processor 910 such as a microprocessor, microcontroller, licensable core, state machine, or the like, is configured to generate the map stored in the lookup table 902 .
  • the processor 910 can be part of the memory device, can be a separate chip in a system, can be the processor of a device using the memory, or the like. In one embodiment, the processor 910 is implemented by test equipment.
  • the lookup table 902 can be implemented in a variety of ways.
  • the lookup table 902 stores offsets for generating the new addresses, rather than the address itself, and the parameter used for remapping can be the offset.
  • FIG. 10 is a flowchart generally illustrating collective block mapping. It will be appreciated by the skilled practitioner that the illustrated process can be modified in a variety of ways. For example, in another embodiment, various portions of the illustrated process can be combined, can be rearranged in an alternate sequence, can be removed, and the like. The illustrated process can be used to match blocks for two or more memory arrays.
  • the process begins by mapping 1002 at least a portion of the good blocks of an array, e.g., array “A,” in a contiguous address space (logical addresses).
  • the contiguous portion includes at least enough good blocks to provide enough memory space to meet the specified memory capacity for the array. Accordingly, the at least enough good blocks can comprise fewer than all of the good blocks.
  • the portion of contiguous blocks includes all of the good blocks as shown in FIG. 12A .
  • the portion of contiguous blocks includes only a portion of the good blocks sufficient to provide enough memory space to meet the specified memory capacity for the array as shown in FIG. 12B .
  • One embodiment of a process for performing the mapping 1002 will be described in greater detail later in connection with FIG. 11 .
  • the process advances to map 1004 at least portions of the good blocks of one or more other arrays, e.g., array “B,” to the same contiguous address space.
  • the mapping of the good blocks to the same contiguous address space ensures that the blocks of the arrays thusly mapped share the same logical addresses for efficient access.
  • the different arrays can use independent row decoders to permit access to blocks at disparate physical addresses at the same time.
  • mappings for address translation to particular blocks of the various memory arrays are stored in a lookup table as described earlier in connection with FIG. 9 .
  • particular mappings for an array are stored by programming a row decoder for the array.
  • FIG. 11 is a flowchart generally illustrating block mapping within an array.
  • the illustrated process maps the good blocks of an array into a contiguous address space. The process can be repeated as necessary for other arrays. It will be appreciated by the skilled practitioner that the illustrated process can be modified in a variety of ways. For example, in another embodiment, various portions of the illustrated process can be combined, can be rearranged in an alternate sequence, can be removed, and the like.
  • n indicates the physical or internal block number (address) and, for example, can be initialized to 0.
  • Variable i indicates the logical address and should be initialized to the starting logical address for the first block of array A. For the purposes of discussion, variable i can begin at 0.
  • the process advances to determine 1104 whether block n (address n) is good.
  • block n address n
  • memory devices typically have a reference table populated during production test (and updateable by, for example, a controller during use) in a known good memory space that indicates which memory blocks are good and which are bad. If the block is bad, the process stores 1106 the block number n in a bad block table. The process advances from the state 1106 to a decision block 1110 .
  • the process associates 1108 logical address i with block number n.
  • the process advances from the state 1108 to the decision block 1110 .
  • the process determines 1110 whether it is done with the blocks of the array being processed. If it is not yet done, the process proceeds to a state 1112 , where the process increments the block number n to prepare for processing the next block. The process then returns from the state 1112 back to the decision block 11104 .
  • the process proceeds from the decision block 1110 to a state 1114 , in which the process associates or maps the bad blocks collected in the state 1106 with addresses at the end of the lookup table or to the end of an address range for a row decoder.
  • the bad blocks can alternatively be mapped to the end of the lookup table at a different point in the process, such as in the state 1106 .
  • the process can be repeated for the other associated arrays.
  • One advantage of the process described in connection with FIG. 11 is that the blocks of the individual arrays can be processed to be addressable in contiguous blocks, such that knowledge of the locations of the good blocks of other arrays is not required.
  • FIG. 12A illustrates an example of a memory map for a memory array, wherein all of the good blocks whether used 1202 or spare 1204 are mapped to a contiguous space 1206 of logical memory addresses.
  • FIG. 12B illustrates another example of a memory map for a memory array, wherein the good blocks 1208 that are to be used are mapped to a contiguous space of logical addresses, and good blocks that are spare blocks 1210 are mapped to an address space that is not contiguous with the address space for the good blocks that are used.
  • Embodiments of the invention advantageously permit a controller or the like to address data from matched blocks of disparate arrays using the same logical address. For example, the addresses of one or more good blocks of the memory arrays are mapped such that the controller does not need to switch back and forth among two or more different logical addresses when accessing data from matched blocks of disparate arrays having different physical addresses.
  • Independent row decoders permit pages of data of matched blocks having disparate physical addresses to be stored to or retrieved from multiple arrays at the same time. This can permit data to be accessed relatively efficiently in, for example, multi-channel data busses, ping-ponged arrays, and the like.
  • One embodiment is an apparatus for organizing access for matched blocks of data spread among two or more disparate memory arrays, wherein the apparatus includes: an address translator configured to receive at least a block portion of logical addresses originating from a processor, wherein the block portion corresponds to an address range for selecting blocks of memory, wherein the address translator is configured to modify at least the received block portion of the received logical addresses to generate at least one of first modified addresses or second modified addresses, wherein the first modified addresses are for selection of memory blocks for a first memory array of the two or more memory arrays, wherein the second modified addresses are for selection of memory blocks for a second memory array of the two or more memory arrays, wherein the first modified addresses and the second modified addresses are configured to select matched blocks of the first memory array and the second memory array, respectively, using a same logical address for a block portion of the logical address; a first row decoder in communication with the address translator to receive the first modified addresses, the first row decoder coupled to the first memory array; and a second row decoder in communication with the
  • One embodiment is a method of matching blocks of memory space for two or more memory arrays for access of data associated with the matching blocks using a same logical address, wherein the method includes: associating usable good blocks of a first array of the two or more memory arrays with usable good blocks of a second array of the two or more memory arrays in a contiguous logical address space such that matching good blocks of memory for the two or more memory arrays are logically addressable with a same logical address for a block portion of the logical address, wherein at least a portion of the usable good blocks of the first array associated with the good blocks of the second array have different physical addresses, and wherein the associated good blocks of the first array and the second array are accessible at the same time even with disparate physical addresses; and storing the associations for logical address translation.
  • One embodiment is a method of modifying addresses for access to two or more disparate memory arrays, wherein the method includes: receiving logical addresses from a processor for access to memory locations of two or more disparate memory arrays, wherein block portions of the logical addresses relate to addressing of particular blocks within memory arrays; generating first modified addresses for a first memory array from the logical addresses and stored parameters corresponding to selected memory blocks of the first memory array to rearrange access to the selected memory blocks such that at least a first group of good memory blocks of at least a minimum number of good memory blocks specified for the first memory array is accessible in a contiguous logical memory address space and such that bad blocks are not addressed within the contiguous logical memory address space; generating second modified addresses for a second memory array from the logical addresses and stored parameters corresponding to selected memory blocks of the second memory array to rearrange access to the selected memory blocks such that at least a second group of good memory blocks of at least a minimum number of good memory blocks specified for the second memory array are accessible in the contiguous logical memory address space and such

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Microelectronics & Electronic Packaging (AREA)
  • Computer Security & Cryptography (AREA)
  • Techniques For Improving Reliability Of Storages (AREA)
  • Memory System (AREA)
US11/773,321 2007-07-03 2007-07-03 Block addressing for parallel memory arrays Abandoned US20090013148A1 (en)

Priority Applications (6)

Application Number Priority Date Filing Date Title
US11/773,321 US20090013148A1 (en) 2007-07-03 2007-07-03 Block addressing for parallel memory arrays
CN2008801022316A CN101772810B (zh) 2007-07-03 2008-06-30 用于并行存储器阵列的块寻址
PCT/US2008/068849 WO2009006442A1 (en) 2007-07-03 2008-06-30 Block addressing for parallel memory arrays
KR1020107002399A KR101573089B1 (ko) 2007-07-03 2008-06-30 병렬 메모리 어레이들의 블록 어드레싱
TW097124899A TWI376601B (en) 2007-07-03 2008-07-02 Block addressing for parallel memory arrays
US14/616,468 US9436609B2 (en) 2007-07-03 2015-02-06 Block addressing for parallel memory arrays

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US11/773,321 US20090013148A1 (en) 2007-07-03 2007-07-03 Block addressing for parallel memory arrays

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US14/616,468 Continuation US9436609B2 (en) 2007-07-03 2015-02-06 Block addressing for parallel memory arrays

Publications (1)

Publication Number Publication Date
US20090013148A1 true US20090013148A1 (en) 2009-01-08

Family

ID=40222341

Family Applications (2)

Application Number Title Priority Date Filing Date
US11/773,321 Abandoned US20090013148A1 (en) 2007-07-03 2007-07-03 Block addressing for parallel memory arrays
US14/616,468 Active 2027-09-09 US9436609B2 (en) 2007-07-03 2015-02-06 Block addressing for parallel memory arrays

Family Applications After (1)

Application Number Title Priority Date Filing Date
US14/616,468 Active 2027-09-09 US9436609B2 (en) 2007-07-03 2015-02-06 Block addressing for parallel memory arrays

Country Status (5)

Country Link
US (2) US20090013148A1 (ko)
KR (1) KR101573089B1 (ko)
CN (1) CN101772810B (ko)
TW (1) TWI376601B (ko)
WO (1) WO2009006442A1 (ko)

Cited By (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090248963A1 (en) * 2008-03-28 2009-10-01 Takafumi Ito Memory controller and memory system including the same
US20090285043A1 (en) * 2008-05-15 2009-11-19 Micron Technology, Inc. Block Repair Scheme
US20120005451A1 (en) * 2010-07-02 2012-01-05 Samsung Electronics Co., Ltd Data storage device and bad block managing method thereof
US8201024B2 (en) * 2010-05-17 2012-06-12 Microsoft Corporation Managing memory faults
US20130031347A1 (en) * 2011-07-28 2013-01-31 STMicroelectronics (R&D) Ltd. Arrangement and method
US20130103884A1 (en) * 2011-10-24 2013-04-25 Samsung Electronics Co., Ltd. File system and control method thereof
WO2014003982A1 (en) * 2012-06-29 2014-01-03 Intel Corporation Bad block management mechanism
US20140149652A1 (en) * 2012-11-27 2014-05-29 Samsung Electronics Co., Ltd. Memory system and method of mapping address using the same
CN103902475A (zh) * 2014-04-23 2014-07-02 哈尔滨工业大学 一种基于队列管理机制的固态硬盘并行访问方法及装置
US20140223080A1 (en) * 2011-04-01 2014-08-07 Ato Solution Co., Ltd. Non-volatile memory device, electronic control system, and method of operating the non-volatile memory device
JP2014157635A (ja) * 2014-06-06 2014-08-28 Lapis Semiconductor Co Ltd 半導体メモリ装置
US9032244B2 (en) 2012-11-16 2015-05-12 Microsoft Technology Licensing, Llc Memory segment remapping to address fragmentation
US9070482B2 (en) 2010-06-17 2015-06-30 Lapis Semiconductor Co., Ltd. Multi-chip package semiconductor memory device
US20150339223A1 (en) * 2014-05-22 2015-11-26 Kabushiki Kaisha Toshiba Memory system and method
US20160092285A1 (en) * 2014-09-25 2016-03-31 Intel Corporation Method and Apparatus for Approximating Detection of Overlaps Between Memory Ranges
US9766814B2 (en) * 2015-08-10 2017-09-19 Intel Corporation Method and apparatus for defect management in a non-volatile memory device
KR101799439B1 (ko) * 2012-11-27 2017-11-20 삼성전자주식회사 메모리 시스템 및 이를 이용한 어드레스 맵핑 방법
US9880747B2 (en) * 2015-07-03 2018-01-30 Xitore, Inc. Apparatus, system, and method of logical address translation for non-volatile storage memory
US9916093B2 (en) 2015-07-22 2018-03-13 Samsung Electronics Co., Ltd. Nonvolatile memory device and storage device for storing bad block management information with high reliability
US10146604B2 (en) * 2016-08-23 2018-12-04 Oracle International Corporation Bad block detection and predictive analytics in NAND flash storage devices
US10339020B2 (en) * 2016-03-29 2019-07-02 Toshiba Memory Corporation Object storage system, controller and storage medium
US10445199B2 (en) * 2016-12-22 2019-10-15 Western Digital Technologies, Inc. Bad page management in storage devices
US11086539B2 (en) * 2019-10-21 2021-08-10 Sandisk Technologies Llc Mapping consecutive logical block addresses to consecutive good blocks in memory device
US20210406170A1 (en) * 2020-06-24 2021-12-30 MemRay Corporation Flash-Based Coprocessor
US20220300424A1 (en) * 2021-03-18 2022-09-22 Kioxia Corporation Memory system, control method, and memory controller
US20230229304A1 (en) * 2020-11-25 2023-07-20 Micron Technology, Inc. Managing page retirement for non-volatile memory

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI406130B (zh) * 2009-03-10 2013-08-21 Phison Electronics Corp 資料處理系統、控制器及其搜尋特定記憶體區的方法
KR101111615B1 (ko) * 2010-06-01 2012-02-15 서울통신기술 주식회사 휴대용 단말기의 프로그램 업데이트 장치 및 방법
KR101293226B1 (ko) * 2011-06-30 2013-08-05 (주)아토솔루션 비휘발성 메모리 소자, 전자제어 시스템, 및 비휘발성 메모리 소자의 동작방법
US9136873B2 (en) 2013-03-11 2015-09-15 Intel Corporation Reduced uncorrectable memory errors
CN105609129A (zh) * 2015-07-10 2016-05-25 上海磁宇信息科技有限公司 一种具有替换行或列的mram芯片及替换、读写方法
US10430085B2 (en) 2016-11-08 2019-10-01 Micron Technology, Inc. Memory operations on data
US10261876B2 (en) * 2016-11-08 2019-04-16 Micron Technology, Inc. Memory management
KR102395434B1 (ko) * 2017-03-20 2022-05-09 삼성전자주식회사 비휘발성 메모리 장치 및 이를 포함하는 메모리 시스템
US10115441B1 (en) 2017-07-20 2018-10-30 Macronix International Co., Ltd. Row decoder and memory system using the same
TWI630616B (zh) * 2017-08-11 2018-07-21 旺宏電子股份有限公司 列解碼器及應用其之記憶體系統
JP7074454B2 (ja) * 2017-10-30 2022-05-24 キオクシア株式会社 計算機システムおよび制御方法
KR20190052315A (ko) * 2017-11-08 2019-05-16 에스케이하이닉스 주식회사 메모리 장치 및 그것을 포함하는 메모리 시스템
KR102504765B1 (ko) 2017-12-22 2023-03-03 에스케이하이닉스 주식회사 메모리 시스템 및 그것의 동작 방법
US11436144B2 (en) * 2020-04-10 2022-09-06 Micron Technology, Inc. Cache memory addressing
CN113689902B (zh) 2020-05-19 2023-09-01 长鑫存储技术有限公司 生成存储器地址数据的方法、计算机可读存储介质及设备

Citations (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4959812A (en) * 1987-12-28 1990-09-25 Kabushiki Kaisha Toshiba Electrically erasable programmable read-only memory with NAND cell structure
US5815456A (en) * 1996-06-19 1998-09-29 Cirrus Logic, Inc. Multibank -- multiport memories and systems and methods using the same
US5923605A (en) * 1997-09-29 1999-07-13 Siemens Aktiengesellschaft Space-efficient semiconductor memory having hierarchical column select line architecture
US6125421A (en) * 1994-11-30 2000-09-26 Hitachi Micro Systems, Inc. Independent multichannel memory architecture
US6233196B1 (en) * 1998-01-09 2001-05-15 Samsung Electronics Co., Ltd. Multi-bank integrated circuit memory devices with diagonal pairs of sub-banks
US6611894B1 (en) * 1998-03-31 2003-08-26 Kawasaki Microelectronics, Inc. Data retrieval apparatus
US20040246806A1 (en) * 2001-08-23 2004-12-09 Winbond Electronics Corporation Semiconductor memory having a flexible dual-bank architecture with improved row decoding
US6906961B2 (en) * 2003-06-24 2005-06-14 Micron Technology, Inc. Erase block data splitting
US6914814B2 (en) * 2002-09-12 2005-07-05 Samsung Electronics Co., Ltd. Dedicated redundancy circuits for different operations in a flash memory device and methods of operating the same
US6950352B1 (en) * 2003-11-18 2005-09-27 Lsi Logic Corporation Method and apparatus for replacing a defective cell within a memory device having twisted bit lines
US20050268208A1 (en) * 2004-05-31 2005-12-01 Sony Corporation Semiconductor memory device and signal processing system
US20050283657A1 (en) * 2004-06-07 2005-12-22 Sony Corporation Semiconductor memory device
US20060028851A1 (en) * 2002-08-28 2006-02-09 Micron Technology, Inc. Multi-bank memory accesses using posted writes
US20060083096A1 (en) * 2004-10-05 2006-04-20 Yang Joong S Semiconductor memory device and package thereof, and memory card using the same
US20060227646A1 (en) * 2005-04-06 2006-10-12 Kishore Kasamsetty Integrated circuit memory device, system and method having interleaved row and column control
US7123512B2 (en) * 2002-07-19 2006-10-17 Micron Technology, Inc. Contiguous block addressing scheme
US20060282610A1 (en) * 2005-06-08 2006-12-14 M-Systems Flash Disk Pioneers Ltd. Flash memory with programmable endurance
US20070043900A1 (en) * 2005-08-20 2007-02-22 Samsung Electronics Co., Ltd. Flash memory management method and flash memory system
US20070086243A1 (en) * 2005-10-18 2007-04-19 Samsung Electronics Co., Ltd. Nor-nand flash memory device with interleaved mat access
US20070136509A1 (en) * 2005-12-09 2007-06-14 Msystems Ltd. Method For Flash-Memory Management
US20070153619A1 (en) * 2005-12-29 2007-07-05 Samsung Electronics Co., Ltd. Address converter semiconductor device and semiconductor memory device having the same
US20070245070A1 (en) * 2006-04-17 2007-10-18 Takuma Mitsunaga Memory controller and flash memory system
US7680988B1 (en) * 2006-10-30 2010-03-16 Nvidia Corporation Single interconnect providing read and write access to a memory shared by concurrent threads

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6047623B2 (ja) * 1982-02-12 1985-10-22 株式会社日立製作所 アドレス変換方式
JP3169155B2 (ja) * 1993-12-22 2001-05-21 インターナショナル・ビジネス・マシーンズ・コーポレ−ション 情報をキャッシュするための回路
JPH10283770A (ja) * 1997-04-07 1998-10-23 Oki Electric Ind Co Ltd 半導体メモリ装置およびその読み出しおよび書き込み方法
JP3860436B2 (ja) * 2001-07-09 2006-12-20 富士通株式会社 半導体記憶装置
US20050144516A1 (en) * 2003-12-30 2005-06-30 Gonzalez Carlos J. Adaptive deterministic grouping of blocks into multi-block units
KR100608592B1 (ko) * 2004-01-27 2006-08-03 삼성전자주식회사 플래시 메모리의 데이터 관리 장치 및 방법
US7669092B2 (en) * 2007-02-26 2010-02-23 Micron Technology, Inc. Apparatus, method, and system of NAND defect management

Patent Citations (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4959812A (en) * 1987-12-28 1990-09-25 Kabushiki Kaisha Toshiba Electrically erasable programmable read-only memory with NAND cell structure
US6125421A (en) * 1994-11-30 2000-09-26 Hitachi Micro Systems, Inc. Independent multichannel memory architecture
US5815456A (en) * 1996-06-19 1998-09-29 Cirrus Logic, Inc. Multibank -- multiport memories and systems and methods using the same
US5923605A (en) * 1997-09-29 1999-07-13 Siemens Aktiengesellschaft Space-efficient semiconductor memory having hierarchical column select line architecture
US6233196B1 (en) * 1998-01-09 2001-05-15 Samsung Electronics Co., Ltd. Multi-bank integrated circuit memory devices with diagonal pairs of sub-banks
US6611894B1 (en) * 1998-03-31 2003-08-26 Kawasaki Microelectronics, Inc. Data retrieval apparatus
US20040246806A1 (en) * 2001-08-23 2004-12-09 Winbond Electronics Corporation Semiconductor memory having a flexible dual-bank architecture with improved row decoding
US7154781B2 (en) * 2002-07-19 2006-12-26 Micron Technology, Inc. Contiguous block addressing scheme
US7154782B2 (en) * 2002-07-19 2006-12-26 Micron Technology, Inc. Contiguous block addressing scheme
US7123512B2 (en) * 2002-07-19 2006-10-17 Micron Technology, Inc. Contiguous block addressing scheme
US7154780B2 (en) * 2002-07-19 2006-12-26 Micron Technology, Inc. Contiguous block addressing scheme
US20060028851A1 (en) * 2002-08-28 2006-02-09 Micron Technology, Inc. Multi-bank memory accesses using posted writes
US6914814B2 (en) * 2002-09-12 2005-07-05 Samsung Electronics Co., Ltd. Dedicated redundancy circuits for different operations in a flash memory device and methods of operating the same
US6906961B2 (en) * 2003-06-24 2005-06-14 Micron Technology, Inc. Erase block data splitting
US6950352B1 (en) * 2003-11-18 2005-09-27 Lsi Logic Corporation Method and apparatus for replacing a defective cell within a memory device having twisted bit lines
US20050268208A1 (en) * 2004-05-31 2005-12-01 Sony Corporation Semiconductor memory device and signal processing system
US20050283657A1 (en) * 2004-06-07 2005-12-22 Sony Corporation Semiconductor memory device
US20060083096A1 (en) * 2004-10-05 2006-04-20 Yang Joong S Semiconductor memory device and package thereof, and memory card using the same
US20060227646A1 (en) * 2005-04-06 2006-10-12 Kishore Kasamsetty Integrated circuit memory device, system and method having interleaved row and column control
US20060282610A1 (en) * 2005-06-08 2006-12-14 M-Systems Flash Disk Pioneers Ltd. Flash memory with programmable endurance
US20070043900A1 (en) * 2005-08-20 2007-02-22 Samsung Electronics Co., Ltd. Flash memory management method and flash memory system
US20070086243A1 (en) * 2005-10-18 2007-04-19 Samsung Electronics Co., Ltd. Nor-nand flash memory device with interleaved mat access
US20070136509A1 (en) * 2005-12-09 2007-06-14 Msystems Ltd. Method For Flash-Memory Management
US20070153619A1 (en) * 2005-12-29 2007-07-05 Samsung Electronics Co., Ltd. Address converter semiconductor device and semiconductor memory device having the same
US20070245070A1 (en) * 2006-04-17 2007-10-18 Takuma Mitsunaga Memory controller and flash memory system
US7680988B1 (en) * 2006-10-30 2010-03-16 Nvidia Corporation Single interconnect providing read and write access to a memory shared by concurrent threads

Cited By (39)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090248963A1 (en) * 2008-03-28 2009-10-01 Takafumi Ito Memory controller and memory system including the same
US8307172B2 (en) * 2008-03-28 2012-11-06 Kabushiki Kaisha Toshiba Memory system including memory controller and separately formatted nonvolatile memory to avoid “copy-involving write” during updating file data in the memory
US20090285043A1 (en) * 2008-05-15 2009-11-19 Micron Technology, Inc. Block Repair Scheme
US8068380B2 (en) * 2008-05-15 2011-11-29 Micron Technology, Inc. Block repair scheme
US8743650B2 (en) 2008-05-15 2014-06-03 Micron Technology, Inc. Block repair scheme
US8201024B2 (en) * 2010-05-17 2012-06-12 Microsoft Corporation Managing memory faults
US8386836B2 (en) 2010-05-17 2013-02-26 Microsoft Corporation Managing memory faults
US9070482B2 (en) 2010-06-17 2015-06-30 Lapis Semiconductor Co., Ltd. Multi-chip package semiconductor memory device
US20120005451A1 (en) * 2010-07-02 2012-01-05 Samsung Electronics Co., Ltd Data storage device and bad block managing method thereof
US9262099B2 (en) * 2011-04-01 2016-02-16 Industrial Bank Of Korea Non-volatile memory device, electronic control system, and method of operating the non-volatile memory device
US20140223080A1 (en) * 2011-04-01 2014-08-07 Ato Solution Co., Ltd. Non-volatile memory device, electronic control system, and method of operating the non-volatile memory device
EP2696350A4 (en) * 2011-04-01 2015-02-25 Industrial Bank Korea NON-VOLATILE MEMORY ELEMENT, ELECTRONIC CONTROL SYSTEM, AND METHOD FOR OPERATING THE NON-VOLATILE MEMORY ELEMENT
US20130031347A1 (en) * 2011-07-28 2013-01-31 STMicroelectronics (R&D) Ltd. Arrangement and method
US9026774B2 (en) * 2011-07-28 2015-05-05 Stmicroelectronics (Research & Development) Limited IC with boot transaction translation and related methods
EP2587487A1 (en) * 2011-10-24 2013-05-01 Samsung Electronics Co., Ltd File system and control method thereof
US20130103884A1 (en) * 2011-10-24 2013-04-25 Samsung Electronics Co., Ltd. File system and control method thereof
US9418700B2 (en) 2012-06-29 2016-08-16 Intel Corporation Bad block management mechanism
GB2518079A (en) * 2012-06-29 2015-03-11 Intel Corp Bad block management mechanism
WO2014003982A1 (en) * 2012-06-29 2014-01-03 Intel Corporation Bad block management mechanism
GB2518079B (en) * 2012-06-29 2016-08-03 Intel Corp Bad block management mechanism
US9032244B2 (en) 2012-11-16 2015-05-12 Microsoft Technology Licensing, Llc Memory segment remapping to address fragmentation
US20140149652A1 (en) * 2012-11-27 2014-05-29 Samsung Electronics Co., Ltd. Memory system and method of mapping address using the same
KR101799439B1 (ko) * 2012-11-27 2017-11-20 삼성전자주식회사 메모리 시스템 및 이를 이용한 어드레스 맵핑 방법
US9318168B2 (en) * 2012-11-27 2016-04-19 Samsung Electronics Co., Ltd. Memory system for continuously mapping addresses of a memory module having defective locations
CN103902475A (zh) * 2014-04-23 2014-07-02 哈尔滨工业大学 一种基于队列管理机制的固态硬盘并行访问方法及装置
US20150339223A1 (en) * 2014-05-22 2015-11-26 Kabushiki Kaisha Toshiba Memory system and method
JP2014157635A (ja) * 2014-06-06 2014-08-28 Lapis Semiconductor Co Ltd 半導体メモリ装置
US20160092285A1 (en) * 2014-09-25 2016-03-31 Intel Corporation Method and Apparatus for Approximating Detection of Overlaps Between Memory Ranges
US9910650B2 (en) * 2014-09-25 2018-03-06 Intel Corporation Method and apparatus for approximating detection of overlaps between memory ranges
US9880747B2 (en) * 2015-07-03 2018-01-30 Xitore, Inc. Apparatus, system, and method of logical address translation for non-volatile storage memory
US9916093B2 (en) 2015-07-22 2018-03-13 Samsung Electronics Co., Ltd. Nonvolatile memory device and storage device for storing bad block management information with high reliability
US9766814B2 (en) * 2015-08-10 2017-09-19 Intel Corporation Method and apparatus for defect management in a non-volatile memory device
US10339020B2 (en) * 2016-03-29 2019-07-02 Toshiba Memory Corporation Object storage system, controller and storage medium
US10146604B2 (en) * 2016-08-23 2018-12-04 Oracle International Corporation Bad block detection and predictive analytics in NAND flash storage devices
US10445199B2 (en) * 2016-12-22 2019-10-15 Western Digital Technologies, Inc. Bad page management in storage devices
US11086539B2 (en) * 2019-10-21 2021-08-10 Sandisk Technologies Llc Mapping consecutive logical block addresses to consecutive good blocks in memory device
US20210406170A1 (en) * 2020-06-24 2021-12-30 MemRay Corporation Flash-Based Coprocessor
US20230229304A1 (en) * 2020-11-25 2023-07-20 Micron Technology, Inc. Managing page retirement for non-volatile memory
US20220300424A1 (en) * 2021-03-18 2022-09-22 Kioxia Corporation Memory system, control method, and memory controller

Also Published As

Publication number Publication date
CN101772810B (zh) 2013-03-27
TWI376601B (en) 2012-11-11
US20150220441A1 (en) 2015-08-06
CN101772810A (zh) 2010-07-07
KR20100051804A (ko) 2010-05-18
TW200910088A (en) 2009-03-01
WO2009006442A1 (en) 2009-01-08
KR101573089B1 (ko) 2015-11-30
US9436609B2 (en) 2016-09-06

Similar Documents

Publication Publication Date Title
US9436609B2 (en) Block addressing for parallel memory arrays
KR101405741B1 (ko) 스트라이프-기반 비-휘발성 멀티레벨 메모리 동작
US7743303B2 (en) Defective memory block remapping method and system, and memory device and processor-based system using same
US20070300130A1 (en) Method of Error Correction Coding for Multiple-Sector Pages in Flash Memory Devices
US20100332895A1 (en) Non-volatile memory to store memory remap information
JP4492218B2 (ja) 半導体記憶装置
US9582224B2 (en) Memory control circuit unit, memory storage apparatus and data accessing method
US10229052B2 (en) Reverse map logging in physical media
US8775722B2 (en) Storing data in parallel in a flash storage device using on chip page shifting between planes
US20240126701A1 (en) Methods of memory address verification and memory devices employing the same
US20100037102A1 (en) Fault-tolerant non-volatile buddy memory structure
US10185662B2 (en) Methods for reprogramming data and apparatuses using the same
US20140013030A1 (en) Memory storage device, memory controller thereof, and method for writing data thereof
CN112463647A (zh) 使用散列来减小前向映射表的大小
US11048597B2 (en) Memory die remapping
KR101347590B1 (ko) 용장 데이터가 원격 버퍼 회로들에 버퍼되는 비휘발성 메모리 및 방법
US8738847B2 (en) Data writing method, and memory controller and memory storage apparatus using the same
US10109373B2 (en) Data storage apparatus and operating method thereof
KR101363965B1 (ko) 결함 위치들에 대한 데이터 래치들에 용장 데이터가 버퍼되는 비휘발성 메모리 및 방법

Legal Events

Date Code Title Description
AS Assignment

Owner name: MICRON TECHNOLOGY, INC., IDAHO

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:EGGLESTON, DAVID;REEL/FRAME:019515/0627

Effective date: 20070620

STCB Information on status: application discontinuation

Free format text: ABANDONED -- AFTER EXAMINER'S ANSWER OR BOARD OF APPEALS DECISION

AS Assignment

Owner name: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT, CALIFORNIA

Free format text: SECURITY INTEREST;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:038669/0001

Effective date: 20160426

Owner name: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGEN

Free format text: SECURITY INTEREST;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:038669/0001

Effective date: 20160426

AS Assignment

Owner name: MORGAN STANLEY SENIOR FUNDING, INC., AS COLLATERAL AGENT, MARYLAND

Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:038954/0001

Effective date: 20160426

Owner name: MORGAN STANLEY SENIOR FUNDING, INC., AS COLLATERAL

Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:038954/0001

Effective date: 20160426

AS Assignment

Owner name: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT, CALIFORNIA

Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE REPLACE ERRONEOUSLY FILED PATENT #7358718 WITH THE CORRECT PATENT #7358178 PREVIOUSLY RECORDED ON REEL 038669 FRAME 0001. ASSIGNOR(S) HEREBY CONFIRMS THE SECURITY INTEREST;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:043079/0001

Effective date: 20160426

Owner name: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGEN

Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE REPLACE ERRONEOUSLY FILED PATENT #7358718 WITH THE CORRECT PATENT #7358178 PREVIOUSLY RECORDED ON REEL 038669 FRAME 0001. ASSIGNOR(S) HEREBY CONFIRMS THE SECURITY INTEREST;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:043079/0001

Effective date: 20160426

AS Assignment

Owner name: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT, ILLINOIS

Free format text: SECURITY INTEREST;ASSIGNORS:MICRON TECHNOLOGY, INC.;MICRON SEMICONDUCTOR PRODUCTS, INC.;REEL/FRAME:047540/0001

Effective date: 20180703

Owner name: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT, IL

Free format text: SECURITY INTEREST;ASSIGNORS:MICRON TECHNOLOGY, INC.;MICRON SEMICONDUCTOR PRODUCTS, INC.;REEL/FRAME:047540/0001

Effective date: 20180703

AS Assignment

Owner name: MICRON TECHNOLOGY, INC., IDAHO

Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT;REEL/FRAME:047243/0001

Effective date: 20180629

AS Assignment

Owner name: MICRON TECHNOLOGY, INC., IDAHO

Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:MORGAN STANLEY SENIOR FUNDING, INC., AS COLLATERAL AGENT;REEL/FRAME:050937/0001

Effective date: 20190731

AS Assignment

Owner name: MICRON TECHNOLOGY, INC., IDAHO

Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT;REEL/FRAME:051028/0001

Effective date: 20190731

Owner name: MICRON SEMICONDUCTOR PRODUCTS, INC., IDAHO

Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT;REEL/FRAME:051028/0001

Effective date: 20190731