-
公开(公告)号:US20250028484A1
公开(公告)日:2025-01-23
申请号:US18781572
申请日:2024-07-23
Applicant: Micron Technology, Inc.
Inventor: Lalla Fatima Drissi , Doriana Tardio , Giuseppe D'Eliseo , Giuseppe Ferrari
IPC: G06F3/06
Abstract: Methods, systems, and devices for memory operations are described. A memory system may write data to sequential physical addresses of the memory system based on receiving multiple write commands, where the sequential physical addresses may be associated with sequential logical addresses. Based on writing the data, the memory system may receive a read command for data stored in the memory system, where the read command may include a logical address. The memory system may determine a physical address of the memory system where the data is stored based on the received logical address, a last logical address written at the memory system, and a sequence number group associated with the last logical address. Based on determining the physical address, the memory system may read the data stored at the physical address.
-
公开(公告)号:US20240272820A1
公开(公告)日:2024-08-15
申请号:US18423018
申请日:2024-01-25
Applicant: Micron Technology, Inc.
Inventor: Paolo Papa , Luigi Esposito , Massimo Iaculo , Giuseppe D'Eliseo , Alberto Sassara , Carminantonio Manganelli , Salvatore Del Prete
CPC classification number: G06F3/064 , G06F3/0604 , G06F12/0246 , G06F12/0646 , G06F2212/1024 , G06F2212/1044 , G06F2212/657 , G06F2212/7205
Abstract: Methods, systems, and devices for data relocation operation techniques are described. A memory system may include blocks of memory cells, for example, within a non-volatile memory device of the memory system. The memory system may identify a command to perform a data relocation operation associated with a block of memory cells and may select between a first procedure and a second procedure for performing the data relocation operation. The memory system may select between the first procedure and the second procedure based on whether one or more parameters associated with the data relocation operation satisfy a threshold. For example, the memory system may select the first procedure if the one or more parameters satisfy the threshold and may select the second procedure if the one or more parameters do not satisfy the threshold. The memory system may perform the data relocation operation using the selected procedure.
-
公开(公告)号:US11922069B2
公开(公告)日:2024-03-05
申请号:US17750131
申请日:2022-05-20
Applicant: Micron Technology, Inc.
Inventor: Alberto Sassara , Giuseppe D'Eliseo , Lalla Fatima Drissi , Luigi Esposito , Paolo Papa , Salvatore Del Prete , Xiangang Luo , Xiaolai Zhu
IPC: G06F3/06
CPC classification number: G06F3/0659 , G06F3/061 , G06F3/0679
Abstract: Methods, systems, and devices for adaptive block mapping are described. In some examples, a first superblock and a second superblock may be established across one or more dice of a memory device. The superblocks may each include one or more blocks from a plurality of planes of a memory die. In some examples, the second superblock may include at least one bad block (e.g., defective block) in addition to one or more good blocks (e.g., non-defective blocks). The memory device may receive a command for writing data in a first mode and may write a first subset of the data to the first superblock in the first mode, a second subset of the data to the second superblock in the first mode, and one or more blocks associated with the second superblock in a second mode. Additionally or alternatively, the memory device may receive a second command for writing data in the second mode and may write the data to the first superblock in the first mode.
-
公开(公告)号:US20210357127A1
公开(公告)日:2021-11-18
申请号:US16488696
申请日:2019-03-15
Applicant: Micron Technology, Inc.
Inventor: Paolo Papa , Carminantonio Manganelli , Massimo Iaculo , Giuseppe D'Eliseo , Alberto Sassara
IPC: G06F3/06
Abstract: Disclosed in some examples are improvements to data placement architectures in NAND that provide additional data protection through an improved NAND data placement schema that allows for recovery from certain failure scenarios. The present disclosure stripes data diagonally across page lines and planes to enhance the data protection. Parity bits are stored in SLC blocks for extra protection until the block is finished writing and then the parity bits may be deleted.
-
公开(公告)号:US20200142821A1
公开(公告)日:2020-05-07
申请号:US16075543
申请日:2017-12-13
Applicant: MICRON TECHNOLOGY, INC.
Inventor: Zhao Cui , Eric Kwok Fung Yuen , Guan Zhong Wang , Xinghui Duan , Giuseppe D'Eliseo , Giuseppe Ferrari
IPC: G06F12/02 , G06F12/0873
Abstract: Devices and techniques for synchronizing NAND logical-to-physical table region tracking are described herein. Table region data structures for physical blocks are maintained. These structures include logical-to-physical (L2P) mapping table portions that point to the respective physical blocks. When garbage collection is performed on a block, table region structures for that block, and another (e.g., the next block to be garbage collected) are read to avoid loading L2P table regions that do not point to the block. If any of the read portions of the L2P table region fail to point to either the block or the other block, these L2P table portions are removed from the loaded table region data structures.
-
公开(公告)号:US10552316B2
公开(公告)日:2020-02-04
申请号:US16024380
申请日:2018-06-29
Applicant: Micron Technology, Inc.
Inventor: Giuseppe D'Eliseo , Luigi Esposito , Xinghui Duan , Lucia Santojanni , Massimo Iaculo
Abstract: Devices and techniques for controlling NAND operation latency are described herein. A controlled can receive a write request. The controller can then calculate a number of garbage collection operations to perform on a physical block that is closed. Here, the calculation includes adding a logical-to-physical (L2P) region search ratio to a cadence calculation for garbage collection. Garbage collection operations can be performed on the physical block in accordance with the calculated number of garbage collection operations to perform. Then, the controller can perform the write request in response to completing the calculated number of garbage collection operations.
-
公开(公告)号:US11955189B2
公开(公告)日:2024-04-09
申请号:US18075027
申请日:2022-12-05
Applicant: Micron Technology, Inc.
Inventor: Carminantonio Manganelli , Paolo Papa , Massimo Iaculo , Giuseppe D'Eliseo , Alberto Sassara
CPC classification number: G11C16/3459 , G11C16/102 , G11C16/26 , G11C29/42 , H03K19/02
Abstract: Disclosed in some examples are improvements to data placement architectures in NAND that provide additional data protection through an improved NAND data placement schema that allows for recovery from certain failure scenarios.
The present disclosure stripes data diagonally across page lines and planes to enhance the data protection. Parity bits are stored in SLC blocks for extra protection until the block is finished writing and then the parity bits may be deleted.-
公开(公告)号:US20240112745A1
公开(公告)日:2024-04-04
申请号:US18527978
申请日:2023-12-04
Applicant: Micron Technology, Inc.
Inventor: Carminantonio Manganelli , Paolo Papa , Massimo Iaculo , Giuseppe D'Eliseo , Alberto Sassara
CPC classification number: G11C16/3459 , G11C16/102 , G11C16/26 , G11C29/42 , H03K19/21
Abstract: Disclosed in some examples are improvements to data placement architectures in NAND that provide additional data protection through an improved NAND data placement schema that allows for recovery from certain failure scenarios. The present disclosure stripes data diagonally across page lines and planes to enhance the data protection. Parity bits are stored in SLC blocks for extra protection until the block is finished writing and then the parity bits may be deleted.
-
公开(公告)号:US11720489B2
公开(公告)日:2023-08-08
申请号:US17902384
申请日:2022-09-02
Applicant: Micron Technology, Inc.
Inventor: Xinghui Duan , Giuseppe D'Eliseo , Lalla Fatima Drissi , Giuseppe Ferrari , Eric Kwok Fung Yuen , Massimo Iaculo
IPC: G06F12/02 , G06F12/1009
CPC classification number: G06F12/0253 , G06F12/1009 , G06F2212/1044 , G06F2212/7201 , G06F2212/7205
Abstract: A variety of applications can include apparatus and/or methods of operating the apparatus in which storage in the memory device is managed. An allocation can include conducting a garbage collection procedure to free up one or more blocks. In various embodiments, execution of a garbage collection procedure can be based on operation of two tables with respect to a logical to physical mapping table split into logical to physical mapping table regions saved in the memory device. The first table can maintain counts of valid pages in blocks for a logical to physical mapping table region. The second table can include bits to identify logical to physical mapping table regions involved in the garbage collection procedure based on the entries in the first table. Search of the second table can determine logical to physical mapping table regions involved in the garbage collection. Additional apparatus, systems, and methods are disclosed.
-
公开(公告)号:US11675709B2
公开(公告)日:2023-06-13
申请号:US17494740
申请日:2021-10-05
Applicant: Micron Technology, Inc.
Inventor: Giuseppe D'Eliseo , Carminantonio Manganelli , Paolo Papa , Yoav Weinberg , Giuseppe Ferrari , Massimo Iaculo , Lalla Fatima Drissi
IPC: G06F12/1009
CPC classification number: G06F12/1009 , G06F2212/657
Abstract: In one approach, a computer storage device has one or more pivot tables and corresponding bit maps stored in volatile memory. The storage device has non-volatile storage media that stores data for a host device. The pivot tables and bit maps are used to determine physical addresses of the non-volatile storage media for logical addresses received in commands from the host device that are determined to be within a sequential address range (e.g., LBAs that are part of a prior sequential write operation by the host device). When a command is received by the storage device that includes a logical address within the sequential address range, then one of the pivot tables and its corresponding bit map are used to determine the physical address of the non-volatile storage media that corresponds to the logical address.
-
-
-
-
-
-
-
-
-