CN104636074A - Sequential access monitoring system and method - Google Patents
Sequential access monitoring system and method Download PDFInfo
- Publication number
- CN104636074A CN104636074A CN201310548188.9A CN201310548188A CN104636074A CN 104636074 A CN104636074 A CN 104636074A CN 201310548188 A CN201310548188 A CN 201310548188A CN 104636074 A CN104636074 A CN 104636074A
- Authority
- CN
- China
- Prior art keywords
- node
- access
- list
- access unit
- sequential
- 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
- 238000000034 method Methods 0.000 title claims abstract description 37
- 238000012544 monitoring process Methods 0.000 title abstract 3
- 230000001186 cumulative effect Effects 0.000 claims description 46
- 238000009825 accumulation Methods 0.000 claims 4
- 230000008707 rearrangement Effects 0.000 claims 4
- 230000003247 decreasing effect Effects 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 7
- 238000009434 installation Methods 0.000 description 6
- 238000001514 detection method Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000006399 behavior Effects 0.000 description 1
- 239000012634 fragment Substances 0.000 description 1
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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2457—Query processing with adaptation to user needs
- G06F16/24578—Query processing with adaptation to user needs using ranking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/061—Improving I/O performance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/12—Replacement control
- G06F12/121—Replacement control using replacement algorithms
- G06F12/123—Replacement control using replacement algorithms with age lists, e.g. queue, most recently used [MRU] list or least recently used [LRU] list
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24552—Database cache management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0643—Management of files
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
- G06F3/0679—Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]
Abstract
The invention relates to a sequential access monitoring system and method. The method includes the steps that when a storage type quick flashing memory magnetic disk NAND flash terminal receives an access unit of a certain access file, whether the access file corresponding to the access unit is a continuous access unit or not is judged; if the access file corresponding to the access unit is the continuous access unit, a sequential access sign corresponding to the access file is marked to be a sign of a sequential access task. By means of the sequential access monitoring system and method, the number of write-in times of NAND flash sectors can be decreased, and time and space needed for a large amount of sequential statistics can be saved.
Description
Technical field
The present invention relates to Data Access Technology field, particularly relate to a kind of sequential access detecting system and method.
Background technology
On the computer systems, the management of disk I/O is the key concerning system effectiveness.And on emerging memory type fast flash memory bank disk (NAND flash disk), due to its read or write speed at a high speed, can be computer system performance and bring remarkable lifting, therefore to have started pay attention to by Database Systems.Though but NAND flash for random-access read-write efficiency far above disk, the reading efficiency of its consecutive access then can be produced the equalizer by the raid-array of many hard disks (Redundant Array of Independent Disk, RAID) system.In order to preserve the write number of times restriction of NAND flash preciousness, and then improving its tenure of use, reducing and building cost, in the behavior number of times having had algorithm can be accessed by recording disc at present, find out whether this access is consecutive access.If this access is consecutive access, then will not write NAND flash.This method can by recording each sector number entered (sector number), and then learn whether this access is successional access or randomness access, and the method is referred to as " sequential access detection method " (sequential I/O detection).
But, current sequential access detection method is the LRU list (LRU tandem) that main use quotes in serial memory block LRU (Least Recently Used) recently, the characteristic of LRU list is the foremost that the element be referenced to recently can come LRU list, and the element be not used to more of a specified duration then can come more.And when LRU list insufficient space is to hold new data, then the element of the tail end of LRU list is deleted, and new data is inserted in LRU list, then this new data is moved to LRU list foremost.So can reach and not need just can know the frequent degree that in LRU list, each element is referenced when using counter.But the method for searching of this LRU list is sequential search, so under the poorest situation, likely search caudal end from the most head end of LRU list, thus cause searching efficiency very low.
Summary of the invention
In view of above content, be necessary to provide a kind of sequential access detecting system and method, it can reduce the write number of times of the sector of NAND flash, just can save a large amount of by the Time and place needed for pen statistics.
A kind of sequential access detecting system, this system comprises: judge module, for when memory type fast flash memory bank disk NAND flash end receives an access unit of certain accessing file, judge whether the accessing file corresponding to described access unit is consecutive access file; Identification module, for when the accessing file corresponding to described access unit is consecutive access file, being designated by the sequential access corresponding to this accessing file is the mark of sequential access task.
A kind of sequential access method for detecting, the method comprises: determining step, when memory type fast flash memory bank disk NAND flash end receives an access unit of certain accessing file, judge whether the accessing file corresponding to described access unit is consecutive access file; Identification of steps one, when the accessing file corresponding to described access unit is consecutive access file, being designated by the sequential access corresponding to this accessing file is the mark of sequential access task.
Compared to prior art, sequential access detecting system of the present invention and method, contact in list between each node is set up by adopting the method for binary search tree and LRU list, such list has binary search tree and LRU list two kinds of data structures, therefore do not need the link removing to carry out each node in search list in modes such as pointers again, therefore can mutually reference fast between node, improve searching efficiency, reduce the write number of times of the sector of NAND flash, just can save a large amount of by the time needed for pen statistics.
Accompanying drawing explanation
Fig. 1 is the applied environment figure of sequential access detecting system of the present invention.
Fig. 2 is the module map of the preferred embodiment of sequential access detecting system of the present invention.
Fig. 3 and Fig. 4 is the process flow diagram of the preferred embodiment of sequential access method for detecting of the present invention.
Fig. 5 is the binary search data tree structure schematic diagram of list.
Fig. 6 is the binary search data tree structure schematic diagram after resetting.
Main element symbol description
| Electronic installation | 2 |
| Sequential access detecting system | 20 |
| Memory device | 21 |
| NAND flash | 210 |
| Display device | 22 |
| Processor | 23 |
| Judge module | 200 |
| Search module | 201 |
| Logging modle | 202 |
| Update module | 203 |
| Mobile module | 204 |
| Reordering module | 205 |
| Accumulator module | 206 |
| Identification module | 207 |
Following embodiment will further illustrate the present invention in conjunction with above-mentioned accompanying drawing.
Embodiment
As shown in Figure 1, be the applied environment schematic diagram of sequential access detecting system of the present invention.In the present embodiment, this sequential access detecting system 20(is hereinafter referred to as " system 20 ") run in an electronic installation 2 and detect whether the accessing file corresponding to access unit that will access is consecutive access file (i.e. continuous IO file).Described electronic installation 2 also comprises the memory device 21, display device 22, the processor 23 that are connected with data line by signal wire.Be appreciated that described electronic installation 2 also should comprise the element of other necessity further, as battery etc.Described memory device 21 also comprises memory type fast flash memory bank (NAND flash) 210.
Before accessing file is accessed, this accessing file is first divided into multiple fragment (i.e. access unit), then numbers these access units successively.When accessing the access unit of certain accessing file, this system 20 can search whether there is access unit consecutive with this access unit in each node of list (hereinafter referred to as " list ") quoting serial memory block LRU (Least Recently Used) recently.Each node of described list stores an access unit, the numbering that the numerical value of this node is stored access unit.The corresponding cumulative consecutive access number of times of each node, when cumulative consecutive access number of times is higher than preset value, namely the accessing file corresponding to access unit that this node stores is consecutive access file, then being designated by the sequential access corresponding to this accessing file is the mark of sequential access task, and this sequential access mark is for identifying whether the access of this accessing file is sequential access.
Described list has the feature of LRU list (LRU tandem) data structure and binary search tree (binary search tree) data structure.The feature of LRU list data structure refers to that the node be referenced to recently can come the foremost of LRU list data structure, and the node be not used to more of a specified duration then can come more.Binary search data tree structure has features: (1) if the left subtree of certain node is not empty, then on left subtree, the numerical value of all nodes is all less than the numerical value of this node; (2) if the right subtree of this node is not empty, then on right subtree, the numerical value of all nodes is all greater than the numerical value of this node; (3) its left and right subtree is also respectively binary sort tree.Because described list has this two kinds of data structures, connect each other between each node, therefore the data structure of each node is shared, therefore does not need the link of removing to search each node in modes such as pointers again, can reference mutually rapidly.
Described electronic installation 2 can be the electronic installations such as mobile phone, computing machine, panel computer.
As shown in Figure 2, be the module map of preferred embodiment of sequential access detecting system 20.In the present embodiment, described sequential access detecting system 20 comprise judge module 200, search module 201, logging modle 202, update module 203, mobile module 204, reordering module 205, accumulator module 206 and identification module 207.Module alleged by the present invention refer to a kind of can be performed and the series of computation machine program segment of fixed function can be completed by processor 23, it is stored in memory device 21.In the present embodiment, the function about each module specifically describes in the process flow diagram of Fig. 3 and Fig. 4.
As shown in Figures 3 and 4, be the process flow diagram identifying accessing file in sequential access method for detecting of the present invention.According to different demands, in this process flow diagram, the order of step can change, and some step can be omitted.
Step S10, when NAND flash end receives an access unit of certain accessing file, whether judge module 200 is numbered adjacent access unit with described access unit judge whether there is access unit consecutive with described access unit in described list according to being existed in the node of described list.
When existence and described access unit number adjacent access unit in the node of described list, i.e. exist and the consecutive access unit of this access unit in the node of described list, perform step S17; When do not exist in described list number adjacent access unit with described access unit time, namely there is not access unit consecutive with described access unit in described list, perform step S11.Such as, the access unit being numbered 1000 is accessed, namely can go in described list, to search the access unit whether existing and be numbered 999.If exist, then represent that the access unit being numbered 1000 is continuous mutually with the access unit being numbered 999, if do not exist, then represent in described list there is not access unit consecutive with the access unit being numbered 1000.
Step S11, search module 201 and first search the node that will store described access unit according to the LRU list data structure of described list, this node is designated as the second node, and in described list, searches the numerical value node identical with the numbering of described access unit, this node is designated as the 3rd node.
In the present embodiment, when in described list be not whole nodes be all used to memory access unit time, then the node storing described access unit can be any one numerical value in described list is empty node.
When nodes all in described list have all been used to memory access unit, then search the feature of the LRU list data structure that module 201 has according to described list, find out and come rearmost node in LRU list data structure (access unit be not namely for a long time referenced to), then this rearmost node will be used for storing described access unit.
Step S12, logging modle 202 records the cumulative consecutive access number of times corresponding to the 3rd node.
In the present embodiment, when searching module 201 and not finding described 3rd node, the cumulative consecutive access number of times corresponding to the 3rd node is recorded as 0 by logging modle 202, is convenient to the cumulative consecutive access number of times corresponding to subsequent calculations second node.
Step S13, the numbering of described second node is updated to the numbering of described access unit by update module 203.
Step S14, mobile module 204 moves the position of described second node in the LRU list data structure of described list makes the second node come the foremost of LRU list data structure, so just can know that the access unit that the second node stores is accessed recently easily.
Step S15, reordering module 205 resets the binary search data tree structure of described list according to the numerical value of the feature of binary search tree and described second node.
In the present embodiment, when described second node is not by coming in LRU list data structure rearmost node gained then, reordering module 205 directly will be searched the second node and will be inserted in the binary search data tree structure of described list position according to the feature of binary search tree and the numerical value of described second node, then by the second Knots inserting in the binary search data tree structure of described list.
When described second node is by coming in LRU list data structure rearmost node gained then, the numerical value of described last node is updated to the numbering of described access unit in step s 13, just may destroy the binary search data tree structure of described list, reordering module 205 is reset the binary search data tree structure of described list with regard to needing.
And the binary search data tree structure of list also can be destroyed when there is the 3rd node in described list, reordering module 205 just needs the 3rd node in first delete list, and then resets the binary search data tree structure of described list.
If do not destroy the binary search data tree structure of list, reordering module 205 can not adjust the binary search data tree structure of described list.
If the numerical value of all nodes is respectively 255 in such as current described list, 372, 445, 656, the binary search data tree structure of this list as shown in Figure 5, if the second node is the node of numerical value 445, the numerical value of the second node to be updated to 700, the numerical value 656 of the node on the right subtree of so the second node will be less than 700, the binary search data tree structure of the current list will be destroyed like this, reordering module 205 will be by numerical value 700 node become the right subtree that numerical value is the node of 656, numerical value be 656 node be root node, the binary search data tree structure of the list after renewal as shown in Figure 6.
Step S16, cumulative consecutive access number of times corresponding to the access of described access unit number of times and the 3rd node that records carries out cumulative with the cumulative consecutive access number of times calculating the second node after upgrading by accumulator module 206, then continues execution step S23.
In the present embodiment, upgrade after the cumulative consecutive access number of times corresponding to the second node equal the recorded cumulative consecutive access number of times corresponding to the 3rd node, and then add one.
Step S17, when there is the consecutive access unit with described access unit in described list, the first node will be designated as with the consecutive access unit of described access unit place node in described list, and search module 201 in described list, search the numerical value node identical with the numbering of described access unit, this node is designated as the 4th node.
Step S18, logging modle 202 records described first node and the cumulative consecutive access number of times corresponding to described 4th node.
In the present embodiment, when searching module 201 and not finding described 4th node, the cumulative consecutive access number of times corresponding to the 4th node is recorded as 0 by logging modle 202, is convenient to the cumulative consecutive access number of times corresponding to subsequent calculations first node.
Step S19, the numerical value of described first node is updated to the numbering of described access unit by update module 203.
Step S20, mobile module 204 moves the position of described first node in the LRU list data structure of described list makes the first node come the foremost of the LRU list data structure of described list.
Step S21, reordering module 205 according to the feature of binary search tree and upgrade after the numerical value of the first node reset the binary search data tree structure of described list.
After the numerical value of the first node is updated to the numbering of described access unit, just may destroy the binary search data tree structure of list.Reordering module 205 is reset the binary search data tree structure of described list with regard to needing.
And the binary search data tree structure of list also can be destroyed when there is the 4th node in described list, reordering module 205 just needs the 4th node first deleted in described list, and then resets the binary search data tree structure of described list.If do not destroy the binary search data tree structure of described list, reordering module 205 can not adjust the binary search data tree structure of described list.
Step S22, the cumulative consecutive access number of times corresponding to the access of described access unit number of times and the 4th node that records is added on the cumulative consecutive access number of times corresponding to the first recorded node to upgrade the cumulative consecutive access number of times corresponding to the first node by accumulator module 206.
In the present embodiment, the cumulative consecutive access number of times corresponding to the first node upgraded equals the recorded cumulative consecutive access number of times corresponding to the first node and adds cumulative consecutive access number of times corresponding to the 3rd recorded node, and then adds one.
Such as, the access unit that certain accessing file is numbered 700 is accessed.If before the binary search data tree structure resetting list, the access unit being numbered 699 is there is in list, the cumulative consecutive access number of times corresponding to access unit being numbered 699 is 10, also there is the access unit being numbered 700 simultaneously, the cumulative consecutive access number of times corresponding to access unit being numbered 700 is 20, be then numbered the cumulative consecutive access number of times corresponding to access unit of 700 for (10+20+1) after cumulative.
Step S23, higher than preset value, whether the cumulative consecutive access number of times of judge module 200 corresponding to the first upgraded node or the second node of upgrading judges whether the accessing file corresponding to described access unit is consecutive access file.
When described first node or the cumulative consecutive access number of times corresponding to the second node are higher than preset value, then the accessing file corresponding to described access unit is consecutive access file, performs step S25; When described first node or the cumulative consecutive access number of times corresponding to the second node be not higher than preset value, then the accessing file corresponding to described access unit is not consecutive access file, performs step S24.
Step S24, it is not that the mark of sequential access task writes in NAND flash to make this accessing file that the sequential access corresponding to this accessing file is designated by identification module 207, and this flow process terminates.
In the present embodiment, when the accessing file corresponding to described access unit is not consecutive access file, the sequential access mark corresponding to described accessing file also can be identified as sky.
Step S25, it is marks of sequential access task that the sequential access corresponding to this accessing file is designated by identification module 207, and this flow process terminates.
Sequential access detecting system of the present invention and method, contact in list between each node is set up by adopting the method for binary search tree and LRU list data structure, such list has binary search tree and LRU list two kinds of data structures, therefore do not need the link removing to carry out each node in search list in modes such as pointers again, therefore can mutually reference fast between node, improve searching efficiency, reduce the write number of times of the sector of NAND flash, just can save a large amount of by the time needed for pen statistics.
Finally it should be noted that, above embodiment is only in order to illustrate technical scheme of the present invention and unrestricted, although with reference to preferred embodiment to invention has been detailed description, those of ordinary skill in the art is to be understood that, can modify to technical scheme of the present invention or equivalent replacement, and not depart from the spirit and scope of technical solution of the present invention.
Claims (18)
1. a sequential access detecting system, is characterized in that, this system comprises:
Judge module, for when memory type fast flash memory bank disk NAND flash end receives an access unit of certain accessing file, judges whether the accessing file corresponding to described access unit is consecutive access file;
Identification module, for when the accessing file corresponding to described access unit is consecutive access file, being designated by the sequential access corresponding to this accessing file is the mark of sequential access task.
2. sequential access detecting system as claimed in claim 1, it is characterized in that, described identification module, also for when the accessing file corresponding to described access unit is not consecutive access file, being designated by the sequential access corresponding to this accessing file is the mark of not sequential access task.
3. sequential access detecting system as claimed in claim 1, it is characterized in that, this system also comprises:
Search module, for when there is not access unit consecutive with described access unit in all nodes of list quoting serial memory block LRU recently, first search the node that will store described access unit according to the LRU list data structure of described list, this node is designated as the second node, and in described list, search the numerical value node identical with the numbering of described access unit, this node is designated as the 3rd node;
Logging modle, for recording the cumulative consecutive access number of times corresponding to the 3rd node;
Update module, for being updated to the numbering of described access unit by the numerical value of described second node;
Mobile module, makes the second node come the foremost of the LRU list data structure of described list for the mobile position of described second node in the LRU list data structure of described list;
Reordering module, for resetting the binary search data tree structure of described list according to the feature of binary search tree and the numerical value of described second node;
Accumulator module, carries out the cumulative consecutive access number of times corresponding to the second node after accumulation calculating renewal for the cumulative consecutive access number of times corresponding to a number of times of the access by described access unit and the 3rd node that records.
4. sequential access detecting system as claimed in claim 3, it is characterized in that, logging modle also for, when not searching the numerical value node identical with the numbering of described access unit in described list, the cumulative consecutive access number of times of record corresponding to the 3rd node is 0.
5. sequential access detecting system as claimed in claim 3, is characterized in that, described reordering module, also for when there is the 3rd node in described list, first deleting described 3rd node, then resetting the binary search data tree structure of described list.
6. sequential access detecting system as claimed in claim 3, it is characterized in that, this system also comprises:
Describedly search module, also for when there is the consecutive access unit with described access unit in the list of LRU, the first node will be designated as with the consecutive access unit of described access unit place node in described list, and in described list, search the numerical value node identical with the numbering of described access unit, this node is designated as the 4th node;
Described logging modle, also for recording the cumulative consecutive access number of times corresponding to described first node and described 4th node;
Described update module, also for the numerical value of described first node being updated to the numbering of described access unit;
Described mobile module, also makes the first node come the foremost of the LRU list data structure of described list for the mobile position of described first node in the LRU list data structure of described list;
Described reordering module, also for according to the feature of binary search tree and upgrade after the numerical value of the first node reset the binary search data tree structure of described list;
Described accumulator module, also on the cumulative consecutive access number of times corresponding to a number of times of the access by described access unit and the 4th node that records is added to corresponding to the first recorded node cumulative consecutive access number of times to upgrade the cumulative consecutive access number of times corresponding to the first node.
7. sequential access detecting system as claimed in claim 6, it is characterized in that, described logging modle, also for when not finding the numerical value node identical with the numbering of described access unit in described list, the cumulative consecutive access number of times of record the 4th node is 0.
8. sequential access detecting system as claimed in claim 6, is characterized in that, described reordering module, also for when there is the 4th node in described list, first deleting described 4th node, then resetting the binary search data tree structure of described list.
9. the sequential access detecting system as described in claim 3 or 6, it is characterized in that, higher than preset value, whether the cumulative consecutive access number of times of described judge module corresponding to the first upgraded node or the second node of upgrading judges whether the accessing file corresponding to described access unit is consecutive access file.
10. a sequential access method for detecting, is characterized in that, the method comprises:
Determining step, when memory type fast flash memory bank disk NAND flash end receives an access unit of certain accessing file, judges whether the accessing file corresponding to described access unit is consecutive access file;
Identification of steps one, when the accessing file corresponding to described access unit is consecutive access file, being designated by the sequential access corresponding to this accessing file is the mark of sequential access task.
11. sequential access method for detecting as claimed in claim 10, it is characterized in that, the method also comprises:
Identification of steps two, when the accessing file corresponding to described access unit is not consecutive access file, being designated by the sequential access corresponding to this accessing file is the mark of not sequential access task.
12. sequential access method for detecting as claimed in claim 10, it is characterized in that, the method also comprises:
Finding step one, when there is not access unit consecutive with described access unit in all nodes of list quoting serial memory block LRU recently, first search the node that will store described access unit according to the LRU list data structure of described list, this node is designated as the second node, and in described list, search the numerical value node identical with the numbering of described access unit, this node is designated as the 3rd node;
Recording step one, the cumulative consecutive access number of times of record corresponding to the 3rd node;
Step of updating one, is updated to the numbering of described access unit by the numerical value of described second node;
Mobile step one, the mobile position of described second node in the LRU list data structure of described list makes the second node come the foremost of the LRU list data structure of described list;
Rearrangement step one, resets the binary search data tree structure of described list according to the feature of binary search tree and the numerical value of described second node;
Accumulation step one, carries out the cumulative consecutive access number of times corresponding to the second node after accumulation calculating renewal by the cumulative consecutive access number of times corresponding to the access of described access unit number of times and the 3rd node that records.
13. sequential access method for detecting as claimed in claim 12, it is characterized in that, in described recording step one, when not searching the numerical value node identical with the numbering of described access unit in described list, the cumulative consecutive access number of times of record corresponding to the 3rd node is 0.
14. sequential access method for detecting as claimed in claim 12, is characterized in that, in described rearrangement step one, when there is the 3rd node in described list, first deleting described 3rd node, then resetting the binary search data tree structure of described list.
15. sequential access method for detecting as claimed in claim 10, it is characterized in that, the method also comprises:
Finding step two, when there is the consecutive access unit with described access unit in the list of LRU, the first node will be designated as with the consecutive access unit of described access unit place node in described list, and in described list, search the numerical value node identical with the numbering of described access unit, this node is designated as the 4th node;
Recording step two, records described first node and the cumulative consecutive access number of times corresponding to described 4th node;
Step of updating two, is updated to the numbering of described access unit by the numerical value of described first node;
Mobile step 2, the mobile position of described first node in the LRU list data structure of described list makes the first node come the foremost of the LRU list data structure of described list;
Rearrangement step two, according to the feature of binary search tree and upgrade after the numerical value of the first node reset the binary search data tree structure of described list;
Accumulation step two, is added to the cumulative consecutive access number of times corresponding to the access of described access unit number of times and the 4th node that records on the cumulative consecutive access number of times corresponding to the first recorded node to upgrade the cumulative consecutive access number of times corresponding to the first node.
16. sequential access method for detecting as claimed in claim 15, it is characterized in that, in described recording step two, when not finding the numerical value node identical with the numbering of described access unit in described list, the cumulative consecutive access number of times of record the 4th node is 0.
17. sequential access method for detecting as claimed in claim 15, is characterized in that, in described rearrangement step two, when there is the 4th node in described list, first deleting described 4th node, then resetting the binary search data tree structure of described list.
18. sequential access method for detecting as described in claim 12 or 15, it is characterized in that, higher than preset value, whether the cumulative consecutive access number of times in described determining step corresponding to the first upgraded node or the second node of upgrading judges whether the accessing file corresponding to described access unit is consecutive access file.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711125905.1A CN107783733B (en) | 2013-11-07 | 2013-11-07 | Sequential access detection system and method |
| CN201310548188.9A CN104636074B (en) | 2013-11-07 | 2013-11-07 | Sequential access detecting system and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310548188.9A CN104636074B (en) | 2013-11-07 | 2013-11-07 | Sequential access detecting system and method |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711125905.1A Division CN107783733B (en) | 2013-11-07 | 2013-11-07 | Sequential access detection system and method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104636074A true CN104636074A (en) | 2015-05-20 |
| CN104636074B CN104636074B (en) | 2017-12-29 |
Family
ID=53214888
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310548188.9A Active CN104636074B (en) | 2013-11-07 | 2013-11-07 | Sequential access detecting system and method |
| CN201711125905.1A Active CN107783733B (en) | 2013-11-07 | 2013-11-07 | Sequential access detection system and method |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711125905.1A Active CN107783733B (en) | 2013-11-07 | 2013-11-07 | Sequential access detection system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN104636074B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7251708B1 (en) * | 2003-08-07 | 2007-07-31 | Crossroads Systems, Inc. | System and method for maintaining and reporting a log of multi-threaded backups |
| CN102253938A (en) * | 2010-05-18 | 2011-11-23 | 深圳市朗科科技股份有限公司 | Method and device for writing and restoring file |
| CN102637197A (en) * | 2012-02-28 | 2012-08-15 | 中北大学 | File management method of real-time data acquisition and storage system |
| CN102810092A (en) * | 2011-05-31 | 2012-12-05 | 腾讯科技（深圳）有限公司 | Data read-write method and system |
| CN104571932A (en) * | 2013-10-16 | 2015-04-29 | 鸿富锦精密工业（深圳）有限公司 | Sequential access detection system and method |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100543662C (en) * | 2007-10-25 | 2009-09-23 | 凌阳科技股份有限公司 | A kind of management method of tree structure file system |
| CN100583059C (en) * | 2007-12-28 | 2010-01-20 | 祥硕科技股份有限公司 | Data access integration method and its system |
| KR100998212B1 (en) * | 2010-06-09 | 2010-12-03 | 엘아이지넥스원 주식회사 | Method for buffer access of nand flash menory |
-
2013
- 2013-11-07 CN CN201310548188.9A patent/CN104636074B/en active Active
- 2013-11-07 CN CN201711125905.1A patent/CN107783733B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7251708B1 (en) * | 2003-08-07 | 2007-07-31 | Crossroads Systems, Inc. | System and method for maintaining and reporting a log of multi-threaded backups |
| CN102253938A (en) * | 2010-05-18 | 2011-11-23 | 深圳市朗科科技股份有限公司 | Method and device for writing and restoring file |
| CN102810092A (en) * | 2011-05-31 | 2012-12-05 | 腾讯科技（深圳）有限公司 | Data read-write method and system |
| CN102637197A (en) * | 2012-02-28 | 2012-08-15 | 中北大学 | File management method of real-time data acquisition and storage system |
| CN104571932A (en) * | 2013-10-16 | 2015-04-29 | 鸿富锦精密工业（深圳）有限公司 | Sequential access detection system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107783733A (en) | 2018-03-09 |
| CN104636074B (en) | 2017-12-29 |
| CN107783733B (en) | 2020-12-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10303596B2 (en) | Read-write control method for memory, and corresponding memory and server | |
| CN1760875B (en) | Transparent migration of files among various types of storage volumes based on file access properties | |
| CN106484761B (en) | For improving the method and system of storage log | |
| US10372382B2 (en) | Methods and apparatus for read disturb detection based on logical domain | |
| KR101933766B1 (en) | Methods and systems for improving flash memory flushing | |
| CN104461390A (en) | Method and device for writing data into imbricate magnetic recording SMR hard disk | |
| KR100526178B1 (en) | Access apparatus and method using flash memory | |
| CN110674056B (en) | Garbage recovery method and device | |
| CN110673789B (en) | Metadata storage management method, device, equipment and storage medium of solid state disk | |
| CN109407985B (en) | Data management method and related device | |
| US10642508B2 (en) | Method to limit impact of partial media failure of disk drive and detect/report the loss of data for objects due to partial failure of media | |
| US11409720B2 (en) | Metadata reduction in a distributed storage system | |
| CN113253932B (en) | Read-write control method and system for distributed storage system | |
| CN107203341A (en) | Date storage method, device and flash chip based on flash memory | |
| CN102426601B (en) | Data deleting method and device | |
| CN114153394A (en) | Data storage management method, device and equipment | |
| CN104205097A (en) | De-duplicate method device and system | |
| CN112597070B (en) | Object recovery method and device | |
| CN104636074A (en) | Sequential access monitoring system and method | |
| CN113553003A (en) | Data storage device and parking lot data storage system | |
| CN111324549B (en) | Memory and control method and device thereof | |
| CN107301073B (en) | Configuration information retrieval method and device based on solid state disk system | |
| TW201519086A (en) | System and method of sequential IO mechanism detection | |
| CN114329640B (en) | Count value reading method, count method, device, electronic device and storage medium | |
| CN113434084B (en) | Data erasing method, system, device and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20170920 Address after: 518000 Guangdong Province, Shenzhen New District of Longhua City, Dalang street, Longsheng Gold Dragon Road community e-commerce incubator exhibition Tao Commercial Plaza E block 706 Applicant after: Shenzhen step Technology Transfer Center Co., Ltd. Address before: 518109 Guangdong city of Shenzhen province Baoan District Longhua Town Industrial Zone tabulaeformis tenth East Ring Road No. 2 two Applicant before: Hongfujin Precise Industry (Shenzhen) Co., Ltd. Applicant before: Hon Hai Precision Industry Co., Ltd. |
|
| TA01 | Transfer of patent application right | ||
| CB03 | Change of inventor or designer information |
Inventor after: Diao Qi Inventor before: Qiu Junxie Inventor before: Zheng Xiangting |
|
| CB03 | Change of inventor or designer information | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20171128 Address after: 264003 Yantai, Yantai City, Shandong, Shandong East Avenue, Rover House No. 588, 2603, 2604 Applicant after: Shandong new data technology Limited by Share Ltd Address before: 518000 Guangdong Province, Shenzhen New District of Longhua City, Dalang street, Longsheng Gold Dragon Road community e-commerce incubator exhibition Tao Commercial Plaza E block 706 Applicant before: Shenzhen step Technology Transfer Center Co., Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 264003 Yantai, Yantai City, Shandong, Shandong East Avenue, Rover House No. 588, 2603, 2604 Patentee after: Shandong Geshu Data Technology Co.,Ltd. Address before: 264003 Yantai, Yantai City, Shandong, Shandong East Avenue, Rover House No. 588, 2603, 2604 Patentee before: Shandong new data technology Limited by Share Ltd. |
|
| CP01 | Change in the name or title of a patent holder | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220415 Address after: 265499 No. 3, building 7, Xiangjiang Road, Yantai Economic and Technological Development Zone, Shandong Province Patentee after: SHANDONG HONGSHU TECHNOLOGY Co.,Ltd. Address before: 264003 2603 and 2604, block D, Range Rover mansion, 588 Gangcheng East Street, Laishan District, Yantai City, Shandong Province Patentee before: Shandong Geshu Data Technology Co.,Ltd. |
|
| TR01 | Transfer of patent right |