CN1924829A - Storage space management method and system and computer readable storage medium - Google Patents
Storage space management method and system and computer readable storage medium Download PDFInfo
- Publication number
- CN1924829A CN1924829A CN 200510097692 CN200510097692A CN1924829A CN 1924829 A CN1924829 A CN 1924829A CN 200510097692 CN200510097692 CN 200510097692 CN 200510097692 A CN200510097692 A CN 200510097692A CN 1924829 A CN1924829 A CN 1924829A
- Authority
- CN
- China
- Prior art keywords
- mentioned
- block
- record
- space
- reformation
- 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.)
- Pending
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
This invention relates to memory space management method to manage several spaces. The method comprises several interval of each block none used to become one single continuous space, wherein, the non used space address interval doesn't contain block minimum address and maximum address.
Description
Technical field
This invention is a kind of storage area administrative skill, the storage space management method and the system of particularly a kind of broken spatial recomposition (defragmentation).
Background technology
Storage area was gone through and numerous was write, after renewal and the deletion action, have many small, the discontinuous and storage areas that can't use usually.And this storage area fragmentation (storagefragmentation) situation can seriously reduce the availability of storage area and the usefulness of operation note or file.Therefore, need a kind of storage space management method and system, in order to carry out broken spatial recomposition effectively.
Summary of the invention
In view of this, purpose of the present invention is for providing a kind of storage space management method and system, in order to carry out broken spatial recomposition effectively.
The embodiment of the invention discloses a kind of storage space management method, comprises the storage area of a plurality of blocks in order to management.The method comprises to merge a plurality of interruptions in each block and be not used the space becomes a single successional space that is not used.Wherein, the single successional address section that is not used the space does not comprise the lowest address and the maximum address of block.
Under certain situation, the method can also comprise moves the space that is not used to another block with the existing record of person one of in the block, makes the original block that stores this record become the block that is not used for complete.
Under certain situation, the method can also comprise a reformation mid point that determines each block; The record that merges the reformation mid point left side that is arranged in each block forms the inner block in a continuity left side that is begun by high order end; And the record that merges the reformation mid point the right that is arranged in each block, form the right inner block of the continuity that begins by low order end.The method can also comprise when detecting an existing address section of record when comprising the reformation mid point, use one of them consolidation strategy to merge: do not do any judgement, directly detected record is merged to after the inner block in a continuity left side; If the length that is positioned at the reformation mid point left side in the detected record, when being positioned at the length on reformation mid point the right, then detected record being continued merges to after the inner block in a continuity left side, merges to before the right inner block of continuity otherwise then detected record is continued; And if be positioned at the space length that is not used on the reformation mid point left side, greater than be positioned at reformation mid point the right be not used space length the time, then detected record being continued merges to after the inner block in a continuity left side, merges to before the right inner block of continuity otherwise then detected record is continued.The method can also comprise by determining a record in a plurality of records in the block wherein; By determining a block in a plurality of blocks in the record that does not comprise selection, wherein be not used the length of record of space length in Jue Ding the block more than or equal to decision; And the record that will determine moves to the space that is not used in the block of decision.The method in the recording step that moves decision, can also comprise will decision record continue and be incorporated into after the inner block in a continuity left side in the decision block, or continue and be incorporated into before the right inner block of continuity in the decision block.The record of decision can be the record of the most close corresponding reformation mid point.
Under certain situation, the method can also comprise: the block foundation is not used the ascending ordering of length in space; And carry out corresponding block according to ranking results and move.
The embodiment of the invention discloses a kind of computer readable storage media in addition, stores a computer program, and this computer program is in order to be loaded in the processing unit and to make this processing unit carry out aforesaid storage space management method.
A kind of storage area management system that the embodiment of the invention also discloses comprises a storage area and a processing unit.The storage area comprises a plurality of blocks.Processing unit is coupled to the storage area, becomes the single successional space that is not used in order to merge a plurality of interruptions in each block and not to be used the space.Wherein, the single successional address section that is not used the space does not comprise the lowest address and the maximum address of block.
Under certain situation, processing unit can also comprise moves the space that is not used to another block with the existing record of person one of in the block, makes the original block that stores this record become the block that is not used for complete.
Under certain situation, processing unit can also determine a reformation mid point of each block; The record that merges the reformation mid point left side that is arranged in each block forms the inner block in a continuity left side that is begun by high order end; And the record that merges the reformation mid point the right that is arranged in each block, form the right inner block of the continuity that begins by low order end.Processing unit can be more when detecting an existing address section of record and comprise the reformation mid point, use one of them consolidation strategy to merge: not do any judgement, directly detected record is merged to after the inner block in a continuity left side; If the length that is positioned at the reformation mid point left side in the detected record, when being positioned at the length on reformation mid point the right, then detected record being continued merges to after the inner block in a continuity left side, merges to before the right inner block of continuity otherwise then detected record is continued; And if be positioned at the space length that is not used on the reformation mid point left side, greater than be positioned at reformation mid point the right be not used space length the time, then detected record being continued merges to after the inner block in a continuity left side, merges to before the right inner block of continuity otherwise then detected record is continued.Processing unit can be more by determining a record in a plurality of records in the block wherein; By determining a block in a plurality of blocks in the record that does not comprise selection, wherein be not used the length of record of space length in Jue Ding the block more than or equal to decision; And the record that will determine moves to the space that is not used in the block of decision.Processing unit can also comprise will decision record continue and be incorporated into after the inner block in a continuity left side of decision in the block, or continue and be incorporated into before the right inner block of continuity in the decision block.The record of decision can be the record of the most close corresponding reformation mid point.
Under certain situation, processing unit can more not be used the block foundation the ascending ordering of length in space; And carry out corresponding block according to ranking results and move.
The above-mentioned reformation mid point that is positioned at i block can be expressed as sx (i-1)+s/2, and s represents the length of each above-mentioned block.The scope that is positioned at the reformation mid point left side of i block can be expressed as [sx (i-1), sx (i-1)+ s/2 ], and the scope that is positioned at reformation mid point the right of i block can be expressed as sx (i-1)+ s/2 , sxi].
Description of drawings
The 1st figure is the hardware structure figure of expression according to the storage area management system of the embodiment of the invention;
The 2nd figure is the block synoptic diagram of expression according to the embodiment of the invention;
3rd, 4a, 4b figure are the method flow diagram of expression according to the broken spatial recomposition method of the embodiment of the invention;
The 5th figure is the storage medium synoptic diagram of expression according to the broken spatial recomposition of the embodiment of the invention;
The 6th figure is the initial storage space synoptic diagram of expression according to the embodiment of the invention;
The 7th figure is the storage area synoptic diagram of expression according to the elimination block internal fracture space of the embodiment of the invention;
8a, 8b, 8c, 8d, 8e, 8f figure are that expression is moved synoptic diagram according to the record in the broken space of transregional of the elimination of the embodiment of the invention.
Label declaration
10～storage area management system; 11～processing unit; 12～storer; 13～storage device; 14～output unit; 15～input media; 16～communication device; 17～bus; B～block; B[i]～an i block; Bl～left inner block; Br～right inner block; Pl～left distance; Pr～right distance; Sl～left inner area block length; Su～be not used space length; Sr～right inner area block length; S～hyte length; S31, S33～process step; S411, S413 ..., S459, S461～process step; 50～storage medium; 520～broken spatial recomposition computer program; The broken spatial recomposition logic of 521～block inside; 522～will dispose the block foundation not to be used the length in space in the little ordering logic greatly that arrives; 523～transregional broken spatial recomposition logic; B1, B2, B3, B4～block; A.1, A.2, A.4, A.5, B.1, B.3, B.4, B.6, B.7, B.8, B.10～space of store recording; A.3, B.2, B.5, B.9, C.1, C.2, C.3, C.4, C.5, C.6, C.7, C.8～originally store recording but by the space.
Embodiment
The 1st figure is the hardware structure figure of expression according to the storage area management system 10 of the embodiment of the invention.Storage area management system 10 comprises processing unit 11, storer 12, storage device 13, output unit 14, input media 15, communication device 16, and uses bus 17 that it is linked together.Those skilled in the art can be implemented on storage area management system 10 on the computer system configurations miscellaneous (configuration), for example, multicomputer system, consumption electronic products (microprocessor-based or programmable consumerelectronics), network computer, mini-computer, mainframe, mobile computer and similar equipment based on microprocessor or programmable.Storer 12 comprises ROM (read-only memory) (read only memory; ROM), flash memory (flashmemory) with and/or dynamic ram (random access memory; RAM), provide the storage area, can be in order to store for program module, data, file and the record of processing unit 11 execution.Generally speaking, program module comprises routine (routines), program (program), object (object), assembly (component) etc., in order to carry out the storage area management function.The present invention can also be implemented on the distributed arithmetic environment, and it is performed that its computing work is linked to the teleprocessing equipment of communication network by one.In distributed environment, perhaps the function executing of storage area management is finished jointly by this locality and multi-section remote computer system.Storage device 13 comprises hard disk unit, diskette unit, optical disc apparatus or flash disk device, and the storage area is provided, in order to stored program module, data, file and record in access hard disk, floppy disk, CD, the carry-on dish.
Usually, each pen is recorded as the set of data value (data values) or data item (data items), its basic data type (primitive data types), as numerical value (numeric), alphabetic character string (string of characters), Boolean types such as (boolean), can be in application programming interfaces (platform-specific application program interface, API) the middle definition of specific software platform.And the length of a notes record is variable-length.The embodiment of the invention proposes a kind of bidirectional record file organization as follows, and (bidirectional record file organization, BRFO) scheme make the storage area comprise several blocks (block).This storage area can be present in the volatibility storage device, as dynamic ram (RAM), impact damper (buffer) etc., or non-volatile memory device, as flash memory (flash memory), hard disk (hard disk), floppy disk (floppy disk), erasable optical disk (opticaldisk-RW) etc.A block is the elementary cell of transmission data between solid data storage and storer.Block length is greater than record length, and each block can comprise number notes record, and can give record in the file with mode (unspanned fashion) the configuration block that does not have transregional.When notes are recorded greater than all storage paragraphs that are not used, can configure another block to store this record.So each block can comprise some storage paragraphs that are not used, and is called internal fracture paragraph (internalfragmentation).The 2nd figure is the block synoptic diagram of expression according to the embodiment of the invention.A block comprises two inner blocks (inner blocks), a left block (left block) and a right block (right block).Be simplified illustration, use several following labels to describe embodiments of the invention.A block is represented with B.Bl and Br represent an inner block in a left side (left innerblock) and an inner block in the right side (right inner block) respectively, and pl is the left side distance (left offset) of Bl, and pr is the right side distance (right offset) of Br.When each block has s continuous byte (byte) length, the length of Bl and Br is represented with sl and sr respectively, and sl+sr≤s, makes that the space that is not used in the block is su=s-(sl+sr).In addition, when the storage area comprises n block, make whole space have the continuity storage area configuration of nxs byte.The numeral that is comprised in the bracket among each label (squarebracket) is a block numbering of representing its place, for example, pr[7] represent the right side distance of the right inner block in the 7th block.
In order to reorganize the storage paragraph that is not used, need aperiodicity or periodically carry out broken spatial recomposition program.The 3rd figure is the method flow diagram of expression according to the broken spatial recomposition method of the embodiment of the invention, and the method is carried out by processing unit 11, comprises the storage area of a plurality of blocks in order to management.In step S31, merging a plurality of interruptions in each block and not being used the space becomes the single successional space that is not used.Wherein, the single successional address section that is not used the space does not comprise the lowest address and the maximum address of block.In step S33, the space that is not used to another block moved in the existing record of person one of in the block, make the original block that stores this record become to be the complete and block that is not used.
The 4th figure is the method flow diagram of expression according to the broken spatial recomposition method of the embodiment of the invention, and the method is carried out by processing unit 11.Step S411 to S421 is the broken spatial recomposition program (intra-block defragmentation procedure) of block inside, become single continuity space in order to merge the interruption in each block and not to be used the space, and this continuity space is positioned at the zone line of block, but not the left side or zone, the right.In step S411, from top to bottom (that is being toward high address by low address) selects a block.Those skilled in the art know that all this step also can be selected toward low address by high address.In step S413, determine the reformation mid point (defragmentation separator) of this block.Wherein, the reformation mid point of i block is positioned at apart from sx (i-l)+s/2, and the scope that is positioned at the reformation mid point left side is [sx (i-1), sx (i-1)+ s/2 ], and the scope that is positioned at reformation mid point the right is sx (i-1)+ s/2 , sxi].In step S415, merge the record that is positioned at the reformation mid point left side, form an inner block Bl in a continuity left side by block high order end (also being lowest address) beginning.In step S417, merge the record that is positioned at reformation mid point the right, form a right inner block Br of the continuity by block low order end (also being location superlatively) beginning.When the existing address section of a notes record comprises the reformation mid point, can also use one of the following stated strategy person merging that continues.(1) do not do any judgement, merging directly continues left; (2) if this record is positioned at the length on the reformation mid point left side, when being positioned at the length on reformation mid point the right, the merging that then continues left, otherwise the merging that then continues to the right; And (3) if be positioned at the space length that is not used on the reformation mid point left side, greater than be positioned at reformation mid point the right be not used space length the time, the merging that then continues left, otherwise the merging that then continues to the right.Those skilled in the art also can use other strategy that above situation is processed.In step S421, whether decision handles all blocks, is the processing of then carrying out step S431, otherwise carries out the processing of step S411.
In step S431, all have been disposed block sorted to big in little, and can store this ranking results for the subsequent step use according to the length that is not used the space, perhaps carry out corresponding block and move according to ranking results.It is noted that in this,, also can omit this step for saving the time of handling.
Step S441 to S461 is a transregional broken spatial recomposition program (inter-blockdefragmentation procedure), merge in order to the record in the block that will hang down utilization rate in the block of paramount utilization rate, cause and discharge more available block, wherein, do not comprise any record in the block that discharges.In step S441, from bottom to top (that is being toward low address by high address) selects next block as first block.Those skilled in the art know that all this step also can be for being selected toward high address by low address.In step S451, (that is the most close reformation mid point of serving as reasons is toward leaving most the reformation mid point) selects a record in the block from inside to outside.It is noted that in this when all having a notes record in inner block in a left side and the right inner block, this step is selected the less record of length earlier.In step S453, from top to bottom (that is being toward high address by low address) selects next block as second block.Those skilled in the art all know when step S441 for by low address toward high address when selecting, this step is then changed into by high address and is selected toward low address.In step S455, determine whether first block and second block are same block, be then to finish whole broken spatial recomposition method, otherwise carry out the processing of step S457.In step S457, determine free space length in second block whether more than or equal to the record length of selecting, be the processing of then carrying out step S459, otherwise carry out the processing of step S453.In step S459, the record selected is moved free space to second block by first block.In step S461, whether decision handles all records in first block, is the processing of then carrying out step S441, otherwise carries out the processing of step S451.
Moreover the present invention proposes a kind of storage medium, and in order to store computer program, aforementioned calculation machine program is in order to realize broken spatial recomposition method, and the method can be carried out aforesaid step.The 5th figure is the storage medium synoptic diagram of expression according to the broken spatial recomposition of the embodiment of the invention.This storage medium 50 is in order to store broken spatial recomposition computer program 520.Its computer program comprises three logics, be respectively block inside broken spatial recomposition logic 521, will dispose block according to the length that is not used the space in little broken spatial recomposition logic 523 to big ordering logic 522 and transregional.
Below more enumerate the actual operation situation that an example illustrates broken spatial recomposition method.The 6th figure is the initial storage space synoptic diagram of expression according to the embodiment of the invention, comprises four block B1 to B4 that disposed, and each block has 150 continuous hyte length spaces.Under original state, A.1 block B1 comprise, B.1 with A.2 record, and stored originally but deleted A.3, B.2 with C.1 record be not used the storage area.B.3 block B2 comprise, A.4 with B.4 record, and stored originally but the storage area that is not used deleted B.5 and record C.2.B.6 block B3 comprise, A.5 with B.7 record, and stored originally but deleted C.3, C.6, C.5 with C.4 record be not used the storage area.B.8 block B4 comprises and B.10 record, and stored originally but deleted B.9, C.8 with C.7 record be not used the storage area.With reference to the 4th figure, after the broken spatial recomposition program of the block inside of execution in step S411 to S421 repeatedly, the storage area is shown in the 7th figure.The 7th figure is the storage area synoptic diagram of expression according to the elimination block internal fracture space of the embodiment of the invention.Wherein, the record in each block all is concentrated to the both sides of block, and produces the bigger continuous space that is not used.For promoting the efficient in reorganization space, the processing of omit step S431.Then, B.10 execution in step S451, S453, S455, S457 and S459 move the space that is not used to the block B1 with record, and the result is shown in 8a figure.B.8, execution in step S451, S453, S455, S457 and S459 move the space that is not used to the block B1 with record, and the result is shown in 8b figure.A.5, execution in step S451, S453, S455, S457 and S459 move the space that is not used to the block B1 with record, and the result is shown in 8c figure.B.7, execution in step S451, S453, S455, S457 and S459 move the space that is not used to the block B1 with record, and the result is shown in 8d figure.B.6, execution in step S451, S453, S455, S457 and S459 move the space that is not used to the block B2 with record, and the result is shown in 8e figure.At last, because without any the record that can move, so the result of reorganization is shown in 8f figure.
Though the present invention discloses as above with preferred embodiment; right its is not in order to limit the present invention; any those skilled in the art; without departing from the spirit and scope of the present invention; when can doing a little change and retouching, so protection scope of the present invention is as the criterion when looking appended the claim scope person of defining.
Claims (20)
1. storage space management method, in order to the management storage area, above-mentioned storage area comprises a plurality of blocks, and its method comprises:
Merging a plurality of interruptions in each above-mentioned block and not being used the space becomes the single successional space that is not used,
Wherein, the above-mentioned single successional address section that is not used the space does not comprise the lowest address and the maximum address of above-mentioned block.
2. storage space management method according to claim 1, also comprise the space that is not used to another block moved in the existing record of person one of in the above-mentioned block, make the original above-mentioned block that stores above-mentioned record become the block that is not used for complete.
3. storage space management method according to claim 1 also comprises:
Determine the reformation mid point of each above-mentioned block;
The record that merges the above-mentioned reformation mid point left side that is arranged in each above-mentioned block forms the inner block in a continuity left side that is begun by high order end; And
Merge the record on the above-mentioned reformation mid point the right that is arranged in each above-mentioned block, form the right inner block of the continuity that begins by low order end.
4. storage space management method according to claim 3 also comprises when detecting the existing address section of record and comprise above-mentioned reformation mid point, uses one of them consolidation strategy to merge:
Do not do any judgement, directly above-mentioned detected record is merged to after the inner block in an above-mentioned continuity left side;
If the length that is positioned at the above-mentioned reformation mid point left side in the above-mentioned detected record, when being positioned at the length on above-mentioned reformation mid point the right, then above-mentioned detected record being continued merges to after the inner block in an above-mentioned continuity left side, merges to before the right inner block of above-mentioned continuity otherwise then above-mentioned detected record is continued; And
If be positioned at the space length that is not used on the above-mentioned reformation mid point left side, greater than be positioned at above-mentioned reformation mid point the right be not used space length the time, then above-mentioned detected record being continued merges to after the inner block in an above-mentioned continuity left side, merges to before the right inner block of above-mentioned continuity otherwise then above-mentioned detected record is continued.
5. storage space management method according to claim 3, the above-mentioned reformation mid point that wherein is positioned at i block is expressed as sx (i-1)+s/2, and s represents the length of each above-mentioned block, and the scope that is positioned at the above-mentioned reformation mid point left side of i block is expressed as
And the scope that is positioned at above-mentioned reformation mid point the right of i block is expressed as
6. storage space management method according to claim 3 also comprises:
By determining a record in a plurality of records in one of them block;
By determining a block in a plurality of blocks in the record that does not comprise above-mentioned selection, wherein be not used the length of space length in Jue Ding the above-mentioned block more than or equal to the record of above-mentioned decision; And
The record of above-mentioned decision is moved to the space that is not used in the block of above-mentioned decision.
7. storage space management method according to claim 6, in the recording step that moves decision, comprising also that record with above-mentioned decision continues is incorporated into after the inner block in an above-mentioned continuity left side in the above-mentioned decision block, or continues and be incorporated into before the right inner block of above-mentioned continuity in the above-mentioned decision block.
8. storage space management method according to claim 6, wherein Jue Ding the above-mentioned record that is recorded as the most close corresponding above-mentioned reformation mid point.
9. storage space management method according to claim 1 also comprises:
Above-mentioned block foundation is not used the ascending ordering of length in space; And
Carrying out corresponding block according to ranking results moves.
10. computer readable storage media, in order to store computer program, this computer program is in order to be loaded in the processing unit and to make this processing unit carry out storage space management method, in order to the management storage area, above-mentioned storage area comprises a plurality of blocks, and its method comprises:
Merging a plurality of interruptions in each above-mentioned block and not being used the space becomes the single successional space that is not used,
Wherein, the above-mentioned single successional address section that is not used the space does not comprise the lowest address and the maximum address of above-mentioned block.
11. a storage area management system comprises:
The storage area, above-mentioned storage area comprises a plurality of blocks; And
Processing unit is coupled to above-mentioned storage area, becomes the single successional space that is not used in order to merge a plurality of interruptions in each above-mentioned block and not to be used the space,
Wherein, the above-mentioned single successional address section that is not used the space does not comprise the lowest address and the maximum address of above-mentioned block.
12. storage area according to claim 11 management system, wherein above-mentioned processing unit is also moved the existing record of person one of in the above-mentioned block space that is not used to another block, makes the original above-mentioned block that stores above-mentioned record become the block that is not used for complete.
13. storage area according to claim 11 management system, wherein above-mentioned processing unit also determines the reformation mid point of each above-mentioned block, the record that merges the above-mentioned reformation mid point left side that is arranged in each above-mentioned block, the inner block in a continuity left side that formation is begun by high order end, and the record that merges the above-mentioned reformation mid point the right that is arranged in each above-mentioned block, form the right inner block of the continuity that begins by low order end.
14. storage area according to claim 13 management system, wherein above-mentioned processing unit uses one of them consolidation strategy to merge when detecting the existing address section of record and comprise above-mentioned reformation mid point:
Do not do any judgement, directly above-mentioned detected record is merged to after the inner block in an above-mentioned continuity left side;
If the length that is positioned at the above-mentioned reformation mid point left side in the above-mentioned detected record, when being positioned at the length on above-mentioned reformation mid point the right, then above-mentioned detected record being continued merges to after the inner block in an above-mentioned continuity left side, merges to before the right inner block of above-mentioned continuity otherwise then above-mentioned detected record is continued; And
If be positioned at the space length that is not used on the above-mentioned reformation mid point left side, greater than be positioned at above-mentioned reformation mid point the right be not used space length the time, then above-mentioned detected record being continued merges to after the inner block in an above-mentioned continuity left side, merges to before the right inner block of above-mentioned continuity otherwise then above-mentioned detected record is continued.
15. storage area according to claim 13 management system, the above-mentioned reformation mid point that wherein is positioned at i block is expressed as sx (i-1)+s/2, and s represents the length of each above-mentioned block, and the scope that is positioned at the above-mentioned reformation mid point left side of i block is expressed as
And the scope that is positioned at above-mentioned reformation mid point the right of i block is expressed as
16. storage area according to claim 13 management system, wherein above-mentioned processing unit is also by determining a record in a plurality of records in one of them block, by determining a block in a plurality of blocks in the record that does not comprise above-mentioned selection, and the record of above-mentioned decision is moved to the space that is not used in the block of above-mentioned decision, wherein, be not used the length of space length in the above-mentioned block of decision more than or equal to the record of above-mentioned decision.
17. storage area according to claim 16 management system, wherein above-mentioned processing unit also continues the record of above-mentioned decision and is incorporated into after the inner block in an above-mentioned continuity left side in the above-mentioned decision block, or continues and be incorporated into before the right inner block of above-mentioned continuity in the above-mentioned decision block.
18. storage area according to claim 16 management system, wherein Jue Ding the above-mentioned record that is recorded as the most close corresponding above-mentioned reformation mid point.
19. storage area according to claim 11 management system, above-mentioned processing unit also are not used the ascending ordering of length in space with above-mentioned block foundation, and carry out corresponding block according to ranking results and move.
20. storage area according to claim 11 management system, wherein above-mentioned storage area is present in volatibility storage device or the non-volatile memory device.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200510097692 CN1924829A (en) | 2005-08-31 | 2005-08-31 | Storage space management method and system and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200510097692 CN1924829A (en) | 2005-08-31 | 2005-08-31 | Storage space management method and system and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1924829A true CN1924829A (en) | 2007-03-07 |
Family
ID=37817479
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200510097692 Pending CN1924829A (en) | 2005-08-31 | 2005-08-31 | Storage space management method and system and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1924829A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102760063A (en) * | 2011-04-25 | 2012-10-31 | 联想(北京)有限公司 | File loading method and device |
| CN103703449A (en) * | 2011-08-04 | 2014-04-02 | 英特尔公司 | Memory coalescing computer-implemented method, system and apparatus |
-
2005
- 2005-08-31 CN CN 200510097692 patent/CN1924829A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102760063A (en) * | 2011-04-25 | 2012-10-31 | 联想(北京)有限公司 | File loading method and device |
| CN102760063B (en) * | 2011-04-25 | 2015-08-26 | 联想(北京)有限公司 | A kind of file loading method and device |
| CN103703449A (en) * | 2011-08-04 | 2014-04-02 | 英特尔公司 | Memory coalescing computer-implemented method, system and apparatus |
| US9244614B2 (en) | 2011-08-04 | 2016-01-26 | Intel Corporation | Memory coalescing computer-implemented method, system, apparatus and computer-readable media |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20140317341A1 (en) | System and apparatus for flash memory data management | |
| KR20150090211A (en) | Methods and apparatus for compressed and compacted virtual memory | |
| CN111352581A (en) | Method for writing data in storage device, storage device and storage system | |
| US20080276037A1 (en) | Method to Access Storage Device Through Universal Serial Bus | |
| CN104881248B (en) | The adaptive directly IO accelerated methods towards in the file system of SSD | |
| CN103049397A (en) | Method and system for internal cache management of solid state disk based on novel memory | |
| CN103440207A (en) | Caching method and caching device | |
| CN1996258A (en) | Method for implementing dynamic memory pool | |
| JP2006268776A (en) | Memory card | |
| CN108763473A (en) | A kind of the native object storage method and device of distributed storage | |
| EP0221358A2 (en) | Sort string generation in a staged storage system | |
| CN101236482A (en) | Method for processing data under degrading state and independent redundancy magnetic disc array system | |
| CN110134650B (en) | File loading method, device, equipment and storage medium | |
| CN101777061A (en) | JAVA card object management method and JAVA card | |
| CN1540523A (en) | Quick method for reading/writing buffer in single task | |
| CN1541358A (en) | Memory pools with moving memory blocks | |
| CN101034375A (en) | Computer memory system | |
| CN1924829A (en) | Storage space management method and system and computer readable storage medium | |
| US7484068B2 (en) | Storage space management methods and systems | |
| CN109445719A (en) | A kind of date storage method and device | |
| CN109491927A (en) | Data storage, read method, device and electronic equipment | |
| CN102169464B (en) | Caching method and device used for non-volatile memory, and intelligent card | |
| CN109426447A (en) | Data storage method for optimizing data storage device and data storage device thereof | |
| CN105630410B (en) | The method for managing file storage area using non-volatile random read-write storage chip dynamic | |
| CN1553345A (en) | Multireel disc array managing method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| AD01 | Patent right deemed abandoned | ||
| C20 | Patent right or utility model deemed to be abandoned or is abandoned |