TW200426584A - Method and system for storing data - Google Patents

Abstract

A method and system for storing a file in a block-storage-based memory. The method includes following steps: comparing the size of said file with each of said blocks of said memory available for memory storage for selecting a best-fit block; storing a fitted segment of said file into said best-fit block; and truncating said fitted segment of said file and repeating said comparing step and said storing step if a remainder of said file remains after said truncating until the entirety of said file has being stored in said memory.

Description

200426584 V. Description of the invention (1) --------___ The technical field to which the invention belongs The present invention provides a kind of information A method and system for dividing a file into a plurality of assets, especially a kind of system. The storage unit uses the method and system for storing the file. The prior art In the various components of the computer system (Storage Device), the storage can be divided into two categories ^ Storage Device) and non-volatile Storage Device). The so-called data will be gradually developed over time. The source supply is cut off, and it is stored in it = because the access speed is fast '. For example, the dynamics follow Random Access Memory, DRAM. The so-called non-volatile storage should follow Time goes by, and at the same time, the power supply of the company still plays a very important role even if the power supply is cut off, but it is very slow. For example, flash memory is used to store data. Often important. The general city is volatile storage (V ο 1 ati 1 (storage) (Non-Volatile storage is lost in the storage ') and if the electrical data of the storage will completely disappear, its benefits are stored Memory (Dynamic) belongs to this kind of component; on the contrary, the data stored in the storage is unexpected and can also be used to cut off the power supply. Therefore, the non-volatile storage has the disadvantage of retaining the data content when needed. For access speed relative to]) Ram body (Flash Memory), hard disk

a Description of goods (2) 2: The floppy disk drive and other components belong to this type of component :: machine :: ..., the disk drive is convenient for carrying large quantities of empty A non-volatile storage channels. Features, and smaller size and faster access speed ::: Equipped with products such as J-line devices (Hubs) ~ non-swaying circuit area memory; f a storage with block write characteristics ... Enter, and endure the area in the storage, the length of the area & (It may have several different sub- "When a fixed number of writes to the storage, you must use 'p and when-the file It is *, this storage characteristic causes division and storage: so that the block still exists in the block and is not used for other storage purposes. This is the type of storage and the continuous storage of hot secondary storage addresses. For example: Husband = take the flash of 习 storage of the known technology 圮 n 戗. ^ Refer to Figure π, Figure 1 is a schematic diagram of Flash-min 4 dagger body storage of a case 20, which is 9n faster The Yewei block has already been used to store data, and now I want to add Luan 20 Aberdeen to the flash memory. 〖Η φ 眭Day 丨 丨 △ ⑶ Dingbei 丨 Dingxiong took a look at the address of the cypress; r 1 〇 starts from the actual storage unit Mi # ^ block in the flash memory 10, and then divides the file 20 in order The capital ', only stored in block 12 of flash memory 10, until file 2 0. All: be V, only: please pay attention to case 2. The last deposit is -70 a; the size of the general file It ’s not a fixed value, so go ahead; ^ Fortunately, 20 is divided according to the size of block 12 of the flash memory 10 used. Γ 1200426584 V. Description of the invention (3) It is finally divided and remaining ^ > The size of the deposited lean material unit ... usually does not match the size of the flash memory type II, f .... that is, in this situation, the storage space is idle, and there must be some storage in the characteristic block 12b ... The method is used for the storage of any data. I want to quickly use the memory to remember the non-block case. The flash memory type although the card or non-block number of different species is renewed. After the waves, the size of the continuous division into continuous space is: The same type and similar amount of technical clearance fees are used. In the case of several, the flash memory of each block is stored because of the fast technology of the unknown block selection technology. But the flash memory address configuration of the usual number is all When the flash memory is not flashed, the flash memory of the management program is repaired (Fragmentat flash memory is stored in the same memory and its storage is the same, and must be changed, this continuous ion) 丨 The so-called gap, which is a flash write The deletion and deletion are more and more frequent, that is, the total size of the blocks in the segment is not in a continuous state. The flash memory for the continuous and unstorable emotions is stored according to the law, which will cause The area has the following several random reads and writes, all using this address as an index 'k kinds of access portability is poor' due to different memory space size and each of them, when a computer system wants to make A type of flash memory will increase the storage characteristics of software maintenance. Due to the existence of flash memory, the storage memory will be used for a period of time, resulting in its free area. Unused blocks will be used. At this time, even if a file to be stored is an hour, the file will fail. This one has a sufficient gate shape, which is the principle of continuous storage of $. The block is not reasonable. The use, ~ from the figure

200426584 V. Description of the invention (4) The flash memory of the conventional technology in Example 1 is an example. Its element 22a is a series of very short data, and it just happens to be a block 1 2b that is set by the data end of Lianruo Ruo. This is a very large block, which will continue to be stored in the principle allocation end data unit 22a, leaving a part of the very large block 12b in the storage block to write characteristics that cannot be used, resulting in waste; The free space is due to the fact that the flash memory of the technology starts from the flash memory. 'Because it is known that idle continuous blocks are used to store data, this will cause the number of writes to start looking for blocks. There are many other blocks, and each block in a specific area has a maximum guaranteed effective write times. After the number of writes in the body reaches this value, the fault value occurs. If a block has a specific block or rate in a flash memory, it cannot increase the total number of writes to each = F. The flash memory first reaches this value. The flash memory The overall life of the body is shortened;; ^, this will cause increased costs for users. SUMMARY OF THE INVENTION A structured file system is a method for arranging a layer of data on the right and the right, to solve the problem of the above-mentioned practice: the gate storage characteristic of the flash memory technology. The method of data storage, which is harmful. The memory contains a plurality of individual case files: in -memory, the block must be used in the hidden body, and when the file is stored

In the margin ...-Hey β, several of them must be in the memory when the block J is used. When the file is stored, the following steps should be included: compare the; block the block as a unit. The method is mainly & Case and memory of each-memory area in the

200426584 V. Description of the invention (5) The size of the free storage space to select an optimal memory block from the memory blocks with the free storage space; the file corresponding to the optimal memory block is stored in the file The data unit of the storage space is stored in the optimal memory block; and if there are remaining data units to be stored in the file after the data unit is stored, the above steps are repeated until the file is completely stored in the memory. . The present invention uses an optimized method of idle memory configuration and the design of a two-level data structure to enable a file system to more efficiently store a storage device with block write characteristics when storing files. Space allocation to achieve a more rational use of storage resources. Embodiment Please refer to FIG. 2, which shows a block diagram of a system 30 of the present invention. A file system 32 having a two-level data structure is established on a drive module of a memory 38 having a block write characteristic, and a file is stored in the memory 38 according to an optimal allocation algorithm. The memory 38 includes a plurality of memory blocks 46, and when the file is stored in the memory 38, the memory block 46 must be used as a unit. The file system 3 2 mainly accesses the memory according to the following steps. Bank 38: comparing the size of the file with each memory block 46 in the memory 38 with free storage space to select an optimal memory block from the memory block 46; storing the file corresponds to The optimal memory

200426584

: Block = data unit of storage space to the optimal memory block; and %% of the remaining data in the file after storage of the π 贝 亥 shell material unit 2 i repeat the above steps until the file is completely Until stored in the memory 38. FIG. 3 is a system diagram of an embodiment of the present invention. In Figure 3, 'is used to store a file to the memory 38. The memory is a storage device with a block write feature, so it contains a complex number, meaning the block 4 6 (which may have several different Size), used to store the data unit generated after the t-division of the second case ', and the memory also contains a driver (not shown in Figure 3), which is used according to —j ^ 系 32 所The information contained is input to the memory block 46 of the memory 38, and the slot system 32 includes two file layers (/ ten factories, a storage layer 42 and a logic layer). ”E Uyer) 44 'The storage layer 42 is used to provide the optimal memory body 38. The idle block management principle is to select the most suitable record 38. The beginning, =: case, sub-record data block 48 actually corresponds to The memory case is used for 3 positions and sizes; the file layer 44 corresponds to the block 48. The data block selected in each data unit of the pattern is stored in the characteristic memory = can be used for various embedded graphics cards with blocks, etc .; and: 1 is suitable, such as a network hub, a graphics memory, However, the memory 38, which is unique and right-handed, usually has a flash cover range. /, /, Memory with the same characteristics also belongs to the meaning of the present invention

200426584

In Figure 3, according to the best memory area, the actual correspondence of the records 9 and 6 of the file will be stored in the file 4 and 4 at the same time. For example, when you want to control the sequence of memory 38 to merge according to the records in block 48, and when you want to do it, you will use the files in memory file layer 4 4 of block 4 8 and 4 8 to record. To delete the write memory, select the appropriate file. The file block 46 is in the starting block 4 of the storage block. 4 8 Complete the file. Take out the file information. Select the corresponding file for reading. The information module clears phase blocks 4 6. Configure the algorithm to block 46 to store the memory block 46 of the memory 38, and to the information stored in the memory cases, you can read the system in the file layer 44 of the body 38. Illegal drive module memory block 46 originally the file. If you want to record from the memory 38 in the file layer 44 to control the relevant information of the memory area of the driver 38, you can act. At 38 o'clock, the file system _ System 32 stores the memory 38. The file system 32 is selected for casting, and it is the data block 48 in the data block 48 of the fourth, fifth, and 1 () ^ layers in order, The end position and size, number and attribute are recorded in the writing of the slot case; similarly, at the time of the case, the file system 32 will store the data in the body layer 42 ^ in the selected data block 48 'and the data unit Follow the instructions to complete the deletion of the reading of the slot. When the file system selects the data in the storage layer 42 corresponding to the selected data block and delete it, and then record it as described above, you can complete the system Contains 1: ϋ: Under 'Save-File to Memory 38 Zhongri Temple, computer system storage layer, case layer 44) All relevant poor information is stored in the computer

V. Description of the invention (8) The processor is used in the memory to ensure the speed when the computer system loses power supply. However, after the storage of the volatile memory :: no longer Q: :), when all storage: restarts, the memory 38 will be "scanned: two when the computer system": one two: Guanghai volatile Re-establish the relevant management information of the scale layer 42 and the storage body layer 42 in the memory, 1 佝 Zhu layer ^ is-dynamic random access memory (D Taozhong = secondary memory can usually be a flash memory, Please refer to each of the non-volatile memories in the memory 38 :: ':: Medium-Use the non-volatile memory used by the hair as 6 as the initial scan to interpret the 46 A part of the storage space is used: two, each of which is next to the memory block 46, etc., ^ is related to the file and points to the note in which the ground is displayed. 2 ° Plane interpretation information 5 0, and The block in Figure 4. Because the storage i indicates that it is the end message of the storage of the case, 50 will not be lost in the memory of D = D. When the initial scan of the Ziqi computer system disappears, the next time On the basis of this lean material structure information: the beginning of scanning and interpretation of information 50 re-comparison of the present invention The embodiment is described in detail on the subject. The above is the scope of the present invention: different applications for which the same purpose can be achieved are also specific: the file system of the invention 32 stores the H * special method to When selecting the most suitable storage file for 2 files, it is based on the best allocation algorithm of a certain system and 1Γ ^ of the memory block 4 6. For details, please refer to Figure V, Figure 6 and Figure 7: ^ is included in the storage layer 42 __ /, is an example of the algorithm, 200426584 V. Description of the invention (9) One contains a block configuration algorithm 60 (play algorithm 70 (see Figure 6)-take the appropriate block far seven ). Figure 7: The sequence of unused idle blocks 80 (as shown in Figure * Gate L 2 Π, the ghost sequence 8 ° is a memory block 46 with unused Chuzi Yuma's block 46, according to FIFO (First-In-

First ^ Out 'FIFO) principle, the sequence of data blocks is arranged in order, that is, the memory block 4 6 that has recently entered the idle state of sadness will be arranged in the last order of the idle block sequence 80 (that is, as shown in the figure) VII shows the grounded memory block 4 6a, which is the end block of the idle block sequence 80 and the block allocation algorithm 6 in Figure 4 contains the following steps: Step 61 Step 62 Step 6 3 Start Block allocation algorithm 60. Set the size of the file to a residual value; check if the residual value is greater than zero. If yes, go to step 6 4 'If no, go to step 6 6; step 6 4 execute the optimal Block selection algorithm 70 to select an optimal memory block; Step 6 5 Step 66 Save the file in the optimal memory block, and subtract the multiplied 5 memory block from the size of the project. And update the idle block sequence 80. Continue to step 6 2; End the block allocation algorithm 60. That is, if you want to save 1 case, enter the r sequence of the block allocation algorithm 60. First check the Whether the file is a data unit to be stored, such as mad According to the optimal block selection algorithm 70, the optimal memory block is selected. * The file is stored in the optimal memory block, i is updated and idle and 80. After storage, if there are still data units to be stored in the file, ==

200426584 V. Description of the Invention (ίο) Repeat the previous steps until the entire file is stored in storage 38. The optimal block selection algorithm 70 in FIG. 6 compares the file size one by one with the free memory block 46 in the free block sequence 80, which includes the following steps: Step 7 1: Start the optimal block Select algorithm 70; step 72: set the initial value of the optimal memory block size, and set the earliest block in the idle block sequence 80 to enter the current block as the current block; step 73: check the current block Whether it is an end block. If yes, go to step 79; if not, go to step 74; Step 74: check whether the size of the current block is greater than or equal to the remaining value. If yes, go to step 75; if no, go to step 76; step 75: check whether the size of the current optimal memory block is smaller than the remaining value or larger than the current block size. If yes, go to step 7 7; if not, go to step 7 8; step 76: check whether the size of the current optimal memory block is smaller than the size of the current block. If yes, go to step 7 7; if not, go to step 7 8; step 77: set the current block as a new optimal memory block; step 78: the next idle block in the idle block sequence 80 The block becomes a new current block. Continue to step 7 3; step 7 9: end the optimal block selection algorithm 70. That is, if the length of at least one free memory block 46 is greater than or equal to the length

5. The length of the file of the invention description, the oldest one should be stored in those records; if the master: 4 of 4 is the smallest, the longest and the oldest one is used to store the selected length in the case. The most described is the preferred embodiment of this specific rule: basin: ζ, unit. The above different applications are also covered by the present invention. In order to achieve the same purpose, that is to say, the method of the present invention includes the case and each of the memory blocks in the memory idle storage :: ':: Compare the slot from the memory with idle storage space = time = Small 'in blocks; storing the file corresponds to the most suitable memory data unit to the most suitable memory block; after storing, there is still a remaining data unit to be stored in the file. Corruption unit until the broadcast is completely stored in the memory = the above steps, compared with the conventional storage technology, the characteristics of directly storing data in a continuous block configuration way, & ... = It has good portability and increased non-continuous block allocation methods = it has software that uses the most suitable block selection algorithm to avoid unreasonable configuration. I use flexible, first-in-first-out idle block management rules to extend the whole = j waste, Well point. The life and other advantages of the cup body are only the preferred embodiments of the present invention. The equivalent changes and modifications made in the scope of the patent are all applied for by the present invention patent. 200426584 V. Description of the invention (12) Cover range.

1I1II 200426584 Brief Description of Drawings Figure 1 is a schematic diagram of storing a file in the flash memory of the conventional technology. Figure 2 is a system block diagram of the present invention. FIG. 3 is a system block diagram of an embodiment of the present invention. Figure 4 is a schematic diagram of the initial scan interpretation. Figure 5 is a block configuration algorithm flowchart. Figure 6 shows the flowchart of the optimal block selection algorithm. Figure 7 is a schematic diagram of an idle block sequence. Symbol description of the figure 12, 12a, 12b Block 22, 22a Data unit 3 2 File system 4 2 Storage layer 46, 46a Memory block 5 0 Initial scan interpretation data 7 0 Optimal block selection algorithm 1 0 Flash Memory 2 0 File 3 0 System architecture of the invention 3 8 Memory 44 File layer 48 Data block 6 0 Block allocation algorithm 8 0 Idle block sequence

Claims (1)

200426584 VI. Scope of Patent Application 1. A method for storing data, which is used to store a file in a memory with a block write feature. The method includes the following steps: Compare the file with each memory in the memory. The size of the free storage space of a memory block to select an optimal memory block from the memory blocks with the free storage space; a data unit storing the file corresponding to the storage space of the optimal memory block To the optimal memory block; and if there are remaining data units to be stored in the file after the data unit is stored, repeat the above steps until the file is completely stored in the memory. 2. The method as described in item 1 of the scope of patent application, wherein the selection of the optimal memory block includes the following steps: setting the initial value of the optimal memory block size; from the memory block according to the FIFO order Select a memory block with free storage space; compare the size of the selected memory block, the current optimal memory block, and the file. When the selected memory block is greater than or equal to the file, and When the current optimal memory block is smaller than the file or larger than the selected memory block, the selected memory block replaces the current optimal memory block to become the new optimal memory block, and the foregoing is repeated. Selection and comparison steps, until each memory block with free storage space in the memory block is completely selected and compared 0 200426584 VI. The scope of the patent application area is the most appropriate for the French party's description of item IX. Fan Li specially requested to apply for a T / J of the initial value of the value of 3. • Block step area. The package with the most selected block is free-take the selected block area to remember the slave; the sequence block of the block area will be remembered first, and the previous data will be stored according to the storage space. The file should be divided into blocks, the file of the district file should be recorded in the most small block of the previous area, and the block of the block should be selected. If it is selected, it will be divided into blocks. The memory of the body area is suitable for the memory area and the body is selected in the first generation of the block; the body of the memory area is suitable for the body and the body is located in the middle and the rear area. Comparing the area and remembering the selection should be completed to the end, the block step step is more detailed than the memory and the selection is empty and stored before storage and resetting. 4. If the scope of patent application is the first The method described in item 1, which makes the memory a flash memory (F 1 a s h Me m O r y). 5. A data storage system including: a memory, which has a block write feature; and a file system, which is built on the drive module of the memory and provides a block configuration algorithm in a file When storing in the memory, more efficient storage space allocation is performed. 200426584 6. Scope of patent application 6. The system described in item 5 of the scope of patent application, wherein the building case system includes a storage layer and a trough case layer, and the storage layer contains a plurality of data blocks, each data area The block corresponds to a memory block of the memory, and records the actual start, end position, and size of the memory block. The file layer is used to record the data area selected by each data unit of the file. Piece. Each of the items in the description of the system: the steps in the memory, the steps below, and the Fan Han case package should specifically ask the owner to apply, such as the method Γ calculation Yin, / / own block should be empty The storage space of the idle block is taken from the empty storage space of the selected block memory, such as the block space between the self-contained, t J large block, and the most suitable empty storage block and Remember to remember · After the most appropriate part of the area, the body element should remember S as early as possible to the record file, and the file should be saved to the storage and storage yuan. If the single material is stored, The remaining files are still in the archives, remembering that the archives that have been completely stored in the archives should be repeated as described above. The only stop is the description of the most appropriate and comprehensive description of the individual minds in the Yuanzhong single area: 7 I Steps are listed below. Includes exclusive packages. Please select the application. • Block 8 i One is available. In the middle of the block, the initial memory of the block-valued area is smaller. The large-scale memory is selected from the sequential sequence of the block-ordered area. The ratio of storage to storage and storage of the space and the price of the block is equal to σ. 200426584 6. The scope of the patent application. The size of the file. When the selected memory block is greater than or equal to the file, and the current optimal memory block is smaller than the file or larger than the selected memory block, then The selected memory block replaces the current optimal memory block to become the new optimal memory block; and repeats the foregoing selection and comparison steps until each of the memory blocks in the memory block has free storage space After being completely selected and compared. 9. The system described in item 7 of the scope of patent application, wherein the selection of the optimal memory block includes the following steps: setting the initial value of the optimal memory block size; and selecting from the memory block according to the FIFO order Select a memory block with free storage space; compare the size of the selected memory block, the current optimal memory block, and the file. When the selected memory block is smaller than the file, and is currently the most suitable When the memory block is smaller than the selected memory block, the selected memory block replaces the current optimal memory block to become the new optimal memory block; and the foregoing selection and comparison steps are repeated until Each memory block in the memory block with free storage space is completely selected and compared. 10. The system described in item 5 of the scope of patent application, wherein the memory having the block write characteristic is a flash memory. 200426584 6. Scope of patent application ill