CN103559260B - The dynamic adjusting method of inode table based on RAMDISK file system - Google Patents
The dynamic adjusting method of inode table based on RAMDISK file system Download PDFInfo
- Publication number
- CN103559260B CN103559260B CN201310537556.XA CN201310537556A CN103559260B CN 103559260 B CN103559260 B CN 103559260B CN 201310537556 A CN201310537556 A CN 201310537556A CN 103559260 B CN103559260 B CN 103559260B
- Authority
- CN
- China
- Prior art keywords
- inode
- data
- cavity
- new
- inode table
- 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.)
- Active
Links
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 the dynamic adjusting method of a kind of inode table based on RAMDISK file system, comprise the following steps: S1, according to the new inode size of data corresponding to filename this new files of byte length computation of new files；S2, traversal inode table, at least sequential search inode table form first cavity most preferably mated with new inode size of data, and these new inode data are inserted cavity；S3, renewal inode table configuration, the inode table length attribute of superblock in amendment file system, and according to the inode table after updating, it is dynamically updated original position and the logical block bitmap of logical block in file system.Pass through the present invention, it is achieved that the dynamic adjustment to the inode table in file system, reduce the inode table occupancy to memory space effective in the file system of RAMDISK, and be effectively improved effective memory space of logical block.
Description
Technical field
The present invention relates to file system technology field, particularly relate to I based on RAMDISK file system
The dynamic adjusting method of node table.
Background technology
RAMDISK is a kind of based on RAM (Random Access Memory) and empty by software
Planization and a kind of memory of being formed, it directly can be accessed by CPU and access speed is fast.RAMDISK
Also the erasable operation as FLASH (flash memory) memory it is not required to when accessing data.
RAMDISK can be with nonvolatile memory (such as NAND Flash), power-supply controller of electric with super
Electric capacity is set up and is electrically connected with, in order to be provided the electric power of short time to supply when computer power down by super capacitor
Should, so that the data preserved in RAMDISK are backed up to rapidly in nonvolatile memory.This
RAMDISK has HDD (mechanical type disk), SSD (solid state hard disc), CD (CD) forever
Preserving the performance of data, also can have the volatile memory such as DRAM or SRAM concurrently can be by CPU simultaneously
Directly access and the fast advantage of access speed, currently become server (Server) or high-end
Storage product the most most advanced and sophisticated in people's PC product.
At present, RAMDISK generally is considered as patrolling by existing operating system (Windows, Linux)
Collecting block is unit the file having linear address space, and these files are protected with discrete logical block form
Deposit.In order to efficiently and be accurately positioned these files, it is necessary to additional configuration some point to the number of these files
According to (also known as " metadata "), and file system (File System, FS) is then in RAMDISK
File in discrete state and " metadata " carry out the mechanism organized.
File system generally includes: superblock (Super block), logical block bitmap (Logic Block
Bitmap), inode table (I-node), logical block (Data block).Wherein, inode table includes
Some inode data, each inode data are by the file in pointer sensing logical block, its bag
The attribute of file, such as paper writer, file type, file size, finally access/amendment are contained
The information such as time, file access authority, directory index item.Generally, each I is saved by file system
The size of point data is limited to 128 or 256 bytes.It is special that catalogue is considered as by existing file system
File (i.e. needing extra inode in order to characterize a catalogue), in the logical block of file system
Storage directory entry.In the prior art, inode table is generally accounted for by file system fixed allocation whole
The memory space of RAMDISK about 5%；Therefore, some number of files are on the low side but file itself relatively
Big occasion easily causes the waste of memory space.
Due to the restriction of prior art, RAMDISK can not possess the storage as mechanical type disk
Space, the capacity of its generally only several G, therefore inode table is in the file system of RAMDISK
The useful space occupied is the most considerable.Join owing in prior art, the file system of RAMDISK is fixing
Put the technical scheme of inode table memory space, just the memory space of logical block exerted a certain influence,
Cause the reduction of the memory space of the logical block really playing file memory function in RAMDISK.
In view of this, it is necessary to the inode table of RAMDISK file system in prior art
The distribution mechanism taken up room in whole file system is improved, to solve above-mentioned technology flaw.
Summary of the invention
It is an object of the invention to disclose a kind of inode table based on RAMDISK file system
Dynamic adjusting method, with the storage condition according to the file in logical block and the byte length of filename,
Make inode table dynamically to adjust, reduce inode table to effective in the file system of RAMDISK
The occupancy of memory space, improves effective memory space of logical block.
For achieving the above object, the invention provides a kind of based on RAMDISK file system
The dynamic adjusting method of inode table, comprises the following steps:
A kind of dynamic adjusting method of inode table based on RAMDISK file system, it is characterised in that
Comprise the following steps:
S1, according to the new inode corresponding to filename this new files of byte length computation of new files
Size of data；
S2, traversal inode table, at least sequential search inode table are formed with new inode size of data
First cavity of optimal coupling, and these new inode data are inserted cavity；
S3, renewal inode table configuration, the inode table length attribute of superblock in amendment file system,
And according to the inode table after updating, it is dynamically updated original position and the logic of logical block in file system
Bitmap block.
As a further improvement on the present invention, when find equal with new inode data empty time, directly
Connect the cavity found described in new inode data being inserted, to form continuous print I joint in inode table
Point data district.
As a further improvement on the present invention, when the cavity found is more than new inode data, will be new
Inode data insert this cavity, and form new cavity in new inode data trailer.
As a further improvement on the present invention, described step S2 also includes: update cavity in inode table
Raft, to determine the candidate cavity that some needs preferentially merge.
As a further improvement on the present invention, described step S2 also includes: when all single in inode table
When cavity is less than new inode data, merge the some candidates cavity in inode table, the least to construct
In the first type structure cavity of new inode data, and these new inode data are inserted the first type structure sky
Hole.
As a further improvement on the present invention, described " the first type not less than new inode data is constructed
Structure cavity " specifically include following steps:
S21, according to the raft in cavity in the inode table after updating, the first type of being formed after being combined
Structure cavity merges not less than some candidate cavities of new inode data；
Inode data between S22, merged front all candidate cavities are along merging front minimum candidate's sky
The direction in hole migrates inode data, to form the first type structure cavity mating these new inode data；
S23, update and preserve the directory index item of all inode data in inode table.
As a further improvement on the present invention, " all candidates cavity before merged in described step S22
Between inode data " be the inode data at some continuous print inode data and/or some intervals.
As a further improvement on the present invention, described step S2 also includes: by sky all of in inode table
A Second-Type structure cavity is merged in hole, and judges whether this Second-Type structure cavity is more than or equal to
The size of these new inode data,
The most do not increase inode table length, and new inode data are inserted Second-Type structure cavity；
If it is not, increase inode table length, and described Second-Type structure cavity is increased with inode table
Length space again merge, to form extended hole, and it is empty that these new inode data are inserted this extension
Hole.
As a further improvement on the present invention, described extended hole is not less than the size of new inode data.
As a further improvement on the present invention, described step S3 specifically includes:
Update the configuration of inode table, the inode table length attribute of superblock in amendment file system；
If inode table length increases, then according to the inode table after updating, it is dynamically updated file system
The original position of middle logical block and logical block bitmap.
Compared with prior art, the invention has the beneficial effects as follows: in the present invention, in traversal to inode
After table, new inode data are inserted the existing cavity in inode table or merges some existing cavity institutes
The the first type structure cavity, the Second-Type that are formed construct cavity or increase the formed expansion of length of inode table
Exhibition cavity, it is achieved that the dynamic adjustment to the inode table in file system, reduces inode table pair
The occupancy of effective memory space in the file system of RAMDISK, and it is effectively improved logical block
Effectively memory space.
Accompanying drawing explanation
Fig. 1 is the data organizational structure when initializing of the file system in RAMDISK of the present invention
Figure；
Fig. 2 is the hardware system structure figure of RAMDISK；
Fig. 3 is the data structure of the inode data in file system based on RAMDISK；
Fig. 4 is the data structure of the superblock in file system based on RAMDISK；
Fig. 5 is the indicator index relational structure of the directory index item in the inode data shown in Fig. 3
Figure；
Fig. 6 is the dynamic adjusting method stream of present invention inode based on RAMDISK file system table
Cheng Tu；
Fig. 7 is that the dynamic adjusting method of present invention inode based on RAMDISK file system table is patrolled
Collect figure；
Fig. 8 be new inode data _ n+1 insert in inode table with new inode data _ n+1 size
The process schematic in equal existing cavity；
Fig. 9 is that new inode data _ n+1 inserts in inode table more than this new inode data _ n+1
The process schematic in the existing cavity of size；
Figure 10 is the process schematic that new inode data _ n+1 inserts the first type structure cavity；
Figure 11 is the process schematic that new inode data _ n+1 inserts Second-Type structure cavity；
Figure 12 is the process schematic that new inode data _ n+1 inserts extended hole；
Figure 13 is the data organizational structure's figure after inode table dynamically adjusts in the file system in Fig. 1.
Detailed description of the invention
The present invention is described in detail for each embodiment shown in below in conjunction with the accompanying drawings, but it should explanation
It is that these embodiments not limitation of the present invention, those of ordinary skill in the art are according to these embodiments
Equivalent transformation in institute's work energy, method or structure or replacement, belong to the protection model of the present invention
Within enclosing.
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, to as if by certain of file system name
Individual ID quotes).Shown in ginseng Fig. 3, in linux system, operating system uses inode data
Preserve the system information of file, such as paper writer, file size, establishment/amendment date, access rights
With system informations such as directory index items.Therefore, file system is the management organization mechanism of a kind of data.
Shown in ginseng Fig. 1, Fig. 4 and Fig. 5, in linux system, file system generally includes super
Level block 10, logical block bitmap 20, inode table 30 and logical block 40.Wherein, logical block 40 is real
The region of storage file, but linux system is when accessing the file in logical block 40, it is common that super
According to the root inode in superblock 10 under the guiding of level block 10, and saved by such as the father in Fig. 5
Point pointer, brother's node pointer, child node pointer, and with inode data corresponding in inode table be
Index accesses data in logical block 40.When the some region of data in logical block 40 carry out write behaviour
When work or deletion action, file system corresponding " bit " can be labeled as in logical block bitmap 20
" 1 " (representing " oneself uses ") or " 0 " (representing " use ").
The structure chart of a kind of RAMDISK system 100 as shown in Figure 2.In RAMDISK system
100 include that some volatile memory cells 101 being respectively connected with controller 102 (include some
DRAM101a).Meanwhile, this controller 102 also by interface module 103 (such as PCI-E) be
System bus 107 is connected.Additionally, this controller 102 can be special IC (ASIC) or show
Gate array (FPGA) can be edited in field.File system is to volatile memory cell 101 in RAMDISK
In file in discrete state and " metadata " carry out the mechanism organized.
Describe in detail
Please join inode based on the RAMDISK file system table of the present invention shown in Fig. 6 with Fig. 7 dynamic
A kind of detailed description of the invention adjusted.
In the present embodiment, the dynamic adjustment of a kind of inode table based on RAMDISK file system
Method, comprises the following steps:
S1, according to the new inode corresponding to filename this new files of byte length computation of new files
Size of data.For convenience of description, in this embodiment, it is assumed that inode table 30 has been deposited
N inode data, and new inode data are defined as inode data _ n+1.
Catalogue is generally considered as a kind of special file by file system of the prior art, thus need for
It distributes inode.Inode length is typically unified is set to 128 or 256 bytes, and what it pointed to patrols
Collect the directory entry data that block then storing directory is corresponding, need to take at least one logical block, a logical block one
As take 4 to 8 sectors.
Assuming that based on existing EXT file system having 10000 catalogues, each catalogue correspondence deposit one
Individual file, the filename length of each file is 10 bytes, and each logical block comprises 4 sectors, each
Sector 512 byte-sized.So in this case, the logical block 40 of inode table 30 and correspondence thereof
Space shared in file system is 20000 × 128 byte+10000 × 4 × 512 bytes
=24MB。
Therefore, in prior art, the mechanism of this fixed allocation filename byte length just seems the most slow-witted
Plate, needs to take extra inode table space and logical block space, thus have compressed in file system
The useful space of logical block 40.Due in the peculiar property of RAMDISK and prior art unlikely
That is done by the capacity of DRAM is very big, is therefore necessary to the space root shared by inode table 30
According in logical block 40 the byte length of the actual file deposited and filename thereof dynamically adjust inode table
30 spaces taking file system.
With new inode size of data shape in S2, traversal inode table 30, at least sequential search inode table
Become first cavity of optimal coupling, and these new inode data are inserted cavity.
As it is shown in fig. 7, in step 201, first traversal inode table, then perform step 202,
And according to optimal matching strategy, in sequential search inode table 30 with new inode data _ n+1 size
First cavity of good coupling.When find equal with new inode data _ n+1 empty time, then redirect
Perform step 207, directly this new inode data _ n+1 is inserted this cavity found.
Concrete, as shown in Figure 8, the size in first cavity 401 after inode data _ n is new with this
Inode data _ n+1 is equal.Now, step 207 is performed, directly to be inserted by this inode data _ n+1
Enter this cavity 401, thus shape between inode data _ 1, inode data _ n+1, inode data _ 2
Become a continuous print inode data field 500, thus decrease in inode table 30 cavity in discrete state
Quantity, improve existing inode table 30 utilization rate in shared space in file system.
When first cavity 401 in inode table 30 is less than this new inode data _ n+1, then continue
Inode table 30 is searched the cavity of next formed optimal coupling.
Because traversal inode table 30, thus file system be appreciated that the size in which cavity more than or
It is equal to and new inode data _ n+1, and preferentially these new inode data _ n+1 is inserted and its size phase
Deng cavity in.
When searching less than cavity equal-sized with new inode data _ n+1, then continue executing with step
203, to judge whether to find the cavity not less than new inode data _ n+1 size.The most then jump
Turn and perform step 207.
Concrete, shown in ginseng Fig. 9, when the size in all single cavity in inode table 30 saves with new I
The size of point data _ n+1 is the most unequal, and it is big more than this new inode data _ n+1 to there is at least one
During little cavity 403.Now, step 207 is performed, so that this new inode data _ n+1 is inserted this sky
In hole 403, and at one new inode data _ n+1 in interval of afterbody formation of this new inode data _ n+1
Cavity 4031 with inode data _ n.
When in inode table 30, new inode data _ n+1 all cannot be mated in any one cavity, then hold
Row step 204, and consider further to be newly inserted through merging inode table 30 by inode data _ n+1
In in the more cavity that formed, some cavities, and not to the length increasing inode table 30, it is to avoid
Increase the unnecessary space that the length of inode table 30 is shared in file system blindly.
Concrete, shown in ginseng Figure 10, in the present embodiment, described step S2 also includes: update I
The raft in cavity in node table 30, to determine some inode data needing priority migration.Concrete,
So-called " updating the raft in cavity in inode table 30 " is particularly as follows: record sky in inode table 30
Hole migrates weighted value, thus forms the raft in cavity.
More specifically, in the present embodiment, described " structure not less than new inode data is constructed
Cavity " include following sub-step:
S21, according to the raft in cavity in the inode table after updating, the first type of being formed after being combined
Structure cavity merges not less than some candidate cavities of new inode data；
Inode data between S22, merged front all candidate cavities are along merging front minimum candidate's sky
The direction in hole migrates inode data, to form the first type structure cavity mating new inode data；
S23, update and preserve the directory index item of all inode data in inode table.
Pass through above-mentioned steps, it is achieved that some smaller cavities are merged into one more than or equal to new
The cavity of inode data _ n+1.Coordinate shown in reference Figure 10, the existing existence in inode table 30
Three cavities 401,402,403.According to the raft in cavity in inode table 30, can be by cavity 402
A first type structure cavity 404 is merged into cavity 403.Now, this first type structure cavity 404
The new cavity that can be formed after selecting anticipated merging according to the raft in cavity before merging of size big
Some cavities that little and new inode data n+1 are mated most merge.
Wherein, in described step S22, " the inode data between all candidate cavities before merged " can
To be some continuous print inode data, it is also possible to be the inode data at some intervals, also can be some
Both include being spaced and also include continuous print inode data, and the most some continuous print inode data.
Shown in ginseng Figure 11, just adapt to new inode when the cavity that warp non-in inode table 30 is whole merges
During data _ n+1, perform step 205, whether to judge the new cavity that formed, all single cavities of merging
More than or equal to new inode size of data；The most then merge all single sky in inode table 30
Hole；If it is not, then perform step 206.
Concrete, when merge the first type structure cavity that all single cavities are formed whether more than or etc.
When new inode size of data, can be to inode data _ 1 in inode table 30, inode data _ 2 ...
Inode data _ n migrates along the direction of first inode data _ 1, thus at inode data _ n
Afterbody forms a bigger Second-Type structure cavity 405.
In conjunction with reference to shown in Fig. 7, Figure 11 and Figure 12, described step S2 also includes: by inode table 30
In all of cavity merge into Second-Type structure cavity 405, and judge this Second-Type structure cavity 405
Whether it is more than or equal to the size of new inode data _ n+1.
The most do not increase inode table length, and new inode data _ n+1 is inserted 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 big
In new inode data _ n+1.After new inode data n+1 are inserted this Second-Type structure cavity 405,
A cavity 4051 can be formed at these new inode data _ n+1 afterbody, and create next for file system
Insert during individual inode data (not shown) and be used.
If it is not, then perform step 206 to increase inode table 30 length, and institute will be merged in step 22
The length space that the Second-Type structure cavity 405 that structure is formed is increased with inode table merges again, with
(the Second-Type structure cavity 405 formed after including merging and inode table increase to form extended hole 407
The cavity 406 that length is formed), and this new inode data _ n+1 is inserted this extended hole 407.
Concrete, the size of this extended hole 407 size not less than new inode data _ n+1, and excellent
Elect as equal.
S3, renewal inode table are put the tenth of the twelve Earthly Branches, the inode table length attribute of superblock 10 in amendment file system,
And according to the inode table after updating, it is dynamically updated the original position 410 of logical block 40 in file system
And logical block bitmap 20.
Concrete, when by merging in inode table 30 by the way of some single cavities to form the first type structure
Make cavity 404 or to form Second-Type structure by the way of all single cavities in merging inode table 30
Make cavity 405, and this first type structure cavity 404 and/or Second-Type structure cavity 405 can meet new
When building the new inode data corresponding to the filename byte length of file, logical block 40 in file system
Original position 410 do not migrate.
Only when needing increase inode table length just to meet the literary composition of new files to form extended hole 407
During new inode data corresponding to part name byte length, just can cause rising of logical block 40 in file system
Beginning position 410 migrates.
Specifically, in file system, the original position 410 of logical block 40 is equal to inode in superblock 10
Table initial address and inode table length sum.
Concrete, this step S3 specifically includes:
Update the configuration of inode table, the inode table length attribute of superblock 10 in amendment file system；
If inode table length increases, then according to the inode table 30 ' after updating, it is dynamically updated file
The original position 410 of logical block 40 and logical block bitmap 20 in system.
Coordinate with reference to shown in Fig. 3 to Fig. 5, in the present embodiment, when new inode data _ n+1 inserts
To search or structure not less than this new inode data _ n+1 size empty time, by this new inode
After data _ n+1 inserts cavity, perform step 207 and new inode data _ n+1 is inserted cavity, now
New inode data _ n+1 is inserted cavity for extended hole 407.
Then, perform step 208 and update the configuration of inode table, the I of superblock 10 in amendment file system
Node table length attribute, and add the root inode in superblock 10, in order to file system by father,
Brother, sub-pointer by the inode table 30 ' after this renewal in memory pointer operational access logical block 40,
It is achieved thereby that file destination be read out, write, revise, deletion action；Finally perform step 209
Migrate logical block data.
In conjunction with reference to shown in Fig. 1, Fig. 7 and Figure 13, after inode table 30 is extended, perform such as
Step 209 in Fig. 7, to migrate logical block data.Now, logical block 40 is shared in file system
The original position 410 of spatial dimension be changed to original position 420.Wherein, original position 410 with
Region 400 between original position 420 increases the cavity 406 that formed of length at file by inode table
Region shared in system.As shown in figure 13, inode table 30' is the inode table 30 after updating.
Concrete, in the present invention, if 10000 catalogues of same tool in EXT file system, each
Catalogue correspondence deposits a file, and the filename length of each file is 10 bytes, each inode number
According to taking 128 byte spaces；In the present embodiment, after using inode table dynamically to distribute, inode
The table 30 space shared by file system is (128 byte+10 byte) × 10000=1.34MB.
Therefore, by the present invention, inode table can be effectively reduced and effectively deposit in RAMDISK file system
The occupancy in storage space, and it is effectively improved effective memory space of logical block.
In the present embodiment, in the file system of RAMDISK, catalogue is closed with inode
Two is one, and directory entry data are stored in inode data.So so that inode size of data
Change along with filename (or directory name) length in directory entry.Reduce inode table pair
The occupancy of effective memory space in the file system of RAMDISK, and it is effectively improved logical block
Effectively memory space.
The a series of detailed description of those listed above is only for the feasibility embodiment of the present invention
Illustrate, they also are not used to limit the scope of the invention, all without departing from skill of the present invention essence
Equivalent implementations or change that god is made should be included within the scope of the present invention.
It is obvious to a person skilled in the art that the invention is not restricted to the thin of above-mentioned one exemplary embodiment
Joint, and without departing from the spirit or essential characteristics of the present invention, it is possible to other concrete shape
Formula realizes the present invention.Therefore, no matter from the point of view of which point, embodiment all should be regarded as exemplary,
And be nonrestrictive, the scope of the present invention is limited by claims rather than described above, because of
This is intended to include at this all changes fallen in the implication of equivalency and scope of claim
In bright.Should not be considered as limiting involved claim by any reference in claim.
Moreover, it will be appreciated that although this specification is been described by according to embodiment, but the most each reality
Mode of executing only comprises an independent technical scheme, and this narrating mode of specification is only for understand
Seeing, those skilled in the art should be using specification as an entirety, and the technical scheme in each embodiment is also
Other embodiments that it will be appreciated by those skilled in the art that can be formed through appropriately combined.
Claims (9)
1. a dynamic adjusting method for inode table based on RAMDISK file system, its feature exists
In, comprise the following steps:
S1, according to the new inode corresponding to filename this new files of byte length computation of new files
Size of data；
S2, traversal inode table, at least sequential search inode table are formed with new inode size of data
First cavity of optimal coupling, and these new inode data are inserted cavity；
S3, renewal inode table configuration, the inode table length attribute of superblock in amendment file system,
And according to the inode table after updating, it is dynamically updated original position and the logic of logical block in file system
Bitmap block；
Described step S2 also includes: update the raft in cavity in inode table, excellent to determine some needs
The candidate cavity first merged, wherein, described " updating the raft in cavity in inode table " particularly as follows:
In inode table, record cavity migrates weighted value, thus forms the raft in cavity.
The dynamic adjusting method of inode table the most according to claim 1, it is characterised in that when looking into
Find equal with new inode data empty time, directly new inode data are inserted described in find
Cavity, to form continuous print inode data field in inode table.
The dynamic adjusting method of inode table the most according to claim 1 and 2, it is characterised in that
When the cavity found is more than new inode data, new inode data are inserted this cavity, and newly
Inode data trailer forms new cavity.
The dynamic adjusting method of inode table the most according to claim 1, it is characterised in that described
Step S2 also includes: when single cavities all in inode table are less than new inode data, merges I joint
Some candidates cavity in some table, to construct the first type structure cavity not less than new inode data,
And these new inode data are inserted the first type structure cavity.
The dynamic adjusting method of inode table the most according to claim 4, it is characterised in that described
" construct the first type structure cavity not less than new inode data " and specifically include following steps:
S21, according to the raft in cavity in the inode table after updating, the first type of being formed after being combined
Structure cavity merges not less than some candidate cavities of new inode data；
Inode data between S22, merged front all candidate cavities are along merging front minimum candidate's sky
The direction in hole migrates inode data, to form the first type structure cavity mating these new inode data；
S23, update and preserve the directory index item of all inode data in inode table.
The dynamic adjusting method of inode table the most according to claim 5, it is characterised in that described
In step S22, " the inode data between all candidate cavities before merged " are some continuous print I joints
The inode data at point data and/or some intervals.
The dynamic adjusting method of inode table the most according to claim 1, it is characterised in that described
Step S2 also includes: cavity all of in inode table is merged into a Second-Type structure cavity, and sentences
Whether disconnected this Second-Type structure cavity is more than or equal to the size of these new inode data,
The most do not increase inode table length, and new inode data are inserted Second-Type structure cavity；
If it is not, increase inode table length, and described Second-Type structure cavity is increased with inode table
Length space again merge, to form extended hole, and it is empty that these new inode data are inserted this extension
Hole.
The dynamic adjusting method of inode table the most according to claim 7, it is characterised in that described
Extended hole is not less than the size of new inode data.
The dynamic adjusting method of inode table the most according to claim 1, it is characterised in that described
Step S3 specifically includes:
Update the configuration of inode table, the inode table length attribute of superblock in amendment file system；
If inode table length increases, then according to the inode table after updating, it is dynamically updated file system
The original position of middle logical block and logical block bitmap.
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 CN103559260A (en) | 2014-02-05 |
| CN103559260B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106021466A (en) * | 2016-05-17 | 2016-10-12 | 浙江大华技术股份有限公司 | Data storage method and apparatus |
Citations (3)
| 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 |
| CN101335706A (en) * | 2008-07-21 | 2008-12-31 | 北京星网锐捷网络技术有限公司 | Route table space managing method, apparatus, switch and router |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7386663B2 (en) * | 2004-05-13 | 2008-06-10 | Cousins Robert E | Transaction-based storage system and method that uses variable sized objects to store data |
-
2013
- 2013-11-05 CN CN201310537556.XA patent/CN103559260B/en active Active
Patent Citations (3)
| 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 |
| CN101335706A (en) * | 2008-07-21 | 2008-12-31 | 北京星网锐捷网络技术有限公司 | Route table space managing method, apparatus, switch and router |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103559260A (en) | 2014-02-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2735978B1 (en) | Storage system and management method used for metadata of cluster file system | |
| CN110825748B (en) | High-performance and easily-expandable key value storage method by utilizing differentiated indexing mechanism | |
| US9996557B2 (en) | Database storage system based on optical disk and method using the system | |
| US9075754B1 (en) | Managing cache backup and restore | |
| US9021222B1 (en) | Managing incremental cache backup and restore | |
| CN101488153A (en) | Method for implementing high-capacity flash memory file system in embedded type Linux | |
| CN100424699C (en) | Attribute extensible object file system | |
| WO2015007155A1 (en) | Data storage method and apparatus | |
| Lee et al. | An efficient index buffer management scheme for implementing a B-tree on NAND flash memory | |
| CN104054071A (en) | Method for accessing storage device and storage device | |
| CN102968381A (en) | Method for improving snapshot performance by using solid state disk | |
| CN109407985B (en) | Data management method and related device | |
| CN102915340A (en) | Expanded B+ tree-based object file system | |
| CN104731886A (en) | Processing method and system for mass small files | |
| KR101438667B1 (en) | Database method for b+ tree based on PRAM | |
| CN113704217A (en) | Metadata and data organization architecture method in distributed persistent memory file system | |
| KR101008032B1 (en) | Meta-data management system and method | |
| KR100907477B1 (en) | Apparatus and method for managing index of data stored in flash memory | |
| 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 | |
| CN103559260B (en) | The dynamic adjusting method of inode table based on RAMDISK file system | |
| Lv et al. | Zonedstore: A concurrent zns-aware cache system for cloud data storage | |
| Na et al. | Iplb+-tree for flash memory database systems. | |
| KR101541532B1 (en) | Method and apparatus for data consistency control of storage class memory | |
| US20110264848A1 (en) | Data recording device |
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 for 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 |