WO2004006102A1 - Logiciel, procede et appareil de gestion de memoire flash - Google Patents

Logiciel, procede et appareil de gestion de memoire flash Download PDF

Info

Publication number
WO2004006102A1
WO2004006102A1 PCT/JP2002/006675 JP0206675W WO2004006102A1 WO 2004006102 A1 WO2004006102 A1 WO 2004006102A1 JP 0206675 W JP0206675 W JP 0206675W WO 2004006102 A1 WO2004006102 A1 WO 2004006102A1
Authority
WO
WIPO (PCT)
Prior art keywords
block
flash memory
physical block
data
empty
Prior art date
Application number
PCT/JP2002/006675
Other languages
English (en)
Japanese (ja)
Inventor
Hiroshi Kosaki
Yuuji Nakayama
Honhong Cho
Original Assignee
Fujitsu Limited
Fujitsu Peripherals Limited
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 Fujitsu Limited, Fujitsu Peripherals Limited filed Critical Fujitsu Limited
Priority to PCT/JP2002/006675 priority Critical patent/WO2004006102A1/fr
Publication of WO2004006102A1 publication Critical patent/WO2004006102A1/fr

Links

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
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C16/00—Erasable programmable read-only memories
    • G11C16/02—Erasable programmable read-only memories electrically programmable
    • G11C16/06—Auxiliary circuits, e.g. for writing into memory
    • G11C16/34—Determination of programming status, e.g. threshold voltage, overprogramming or underprogramming, retention
    • G11C16/349—Arrangements for evaluating degradation, retention or wearout, e.g. by counting erase cycles

Definitions

  • Flash memory management program Description Flash memory management program, flash memory management method, and flash memory management device
  • the present invention relates to a flash memory management program, a flash memory management method, and a flash memory management method for writing and reading denita to and from a flash memory in response to a request from a data management program for managing data stored in the flash memory.
  • memory management devices in particular, prevent unequal numbers of erasures of physical blocks due to data that is not updated continuing to occupy physical blocks with fewer erasures of flash memory, and unnecessary data exchange between physical blocks.
  • the present invention relates to a flash memory management program, a flash memory management method, and a flash memory management device that can prevent the occurrence of flash memory and extend the life of the flash memory.
  • Japanese Patent Laid-Open Publication No. Hei 6-222 986 proposes to solve the problem when the number of erasures of a certain physical block is equal to or greater than a predetermined value, or the number of erasures and the number of erasures of this physical block.
  • the number of erasures is equalized by exchanging the data of this physical block with the data of the physical block with the least number of erasures. The technology is disclosed.
  • An object of the present invention is to provide a flash memory management program, a flash memory management method, and a flash memory management device that can prevent the occurrence of replacement and extend the life of the flash memory.
  • a flash memory management program for writing and reading data to and from a flash memory comprising: a management procedure for managing, as block management information, the number of times of erasure of a physical block, which is an erasing unit of the flash memory, and update attributes of data. And a storage block acquisition procedure for acquiring a free physical block for storing data based on the number of erasures of the physical block managed as the block management information by the management procedure and an update attribute of the data.
  • the present invention also relates to a flash memory management method for writing and reading data to and from the flash memory in response to a request from a data management program for managing data stored in the flash memory.
  • a storage block acquisition step of acquiring an empty physical block for storing data based on the storage block.
  • the present invention is a flash memory management device that writes and reads data to and from the flash memory in response to a request from a data management program that manages data stored in the flash memory, Management means for managing, as block management information, the number of erasures of physical blocks, which are units of memory erasure, and data update attributes; and the number of erasures of physical blocks and data update attributes managed as block management information by the management means. And a storage block acquisition means for acquiring an empty physical block for storing data based on the data.
  • the number of erasures of the physical block which is the unit of erasure of the flash memory, and the update attribute of the data are managed as block management information
  • the number of erasures of the physical block and the update attribute of the data which are managed as the block management information
  • FIG. 1 is an explanatory diagram for explaining a flash memory file update process according to an embodiment of the present invention
  • FIG. 2 shows a configuration of a flash memory management device according to an embodiment of the present invention
  • FIG. 3 is a functional block diagram.
  • FIG. 3 is a diagram showing an example of the file management information and block management information shown in FIG. 2.
  • FIG. 4 is a diagram showing the processing of the file update routine shown in FIG.
  • FIG. 5 is a flowchart showing the procedure of a new file creation routine when the update attribute of a file to be created is “updatable”
  • FIG. FIG. 7 is a flowchart showing a processing procedure of a new file creation routine when the update attribute of a file to be created is “updatable”.
  • FIG. 7 is a block data movement routine shown in FIG.
  • FIG. 8 is a flowchart showing a processing procedure of a block reallocation routine shown in FIG. 2.
  • FIG. 1 is an explanatory diagram for explaining a flash memory file update process according to an embodiment of the present invention.
  • FIG. 2A shows an example of updating the physical block of the flash memory when updating the flash memory file.
  • the physical block is a unit of erasing data in the flash memory, and its size is, for example, 16 KB.
  • data 1 to data 4 are stored in physical block 1.
  • FIG. 2B shows an example of block management information (information for managing physical blocks and the like) before and after updating the flash memory file.
  • the physical block 1 stores data whose update attribute is “updatable”, and its erase count is 200.
  • the update attribute is information indicating whether or not a file whose data is stored in the physical block is updatable. If the file is updatable, the update attribute becomes “updatable”. If is not updatable, the update attribute is “updatable”.
  • the physical block 4 stores data whose update attribute is “updatable”, and its erase count is 500.
  • the other physical blocks, physical block 2, physical block 3, and physical block 5, are unused, and the erase counts are 300, 100, and 400, respectively.
  • which empty block is used is determined by the number of erasures of each physical block and the update attribute of the data to be written as shown in FIG.
  • which empty block is used is determined by the number of erasures of each physical block and the update attribute of the data to be written as shown in FIG.
  • the update attribute of the data to be written is “updatable”. Therefore, the number of erasures from the three free blocks of physical block 2, physical block 3, and physical block 5 is reduced. Select the least physical block 3 and write the data in the work buffer. If a new non-updatable file is created and data is written, the physical block 5 with the largest number of erasures will be selected. In addition, the update attribute of the physical block 3 is set to “updatable”. Finally, physical block 1 has all data erased and becomes an empty block, the number of erases increases by 1, and it changes from 200 to 201. Then, the block management information is updated as shown in FIG.
  • FIG. 2 is a functional block diagram showing a configuration of a flash memory management device according to an embodiment of the present invention. As shown in the figure, the flash memory management device has a microprocessor 100, a program memory 200, a data area 300, and a flash memory 400.
  • the microprocessor 100 is a processing unit that controls the entire flash memory management device. More specifically, the flash memory 400 is managed by executing a program stored in the program memory 200.
  • the program memory 200 is a ROM or a RAM for storing a program. If the program memory 200 is a RAM, the program is read from the flash memory 400 when the flash memory management device is started. Is loaded into the program memory 200 and executed.
  • the data area 300 is a RAM for reading and storing the management information of the flash memory 400 from the management information storage area 410 when executing a program, and is an area for storing the operation results of the program. Also used as a buffer.
  • the flash memory 400 is a storage unit for storing file data and the like, and has a management information storage area 410 for storing management information.
  • the program memory 200 has a user program 210, a file management program 220, and a flash memory driver 230.
  • the user program 210 is any application program that uses the flash memory 400 via the file management program 220.
  • the file management program 222 is a program for managing files stored in the flash memory 400.
  • the file management program 220 may be provided as a part of the operating system (OS).
  • the flash memory driver 230 is a program that writes and reads data to and from the flash memory 400 based on a request from the file management program 220. .
  • This data area 300 stores file management information 310 and block management information 320.
  • the file management information 310 is information about a file
  • the block management information 320 is information about a physical block and the like.
  • FIG. 3 is a diagram showing an example of the file management information 310 and the block management information 320 shown in FIG.
  • the file management information 310 includes a file name indicating a file name, a start address indicating a storage start position of the file in the flash memory 400, a size indicating a file size, and a file. This is information in which an update attribute indicating whether or not the file can be updated is managed for each file.
  • a file with the file name a.txt indicates that the storage start position in the flash memory 400 is 0x2000, the size is 0x100, and whether or not the file can be updated is "not updatable".
  • the b. Txt file indicates that the storage start position in the flash memory 400 is OxaOOO, the size is 0x100, and the update availability is “updatable”.
  • Ox indicates a hexadecimal number.
  • the start address is a logical address. By separating the start address from the physical address of the flash memory 400, even if the physical block that stores data is changed, the file can be stored without being affected by the change. Start position can be managed.
  • the block management information 320 is information managing the logical address management information 321 and the physical block management information 322.
  • the logical address management information 3 211 divides the logical space of the flash memory 400 defined by the logical address into logical blocks of a certain size, and starts logical address and logical address indicating the first logical address of the logical block.
  • This update attribute is the update attribute of the corresponding physical block.
  • the corresponding physical block is an updatable physical block (hereinafter referred to as “updatable block”). If this update attribute is “updatable”, the corresponding physical block is These physical blocks are non-updatable physical blocks (hereinafter referred to as “non-updatable blocks”). .
  • a logical block whose starting logical address is 0x0000 has a size of 0x4000
  • the number of a physical block that actually stores the data is 12 and this physical block 12 is a non-updatable block.
  • the logical block whose start logical address is 0x4000 has a size of 0x4000, indicating that the logical block is empty.
  • the logical block whose starting logical address is 0x8000 has a size of .0x4000, and the physical block number that actually stores the data is 14, and this physical block 14 is an updatable block
  • the logical block whose start logical address is OxcOOO has a size of 0x4000, indicating that the logical block is empty.
  • Physical block management information 3 2 2 manages, for each physical block, the number indicating the physical block number, the usage status indicating the status of writing data to the physical block, and the erase count indicating the number of physical block erases so far. Information. For example, Physical Block 11, Physical Block 13 and Physical Block 15 are empty, indicating that the erase counts so far are 100, 500, and 200, respectively. . Also, physical blocks 12 and 14 have already been written with data. The number of erasures up to is respectively;
  • the file management information 310 and the block management information 320 are stored in the management information storage area 410 of the flash memory 400, and the data area is used when the flash memory 400 is used. Read into 300. When the flash memory 400 is updated, its contents are changed, and when the use of the flash memory 400 is finished, the change result is stored in the management information storage area 410.
  • the flash memory driver 230 has a file update routine 231, a new file creation routine 232, a block data movement routine 233, and a block reallocation routine 2324.
  • the file update ff routine 231 is a program for updating file data based on a request from the file management program 220.
  • the file update / latin 23 reads data from the physical block storing the data to be updated into the data area 300, updates this data, and writes it to a new physical block. At this time, since the data to be written can be updated, the empty block acquisition processing acquires the empty block with the least number of erases.
  • the new file creation routine 232 is a program for writing new data to a physical block based on a request from the file management program 220.
  • the new file creation routine 2 32 selects an empty block based on the attribute of the file to be created in the empty block acquisition process.
  • the block data movement routine 2 33 is a program that starts processing when an empty block occurs. This block data movement routine 2 3 3 Whether the number of erasures of the empty block with the smallest number of erasures exceeds the specified value or whether the number of erasures of the empty block with the largest number of erasures among the vacant blocks exceeds the specified value If the value exceeds the predetermined value, and if there is a non-updatable block in the non-updatable block and the number of erasures of the non-updatable block is less than the number of erasures of a free block, the data of the non-updatable block Is moved to an empty block where the number of deletions is large.
  • the number of erasures of the empty block with the smallest number of erasures among the empty blocks exceeds a predetermined value, or the number of erasures of the empty block with the largest number of erasures among the empty blocks is If the value exceeds the predetermined value, if there is a non-updatable block in the non-updatable block and the number of erasures of the non-updatable block is smaller than the number of erasures of an empty block, the data of the non-updatable block is deleted.
  • the non-updatable block does not move its data to another physical block, so that the efficiency is not reduced due to unnecessary data exchange and the flash memory 400 Life can be extended.
  • the block reallocation routine 234 is a program that reallocates physical block data based on a user request. Specifically, the physical blocks are sorted as non-updatable blocks, updatable blocks, and empty blocks in order from the block with the largest number of erases.
  • the number of erasures can be equalized and the life of the flash memory 400 can be extended.
  • FIG. 4 is a flowchart showing the processing procedure of the file update routine 231, shown in FIG. It is a chart.
  • the file update routine 2 31 obtains the physical block number storing the data of the file to be updated from the logical address of the file to be updated and the logical address management information 3 21.
  • step S 4 0 1) the data of the physical block number is read into the data area 3 0 0 (step S 4 0 2) 0
  • step S403 the update attribute of the file is “updatable”, an empty block having the least number of erasures is obtained from the empty blocks (step S404), and the updated data is stored in the empty block.
  • Write step S405.
  • the logical block management information, the physical block number for the file logical address of 321, is updated, and the physical block storing the data before the update is erased to be a free block (step S407). ).
  • FIG. 5 is a flowchart showing the processing procedure of the new file creation routine 232 when the update attribute of the file to be created is “updatable”.
  • this new file creation routine 2 32 has a free area large enough to write the file to be created in the existing non-updatable block when creating a non-updatable file. It is determined whether there is a block that cannot be updated (step S501). If there is a non-updatable block having a free area large enough to write a file, the logical address to which data is written using the logical address management information 3 21 from the address of the free area of the non-updatable block Is calculated (step S503), and the flow advances to step S506.
  • the update attribute of the file is “updatable”, and the empty block with the largest number of erasures is obtained (step S). 5 0 2), an empty logical block is obtained from the file management information 3 10 and the block management information 3 2 0 (step S 5 0 4), and an empty block from which the physical block number of the obtained logical block is obtained. And the update attribute is set to “updating impossible” (Step S505).
  • step S506 a new file name, start address, size, and update attribute are added to the file management information 310 (step S506), and data is written to the physical block address corresponding to the acquired logical address (step S506). S507).
  • FIG. 6 is a flowchart showing the processing procedure of the new file creation routine 232 when the update attribute of the file to be created is “updatable”.
  • step S601 when creating a file that can be updated, the routine for creating a new file 2 32 has a free area large enough to write the file to be created in an existing updatable block. It is determined whether or not there is an updatable block (step S601). If there is an updatable block having a free area large enough to write the file, the logical address to which data is written is calculated from the address of the free area of the updatable block using the logical address management information 3 2 1. Then (step S603), the process proceeds to step S606.
  • the update attribute of the file is “updatable J”, and the free block with the least number of erasures is acquired (step S 6 0 2), obtains a free logical block from the file management information 3 10 and the block management information 3 2 0 (step S 6 04), and obtains the physical block number of the obtained logical block.
  • the number is set as an update attribute, and the update attribute is set to “updatable” (step S605).
  • FIG. 7 is a flowchart showing a processing procedure of the block data movement routine 233 shown in FIG.
  • the block data movement routine 233 determines whether the number of erasures of the empty block having the smallest number of erasures among the empty blocks exceeds a predetermined value, or the number of erasures within the empty block. It is determined whether the number of erasures of the most vacant block exceeds a predetermined value (step S701), and if it does not exceed the predetermined value, the process is terminated without doing anything.
  • step S703 the data of the non-updatable block is moved to an empty block having a large number of deletions (step S703), and the physical block is erased to become an empty block (step S700).
  • FIG. 8 is a flowchart showing the processing of the block reallocation routine 234 shown in FIG.
  • the block re-allocation routine 234 selects one non-updatable block (step S801), and determines the number of erasures and the number of erasures in the empty block and the updatable block. The most frequent value is compared (step S802).
  • step S803 If the number of erasures of the non-updatable block is small, the data of the non-updatable block and the physical block with the largest number of erasures among the empty blocks and the updatable blocks are exchanged (step S803). Conversely, if the number of erasures of the non-updatable block is equal to or more than the maximum value of the number of erasures of the empty block and the updatable block, the process proceeds to the next step without doing anything about the non-updatable block.
  • step S 8 0 4 it is determined whether all non-updatable blocks have been investigated. If there is a non-updatable block that has not been checked, the above processing is repeated for the next non-updatable block. On the other hand, when all the non-updatable blocks have been prepared, the process proceeds to the next step, that is, the processing of the updatable blocks.
  • one updatable block is selected (step S805), and the number of erasures of the updatable block is compared with the maximum value of the number of erasures of the empty block (S806). If the number of erasures of the updatable block is small, the data of the updatable block and the data of the physical block having the largest number of erasures in the empty block are exchanged (step S807). Conversely, if the number of erasures of this updatable block is equal to or greater than the maximum value of the number of erasures of the free block, the process proceeds to the next step without doing anything with this updatable block.
  • step S808 it is determined whether or not all updatable blocks have been examined. If there is an updatable block that has not been examined, the above processing is repeated for the next updatable block. On the other hand, when all the updatable blocks have been adjusted, non-updatable blocks, updatable blocks, and empty blocks are arranged in order from the block with the largest number of erases, and the reallocation of the physical blocks is completed.
  • the number of erasures can be equalized and the life of the flash memory 400 can be extended.
  • the physical block when writing data to an empty block, if the data to be written can be updated, the physical block is likely to be rewritten in the future, so an empty block with a small number of erases is selected, and the data to be written is updated. If it is not possible, the physical block will not be rewritten in the future, so an empty block with a large number of erases is selected.Therefore, the number of erases of the physical block in the flash memory 400 is equalized, and the flash memory 4 The life of 00 can be extended.
  • the number of erasures of an empty block with the least number of erasures among the empty blocks exceeds a predetermined value, or an empty block with the largest number of erasures among the empty blocks If the number of block erasures exceeds a predetermined value, the data in the non-updatable block with a small number of erasures is moved to a vacant block with a large number of erasures. It is possible to prevent the physical block from being continuously occupied by the small number of erases of 00, and to equalize the number of erases of the physical block, thereby extending the life of the flash memory 400.
  • the non-updatable block does not transfer the data to another physical block, so that the efficiency is not reduced due to the exchange of unnecessary data and the flash memory 400 Life can be extended.
  • the number of erasures can be equalized, and the life of the flash memory 400 can be extended.
  • the number of erasures of a physical block which is an erasing unit of a flash memory, and the update attribute of data are managed as block management information, and the number of erasures of a physical block managed as block management information is managed.
  • the number of erasures of the physical block in the flash memory can be equalized, thereby extending the life of the flash memory. It has the effect of being able to do it.
  • the flash memory management program, the flash memory management method, and the flash memory management device according to the present invention are suitable for flash memory files that handle a large amount of data that cannot be updated.

Abstract

Un logiciel de gestion de mémoire flash écrit et lit des données dans une mémoire flash, ou en provenance d'une mémoire flash, en réaction à une demande provenant d'un logiciel de gestion de données gérant les données enregistrées dans la mémoire flash. Le logiciel exécute un traitement pour gérer, d'une part un décompte d'effacement d'un bloc physique pris comme unité d'effacement en mémoire flash, et d'autre part un attribut de mise à jour de données pris comme information de gestion de bloc. Le logiciel exécute également un traitement servant à acquérir un bloc physique vide pour enregistrer des données en tenant compte du décompte d'effacements de bloc physique et de l'attribut de mise à jour des données pris comme information de gestion de bloc.
PCT/JP2002/006675 2002-07-02 2002-07-02 Logiciel, procede et appareil de gestion de memoire flash WO2004006102A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2002/006675 WO2004006102A1 (fr) 2002-07-02 2002-07-02 Logiciel, procede et appareil de gestion de memoire flash

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2002/006675 WO2004006102A1 (fr) 2002-07-02 2002-07-02 Logiciel, procede et appareil de gestion de memoire flash

Publications (1)

Publication Number Publication Date
WO2004006102A1 true WO2004006102A1 (fr) 2004-01-15

Family

ID=30022606

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2002/006675 WO2004006102A1 (fr) 2002-07-02 2002-07-02 Logiciel, procede et appareil de gestion de memoire flash

Country Status (1)

Country Link
WO (1) WO2004006102A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103150257A (zh) * 2013-02-28 2013-06-12 天脉聚源(北京)传媒科技有限公司 一种内存管理方法和装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05274219A (ja) * 1992-03-27 1993-10-22 Alps Electric Co Ltd 記憶装置
JPH0816482A (ja) * 1994-06-29 1996-01-19 Hitachi Ltd フラッシュメモリを用いた記憶装置およびその記憶制御方法
JP2000112818A (ja) * 1999-09-03 2000-04-21 Matsushita Graphic Communication Systems Inc フラッシュメモリ制御装置及び方法
JP2002032256A (ja) * 2000-07-19 2002-01-31 Matsushita Electric Ind Co Ltd 端末装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05274219A (ja) * 1992-03-27 1993-10-22 Alps Electric Co Ltd 記憶装置
JPH0816482A (ja) * 1994-06-29 1996-01-19 Hitachi Ltd フラッシュメモリを用いた記憶装置およびその記憶制御方法
JP2000112818A (ja) * 1999-09-03 2000-04-21 Matsushita Graphic Communication Systems Inc フラッシュメモリ制御装置及び方法
JP2002032256A (ja) * 2000-07-19 2002-01-31 Matsushita Electric Ind Co Ltd 端末装置

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103150257A (zh) * 2013-02-28 2013-06-12 天脉聚源(北京)传媒科技有限公司 一种内存管理方法和装置

Similar Documents

Publication Publication Date Title
CN101154190B (zh) 映射信息管理设备和方法
JP4452261B2 (ja) ストレージシステムの論理ボリューム管理方法、論理ボリューム管理プログラム、及びストレージシステム
JP4356686B2 (ja) メモリ装置及びメモリ制御方法
KR100823171B1 (ko) 파티션된 플래시 변환 계층을 갖는 컴퓨터 시스템 및플래시 변환 계층의 파티션 방법
KR101038167B1 (ko) 프로세서로부터 메모리로의 액세스를 관리하는 메모리 관리 장치를 포함하는 정보 처리 장치 및 메모리 관리 방법
US8738851B2 (en) Device and memory system for swappable memory
US5953737A (en) Method and apparatus for performing erase operations transparent to a solid state storage system
KR100849221B1 (ko) 비휘발성 메모리의 관리 방법 및 비휘발성 메모리 기반의장치
EP1729218A1 (fr) Systeme de stockage non volatile
JP2005242897A (ja) フラッシュディスク装置
KR20050067203A (ko) 비휘발성 저장 시스템의 평균 소거 카운트 유지 방법 및장치
JP2008508596A (ja) Ｎｖｒａｍを使用するメモリ管理のためのシステム、方法、コンピュータ可読媒体、および装置
US20140181378A1 (en) Control device, control method, and program
JP2013222435A (ja) 半導体記憶装置及びその制御方法
JP2008009527A (ja) メモリシステム
JPWO2005008499A1 (ja) 情報記録媒体におけるデータ領域管理方法、及びデータ領域管理方法を用いた情報処理装置
JP2009205689A (ja) フラッシュディスク装置
US20100180072A1 (en) Memory controller, nonvolatile memory device, file system, nonvolatile memory system, data writing method and data writing program
JP4829202B2 (ja) 記憶装置及びメモリ制御方法
JP5057887B2 (ja) データ更新装置及びデータ更新方法及びデータ更新プログラム
JP2010237907A (ja) ストレージ装置および記録方法
JP2005115561A (ja) フラッシュｒｏｍ制御装置
JP4311312B2 (ja) 時系列データ管理方法およびプログラム
JP2009259145A (ja) メモリコントローラ、メモリコントローラを備えるフラッシュメモリシステム、並びにフラッシュメモリの制御方法
WO2004006102A1 (fr) Logiciel, procede et appareil de gestion de memoire flash

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): JP US

NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP