Processing

Please wait...

Settings

Settings

Goto Application

1. WO2020222878 - SYSTEMS AND METHODS FOR FINDING A LAST GOOD PAGE IN NAND OPEN BLOCK

Publication Number WO/2020/222878
Publication Date 05.11.2020
International Application No. PCT/US2019/066145
International Filing Date 13.12.2019
IPC
G06F 11/10 2006.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
11Error detection; Error correction; Monitoring
07Responding to the occurrence of a fault, e.g. fault tolerance
08Error detection or correction by redundancy in data representation, e.g. by using checking codes
10Adding special bits or symbols to the coded information, e.g. parity check, casting out nines or elevens
G06F 11/14 2006.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
11Error detection; Error correction; Monitoring
07Responding to the occurrence of a fault, e.g. fault tolerance
14Error detection or correction of the data by redundancy in operation, e.g. by using different operation sequences leading to the same result
G06F 3/06 2006.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
3Input 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
06Digital input from, or digital output to, record carriers
G06F 12/02 2006.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
12Accessing, addressing or allocating within memory systems or architectures
02Addressing or allocation; Relocation
CPC
G06F 13/1668
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
13Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
14Handling requests for interconnection or transfer
16for access to memory bus
1668Details of memory controller
G06F 3/0619
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
3Input 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
06Digital input from or digital output to record carriers ; , e.g. RAID, emulated record carriers, networked record carriers
0601Dedicated interfaces to storage systems
0602specifically adapted to achieve a particular effect
0614Improving the reliability of storage systems
0619in relation to data integrity, e.g. data losses, bit errors
G06F 3/064
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
3Input 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
06Digital input from or digital output to record carriers ; , e.g. RAID, emulated record carriers, networked record carriers
0601Dedicated interfaces to storage systems
0628making use of a particular technique
0638Organizing or formatting or addressing of data
064Management of blocks
G06F 3/0653
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
3Input 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
06Digital input from or digital output to record carriers ; , e.g. RAID, emulated record carriers, networked record carriers
0601Dedicated interfaces to storage systems
0628making use of a particular technique
0653Monitoring storage devices or systems
G06F 3/0659
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
3Input 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
06Digital input from or digital output to record carriers ; , e.g. RAID, emulated record carriers, networked record carriers
0601Dedicated interfaces to storage systems
0628making use of a particular technique
0655Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
0659Command handling arrangements, e.g. command buffers, queues, command scheduling
G06F 3/0679
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
3Input 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
06Digital input from or digital output to record carriers ; , e.g. RAID, emulated record carriers, networked record carriers
0601Dedicated interfaces to storage systems
0668adopting a particular infrastructure
0671In-line storage system
0673Single storage device
0679Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]
Applicants
  • WESTERN DIGITAL TECHNOLOGIES, INC. [US]/[US]
Inventors
  • ELIASH, Tomer
  • MEKHANIK, Evgeny
  • ROZMAN, David
  • CHASDAI, Yair
Agents
  • HURLES, Steven C.
Priority Data
16/398,59130.04.2019US
Publication Language English (EN)
Filing Language English (EN)
Designated States
Title
(EN) SYSTEMS AND METHODS FOR FINDING A LAST GOOD PAGE IN NAND OPEN BLOCK
(FR) SYSTÈMES ET PROCÉDÉS POUR TROUVER UNE DERNIÈRE BONNE PAGE DANS UN BLOC OUVERT NON-ET
Abstract
(EN)
A method for finding a last good page in a memory system includes determining a first number of write operations in a first queue at a first page in a memory block of the memory system. The method also includes determining whether the first number of write operations in the first queue is above a threshold. The method also includes based on a determination that the first number of write operations in the first queue is above the threshold, determining whether a second page in the memory block is empty. The method also includes identifying, based on a determination that the second page is empty, the last good page in the memory block using a binary search between the first page and the second page.
(FR)
L'invention concerne un procédé pour trouver une dernière bonne page dans un système de mémoire, qui consiste à déterminer un premier nombre d'opérations d'écriture dans une première file d'attente au niveau d'une première page dans un bloc de mémoire du système de mémoire. Le procédé consiste également à déterminer si le premier nombre d'opérations d'écriture dans la première file d'attente est supérieur à un seuil. Le procédé consiste également, sur la base d'une détermination que le premier nombre d'opérations d'écriture dans la première file d'attente est supérieur au seuil, à déterminer si une seconde page dans le bloc de mémoire est vide. Le procédé consiste également à identifier, sur la base d'une détermination que la seconde page est vide, la dernière bonne page dans le bloc de mémoire à l'aide d'une recherche binaire entre la première page et la seconde page.
Latest bibliographic data on file with the International Bureau