GB2317722A - Managing Flash Memory - Google Patents

Managing Flash Memory Download PDF

Info

Publication number
GB2317722A
GB2317722A GB9620375A GB9620375A GB2317722A GB 2317722 A GB2317722 A GB 2317722A GB 9620375 A GB9620375 A GB 9620375A GB 9620375 A GB9620375 A GB 9620375A GB 2317722 A GB2317722 A GB 2317722A
Authority
GB
United Kingdom
Prior art keywords
volatile memory
memory means
electronic signals
flash memory
parametric data
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.)
Granted
Application number
GB9620375A
Other versions
GB9620375D0 (en
GB2317722B (en
Inventor
Leslie Innes Bothwell
Andrew Robert Blake
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.)
Nokia Oyj
Original Assignee
Nokia Mobile Phones Ltd
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 Nokia Mobile Phones Ltd filed Critical Nokia Mobile Phones Ltd
Priority to GB9620375A priority Critical patent/GB2317722B/en
Publication of GB9620375D0 publication Critical patent/GB9620375D0/en
Priority to EP97307125A priority patent/EP0834882B1/en
Priority to DE69710665T priority patent/DE69710665T2/en
Priority to US08/937,986 priority patent/US6301635B2/en
Priority to JP26433497A priority patent/JPH10133940A/en
Publication of GB2317722A publication Critical patent/GB2317722A/en
Application granted granted Critical
Publication of GB2317722B publication Critical patent/GB2317722B/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C16/00Erasable programmable read-only memories
    • G11C16/02Erasable programmable read-only memories electrically programmable
    • G11C16/06Auxiliary circuits, e.g. for writing into memory
    • G11C16/34Determination of programming status, e.g. threshold voltage, overprogramming or underprogramming, retention
    • G11C16/349Arrangements for evaluating degradation, retention or wearout, e.g. by counting erase cycles
    • G11C16/3495Circuits or methods to detect or delay wearout of nonvolatile EPROM or EEPROM memory devices, e.g. by counting numbers of erase or reprogram cycles, by using multiple memory areas serially or cyclically
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/0223User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023Free address space management
    • G06F12/0238Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
    • G06F12/0246Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C16/00Erasable programmable read-only memories
    • G11C16/02Erasable programmable read-only memories electrically programmable
    • G11C16/06Auxiliary circuits, e.g. for writing into memory
    • G11C16/10Programming or data input circuits
    • G11C16/102External programming circuits, e.g. EPROM programmers; In-circuit programming or reprogramming; EPROM emulators
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C16/00Erasable programmable read-only memories
    • G11C16/02Erasable programmable read-only memories electrically programmable
    • G11C16/06Auxiliary circuits, e.g. for writing into memory
    • G11C16/34Determination of programming status, e.g. threshold voltage, overprogramming or underprogramming, retention
    • G11C16/349Arrangements for evaluating degradation, retention or wearout, e.g. by counting erase cycles
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/72Details relating to flash memory management
    • G06F2212/7211Wear leveling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04MTELEPHONIC COMMUNICATION
    • H04M1/00Substation equipment, e.g. for use by subscribers
    • H04M1/72Mobile telephones; Cordless telephones, i.e. devices for establishing wireless links to base stations without route selection
    • H04M1/724User interfaces specially adapted for cordless or mobile telephones

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Read Only Memory (AREA)
  • Techniques For Improving Reliability Of Storages (AREA)
  • Memory System (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

To reduce wear on a write-few Flash memory changes are written to the Flash memory in batches. Changes to be made are held in RAM and written to the Flash memory depending on their number, their priority levels and the time intervals elapsing between receipt of changes by the RAM. The Flash memory manager monitors the number of times that its blocks are erased and can copy data from the most erased block to the least to even up wear since it is likely that the data transferred from the most erased block is likely to be updated often. The Flash memory manager has an interrupt handling routine which operates during erase or write operations. If an erase operation is in progress, it is halted and reading is enabled. If a write operation is in progress, the interrupt is suspended until the current word has been written at which time memory reading is enabled. If more words remain to be written the write operation is resumed with the next word after the interrupt has been processed.

Description

2317722 Memory Device The present invention relates to a memory device and
method of operation therefor. In particular, but not exclusively, the present invention relates to memory devices known as flash memory.
Semiconductor or solid state memory devices comprise electrical signals or charges arranged to be representative of the data which is desired to be stored in the memory device. Memory devices which require power to be supplied to them in order that the electrical signals can be maintained, sometimes referred to as being refreshed, are known as volatile memories. Memory devices not requiring power to maintain the electrical signals are known as non-volatile memories. An early type of non-volatile memory is known as a Read Only Memory (ROM), in which the electrical signals or charges representative of data were created at the time of manufacturing the ROM and then the data represented by the electrical signals was read back when the device was in operation. The facility for a user to program a ROM and electrically erase data stored on the device and replace it with other data is possible with Electrically Erasable Programmable Read Only Memories (EEPROMs).
Programming an EEPROMs is relatively slow since inputloutput of data and addressing is in a serial format. Additionally, special "high" voltages are required when programming the EEPROM. However, EEPROMs are particularly useful in portable electronic apparatus where user or system parameters are altered during 2 use of the portable apparatus, and need to be stored when the apparatus is powered down for future use next time the portable apparatus is operating. Such a portable apparatus may be a radio telephone for example, where the parameters are for call counters/timers, last call stack, user settings for the user interface and user name and number memory for example. Such use may be referred to as a "write oncelread many" type of application where the relative slowness during use and" high power consumption during reprogramming does not mitigate against the use of EEPROMs for portable battery powered apparatus.
However, EEPROMs are typically only available in relatively small memory sizes such as 8 Kbyte or 16 Kbyte sizes, before they become prohibitively expensive. As more and more non-volatile memory space is required at lower power consumption for portable electronic apparatus, alternatives to EEPROM are required. Such an alternative is so-called Flash Memory which is available with large storage densities, for example 16 and 32 Mbit devices are commercially available.
Flash memory is faster than EEPROM since it uses a parallel addressing and data format. Additionally, it has lower stand-by power consumption than EEPROM. Flash memory erases in blocks which are groups of bytes usually in multiples of 4K, 8K, 16K and so-forth. Erasing a block at a time usually makes reprogramming Flash Memory faster than reprogramming EEPROM, which is the origin of the term "flash".
Nevertheless, a block erase takes a relatively long time, typically 0.5 seconds for an 8 Kbyte block.
3 The feature of block only erase has resulted in Flash Memory being used to store 1inked list" data structures. Such a structure is described in Intel Corporation Application Note AP-604 for their Smart Voltage Boot Block Flash Memory Family. In these Flash Memory devices two so-called parameter blocks are provided for storing data that will change. Only one of the parameter blocks is in use at any one time. Each data record comprises a parameter value and a pointer to the next record for that parameter. If the parameter value for a record is the current value then the pointer is "empty" or given a value such as FFH indicating that there is no further record for the parameter. When a parameter value is updated the pointer for the previous current value is changed from "empty" to having the address of the record in which the new parameter value is to be stored. The new record has the new value stored in it, and an "empty" pointer.
Parameter values are stored in the linked list structure until the current parameter block is full. When this point is reached the latest value for each parameter is stored in the second parameter block, now the current parameter block, and the linked list structure continues in the new current block. The original current parameter block is then erased.
However, although Flash Memory addresses some of the problems and drawbacks associated with EEPROMs and the like, Flash Memory has its own drawbacks. During an erase cycle it is not possible to read from any block, whether or not that block is being erased, which is a significant disadvantage over EEPROM where data can be read or written to any individual byte. Additionally, the number of erase 4 cycles which Flash Memory can undergo before degradation in performance occurs is limited to about 100,000 erase cycles, which is significantly less than the limitation on EEPROMs.
The present invention aims to ameliorate at least one of the problems or drawbacks experienced with flash memory devices.
In accordance with an embodiment of a first aspect of the present invention there is provided a memory management method comprising, storing electronic signals representative of parametric data in a volatile memory means, and storing in a nonvolatile memory means electronic signals corresponding to the electronic signals representative of parametric data stored in the volatile memory means, said storing electronic signals in the non-volatile memory means being in dependence on the nature of the parametric data, for reducing wear of the non- volatile memory means.
An embodiment of the present invention has an advantage that non-volatile memory is not used each time a parameter or variable value is updated. Instead, volatile memory is used. This reduces wear of non-volatile memory. Additionally, since there are fewer parameter or variable value updates to the non-volatile memory than would otherwise be necessary, the performance of, for example a micro processor, is improved since typically it is quicker to read/write to volatile memory than nonvolatile memory. Since non-volatile memory typically requires higher voltages than volatile memory for writing to the memory, an embodiment in accordance with the invention may use less power than conventional memory systems.
In a preferred embodiment of the present invention the electronic signals corresponding to the electronic signals representative of parametric data stored in the volatile memory means are stored in the non-volatile memory means dependent on storing the electronic signals in the non-volatile memory previously occurring concurrently with storing the electronic signals representative of parametric data in the volatile memory means. This addresses the problem that when data has been written to the volatile memory during writing of data to the non-volatile memory, the contents of the volatile and non-volatile memories may be different. In accordance with the preferred embodiment any inconsistency due to such overlapping may be resolved by updating the contents of the volatile memory to the non-volatile memory.
Preferably, the method further comprises the steps of determining a priority level for parametric data represented by the electronic signals stored in the volatile memory means, and initiating storing in the nonvolatile memory means the electronic signals corresponding to the electronic signals representative of parametric data stored in the volatile memory means in accordance with a priority level for the parametric data. Typically, the parametric data is categorised having a first high level priority or a second low level priority thereby preferably updating the nonvolatile memory important data stored in volatile memory. Optionally, all parametric data may have the same priority level and initiating storing in the non-volatile memory means may be determined by a suitable single criterion to balance likelihood of loss of data against number of stores to non-volatile memory.
6 Suitably, the method further comprises determining the expiration of a predetermined time period since storing the electronic signals representative of parametric data in volatile memory means, and initiating storing in a non-volatile memory means the electronic signals corresponding to the electronic signals representative of parametric data stored in the volatile memory means. Typically the predetermined time period is shorter for parametric data having the first high level priority than for parametric data having the second low level priority.
Optionally, the method further comprises counting the number of occurrences of storing in the volatile memory means the electronic signals representative of the parametric data, determining the said number exceeding a predetermined threshold, and initiating storing in the non-volatile memory means the electronic signals corresponding to the electronic signals representative of parametric data stored in the volatile memory means. Typically, the predetermined threshold comprises a lower number of occurrences for parametric data having the first high level priority than for parametric data having the second low level priority.
In a second aspect of the present invention there is provided electronic apparatus, comprising a volatile memory means, a non-volatile memory means, and control circuitry, wherein the control circuitry is adaptable to store electronic signals representative of parametric data in the volatile memory means, and store in the non-volatile memory means electronic signals corresponding to electronic 7 signals representative of parametric data. stored in the volatile memory means in dependence on the nature of the parametric data.
Embodiments in accordance with the present invention will now be described, by way of example only, and with reference to the accompanying drawings, in which:
Figure 1 shows a typical Flash Memory map; Figure 2 shows a block diagram of a VILS1 microcontroller, Figure 3 shows a flow chart for a Flash Memory Manager RAM Cache Routine in accordance with a preferred embodiment of the invention; Figure 4 shows a flow chart for a Flash Memory Manager Interrupt Handling routine, and Figure 5 shows a schematic representation of a Flash Memory Manager Block Copy Policy.
Intel Corporation 4-Mbit Smart Voltage Boot Block Flash Memory is described in application note AP-604 published November 1995. A memory map for the Intel 4-Mbit Flash Memory is shown in Fig. 1. Intel's 4-Mbit Flash Memory 100 is divided into blocks, each block having a fixed address range. Blocks 102, 104 and 106 are 128 Kbyte blocks extending between addresses OOOOOH to 30000H. Additionally, there is a 96 Kbyte block 108 extending between address 30000H and 3BFFFH. Flash Memory blocks 102, 104, 106 and 108 comprise main memory blocks and are typically used to store data or information which is not going to change or is unlikely to change during use of the Flash Memory 100. Such data or information may be 8 application software or a program for operating a device where only occasional software upgrades or updates required. The Intel 4-Mbyte Flash Memory also comprises two 8 Kbyte parameter blocks 110 and 112. Parameter block 1, 110, extends between addresses 3C000H and 3UFFH, and parameter block 11, 112, extends between addresses 3DOO0H and 3DFUR Parameter block i and parameter block I 1, 110 and 112, are blocks of Flash Memory reserved for storing data which is typically up-dated during operation of the Flash Memory 100. For example, the data may be parameters relating to the operation of the electronic apparatus in which the Flash Memory 100 is situated. If this was a portable radio telephone for example, such information may relate to the user interface set-up, the user personal telephone directory or some other parameter of the radio telephone which varies during use and must be retained during power down of the radio telephone. The final memory block, block 114, is a code block and is suitably reserved for storing software necessary to initialise the operating system of a electronic apparatus for example, and to provide for the recovery of a system in the event of application code catastrophically failing. Additionally, code block 114 typically stores the code necessary to program and erase the Flash Memory. Code block 114 is often referred to as a boot block and occupies the highest region of memory, address 3E000H to 3FFFFI-1.
In common with other semi-conductor memories, Flash Memory stores data as electronic signals. The data is stored as binary information, that is to say the information or stored data represents either a "Y' or "0". It is a characteristic of Flash Memory that it is only possible to write (or program) information to the Flash 9 Memory by changing M "s to "O"s. Thus, Flash Memory is initialised ready for writing (or programming) by filling each memory location with M"s. To erase Flash Memory uO"s are changed to M"s. Additionally, it is a characteristic of Flash Memory that erase processes are carried out on a block by block basis. Referring to Fig. 1, an erase process or cycle would have to take place on one of blocks 102 to 114. It is not possible to selectively erase information within a block; all of the information in that block has to be erased. A block erase only erases information in the one block, all other blocks are unaffected. An erase cycle is typically defined as an erase operation followed by a writing or programming operation, or visa versa. Reading from Flash Memory is carried out in a relatively conventional manner by first addressing the location it is desired to read data from, and then reading that data. It is a feature of the Intel 4 M-byte Smart Voltage Boot Block Flash Memory that it is only specified to work over 100,000 erase cycles when operating at a 5 volt power supply within a standard temperature range, and only 10,000 cycles for an extended temperature range. This upper limit on the specified number of cycles may be a limitation to utilisation of such Flash Memory devices in some types of electronic apparatus.
Referring now to Fig. 2, there is shown a block diagram of a microcontroller 200 having a multiplicity of integrated on-board functioning units. Micro-controller 200 comprises a CPU 202, Flash Memory 204, Random Access Memory (RAM) 206, input/output drivers 208 and Digital Signal Processor (DSP) 210. CPU 202 may be a conventional processor unit having the normal functions associated with such processors and interacting with other functional units within the micro-controller 200, and on signals supplied to the micro-controlier 200 from electronic apparatus associated with the micro-controller. Inputloutput driver 208 handles transfer of data between individual functional units on board the micro-controller 200 as well as handling data flow between the units of micro-controller 200 and external electronic apparatus. As integration becomes greater and greater it is not uncommon to find sophisticated functional units on board a micro-controller such as DSP 210 suitably programmed to carry out vocoding functions, for example in a radiotelephone. Typically micro-controller 200 also has on-board various types of memory. Flash Memory 204 provides non-volatile memory means and is often used as a replacement for and emulates EEPROM, and RAM 206 provides volatile memory means and is usually provided to serve its normal function such as scratch pad memory or for use in association with any software running in the CPU.
Flash Memory 204 typically has stored in memory block 114 instructions for CPU 202 to perform writing and erasing of the Flash Memory 204. However, since the Flash Memory is not able to read from one address location whilst writing to another address location within the same device, any instruction that involves writing to a Flash Memory location must first be temporarily stored in RAM 206 in order that the code may be executed to perform the writing process. Since the erase process is a process of changing "O"s to "1"s, i.e. a form of "writing", erase cycle instructions must also be temporarily downloaded to RAM before the erase cycle begins.
In accordance with a preferred embodiment of the invention RAM 206 c omprises an 8 Kbyte block, hereinafter referred to as 8K RAM cache, for interim storage of 11 parameters or variables which are to be stored in one of Flash Memory parameter blocks 110, 112. CPU 202 is conditioned in accordance with a set of machinereadable instructions known as a Flash Memory Manager (FIVIM) to provide means to manage efficient use of the Flash Memory. A set of machine-readable instructions known as FIVIM-RAM Cache Routine are provided for controlling the storage of parameters in and between RAM cache 212 and parameter blocks 110 and 112. Typically, FIVIM instructions such as FIVIM-RAM Cache Routine instructions are stored in main memory blocks 102 to 108 of Flash Memory 200, and may be downloaded to RAM 206 if the FIVIM instructions are to comprise writing or erasing of a block of Flash Memory, in particular of one or other of parameter blocks 110, 112.
Referring to Fig. 3, there is shown a flowchart 300 in accordance with a preferred embodiment of the invention for the operation of CPU 202 conditioned in accordance with FMMRAM Cache Routine instructions. When a parameter stored in the currently active flash parameter block, 110 for example, of Flash Memory 100 is changed, altered or updated the FIVIM 300 enters state 302 in which a corresponding parameter stored in RAM cache 212 is updated with the new parameter value. FIVIM 300 then proceeds to state 304 where it is determined whether or not any updating of RAM cache 212 has occurred during a write to the currently active flash parameter block 110. If a RAM cache update has occurred during a flash write then FIVIM 300 enters state 306 where the currently active flash parameter block 110 has the contents of RAM cache 212 written to it in order to update RAM cache 212 to the currently active flash parameter block 110. This 12 takes account of any inconsistencies between parameter values stored in the RAM cache 212 and the currently active flash parameter block 110 due to there being a write to RAM cache 212 during a flash write which may have caused the currently active flash parameter block 110 to then have partly old data and partly new data stored in it. If state 304 is NO then FMM 300 enters state 308 where the priority of the parameter currently updated in RAM is determined. It should be noted that in accordance with the invention the parameters are either designated "urgent" or "lazy" parameters depending upon their importance to the operation of the electronic apparatus in which the Flash Memory or micro-controller resides. Which parameters are "urgent" and which are "lazy", and how such priorities are distributed amongst the various parameters for the electronic apparatus is not relevant to the instant invention. It is merely necessary to note that parameters having those respective two levels of priority exist within the system and are capable of being identified as having such priorities. Clearly, there may be more than two levels of priority in any system and FMM 300 may be suitably altered to accommodate other levels of priority. If the current parameter has a "lazy" priority then FIVIM 300 enters state 310 and if the current parameter has an "urgent" priority then FIVIM 300 enters state 312. During state 310 if more than five "lazy" parameters have been written to RAM cache 212 since the last flash back-up OR it has been more than one minute since the last "lazy" parameter was written to RAM cache 212 and there have been no intervening flash back-ups then FIVIM 300 enters state 306 where the currently active flash parameter block 110 has the contents of RAM cache 212 written to it in order to back-up the RAM cache 212. If state 310 is NO then the FMM 300 enters state 302 where it waits for the next parameter to be up-dated to the RAM cache 13 212. In state 312 if more than one urgent parameter has been written to the RAM cache 212 since the last flash back-up OR it has been two seconds since the last urgent parameter was written to RAM cache 212 and there has been no interim back-up to flash then FIVIM 300 enters state 306 where the contents of RAM cache 212 is backed-up to the currently active flash memory parameter block 110. If state 312 is NO then FIVIM 300 enters state 302 where the process waits for the next parameter to be up- dated in RAM cache 212.
It will be clear to a person skilled in the art that the criteria in respective states 310 and 312 need not be as specifically described, but may be varied to take into account the nature and priority of the parameters for any particular electronic apparatus.
As is clear from the flowchart of Fig. 3, FIVIM 300 has states which require writing to the active flash memory parameter block 110, and states which do not require such writing. Consequently, it is possible that not all of the instructions relating to FIVIM 300 need be downloaded from Flash Memory to RAM 206 when CPU 202 is to be conditioned to operate in accordance with FMM 300, but only that part of FIVIM 300 instructions which initiate a "write" to Flash Memory parameter block 110.
Since Flash Memory cannot be individually erased, each subsequent back-up with contents of RAM cache 212 is written to the next available address within the active Flash Memory parameter block 110. A linked list data structure as described before is particularly suitable for this purpose Eventually, the currently active Flash 14 Memory parameter block 110 becomes full. Then the most up to date values forthe parameters stored in the currently active Flash Memory parameter block 110 are then stored in the second Flash Memory parameter memory block 112. The second Flash Memory parameter block now becomes the currently active parameter block and the contents of RAM cache 212 are now up-dated to the new currently active parameter block 112 under the control of FIVIM 300. At a convenient point in the operation of the electronic apparatus, the original active parameter block 110 is erased,. i.e. all memory locations filled with "V's, and made ready for receiving updated parameter values when the currently active parameter block 212 becomes full.
Flash Memory managed by FIVIM-RAM cache routine in accordance with the preferred embodiment of the present invention is capable of having effectively longer use since it is not necessarily up-dated for every change in parameter value but only when there have been certain numbers of parameter up-dates or when the parameter is sufficiently important for it to be saved to Flash Memory promptly. Thus, more parameter up-dates are available than would be available with a conventionally managed Flash Memory.
During the operation of electronic apparatus controlled by a central processor unit such as CPU 202, information has to be read from memory devices such as Flash Memory 204 and RAM 206. However, as described above it is not possible to read from Flash Memory 204 during a write to or erase of a block of the Flash Memory. Thus, if a request by the CPU to read data from Flash Memory 204 occurs during a write or erase the request will be denied. Such requests are hereinafter referred to as Interrupts.
Depending upon the type of electronic apparatus and its state, the apparatus will cease to function correctly if Interrupts or at least certain types of Interrupt, are not serviced promptly. For an erase the delay may be up to 2 seconds for an 8K block, which is typically far too long a delay before servicing an Interrupt.
Referring now to Fig. 4, there is shown a flow chart for a Flash File Manager (FIVIM) Interrupt Handler Routine 400. CPU 202 may be conditioned to operate in accordance with FIVIM Interrupt Handler Routine 400. When an Interrupt occurs which requires access to Flash Memory 204 FIVIM Interrupt Handler 400 is invoked. FIVIM Interrupt Handler determines at state 402 whether the Flash Memory 204 is currently undergoing a write or erase operation. If no such operation is in progress then state 404 is entered in which the system standard interrupt handler routine is initiated. Standard interrupt handling routines are well known to a skilled person and no detailed description of them is necessary. The standard interrupt handler services the interrupt request in a conventional manner, reading from whatever data locations are necessary. If a write or erase is in progress then if a "short" write to Flash Memory 204 is in progress FIVIM Interrupt Handler 400 enters state 406, if a "long" write, e.g. a word write, is in progress state 408 is entered, and if an erase is in progress state 410 is entered.
16 For a short write to Flash Memory 204, state 406, Interrupt Handler 400 enters state 412 where the interrupt is disabled. When the "short" write is completed then Interrupt Handler 400 enters state 414 in which the Flash Memory 204 block read mode is enabled. The Interrupt Handler then enters state 404 in which the Standard Interrupt Handler is invoked. The maximum duration for a write to qualify as a Ushorf' write is typically dependent on the nature of the electronic apparatus controlled by and the instructions running on CPU 202, and may be suitably determined by a person skilled in the art. Generally, a write of less than six, machine cycles or one instruction may be considered a "short" write.
If a "long" write, i.e. comprising many "words", is in progress then Interrupt Handler 400 enters state 408 and determines if a word (typically 8 or 16 bits) is currently being written to Flash Memory 204. If not then the Interrupt Handler 400 goes to state 414 where the block read mode is entered for Flash Memory 204, and then state 404 is entered where the standard interrupt handler is invoked. If a word is currently being written to Flash Memory 204, then state 412 is entered and the interrupt disabled until such time as the word write ceases. Then state 414 is entered and the block read mode enabled, and standard interrupt handler invoked at state 404. Optionally, interrupts may be enabled in between word writes since there is typically a pause between word writes for the new word to be placed into a data buffer or the address for writing the new word to be loaded. Thus, if an interrupt occurs during such an enabled period the FMM Interrupt Handler can place the Flash Memory 204 into read mode in order that the interrupt may be serviced. The FIVIM Interrupt Handler may determine when the "long" write is between word writes 17 and then place Flash Memory 204 into the read mode; or note when a "long" write is likely to be between word writes.
If FIVIM Interrupt Handler 400 enters state 410, where an erase in progress has been detected, the erase process is halted and the block read mode enabled, state 414. The Standard Interrupt Handler is invoked at state 404.
From state 404, FIVIM Interrupt Handler 400 enters state 416 which is a continuation of the operation being performed prior to the Interrupt Handler being invoked. For example, if an erase was in progress then in state 416 the erase continues from where it was halted to service the interrupt. Similarly, if a "long" write was in progress and interrupted, then the next word write is performed in state 416.
FIVIM Interrupt Handler 400 may be stored in Flash Memory 204, but when a flash erase or write operation is to be performed it is temporarily transferred to RAM 206. Optionally, Interrupt Handler 400 may be preferably stored in RAM 206. Whether only temporarily or preferably stored in RAM, interrupt requests must be vectored to the RAM address containing FIVIM Interrupt Handler 400.
As described earlier Flash Memory 204 has a finite number of erase cycles which can be performed before there is a degradation of performance of the Flash Memory. Flash Memory Manager provides a set of machine-readable instructions known as FIVIM Block Re-use Policy to CPU 202 to provide means for re-using flash 18 memory blocks evenly so that all blocks get approximately the same wear for each block.
Referring now to Figure 5, there is shown a schematic representation ofFMM Block Re-use Policy. CPU 202 may be conditioned to operate in accordance with FIVIM Block Re-use Policy. The Block Re-use Policy comprises a set of sub routines labelled erase-count 502, erase-initiate 504, copy_initiate 506, copy_jrom 508, copyjo 510 and copy---jor-wearlevel ling 512.
Erase-count sub routine 502, keeps track of how many times a block has been erased. The number of times a block has been erased is known as the block wear count. The block wear count is initialised at 0 the first time the flash memory is used. That is to say the first time that the Flash Memory Manager runs in the electronic apparatus in which the Flash Memory 204 resides. There is a block wear count for each block of Flash Memory, and the block wear count is incremented each time a corresponding block is erased. Generally a block is erased so that another block may be copied into it. Thus, block wear count for the block being erased may be stored in the block from which the copy is to be made whilst the block to which the copy is to be made is being erased.
Erase-initiate sub routine 504 controls the operation of erase processes within the Flash Memory 204. Typically, blocks that can be erased will be erased, such erasing only being interrupted when the Flash Memory Manager requires such interruption due to the need to service interrupt requests from CPU 202.
19 Initiation of a copy is controlled by machine-readable instructions in accordance with copy_initiate sub routine 506. The criteria for initiating a block copy from a nearly full block to an unused block is that:
at least one block is over 80% full and has at least 20% wasted space in it. AND a free block of the same size is available.
Other conditions or criteria may be determined by a person skilled in the art to adapt copy---initiate sub routine 506 to a particular electronic apparatus or micro control]erlinstruction set architecture.
When the conditions for fulfilling the criteria in copy_initiate sub routine 506 are met, copy_jrom sub routine 508 and copy_to sub routine 510 are invoked. Copy-jrom sub routine 508 causes the contents of the block with the greatest wasted space to be copied from. Typically, when copy_from sub routine 508 is invoked there is normally more than one candidate block to copy from. For example, if there are eight 8 Kbyte blocks of which six blocks are full:
One having 90% wasted space with a wear count of thirty, One having 80% wasted space with a wear count of twenty, One having 50% wasted space with a wear count of nine, One having 45% wasted space with a wear count of three, One having 30% wasted space with a wear count of two, and the final one having 10% wasted space. One of the blocks being erased and the final block has been erased.
In accordance with the criteria in copyjrom sub routine 508 the candidate for which copies are to be made is that with the 90% wasted space. However, this block has the highest wear count. It is an option that a trade-off may be made between the wear count and the percentage wastage. For example, the higher the percentage wasted, the better use of memory resources and increased time to next block copy, due to the greatest space being freed. If the block with the greatest wasted space is not chosen, the implication is that the next copy will happen sooner and hence produce a block copy requirement sooner and therefore introduce wear sooner. It should be noted that the term "wasted space" refers to memory locations which store parameter values which have been updated, such that the updated value is in a different memory location.
Since each flash block can be erased and re-written 100,000 times, the wear count is a low factor in the decision as to which block a copy should be made from. Hence in the specific embodiment copyjrom sub routine 508 ignores the wear count and uses the simple criteria that the block to be copied is that with the greatest wasted space. That is not to say, that a person skilled in the art would not wish to utilise a trade off between wear count and percentage wasted space to optimise utilisation of a flash memory device within a particular environment.
21 When copy_to policy 510 is invoked, there is typically more than one candidate memory block in which to copy to. For example, taking eight 8 Kbyte blocks four of which are full, one of which has data which has already been copied to another block, one is being erased and two have been erased, only two blocks are immediately available for use. That is to say the two memory blocks which have already been erased. Each of these two blocks will have a block wear count. The criteria for copyjo sub routine 510 is that the first block to be copied to will be the block with the lowest wear count.
In certain types of application it is possible that some flash memory blocks never or rarely get erased. For example, an application may save two large records to a memory block and never remove or write them. In such a situation, this particular block would not wear out whereas the other blocks in the Flash Memory would wear out. Copy_jor-wearlevelling_only sub routine 512 is adapted to identify any major discrepancy between the wear values of blocks within the Flash Memory and force a block copy from a relatively unworn block to the most worn block and vice versa. In this way the little worn block becomes heavily used and wear on the heavily worn block is substantially reduced. The forced copy occurs when the difference between the wear level in the least used block and the wear level in the most used block exceeds a predetermined value. This value is dependent upon the applications which are using the flash memory but would typically be in the range of 1-40%. Modifications to this range may be made depending on the writelerase frequency for the Flash Memory such that high writelerase use would cause forced copy to occur more often. Additionally, as the wear count increases for blocks then forced copy 22 would occur more often. Forced copy may be made adjustable to take into account the foregoing criteria, even on a block basis.
In view of the foregoing description it will be evident to a person skilled in the art that various modifications may be made within the scope of the invention, for example, as mentioned earlier there may be more than two priority levels for parameters and the criteria for determining whether or not the RAM cache 212 is backed-up to Flash Memory 100 may be adapted to suit the electronic apparatus in which micro- controller 200 and Flash Memory 100 resides. For example, a further state may exist in the FIVIM 300 which detects initiation of power down of portable electronic apparatus and prior to power down backs up the RAM cache 212 to the currently active Flash Memory parameter block.
The scope of the present disclosure includes any novel feature or combination of features disclosed therein either explicitly or implicitly or any generalisation thereof irrespective of whether or not it relates to the claimed invention or mitigates any or all of the problems addressed by the present invention. The applicant hereby gives notice that new claims may be formulated to such features during prosecution of this application or of any such further application derived therefrom.
23

Claims (11)

1. A memory management method comprising, storing electronic signals representative of parametric data in a volatile memory means, and storing in a nonvolatile memory means electronic signals corresponding to the electronic signals representative of parametric data stored in the volatile memory means, said storing electronic signals in the nonvolatile memory means being in dependence on the nature of the parametric data, thereby reducing wear of the non-volatile memory means.
2. A method according to claim 1, wherein the electronic signals corresponding to the electronic signals representative of parametric data stored in the volatile memory means are stored in the non-volatile memory means dependent on storing the electronic signals in the non-volatile memory previously occurring concurrently with storing the electronic signals representative of parametric data in the volatile memory means.
3. A method according to claim 1, further comprising the steps of determining a priority level for parametric data represented by the electronic signals stored in the volatile memory means, and initiating storing in the non-volatile memory means the electronic signals corresponding to the electronic signals representative of parametric data stored in the volatile memory means in accordance with a priority level for the parametric data.
24
4. A method according to claim 3, wherein the parametric data is categorised having a first high level priority or a second low level priority.
5. A method according to claim 1, claim 3 or claim 4, further comprising determining the expiration of a predetermined time period since storing the electronic signals representative of parametric data in volatile memory means, and initiating storing in a non-volatile memory means the electronic signals corresponding to the electronic signals representative of parametric data stored in the volatile memory means.
6. A method according to claim 5 dependent on claim 3, wherein the predetermined time period is shorter for parametric data having the first high level priority than for parametric data having the second low level priority.
7. A method according to claim 4, further comprising counting the number of occurrences of storing in the volatile memory means the electronic signals representative of the parametric data, determining the said number exceeding a predetermined threshold, and initiating storing in the non-volatile memory means the electronic signals corresponding to the electronic signals representative of parametric data stored in the volatile memory means.
8. A method according to claim 7, wherein the predetermined threshold comprises a lower number of occurrences for parametric data having the first high level priority than for parametric data having the second low level priority.
9. A method for memory management substantially as hereinbefore described, and with reference to Figures 1, 2 and 3 of the drawings
10. Electronic apparatus, comprising a volatile memory means, a non- volatile memory means, and control circuitry, wherein the control circuitry is adaptable to store electronic signals representative of parametric data in the volatile memory means, and store in the non- volatile memory means electronic signals corresponding to electronic signals representative of parametric data stored in the volatile memory means in dependence on the nature of the parametric data.
11. Electronic apparatus substantially as hereinbefore described, and with reference to Figures 1, 2 and 3 of the drawings.
GB9620375A 1996-09-30 1996-09-30 Memory device Expired - Fee Related GB2317722B (en)

Priority Applications (5)

Application Number Priority Date Filing Date Title
GB9620375A GB2317722B (en) 1996-09-30 1996-09-30 Memory device
EP97307125A EP0834882B1 (en) 1996-09-30 1997-09-15 Memory management method and apparatus
DE69710665T DE69710665T2 (en) 1996-09-30 1997-09-15 Memory management method and apparatus
US08/937,986 US6301635B2 (en) 1996-09-30 1997-09-26 Memory device
JP26433497A JPH10133940A (en) 1996-09-30 1997-09-29 Memory device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GB9620375A GB2317722B (en) 1996-09-30 1996-09-30 Memory device

Publications (3)

Publication Number Publication Date
GB9620375D0 GB9620375D0 (en) 1996-11-13
GB2317722A true GB2317722A (en) 1998-04-01
GB2317722B GB2317722B (en) 2001-07-18

Family

ID=10800724

Family Applications (1)

Application Number Title Priority Date Filing Date
GB9620375A Expired - Fee Related GB2317722B (en) 1996-09-30 1996-09-30 Memory device

Country Status (5)

Country Link
US (1) US6301635B2 (en)
EP (1) EP0834882B1 (en)
JP (1) JPH10133940A (en)
DE (1) DE69710665T2 (en)
GB (1) GB2317722B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1065667A2 (en) * 1999-06-29 2001-01-03 Nec Corporation Microcomputer with a flash memory and rewrite count management method
WO2008029389A1 (en) * 2006-09-04 2008-03-13 Sandisk Il Ltd. Device and method for prioritized erasure of flash memory
US7975119B2 (en) 2006-09-04 2011-07-05 Sandisk Il Ltd Device for prioritized erasure of flash memory
US8117414B2 (en) 2006-09-04 2012-02-14 Sandisk Il Ltd. Method for prioritized erasure of flash memory

Families Citing this family (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3718578B2 (en) * 1997-06-25 2005-11-24 ソニー株式会社 Memory management method and memory management device
JP2000172549A (en) * 1998-12-04 2000-06-23 Mitsubishi Electric Corp Information processor used together with eprom
US6104638A (en) * 1999-02-26 2000-08-15 Hewlett-Packard Company Use of erasable non-volatile memory for storage of changing information
JP2001056760A (en) * 1999-08-19 2001-02-27 Murata Mfg Co Ltd Data processor
KR100631770B1 (en) * 1999-09-07 2006-10-09 삼성전자주식회사 Real time processing method of flash memory
JP3578265B2 (en) * 1999-11-19 2004-10-20 日本電気株式会社 Method of writing data to nonvolatile memory, information processing device, and recording medium
DE10040267A1 (en) * 2000-08-17 2002-02-28 Philips Corp Intellectual Pty Processor Memory System
US6704835B1 (en) * 2000-09-26 2004-03-09 Intel Corporation Posted write-through cache for flash memory
TWI240864B (en) * 2001-06-13 2005-10-01 Hitachi Ltd Memory device
EP1286267B1 (en) * 2001-08-17 2017-08-16 Sony Deutschland GmbH Mobile communication device and memory management method
US7487316B1 (en) * 2001-09-17 2009-02-03 Rockwell Automation Technologies, Inc. Archive and restore system and methodology for on-line edits utilizing non-volatile buffering
GB0123415D0 (en) 2001-09-28 2001-11-21 Memquest Ltd Method of writing data to non-volatile memory
GB2393273A (en) * 2002-09-20 2004-03-24 Sharp Kk Method and apparatus for detecting an error in writing to persistent memory
JP4686193B2 (en) 2002-11-27 2011-05-18 エヌエックスピー ビー ヴィ Protection means with integrated chips
US20050055495A1 (en) * 2003-09-05 2005-03-10 Nokia Corporation Memory wear leveling
US7139863B1 (en) 2003-09-26 2006-11-21 Storage Technology Corporation Method and system for improving usable life of memory devices using vector processing
US7644239B2 (en) 2004-05-03 2010-01-05 Microsoft Corporation Non-volatile memory cache performance improvement
US7490197B2 (en) 2004-10-21 2009-02-10 Microsoft Corporation Using external memory devices to improve system performance
DE602005014278D1 (en) 2004-12-27 2009-06-10 Research In Motion Ltd METHOD AND DEVICE FOR WRITEING DATA IN A WIRELESS COMMUNICATION TERMINAL BETWEEN VOLATILE AND NON-VOLATILE STORAGE
US8914557B2 (en) * 2005-12-16 2014-12-16 Microsoft Corporation Optimizing write and wear performance for a memory
KR101469512B1 (en) * 2007-01-10 2014-12-05 모바일 세미컨덕터 코오포레이션 Adaptive memory system for enhancing the performance of an external computing device
US8762624B2 (en) * 2007-08-29 2014-06-24 Lifescan Scotland Limited Data management system and method using nonvolatile and volatile memories and linked lists to sequentially store data records of different category types
US8631203B2 (en) 2007-12-10 2014-01-14 Microsoft Corporation Management of external memory functioning as virtual cache
KR20100013485A (en) * 2008-07-31 2010-02-10 삼성전자주식회사 Memory device and method of wear leveling
US8032707B2 (en) 2008-09-15 2011-10-04 Microsoft Corporation Managing cache data and metadata
US9032151B2 (en) 2008-09-15 2015-05-12 Microsoft Technology Licensing, Llc Method and system for ensuring reliability of cache data and metadata subsequent to a reboot
US7953774B2 (en) 2008-09-19 2011-05-31 Microsoft Corporation Aggregation of write traffic to a data store
EP2273373A1 (en) 2009-07-02 2011-01-12 Vodafone Holding GmbH Storing of frequently modified data in an IC card
US10141314B2 (en) * 2011-05-04 2018-11-27 Micron Technology, Inc. Memories and methods to provide configuration information to controllers
US10355001B2 (en) 2012-02-15 2019-07-16 Micron Technology, Inc. Memories and methods to provide configuration information to controllers
US20180239532A1 (en) * 2017-02-23 2018-08-23 Western Digital Technologies, Inc. Techniques for performing a non-blocking control sync operation
CN110325971A (en) 2017-06-20 2019-10-11 京瓷办公信息系统株式会社 Storage system and electronic equipment
US11816349B2 (en) 2021-11-03 2023-11-14 Western Digital Technologies, Inc. Reduce command latency using block pre-erase

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5175842A (en) * 1988-05-31 1992-12-29 Kabushiki Kaisha Toshiba Data storage control system capable of reading data immediately after powered on
US5297148A (en) * 1989-04-13 1994-03-22 Sundisk Corporation Flash eeprom system

Family Cites Families (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4523206A (en) * 1982-03-03 1985-06-11 Sperry Corporation Cache/disk system with writeback regulation relative to use of cache memory
US4916605A (en) * 1984-03-27 1990-04-10 International Business Machines Corporation Fast write operations
EP0391871A3 (en) * 1989-04-03 1992-05-27 International Business Machines Corporation Method for managing a prioritized cache
JPH0373496A (en) * 1989-05-16 1991-03-28 Seiko Epson Corp Eeprom writer
JPH0816886B2 (en) * 1990-12-21 1996-02-21 富士通株式会社 Fast writing method
FI89993C (en) 1991-05-31 1993-12-10 Nokia Mobile Phones Ltd Programming installation data in a mobile phone
US5469555A (en) * 1991-12-19 1995-11-21 Opti, Inc. Adaptive write-back method and apparatus wherein the cache system operates in a combination of write-back and write-through modes for a cache-based microprocessor system
US5381539A (en) * 1992-06-04 1995-01-10 Emc Corporation System and method for dynamically controlling cache management
JPH0797352B2 (en) * 1992-07-02 1995-10-18 インターナショナル・ビジネス・マシーンズ・コーポレイション Computer system and I / O controller
US5416915A (en) * 1992-12-11 1995-05-16 International Business Machines Corporation Method and system for minimizing seek affinity and enhancing write sensitivity in a DASD array
KR970008188B1 (en) * 1993-04-08 1997-05-21 가부시끼가이샤 히다찌세이사꾸쇼 Control method of flash memory and information processing apparatus using the same
US5542066A (en) * 1993-12-23 1996-07-30 International Business Machines Corporation Destaging modified data blocks from cache memory
US5606529A (en) * 1994-12-20 1997-02-25 Hitachi, Ltd. Semiconductor disk storage
JPH08314794A (en) * 1995-02-28 1996-11-29 Matsushita Electric Ind Co Ltd Method and system for shortening wait time of access to stable storage device
US5696929A (en) * 1995-10-03 1997-12-09 Intel Corporation Flash EEPROM main memory in a computer system
US5778070A (en) 1996-06-28 1998-07-07 Intel Corporation Method and apparatus for protecting flash memory

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5175842A (en) * 1988-05-31 1992-12-29 Kabushiki Kaisha Toshiba Data storage control system capable of reading data immediately after powered on
US5297148A (en) * 1989-04-13 1994-03-22 Sundisk Corporation Flash eeprom system

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1065667A2 (en) * 1999-06-29 2001-01-03 Nec Corporation Microcomputer with a flash memory and rewrite count management method
EP1065667A3 (en) * 1999-06-29 2003-02-12 Nec Corporation Microcomputer with a flash memory and rewrite count management method
WO2008029389A1 (en) * 2006-09-04 2008-03-13 Sandisk Il Ltd. Device and method for prioritized erasure of flash memory
US7975119B2 (en) 2006-09-04 2011-07-05 Sandisk Il Ltd Device for prioritized erasure of flash memory
US8117414B2 (en) 2006-09-04 2012-02-14 Sandisk Il Ltd. Method for prioritized erasure of flash memory

Also Published As

Publication number Publication date
US20010002475A1 (en) 2001-05-31
GB9620375D0 (en) 1996-11-13
US6301635B2 (en) 2001-10-09
JPH10133940A (en) 1998-05-22
EP0834882A3 (en) 1999-08-04
EP0834882B1 (en) 2002-02-27
DE69710665D1 (en) 2002-04-04
EP0834882A2 (en) 1998-04-08
GB2317722B (en) 2001-07-18
DE69710665T2 (en) 2002-11-21

Similar Documents

Publication Publication Date Title
US6301635B2 (en) Memory device
EP0833250B1 (en) Memory management method
US6092160A (en) Memory management method
EP1559018B1 (en) Wear leveling in non-volatile storage systems
EP1559113B1 (en) Tracking the most frequently erased blocks in non-volatile storage systems
EP1559112B1 (en) Maintaining an average erase count in a non-volatile storage system
KR100914089B1 (en) Maintaining erase counts in non-volatile storage systems
US6149316A (en) Flash EEprom system
EP1559015B1 (en) Method and apparatus for managing an erase count block
US6571326B2 (en) Space allocation for data in a nonvolatile memory
US6839823B1 (en) Increased reliability of data stored on flash memory in applications sensitive to power-loss
US7876616B2 (en) System and method for wear leveling utilizing a relative wear counter
EP1559017A1 (en) Tracking the least frequently erased blocks in non-volatile memory systems
JP2007519083A (en) Internal maintenance schedule request for non-volatile memory systems
JP2003532222A (en) Method, system, and computer program for data management on a storage medium
US7149844B2 (en) Non-volatile memory device
US5748537A (en) Method and apparatus for storing items in flash memory
KjelsØ et al. Memory management in flash-memory disks with data compression

Legal Events

Date Code Title Description
732E Amendments to the register in respect of changes of name or changes affecting rights (sect. 32/1977)
PCNP Patent ceased through non-payment of renewal fee

Effective date: 20110930