Data management apparatus and method of flash memory
Abstract
A data management apparatus and method used in a system using one or more flash memories, which can deal with defective blocks in each of the flash memories using different methods depending on how the system manages data stored in each of the flash memories. The data management apparatus includes a device driver (300), which controls the operation of one or more flash memories, and a controller (400), which transfers data stored in a defective block of one of the flash memories to a predetermined block in the flash memory (510,520).

Term
Term ended
Projected expiry passed 17 January 2025, 1.7 years ago.
- Priority
- Filed
- Published
- Projected expiry
- Today
20 claims: 5 independent, 15 dependent
- 1A data management apparatus comprising:a device driver (300) for controlling at least one flash memory (510,520);and a controller (400) for transferring data stored in a defective block of one of the at least one flash memory (510,520) to a predetermined different block of said one flash memory (510,520).
- 7A data management method of a flash memory comprising:identifying a defective block that has occurred in at least one first flash memory (510);and transferring data stored in the defective block to a predetermined block in the first flash memory (510).
- 13A data management apparatus comprising:first (510) and second (520) flash memories, each having a plurality of memory blocks;and a controller (400) for transferring data stored in a defective memory block of said first flash memory (510) to a predetermined different memory block of said first flash memory (510), and for transferring data stored in a memory block of said second flash memory (520) to a predetermined different memory of said second flash memory (520).
Independent claims5
107 paragraphs, as filed
0001The present invention relates to a data management apparatus and method for use in a flash memory, and more particularly, to a data management apparatus and method for use in a flash memory, which can deal with defective blocks in each flash memory in a system using at least one flash memory by taking into consideration how the system processes data stored in each flash memory.
0002In general, home appliances, communications devices, and embedded systems, such as set-top boxes, use non-volatile memories as storage devices for storing and processing data.
0003Flash memories are one type of non-volatile memory, in which data can be electrically erased and overwritten. Flash memories are suitable for portable devices because they consume less power than magnetic disc memory-based storage mediums, are as accessible as hard discs, and are compact-sized.
0004Due to the hardware characteristics of flash memories, data recorded on a flash memory should be erased before data is overwritten on the flash memory.
0005A unit in which data is recorded on a flash memory may differ from a unit in which data is erased from the flash memory, which may result in deterioration of the performance of the flash memory.
0006In order to prevent the performance of the flash memory from deteriorating for this reason, logical addresses and physical addresses have been suggested. Logical addresses are virtual addresses specified by a user when executing a data operation on the flash memory with the use of a program. By comparison, physical addresses are actual addresses referenced when executing the data operation on the flash memory.
0007Flash memory is generally classified into either a small block flash memory or a large block flash memory. In a small block flash memory, a logical operation unit is equal to a physical operation unit, whereas in a large block flash memory, a logical operation unit is smaller than a physical operation unit.
0008In other words, supposing that the logical operation unit and physical operation unit of the flash memory are respectively referred to as a sector and a page, a sector and a page of the small block flash memory are identical, but a page of the large block flash memory is a predetermined number of times larger than a sector of the large block flash memory.
0009Data can be erased from a flash memory only a limited number of times. If data is erased from some of a plurality of blocks of the flash memory more than a maximum number of times that data can be erased from the flash memory, or if some of the blocks of the flash memory, from which data is erased almost as many times as the maximum number, are fragile for some reason, the corresponding blocks may become defective.
0010Defective blocks of the flash memory are categorized into initial defective blocks, which are defective blocks detected before the flash memory is shipped out of the factory, or run-time defective blocks, which are defective blocks generated by a user during executing a data operation on the flash memory.
0011All of the blocks of the flash memory may become defective, and defective blocks of the flash memory considerably affect the performance of the flash memory. Thus, various methods to efficiently deal with the defective blocks of the flash memory have been developed.
0012Figure 1 is a schematic diagram illustrating the structure of a typical flash memory. Referring to Figure 1, the typical flash memory includes a defective block management area 10, in which defective blocks of the typical flash memory are dealt with, and a data area 20, in which data computations are executed.
0013Specifically, the defective block management area 10 includes a defective block information area 11, which includes mapping information on the defective blocks of the typical flash memory, and a spare area 12, which provides substitute blocks that respectively replace the defective blocks of the typical flash memory.
0014Here, the mapping information on the defective blocks of the typical flash memory is realized as a mapping table that respectively maps the defective blocks of the typical flash memory with the substitute blocks in the spare area 12.
0015A conventional data management method using the defective block management area 10 will now be described. As shown in Figure 2, in operation S11, it is determined whether there is an indication that a predetermined or current block of the typical flash memory is an initial defective block.
0016In operation S12, it is determined whether the predetermined block is an initial defective block based on the determination results obtained in operation S11.
0017In operation S13, if the predetermined block is an initial defective block, the predetermined block of the flash memory is replaced with a normal block, specifically, a substitute block in the spare area 12, by referencing the mapping table.
0018Accordingly, a data operation, which is supposed to be performed on the predetermined block, can be performed on the substitute block that replaces the predetermined block.
0019In operation S14, it is determined if all blocks in the flash memory are subjected to defective block determination. If the predetermined block is not the last one, the iteration is initiated in operation S15 so that operations S11 through S14 can be performed on a block subsequent to the predetermined block.
0020If a defect occurs while performing the data operation on a block of the flash memory that has already been determined non-defective through operations S11 through S14, the corresponding block is determined to be a run-time defective block.
0021A conventional data management method for dealing with run-time defective blocks of a typical flash memory is illustrated in Figure 3. Referring to Figure 3, in operation S21, a data operation is performed on a predetermined or current block. In operation S22, it is determined whether the data operation has been successfully performed on the predetermined block.
0022Specifically, referring to Figure 4A, the data operation is performed on a block 21 of a flash memory, and then it is determined whether the data operation has been successfully performed on the block 21 of the flash memory.
0023If the data operation is determined unsuccessful, then in operation S23 the predetermined block is determined defective and then registered with the mapping table.
0024In operation S24, the predetermined block is mapped with a substitute block in the spare area 12. In operation S25, a data operation, which is supposed to be performed on the predetermined block, is performed on the substitute block.
0025Specifically, referring to Figure 4B, data stored in the block 21 in the data area 20 is transferred to a block 12a in the spare area 12.
0026Then, a data operation, which is supposed to be performed on the block 21 in the data area 20, is performed on the block 12a in the spare area 12 by referencing the mapping table specifying that the block 21 in the data area 20 is replaced with the block 12a in the spare area 12.
0027For example, if a defect occurs while writing data on the block 21 in the data area 20, part of the data that has been written on the block 21 is transferred from the block 21 to the block 12a in the spare area 12.
0028In addition, when a data operation is again performed on the block 21, the rest of the data is written on the block 12a in the spare area 12 by referencing the mapping table.
0029Thereafter, in operation S26, it is determined whether the data operation is complete. Unless the data operation is complete, operations S21 through S25 are repeatedly performed.
0030However, the above conventional data management methods of a flash memory can only be applied to a single flash memory and thus are not suitable for a system using plural flash memory.
0031According to the present invention there is provided an apparatus and method as set forth in the appended claims. Preferred features of the invention will be apparent from the dependent claims, and the description which follows.
0032The present invention provides a data management apparatus and method of a flash memory, which can efficiently deal with defective blocks in each flash memory in a system using one or more flash memory.
0033The above stated object as well as other objects, features and advantages, of the present invention will become clear to those skilled in the art upon review of the following description, the attached drawings and appended claims.
0034According to an exemplary embodiment of the present invention, there is provided a data management apparatus comprising a device driver, which controls the operation of one or more flash memories, and a controller, which transfers data stored in a defective block of one of the flash memories (to be referred to as first flash memory) to a predetermined block in the first flash memory.
0035When performing a data operation in a multi-channel manner, the controller may transfer data, which is stored in a block of the other flash memory (to be referred to as second flash memory) having the same offset value as the defective block of the first flash memory, to a predetermined block of each flash memory.
0036When performing a data operation in an interleaved manner, the controller may generate an upper block by combining together blocks of flash memories having the same offset value.
0037The controller may replace the defective block of the first flash memory with the predetermined block of the first flash memory to then allow the predetermined block to be included in the upper block.
0038According to another exemplary embodiment of the present invention, there is provided a data management method of a flash memory comprising identifying a defective block that has occurred in one or more flash memories (to be referred to as first flash memory), and transferring data stored in the defective block to a predetermined block in the first flash memory.
0039When performing the data operation on the predetermined block, the identifying operation may comprise identifying a block of the first flash memory as the defective block depending on whether the data operation has been successfully performed on the predetermined block of the first flash memory.
0040When performing the data operation in a multi-channel manner, the transferring operation may comprise transferring data, which is stored in a block of another flash memory (to be referred to as second flash memory), having the same offset value as the defective block of the first flash memory, to a predetermined block of each flash memory.
0041When performing the data operation in an interleaved manner, the transferring operation may comprise generating an upper block by combining together blocks of flash memories having the same offset value.
0042In addition, the transferring operation may comprise replacing the defective block of the first flash memory with the non-defective block of the first flash memory, and allowing the predetermined block to be included in the upper block.
0043The above and other features and advantages of the present invention will become more apparent by describing in detail exemplary embodiments thereof with reference to the attached drawings in which: <ul id="ul0001" list-style="none"><li>Figure 1 is a schematic diagram of a typical flash memory;</li><li>Figure 2 is a flowchart of a conventional data management method that deals with initial defective blocks in a flash memory;</li><li>Figure 3 is a flowchart of a conventional data management method that deals with run-time defective blocks in a flash memory;</li><li>Figure 4A is a diagram illustrating a data operation performed on a typical flash memory;</li><li>Figure 4B is a diagram illustrating a method of transferring data stored in a run-time defective block in a data area of a typical flash memory to a substitute block in a spare area of the typical flash memory;</li><li>Figure 5A is a block diagram of a typical multi-channel system using at least one flash memory;</li><li>Figure 5B is a diagram illustrating a typical data operation performed in the typical multi-channel system of Figure 5A;</li><li>Figure 6A is a block diagram of a typical interleaved system using one or more flash memories;</li><li>Figure 6B is a diagram illustrating a typical data operation performed in the typical interleaved system of Figure 6A;</li><li>Figure 7 is a block diagram of a data management apparatus of a flash memory, according to an exemplary embodiment of the present invention;</li><li>Figure 8 is a diagram illustrating a data operation performed in a multi-channel system using one or more flash memories, according to an exemplary embodiment of the present invention;</li><li>Figure 9 is a diagram illustrating a data operation performed in an interleaved system using one or more flash memories, according to an exemplary embodiment of the present invention;</li><li>Figure 10 is a diagram illustrating virtual block management areas of Figure 9;</li><li>Figure 11 is a diagram illustrating a data operation performed on an upper block of Figure 9;</li><li>Figure 12 is a flowchart of a data management method of a flash memory, according to an exemplary embodiment of the present invention;</li><li>Figure 13 is a diagram illustrating a method of dealing with initial defective blocks of a flash memory, according to an exemplary embodiment of the present invention;</li><li>Figures 14A and 14B are diagrams illustrating mapping tables, which respectively map defective blocks in a flash memory with substitute blocks in a spare area of the flash memory;</li><li>Figure 15 is a flowchart of a method of dealing with run-time defective blocks of one or more flash memories in a multi-channel system, according to an exemplary embodiment of the present invention;</li><li>Figure 16 is a diagram illustrating a method of transferring data stored in a run-time defective block in one or more flash memories in a multi-channel system to a block in a spare area of a corresponding flash memory;</li><li>Figure 17 is a flowchart of a method of dealing with run-time defective blocks in one or more flash memories in an interleaved system, according to an exemplary embodiment of the present invention;</li><li>Figure 18 is a diagram illustrating a data operation performed in an interleaved system using one or more flash memories, according to another exemplary embodiment of the present invention; and</li><li>Figure 19 is a diagram illustrating a method of transferring data stored in a run-time defective block in one or more flash memories in an interleaved system to a block in a spare area of a corresponding flash memory.</li></ul>
0044Advantages and features of the present invention and methods of accomplishing the same may be understood more readily by reference to the following detailed description of preferred embodiments and the accompanying drawings. The present invention may, however, be embodied in many different forms and should not be construed as being limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete and will fully convey the concept of the invention to those skilled in the art, and the present invention will only be defined by the appended claims. Like reference numerals refer to like elements throughout the specification.
0045The present invention will now be described more fully with reference to the accompanying drawings, in which exemplary embodiments of the invention are shown.
0046Recently, the performance of a system using one or more flash memories has been improved by adopting a multi-channel or interleaved approach.
0047In a multi-channel approach, the flash memories share a control line with one another, and thus data can be written in parallel on the flash memories at the same time.
0048Specifically, referring to Figure 5A, two flash memories 111 and 112 and a device driver 113, which controls the flash memories 111 and 112, share a control line 114. The flash memories 111 and 112 use different data lines, i.e., the flash memories 111 and 112 use data lines 115 and 116, respectively.
0049Therefore, the multi-channel approach enables m flash memories each comprised of n bits (where m and n are integers) to be operated as if there were only one flash memory, by making the m flash memories share mxn buses with one another.
0050Referring to Figure 5B, which illustrates the operation of the typical multi-channel system of Figure 5A, a control signal, including a data computation command and an address at which a data operation is to be performed, is transmitted (117) to the flash memory 112 and to the flash memory 113 at the same time because the flash memories 112 and 113 share the control line 114 with each other.
0051Since the flash memories 112 and 113 use the data lines 115 and 116, respectively, data can be respectively loaded (118) in the flash memory 112 and in the flash memory 113 at the same time, and the data operation can be performed (119) on the flash memory 112 and the flash memory 113 at the same time.
0052Complete data, which is supposed to be recorded in an entire flash memory unit comprised of the flash memories 112 and 113, is obtained by summing up the data respectively loaded in the flash memories 112 and 113.
0053In an interleaved manner, a plurality of flash memories share a data line with one another. Specifically, in the case of performing multiple write operations, data is loaded in a first flash memory, and then other data is loaded in a second flash memory while loading data in the first flash memory.
0054Referring to Figure 6A, which illustrates a typical interleaved system using one or more flash memories, two flash memories 121 and 122 and a device driver 123, which controls the two flash memories 121 and 122, share a data line 124 with one another. The flash memories 121 and 122 use separate control lines, i.e., the flash memories 121 and 122 use control lines 125 and 126, respectively.
0055Referring to Figure 6B, which illustrates the operation of the typical interleaved system of Figure 6A, a control signal, including a data computation command and an address at which a first data operation is to be performed is transmitted (127a) to, for example, the first flash memory, data is loaded (128a) in the first flash memory, and the first data operation is performed (129a) on the first flash memory. While the first data operation is being performed (129a) on the first flash memory, another control signal, including a data computation command and an address at which a second data operation is to be performed, is transmitted (127b) to, for example, the second flash memory, another data is loaded (128b) in the second flash memory, and the second data operation is performed (129b) on the second flash memory.
0056A data management apparatus according to an exemplary embodiment of the present invention will now be described more fully with reference to Figure 7. The data management apparatus can guarantee the stability of data stored in a plurality of flash memories and can efficiently deal with defective blocks in each of the flash memories. Referring to Figure 7, the data management apparatus includes a plurality of flash memories, i.e., flash memories 210, 220, and 230, a device driver 300, which controls the operation of each of the flash memories 210, 220, and 230, and a controller 400, which transfers data stored in a defective block in any of the flash memories 210, 220, and 230 to a non-defective block in a corresponding flash memory.
0057The data management apparatus according to the exemplary embodiment of the present invention will now be described by taking examples of a multi-channel system using one or more flash memories and an interleaved system using one or more flash memories.
0058Referring first to Figure 8, flash memories 510 and 520 include virtual block management areas 511 and 521, respectively, spare areas 512 and 522, respectively, and data areas 513 and 523, respectively. Each of the virtual block management areas 511 and 521 includes mapping information of defective blocks in a corresponding flash memory. Each of the spare areas 512 and 522 includes substitute blocks, to which data stored in the defective blocks in the corresponding flash memory are respectively transferred. In each of the data areas 513 and 523, predetermined data operations are executed.
0059In the multi-channel approach, a data operation can be performed in parallel on the flash memories 510 and 520. Thus, if data exists in a block 513a of the flash memory 510, data also exists in a block 523a of the flash memory 520 that has the same offset value as the block 513a.
0060If a defect occurs in a block of one of the flash memories 510 and 520 (hereinafter referred to as a first flash memory), the controller 400 of the data management apparatus of Figure 7 transfers data stored in the defective block of the first flash memory to a block in the spare area (512 or 522) of the first flash memory.
0061Thereafter, the controller 400 also transfers data, which is stored in a block of the other flash memory (hereinafter referred to as a second flash memory) that has the same offset value as the defective block of the first flash memory, to a block in the spare area of the second flash memory.
0062This is because the data stored in the defective block of the first flash memory may cause data loss by adversely affecting the data stored in the block of the second flash memory having the same offset value as the defective block of the first flash memory, due to the characteristics of the multi-channel approach.
0063Alternatively, flash memories 510 and 520 include virtual block management areas 511 and 521, respectively, spare areas 512 and 522, respectively, and data areas 513 and 523, respectively. Each of the virtual block management areas 511 and 521 includes mapping information on defective blocks in a corresponding flash memory. Each of the spare areas 512 and 522 includes substitute blocks, to which data stored in the defective blocks in the corresponding flash memory are respectively transferred. Predetermined data operations are executed in each of the data areas 513 and 523.
0064In addition, as shown in Figure 9, the controller 400 forms an upper block 530 by combining together a block 510a of the flash memory 510 and a block 520a of the flash memory 520, which have the same offset value.
0065Here, as shown in Figure 10, the virtual block management areas 511 and 521 include upper block management areas 511a and 521a, respectively, and defective block management areas 511b and 521b, respectively. Each of the upper block management areas 511a and 521a includes information on the upper block 530. Each of the defective block management areas 511b and 521b is comprised of a mapping table that respectively maps defective blocks in the data area of a corresponding flash memory with non-defective blocks in the spare area of the corresponding flash memory.
0066Thus, the controller 400 performs a data operation, which is supposed to be sequentially performed on the block 510a of the flash memory 510 and on the block 520a of the flash memory 520, on the upper block 530 by referencing the information on the upper block 530 stored in each of the upper block management areas 511a and 521a. Obviously, it is more convenient to perform the data operation on the upper block 530 than to perform the data operation on the block 510a of the flash memory 510 and then on the block 520a of the flash memory 520.
0067In this case, according to the interleaved manner, if a defect occurs in a block of one of the flash memories 510 and 520 (hereinafter referred to as first flash memory) data stored in the defective block of the first flash memory is transferred to a non-defective block in the spare area (512 or 522) of the first flash memory.
0068Then, an upper block is generated by combining the non-defective block in the spare area of the first flash memory with a predetermined block of the other flash memory (hereinafter referred to as second flash memory).
0069As described above, information on the non-defective block in the spare area of the first flash memory and the predetermined block of the second flash memory, which forms the upper block together with the non-defective block in the spare area of the first flash memory, is stored in each of the upper block management areas 511a and 521a.
0070Thus, a data operation, which is supposed to be performed on the upper block comprised of the defective block of the first flash memory and the predetermined block of the second flash memory, can be performed on the upper block comprised of the non-defective block in the spare area of the first flash memory and the predetermined block of the second flash memory by referencing the information stored in each of the upper block management areas 511a and 521a.
0071A data management method of a system using one or more flash memories, according to an exemplary embodiment of the present invention will be described more fully.
0072Referring to Figure 12, in operation S110, it is determined whether each of the flash memories in the system has initial defective blocks.
0073Here, the initial defective blocks are defective blocks detected before a flash memory is shipped out of the factory. In operation S120, a mapping table is generated by identifying the initial defective blocks in each of the flash memories in the system.
0074The mapping table matches the initial defective blocks in the flash memories in the system with non-defective blocks in spare areas of the respective flash memories and is stored in a virtual block management area in each of the flash memories so that a data operation, which is supposed to be performed on the initial defective blocks of the corresponding flash memory, can be performed on the non-defective blocks in the spare area of the corresponding flash memory.
0075Referring to Figure 13, reference numerals 631 and 632 denote initial defective blocks generated in a data area 630.
0076Specifically, the initial defective blocks 631 and 632 are respectively mapped with non-defective blocks 621 and 622 of a spare area 620 so that a data operation can be performed on the non-defective blocks 621 and 622, rather than on the initial defective blocks 631 and 632.
0077A mapping table that respectively maps the initial defective blocks 631 and 632 with the non-defective blocks 621 and 622 is stored in a virtual block management area 610.
0078The mapping table may respectively match addresses of the non-defective 621 and 622 with addresses of the initial defective blocks 631 and 632, as shown in Figure 14A. Alternatively, the mapping table may respectively match offset values assigned to the non-defective blocks 621 and 622 with the addresses of the initial defective blocks 631 and 632, as shown in Figure 14B.
0079In operation S130, a user issues a request for performing a data operation on a predetermined or current block of one of the flash memories (hereinafter referred to as first memory). In operation S140, it is determined whether the predetermined block is an initial defective block by determining whether the predetermined block is included in the mapping block.
0080In operation S150, if the predetermined block turns out to be an initial defective block, a data operation is performed on a non-defective block in a spare area of the first flash memory, rather than on the predetermined block.
0081In operation S160, if the predetermined block turns out to be a non-defective block, the data operation is performed on the predetermined block. In operation S170, it is determined whether a defect has occurred in the predetermined block in the process of performing the data operation on the predetermined block.
0082If a defect has occurred in the predetermined block while performing the data operation on the predetermined block, then in operation S180 the predetermined block is determined to be a run-time defective block.
0083In operation S190, the predetermined block is registered with the mapping table so that it can be matched with a non-defective block in the spare area of the first flash memory.
0084In operation S200, data stored in the predetermined block is transferred to the non-defective block in the spare area of the first flash memory. In operation S210, a data operation is performed on the non-defective block in the spare area of the first flash memory, rather than on the predetermined block.
0085If the system is an interleaved system, the data operation is performed on an upper block, which is comprised of the non-defective block in the spare area of the first flash memory and a block in the other flash memory that has the same offset value as the non-defective block in the spare area of the first flash memory.
0086A method of transferring data stored in a defective block in each flash memory of a system to a non-defective block in a spare area of a corresponding flash memory will now be described in further detail.
0087Referring to Figure 15, in operation S311, data stored in a defective block in one of the flash memories (hereinafter, referred to as first flash memory) is transferred to a non-defective block in a spare area of the first flash memory.
0088In operation S312, data, which is stored in a block of the other flash memory (hereinafter, referred to as second flash memory) that has the same offset value as the defective block in the first flash memory, is also transferred to a non-defective block in a spare area of the second flash memory.
0089Specifically, referring to Figure 16, flash memories 710 and 720 include data areas 713 and 723, respectively. When a defect occurs in a block 713a in the flash memory 710, data stored in the defective block 713a is transferred to a non-defective block 712a in a spare area 712 of the flash memory 710.
0090A mapping table that matches the defective block 713a with the non-defective block 712a in the spare area 712 is stored in a virtual block management area 711.
0091Given that in the multi-channel system, a data operation is performed in parallel, data, which is stored in a block 723a of the flash memory 720 that has the same offset value as the defective block 713a of the flash memory 710, is also transferred to a block 722a in a spare area 722 of the flash memory 720.
0092In addition, a mapping table that matches the block 723a in the data area 723 with the block 722a in the spare area 722 is stored in a virtual block management area 721.
0093Alternatively, referring to Figure 17, in operation S321, data stored in a defective block in one of the flash memories (hereinafter referred to as first flash memory) is transferred to a non-defective block in a spare area of the first flash memory.
0094In operation S322, an upper block is generated by combining the non-defective block in the spare area of the first flash memory with a block of the other flash memory (hereinafter, referred to as second flash memory) having the same offset value as the defective block of the first flash memory.
0095Specifically, referring to Figure 18, flash memories 810 and 820 have no defective blocks. Blocks 813a and 823a of the flash memories 810 and 820, which have the same offset value, are integrated into an upper block 830. Information on the upper block 830 is stored in virtual block management areas 811 and 821 of the flash memories 810 and 820.
0096Referring to Figure 19, if a defect occurs in the block 813a of the flash memory 810, data stored in the block 813a is transferred to a non-defective block 812a in a spare area 812 of the flash memory 810.
0097Thereafter, the non-defective block 812a in the spare area 812 of the flash memory 810 and the block 823 of the flash memory 820 are integrated into an upper block 830.
0098Information on the upper block is stored in the virtual block management areas 811 and 821 of the flash memories 810 and 820.
0099While the data management apparatus and method of a flash memory have been described with reference to the illustrative embodiments and drawings, it is to be appreciated that the above described embodiment is for purposes of illustration only and not to be construed as a limitation of the invention, and all variations and equivalents which fall within the range of the claims are intended to be embraced therein.
0100As described above, the data management apparatus and method according to the present invention have the following advantages.
0101First, it is possible to efficiently prevent the performance of a system using one or more flash memories from deteriorating due to defective blocks therein.
0102Second, it is possible to provide a system with an optimal data management method by using various methods depending on how the system manages data stored in each of the flash memories when dealing with defective blocks in each of the flash memories.
0103Although a few preferred embodiments have been shown and described, it will be appreciated by those skilled in the art that various changes and modifications might be made without departing from the scope of the invention, as defined in the appended claims.
0104Attention is directed to all papers and documents which are filed concurrently with or previous to this specification in connection with this application and which are open to public inspection with this specification, and the contents of all such papers and documents are incorporated herein by reference.
0105All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and/or all of the steps of any method or process so disclosed, may be combined in any combination, except combinations where at least some of such features and/or steps are mutually exclusive.
0106Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise. Thus, unless expressly stated otherwise, each feature disclosed is one example only of a generic series of equivalent or similar features.
0107The invention is not restricted to the details of the foregoing embodiment(s). The invention extends to any novel one, or any novel combination, of the features disclosed in this specification (including any accompanying claims, abstract and drawings), or to any novel one, or any novel combination, of the steps of any method or process so disclosed.
19 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16 Sheet 17 Sheet 18 Sheet 19
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US8892969B2 | Cited by | United States of America | Applicant |
| US7669092B2 | Cited by | United States of America | Applicant |
| US8365028B2 | Cited by | United States of America | Applicant |
| US7992060B2 | Cited by | United States of America | Applicant |
| WO2008087082A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| WO2008106095A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US8621294B2 | Cited by | United States of America | Applicant |
| US8312245B2 | Cited by | United States of America | Applicant |
| EP2404240A4 | Cited by | European Patent Office (EPO) | Search report |
| EP2404240A2 | Cited by | European Patent Office (EPO) | Search report |
| US2002181285A1 | Cites | United States of America | Applicant |
| US6081878A | Cites | United States of America | Applicant |
12 members in 6 offices; this record represents the family
Priority claims2
| Document | Office | Kind | Date |
|---|---|---|---|
| 2004005020 | Republic of Korea | – | |
| 20040005020 | Republic of Korea | A |
Members12
| Document | Office | Kind | |
|---|---|---|---|
| US2005162947A1 | United States of America | A1 | |
| CN1648876A | China | A | |
| KR20050077505A | Republic of Korea | A | |
| JP2005216293A | Japan | A | |
| EP1564755A2This record | European Patent Office (EPO) | A2 | |
| KR100608592B1 | Republic of Korea | B1 | |
| EP1564755A3 | European Patent Office (EPO) | A3 | |
| CN100334565C | China | C | |
| US7454670B2 | United States of America | B2 | |
| EP1564755B1 | European Patent Office (EPO) | B1 | |
| DE602005022512D1 | Germany | D1 | |
| JP4704759B2 | Japan | B2 |
25 legal events, as 3 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent expired after termination of 20 yearsExpiredPE20 | PE20 | GB | |
| Expiry of rightR071 | R071 | DE | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Opt-out of the competence of the unified patent court (upc) registeredP01 | P01 | EP | |
| No opposition filed against granted patent, or epo opposition proceedings concluded without decisionGrantedR097 | R097 | DE | |
| No opposition filedOpposition26N | 26N | EP | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| Corresponds to:REF | REF | EP | |
| Designated contracting statesAK | AK | EP | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| Designation fees paidAKX | AKX | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Search report despatchedORIGINAL CODE: 0009013PUAL | PUAL | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 1564755
- Application
- 52502051
Titles3
- German
- Vorrichtung und Verfahren zur Datenverwaltung in einem Flash-Speicher
- English
- Data management apparatus and method of flash memory
- French
- Appareil et procédé de gestion de données dans une memoire flash
Classification
- CPC, 10
- G11C29/76
- F16L59/029
- G06F12/0246
- B32B5/18
- B32B9/025
- B32B15/046
- B32B27/065
- B32B2266/0278
- B32B2307/304
- B32B2607/00
- IPC, 3
- G06F12 16
- G06F12 02
- G11C29 00
Designated states36
- Contracting states, 30
- Austria
- Belgium
- Bulgaria
- Switzerland
- Cyprus
- Czechia
- Germany
- Denmark
- Estonia
- Spain
- Finland
- France
- United Kingdom
- Greece
- Hungary
- Ireland
- Iceland
- Italy
- Liechtenstein
- Lithuania
- Luxembourg
- Monaco
- Netherlands (Kingdom of the)
- Poland
and 6 moreShow fewer
- Portugal
- Romania
- Sweden
- Slovenia
- Slovakia
- Türkiye
- Extension states, 6
- Albania
- Bosnia and Herzegovina
- Croatia
- Latvia
- North Macedonia
- Yugoslavia, later Serbia and Montenegro (until 2006)