CN103559260A - Method for dynamically adjusting I node list on the basis of RAMDISK file system - Google Patents
Method for dynamically adjusting I node list on the basis of RAMDISK file system Download PDFInfo
- Publication number
- CN103559260A CN103559260A CN201310537556.XA CN201310537556A CN103559260A CN 103559260 A CN103559260 A CN 103559260A CN 201310537556 A CN201310537556 A CN 201310537556A CN 103559260 A CN103559260 A CN 103559260A
- Authority
- CN
- China
- Prior art keywords
- node
- cavity
- new
- node table
- node data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/172—Caching, prefetching or hoarding of files
Abstract
The invention provides a method for dynamically adjusting an I node list on the basis of an RAMDISK file system. The method comprises the following steps of S1, calculating the data of novel I node corresponding to a newly-built file according to the bits length of a file name of the newly-built file; S2, traversing the I node list, at least sequentially searching a first cavity which is best matched with the data of the novel I node in the I node list, and inserting the novel I node data into the cavity; and S3, replacing the configuration of the I node list, modifying the attribute of the length of the I node list of a superblock in the file system, and dynamically updating an initial position and a logic block bitmap of a logic block in the file system. Through the method, the I node list in the file system can be dynamically adjusted, the occupation rate of the I node list in a valid storage space in the file system of the RAMDISK can be reduced, and the valid storage space of the logic block is effectively improved.
Description
Technical field
The present invention relates to file system technology field, relate in particular to the dynamic adjusting method of the I node table based on RAMDISK file system.
Background technology
RAMDISK is a kind of based on RAM (Random Access Memory), and passes through a kind of storer that software virtualization forms, its can directly be accessed by CPU and access speed fast.RAMDISK does not need the erasable operation of picture FLASH (flash memory) storer when access data yet.
RAMDISK can set up and be electrically connected with nonvolatile memory (as NAND Flash), power-supply controller of electric and super capacitor, in order to the electric power supply of short time to be provided by super capacitor when the computing machine power down, so that the data of preserving in RAMDISK are backed up in nonvolatile memory rapidly.This RAMDISK has the performance of HDD (mechanical type disk), SSD (solid state hard disc), CD (CD) persistence data, also can have the volatile memory such as DRAM or SRAM concurrently can directly be accessed and the fast advantage of access speed by CPU simultaneously, is becoming at present storage products the most most advanced and sophisticated in server (Server) or high-end individual PC product.
At present, existing operating system (Windows, Linux) is conventionally considered as RAMDISK take logical block as unit and has the file of linear address space, and these files are preserved with discrete logical block form.For these files of efficient and accurate location, some point to the data (claiming again " metadata ") of these files just to need additional configuration, and file system (File System, FS) is the mechanism to the file that is discrete state in RAMDISK and " metadata " tissue.
File system generally includes: superblock (Super block), logical block bitmap (Logic Block bitmap), I node table (I-node), logical block (Data block).Wherein, I node table comprises some I node datas, each I node data is by the file in pointed logical block, and the attribute that it has comprised file, such as paper writer, file type, file size, the last information such as access/modification time, file access authority, directory index item.Conventionally, file system is restricted to 128 or 256 bytes by the size of each I node data.Existing file system is considered as special file (needing extra I node in order to characterize a catalogue), storage directory item in the logical block of file system by catalogue.In the prior art, I node table conventionally by file system fixed allocation account for the storage space of whole RAMDISK about 5%; Therefore, occasion on the low side in some number of files but that file itself is larger easily causes the waste of storage space.
Due to the restriction of prior art, RAMDISK can not possess the storage space the same with mechanical type disk, and it only has the capacity of several G conventionally, so the useful space that I node table occupies in the file system of RAMDISK is just more considerable.Technical scheme due to the file system fixed configurations I node table storage space of RAMDISK in prior art, just the storage space of logical block is exerted a certain influence, caused the reduction of the storage space of the logical block that really plays file memory function in RAMDISK.
In view of this, be necessary the distribution mechanism taking up room in whole file system of the I node table of RAMDISK file system in prior art to be improved, to solve above-mentioned technology flaw.
Summary of the invention
The object of the invention is to disclose a kind of dynamic adjusting method of the I node table based on RAMDISK file system, with according to the byte length of the storage condition of the file in logical block and filename, I node table is done dynamically to adjust, reduce the occupancy of I node table to effective storage space in the file system of RAMDISK, improve effective storage space of logical block.
For achieving the above object, the invention provides a kind of dynamic adjusting method of the I node table based on RAMDISK file system, comprise the following steps:
A dynamic adjusting method for the I node table of RAMDISK file system, is characterized in that, comprises the following steps:
S1, big or small according to the corresponding new I node data of this new files of filename byte length computation of new files;
S2, traversal I node table, at least form first cavity of optimum matching, and this new I node data inserted to cavity with new I node data size in sequential search I node table;
S3, the configuration of renewal I node table, the I node table length attribute of superblock in revised file system, and according to the I node table after upgrading, the dynamically reference position of logical block and logical block bitmap in updating file system.
As a further improvement on the present invention, when finding equate with new I node data empty, the cavity finding described in directly new I node data being inserted, to form continuous I node data district in I node table.
As a further improvement on the present invention, when the cavity finding is greater than new I node data, new I node data is inserted to this cavity, and form new cavity at new I node data afterbody.
As a further improvement on the present invention, described step S2 also comprises: upgrade the raft in cavity in I node table, to determine the preferential candidate cavity merging of some needs.
As a further improvement on the present invention, described step S2 also comprises: when in I node table, all single cavities are less than new I node data, merge the some candidates cavity in I node table, to construct the first type structure cavity that is not less than new I node data, and this new I node data is inserted to the first type structure cavity.
As a further improvement on the present invention, described " constructing the first type structure cavity that is not less than new I node data " specifically comprises the following steps:
S21, according to the raft in cavity in the I node table after upgrading, be combined some candidates cavity that rear formed the first type structure cavity is not less than new I node data and merge;
I node data between S22, merged front all candidates cavity is along the direction migration I node data in the front minimum candidate cavity of merging, and the first type that mates this new I node data to form is constructed empty;
S23, renewal are also preserved the directory index item of all I node datas in I node table.
As a further improvement on the present invention, in described step S22, " the I node data between all candidates cavity before merged " is the I node data at some continuous I node datas and/or some intervals.
As a further improvement on the present invention, described step S2 also comprises: a Second-Type structure cavity is merged into in cavities all in I node table, and judge whether this Second-Type structure cavity is greater than or equal to the size of this new I node data,
If so, do not increase I node table length, and new I node data is inserted to Second-Type structure cavity;
If not, increase I node table length, and described Second-Type structure cavity is merged again with the length space that I node table increases, to form extended hole, and this new I node data is inserted to this extended hole.
As a further improvement on the present invention, described extended hole is not less than the size of new I node data.
As a further improvement on the present invention, described step S3 specifically comprises:
Upgrade the configuration of I node table, the I node table length attribute of superblock in revised file system;
If I node table length increases, according to the I node table after upgrading, the dynamically reference position of logical block and logical block bitmap in updating file system.
Compared with prior art, the invention has the beneficial effects as follows: in the present invention, after traversal is to I node table, new I node data is inserted to the existing cavity in I node table or merge the extended hole that length forms that formed the first type in some existing cavities is constructed cavity, Second-Type structure cavity or increased I node table, realized the dynamic adjustment to the I node table in file system, reduce the occupancy of I node table to effective storage space in the file system of RAMDISK, and effectively improved effective storage space of logical block.
Accompanying drawing explanation
Fig. 1 is file system in the RAMDISK of the present invention figure of data organizational structure when initialization;
Fig. 2 is the hardware system structure figure of RAMDISK;
Fig. 3 is the data structure of the I node data in the file system based on RAMDISK;
Fig. 4 is the data structure of the superblock in the file system based on RAMDISK;
Fig. 5 is the indicator index relation structure diagram of the directory index item in the I node data shown in Fig. 3;
Fig. 6 is the dynamic adjusting method process flow diagram that the present invention is based on the I node table of RAMDISK file system;
Fig. 7 is the dynamic adjusting method logical diagram that the present invention is based on the I node table of RAMDISK file system;
Fig. 8 is in new I node data _ n+1 insertion I node table and the process schematic diagram in the equal-sized existing cavity of new I node data _ n+1;
Fig. 9 is that new I node data _ n+1 inserts the process schematic diagram that is greater than the existing cavity of this new I node data _ n+1 size in I node table;
Figure 10 constructs empty process schematic diagram for new I node data _ n+1 is inserted to the first type;
Figure 11 constructs empty process schematic diagram for new I node data _ n+1 is inserted to Second-Type;
Figure 12 inserts new I node data _ n+1 the process schematic diagram of extended hole;
Figure 13 is the figure of data organizational structure after the dynamic adjustment of I node table in the file system in Fig. 1.
Embodiment
Below in conjunction with each embodiment shown in the drawings, the present invention is described in detail; but should be noted that; these embodiment are not limitation of the present invention; those of ordinary skills are according to these embodiment institute work energy, method or structural equivalent transformation or alternative, within all belonging to protection scope of the present invention.
general introduction
File system (File System, FS) is a type of object storage, and it can preserve file (now, object ID is its pathname) or object (now, certain ID liking by file system name being quoted).Shown in ginseng Fig. 3, in linux system, operating system is used I node data to preserve the system information of file, system informations such as paper writer, file size, establishment/modification date, access rights and directory index item.Therefore, file system is a kind of management organization mechanism of data.
Shown in ginseng Fig. 1, Fig. 4 and Fig. 5, in linux system, file system generally includes superblock 10, logical block bitmap 20, I node table 30 and logical block 40.Wherein, logical block 40 is regions of real storage file, but during the file of linux system in access logic piece 40, normally under the guiding of superblock 10 according to the root directory I node in superblock 10, and by as the father node pointer in Fig. 5, brother's node pointer, child node pointer, and to take corresponding I node data in I node table be index visit data in logical block 40.When the data in a certain region in logical block 40 are carried out write operation or deletion action, file system can corresponding " bit " be labeled as " 1 " (representative " oneself uses ") or " 0 " (representative " is not used ") in logical block bitmap 20.
The structural drawing of a kind of RAMDISK system 100 as shown in Figure 2.In RAMDISK system 100, comprise some volatile memory cells 101 that are connected respectively with controller 102 (comprising some DRAM101a).Meanwhile, this controller 102 also for example, is connected with system bus 107 by interface module 103 (PCI-E).In addition, this controller 102 can be that gate array (FPGA) can be edited in special IC (ASIC) or scene.File system is to being the mechanism of file He " metadata " tissue of discrete state in volatile memory cell in RAMDISK 101.
describe in detail
Please refer to the drawing 6 and the dynamic a kind of embodiment adjusted of the I node table that the present invention is based on RAMDISK file system shown in Fig. 7.
In the present embodiment, a kind of dynamic adjusting method of the I node table based on RAMDISK file system, comprises the following steps:
S1, big or small according to the corresponding new I node data of this new files of filename byte length computation of new files.For convenience of description, in this embodiment, suppose and in I node table 30, deposited n I node data, and new I node data is defined as to I node data _ n+1.
File system of the prior art is considered as catalogue a kind of special file conventionally, so just need to distribute I node for it.The general unification of I node ' s length is set to 128 or 256 bytes, and the logical block of its sensing is directory entry data corresponding to storing directory, need to take at least one logical block, and a logical block generally takies 4 to 8 sectors.
Suppose that each catalogue correspondence is deposited a file based on there being 10000 catalogues in existing EXT file system, the filename length of each file is 10 bytes, and each logical block comprises 4 sectors, each sector 512 byte-sized.So in such cases, I node table 30 and corresponding logical block 40 shared space in file system thereof are 20000 * 128 byte+10000 * 4 * 512 byte=24MB.
Therefore, in prior art, the mechanism of this fixed allocation filename byte length just seems very stiff, needs I node table space and logical block space outside occupying volume, has so just compressed the useful space of logical block 40 in file system.Very large due to what unlikely the capacity of DRAM is done in the peculiar property of RAMDISK and prior art, be therefore just necessary to the shared space of I node table 30 according in logical block 40 the byte length of the actual file of depositing and filename thereof dynamically adjust the space that I node table 30 takies file system.
S2, traversal I node table 30, at least form first cavity of optimum matching, and this new I node data inserted to cavity with new I node data size in sequential search I node table.
As shown in Figure 7, in step 201, first travel through I node table, then perform step 202, and according to optimum matching strategy, in sequential search I node table 30 and first cavity of new I node data _ n+1 size optimum matching.When finding equate with new I node data _ n+1 empty, redirect execution step 207, directly this new I node data _ n+1 is inserted to the cavity that this finds.
Concrete, as shown in Figure 8, the size in first cavity 401 after I node data _ n equates with this new I node data _ n+1.Now, execution step 207, so that this I node data _ n+1 is directly inserted to this cavity 401, thereby between I node data _ 1, I node data _ n+1, I node data _ 2, form a continuous I node data district 500, thereby reduced the empty quantity that is discrete state in I node table 30, improved the utilization factor in existing I node table 30 shared space in file system.
Because traversal I node table 30, is greater than or equal to and new I node data _ n+1 so file system can be learnt the size in which cavity, and preferentially this new I node data _ n+1 is inserted in cavity equal-sized with it.
When search less than with new I node data _ n+1 equal-sized when cavity, continue execution step 203, to judge whether to find the cavity that is not less than new I node data _ n+1 size.If so, redirect performs step 207.
Concrete, shown in ginseng Fig. 9, the size in all single cavities in I node table 30 is all unequal with the size of new I node data _ n+1, and while there is the cavity 403 that at least one is greater than this new I node data _ n+1 size.Now, perform step 207, so that this new I node data _ n+1 is inserted in this cavity 403, and in new I node data _ n+1 in interval of afterbody formation of this new I node data _ n+1 and the cavity 4031 of I node data _ n.
When in I node table 30, new I node data _ n+1 all cannot be mated in any one cavity, perform step 204, and further consider that newly I node data _ n+1 inserts through in formed more cavity, some cavities in merging I node table 30, and not to increasing the length of I node table 30, the length of avoiding increasing blindly I node table 30 shared unnecessary space in file system.
Concrete, shown in ginseng Figure 10, in the present embodiment, described step S2 also comprises: upgrade the raft in cavity in I node table 30, to determine some I node datas that need priority migration.Concrete, so-called " upgrade cavity in I node table 30 raft " is specially: record cavity migration weighted value in I node table 30, thus form the raft in cavity.
More specifically, in the present embodiment, described " constructing the structure cavity that is not less than new I node data " comprises following sub-step:
S21, according to the raft in cavity in the I node table after upgrading, be combined some candidates cavity that rear formed the first type structure cavity is not less than new I node data and merge;
I node data between S22, merged front all candidates cavity is along the direction migration I node data in the front minimum candidate cavity of merging, and the first type that mates new I node data to form is constructed empty;
S23, renewal are also preserved the directory index item of all I node datas in I node table.
By above-mentioned steps, realized some smaller cavities have been merged into a cavity that is greater than or equal to new I node data _ n+1.Cooperation is with reference to shown in Figure 10, three cavities of existence 401,402,403 in existing I node table 30.According to the raft in cavity in I node table 30, cavity 402 and cavity 403 can be merged into a first type structure cavity 404.Now, the size in this first type structure cavity 404 before merging can according to the raft in cavity select estimate to merge after the size in formed new cavity merge with some cavities that newly I node data n+1 mates most.
Wherein, in described step S22, " the I node data between all candidates cavity before merged " can be some continuous I node datas, also can be the I node data at some intervals, also can be and somely both comprised that interval also comprised continuous I node data, and be preferably some continuous I node datas.
Shown in ginseng Figure 11, in I node table 30, the whole cavity of non-warp merges in the time of could adapting to new I node data _ n+1, performs step 205, to judge whether merge formed new cavity, all single cavities is greater than or equal to new I node data size; If so, merge all single cavity in I node table 30; If not, perform step 206.
Concrete, when whether formed the first type structure cavity, all single cavities of merging is greater than or equal to new I node data size, can be to I node data _ 1 in I node table 30, I node data _ 2 ... I node data _ n moves along the direction of first I node data _ 1, thereby forms a larger Second-Type structure cavity 405 at I node data _ n afterbody.
In conjunction with reference to shown in Fig. 7, Figure 11 and Figure 12, described step S2 also comprises: a Second-Type structure cavity 405 is merged into in cavities all in I node table 30, and judge whether this Second-Type structure cavity 405 is greater than or equal to the size of new I node data _ n+1.
If so, do not increase I node table length, and new I node data _ n+1 is inserted to this Second-Type structure cavity 405.Shown in ginseng Figure 11, in the present embodiment, the size in this Second-Type structure cavity 405 is greater than new I node data _ n+1.After new I node data n+1 being inserted to this Second-Type structure cavity 405, can form a cavity 4051 at this new I node data _ n+1 afterbody, and the use of insertion while creating next I node data (not shown) for file system.
If not, perform step 206 increase I node table 30 length, and the Second-Type structure cavity 405 that merges institute's formation of structure in step 22 is merged again with the length space that I node table increases, to form extended hole 407 (comprising that the Second-Type structure cavity 405 and the I node table that form after merging increase length formed empty 406), and this new I node data _ n+1 is inserted to this extended hole 407.
Concrete, the size of this extended hole 407 is not less than the size of new I node data _ n+1, and is preferably equal.
S3, renewal I node table are put the tenth of the twelve Earthly Branches, the I node table length attribute of superblock 10 in revised file system, and according to the I node table after upgrading, the dynamically reference position 410 of logical block 40 and logical block bitmap 20 in updating file system.
Concrete, when constructing cavity 404 or construct cavity 405 by merging the mode in all single cavities in I node table 30 to form Second-Type to form the first type by merging the mode in some single cavities in I node table 30, and when this first type structure cavity 404 and/or Second-Type structure cavity 405 can meet the corresponding new I node data of filename byte length of new files, in file system, the reference position 410 of logical block 40 is not just moved.
Only have in the time need to increasing I node table length and just meet the corresponding new I node data of filename byte length of new files to form extended hole 407, just can cause the reference position 410 of logical block 40 in file system to be moved.
Particularly, in file system, the reference position 410 of logical block 40 equals I node table start address and I node table length sum in superblock 10.
Concrete, this step S3 specifically comprises:
Upgrade the configuration of I node table, the I node table length attribute of superblock 10 in revised file system;
If I node table length increases, according to the I node table 30 ' after upgrading, the dynamically reference position 410 of logical block 40 and logical block bitmap 20 in updating file system.
Cooperation is with reference to shown in Fig. 3 to Fig. 5, in the present embodiment, when new I node data _ n+1 is inserted into, searches or construct while being not less than this new I node data _ n+1 size empty, at new I node data by this _ n+1, insert behind cavity, execution step 207 is inserted cavity by new I node data _ n+1, and this stylish I node data _ n+1 inserts cavity for extended hole 407.
Then, execution step 208 is upgraded the configuration of I node table, the I node table length attribute of superblock 10 in revised file system, and add the root directory I node in superblock 10, so that file system by father, brother, sub-pointer by this I node table 30 ' after upgrading in internal memory pointer operation access logic piece 40, thereby realized to file destination read, write, modification, deletion action; Finally perform step 209 migration logical block data.
In conjunction with reference to shown in Fig. 1, Fig. 7 and Figure 13, after I node table 30 is expanded, carry out as the step 209 in Fig. 7, to move logical block data.Now, the reference position 410 of logical block 40 shared spatial dimension in file system changes to reference position 420.Wherein, the region 400 between reference position 410 and reference position 420 increases length formed empty 406 shared region in file system for I node table.As shown in figure 13, I node table 30' is the I node table 30 after upgrading.
Concrete, in the present invention, if same 10000 catalogues of tool in EXT file system, each catalogue correspondence is deposited a file, and the filename length of each file is 10 bytes, and each I node data takies 128 byte spaces; In the present embodiment, adopt after I node table dynamic assignment, I node table 30 shared space in file system is (128 byte+10 byte) * 10000=1.34MB.Therefore, by the present invention, can effectively reduce the occupancy of I node table to effective storage space in RAMDISK file system, and effectively improve effective storage space of logical block.
In the present embodiment, in the file system of RAMDISK, catalogue and I node are united two into one, directory entry data are stored in I node data.Like this, I node data size is changed along with (or directory name) length of the filename in directory entry.Reduce the occupancy of I node table to effective storage space in the file system of RAMDISK, and effectively improved effective storage space of logical block.
Listed a series of detailed description is above only illustrating for feasibility embodiment of the present invention; they are not in order to limit the scope of the invention, all disengaging within equivalent embodiment that skill spirit of the present invention does or change all should be included in protection scope of the present invention.
To those skilled in the art, obviously the invention is not restricted to the details of above-mentioned one exemplary embodiment, and in the situation that not deviating from spirit of the present invention or essential characteristic, can realize the present invention with other concrete form.Therefore, no matter from which point, all should regard embodiment as exemplary, and be nonrestrictive, scope of the present invention is limited by claims rather than above-mentioned explanation, is therefore intended to include in the present invention dropping on the implication that is equal to important document of claim and all changes in scope.Any Reference numeral in claim should be considered as limiting related claim.
In addition, be to be understood that, although this instructions is described according to embodiment, but not each embodiment only comprises an independently technical scheme, this narrating mode of instructions is only for clarity sake, those skilled in the art should make instructions as a whole, and the technical scheme in each embodiment also can, through appropriately combined, form other embodiments that it will be appreciated by those skilled in the art that.
Claims (10)
1. a dynamic adjusting method for the I node table based on RAMDISK file system, is characterized in that, comprises the following steps:
S1, big or small according to the corresponding new I node data of this new files of filename byte length computation of new files;
S2, traversal I node table, at least form first cavity of optimum matching, and this new I node data inserted to cavity with new I node data size in sequential search I node table;
S3, the configuration of renewal I node table, the I node table length attribute of superblock in revised file system, and according to the I node table after upgrading, the dynamically reference position of logical block and logical block bitmap in updating file system.
2. the dynamic adjusting method of I node table according to claim 1, it is characterized in that, when finding equate with new I node data empty, the cavity finding described in directly new I node data being inserted, to form continuous I node data district in I node table.
3. the dynamic adjusting method of I node table according to claim 1 and 2, is characterized in that, when the cavity finding is greater than new I node data, new I node data is inserted to this cavity, and forms new cavity at new I node data afterbody.
4. the dynamic adjusting method of I node table according to claim 1, is characterized in that, described step S2 also comprises: upgrade the raft in cavity in I node table, to determine the preferential candidate cavity merging of some needs.
5. according to the dynamic adjusting method of the I node table described in claim 1 or 4, it is characterized in that, described step S2 also comprises: when in I node table, all single cavities are less than new I node data, merge the some candidates cavity in I node table, to construct the first type structure cavity that is not less than new I node data, and this new I node data is inserted to the first type structure cavity.
6. the dynamic adjusting method of I node table according to claim 5, is characterized in that, described " constructing the first type structure cavity that is not less than new I node data " specifically comprises the following steps:
S21, according to the raft in cavity in the I node table after upgrading, be combined some candidates cavity that rear formed the first type structure cavity is not less than new I node data and merge;
I node data between S22, merged front all candidates cavity is along the direction migration I node data in the front minimum candidate cavity of merging, and the first type that mates this new I node data to form is constructed empty;
S23, renewal are also preserved the directory index item of all I node datas in I node table.
7. the dynamic adjusting method of I node table according to claim 6, is characterized in that, in described step S22, " the I node data between all candidates cavity before merged " is the I node data at some continuous I node datas and/or some intervals.
8. the dynamic adjusting method of I node table according to claim 1, it is characterized in that, described step S2 also comprises: a Second-Type structure cavity is merged into in cavities all in I node table, and judge whether this Second-Type structure cavity is greater than or equal to the size of this new I node data
If so, do not increase I node table length, and new I node data is inserted to Second-Type structure cavity;
If not, increase I node table length, and described Second-Type structure cavity is merged again with the length space that I node table increases, to form extended hole, and this new I node data is inserted to this extended hole.
9. the dynamic adjusting method of I node table according to claim 8, is characterized in that, described extended hole is not less than the size of new I node data.
10. the dynamic adjusting method of I node table according to claim 1, is characterized in that, described step S3 specifically comprises:
Upgrade the configuration of I node table, the I node table length attribute of superblock in revised file system;
If I node table length increases, according to the I node table after upgrading, the dynamically reference position of logical block and logical block bitmap in updating file system.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310537556.XA CN103559260B (en) | 2013-11-05 | 2013-11-05 | The dynamic adjusting method of inode table based on RAMDISK file system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310537556.XA CN103559260B (en) | 2013-11-05 | 2013-11-05 | The dynamic adjusting method of inode table based on RAMDISK file system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103559260A true CN103559260A (en) | 2014-02-05 |
| CN103559260B CN103559260B (en) | 2016-08-31 |
Family
ID=50013507
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310537556.XA Active CN103559260B (en) | 2013-11-05 | 2013-11-05 | The dynamic adjusting method of inode table based on RAMDISK file system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103559260B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106021466A (en) * | 2016-05-17 | 2016-10-12 | 浙江大华技术股份有限公司 | Data storage method and apparatus |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5555405A (en) * | 1993-07-06 | 1996-09-10 | Digital Equipment Corporation | Method and apparatus for free space management in a forwarding database having forwarding entry sets and multiple free space segment queues |
| CN101021813A (en) * | 2006-02-13 | 2007-08-22 | 三星电子株式会社 | Flash memory management system and apparatus |
| US20080263089A1 (en) * | 2004-05-13 | 2008-10-23 | Cousins Robert E | Transaction-Based Storage System and Method That Uses Variable Sized Objects to Store Data |
| CN101335706A (en) * | 2008-07-21 | 2008-12-31 | 北京星网锐捷网络技术有限公司 | Route table space managing method, apparatus, switch and router |
-
2013
- 2013-11-05 CN CN201310537556.XA patent/CN103559260B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5555405A (en) * | 1993-07-06 | 1996-09-10 | Digital Equipment Corporation | Method and apparatus for free space management in a forwarding database having forwarding entry sets and multiple free space segment queues |
| US20080263089A1 (en) * | 2004-05-13 | 2008-10-23 | Cousins Robert E | Transaction-Based Storage System and Method That Uses Variable Sized Objects to Store Data |
| CN101021813A (en) * | 2006-02-13 | 2007-08-22 | 三星电子株式会社 | Flash memory management system and apparatus |
| CN101335706A (en) * | 2008-07-21 | 2008-12-31 | 北京星网锐捷网络技术有限公司 | Route table space managing method, apparatus, switch and router |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106021466A (en) * | 2016-05-17 | 2016-10-12 | 浙江大华技术股份有限公司 | Data storage method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103559260B (en) | 2016-08-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10228854B2 (en) | Storage devices and methods for optimizing use of storage devices based on storage device parsing of file system metadata in host write operations | |
| EP2735978B1 (en) | Storage system and management method used for metadata of cluster file system | |
| US7761648B2 (en) | Caching method for NAND flash translation layer | |
| US20140372685A1 (en) | Memory system, data storage device, user device and data management method thereof | |
| CN105242871A (en) | Data writing method and apparatus | |
| CN103838853B (en) | Mixed file system based on different storage media | |
| CN104246722A (en) | Storage system for eliminating data duplication on basis of hash table, storage controller, and method | |
| CN101692252B (en) | Method for distributing and reclaiming idle blocks of file | |
| CN103995855A (en) | Method and device for storing data | |
| CN107016100A (en) | A kind of metadata management method based on Nonvolatile memory file system | |
| CN100424699C (en) | Attribute extensible object file system | |
| CN106354658B (en) | A method of it reducing mapping table memory source in mixed-use developments algorithm and occupies | |
| CN111522507B (en) | Low-delay file system address space management method, system and medium | |
| CN104268088A (en) | Vehicle DVR (Digital Video Recorder) hard disk data storage method | |
| CN102169460A (en) | Method and device for managing variable length data | |
| CN102915340A (en) | Expanded B+ tree-based object file system | |
| CN103914483A (en) | File storage method and device and file reading method and device | |
| CN109407985B (en) | Data management method and related device | |
| TW201830249A (en) | Method, memory system and article for maximized dedupable memory | |
| CN108628542A (en) | A kind of Piece file mergence method and controller | |
| KR101438667B1 (en) | Database method for b+ tree based on PRAM | |
| CN102200986A (en) | Storage system and method for generating file system in the storage system | |
| CN102955787A (en) | Using method for file directory table, file writing method and main circuit board, CPU (central processing unit) and external storage applying same | |
| CN103823634A (en) | Data processing method and system supporting non-random write mode | |
| CN103116652B (en) | A kind of index stores management method based on slide fastener information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent of invention or patent application | ||
| CB02 | Change of applicant information |
Address after: E science and Technology Park Building No. 20 Liye sensor network university 214073 Jiangsu province Wuxi District Qingyuan Road No. 210 Applicant after: Wuxi Yundong Technology Development Co., Ltd. Address before: Block C No. 18 national software park, whale 214000 Jiangsu province Wuxi Zhenze Road, building 4 floor Applicant before: Wuxi Yundong Technology Development Co., Ltd. |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 214000 WUXI, JIANGSU PROVINCE TO: 214073 WUXI, JIANGSU PROVINCE |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |