CN107423229A - A kind of buffering area improved method towards page level FTL - Google Patents
A kind of buffering area improved method towards page level FTL Download PDFInfo
- Publication number
- CN107423229A CN107423229A CN201710156124.2A CN201710156124A CN107423229A CN 107423229 A CN107423229 A CN 107423229A CN 201710156124 A CN201710156124 A CN 201710156124A CN 107423229 A CN107423229 A CN 107423229A
- Authority
- CN
- China
- Prior art keywords
- request
- module
- treatment region
- random
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- 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/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
- G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
- G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
-
- 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/06—Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication
- G06F12/0646—Configuration or reconfiguration
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Memory System Of A Hierarchy Structure (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of buffering area improved method towards page level FTL.Step of the present invention is as follows：1st, RAM is divided into request type discriminating module, random request treatment region module and continuous request treatment region module；2nd, request type discriminating module determines the type up to request, and transfers to ask treatment region resume module accordingly；The 3rd, if the data page of request is instantly available service in RAM.During service, the read-write type of request need to be judged, if write request, then data cover is carried out in the buffer and realize renewal；Conversely, data are then directly read from buffering area.4th, when the data page in continuous request processing module is by secondary access, then the data page is loaded into random request treatment region module.5th, when random request treatment region module is full, rejected according to LRU policy in units of cluster；When continuously request treatment region module is full, rejected according to FIFO policy in units of cluster.The present invention has good practicality and application prospect.
Description
Technical field
The invention belongs to solid state hard disc algorithm design field, discloses a kind of buffering area towards page level FTL and improves
Method.
Background technology
The design of buffering area algorithm be in SSD firmware designs one it is very crucial the problem of, particularly to the SSD's of middle and high end
Performance and life-span optimization, the design of buffering area algorithm play vital effect.Because data access has higher time office
Portion's property and spatial locality feature, buffering area algorithm design can will access frequently data buffer storage in the buffer, with reduce
Direct access to flash memory, improve CPU read-write efficiency.
Data Replacement Strategy is a key issue of buffering area algorithm design.Traditional page level Replacement Strategy, that is, replace
Granularity is 1 page.The advantage of page level Replacement Strategy is the fine-grained accessing characteristic for distinguishing each page, and buffering area hit rate is more
Height, shortcoming is flash memory may be made to produce substantial amounts of fragmentation, and fragmentation excessively can substantially increase garbage reclamation
Expense.Traditional block level Replacement Strategy, the good order write performance of flash memory is taken into full account, by buffering area in a manner of clustering
The data page of same logical block, which flocks together, to be managed, and is rejected after buffering area is full and is also carried out according to block, i.e., will be same
The data page of logical block all displaces buffering area.The Pros and Cons of block level Replacement Strategy just with page level Replacement Strategy phase
Instead.
Furthermore buffering area structure design is another key issue of buffering area algorithm design.In hard disk access, renewal
Frequency is related to request size.When the request of arrival is more than 4KB, renewal frequency can be reduced substantially.If frequency will be accessed
After the relatively low continuous request of rate is cached to buffering area, buffer pollution can be caused, i.e., the data of no temporal locality occupy
Valuable memory space, so as to cause the space availability ratio of buffering area to decline.But directly give continuous request to FTL processing,
Effect is also bad, because in the presence of some data in a continuous request by secondary access, the phenomenon even repeatedly accessed.
Described on end, one outstanding buffering area innovatory algorithm of design is most important to the overall performance for lifting SSD.
The content of the invention
The purpose of the present invention is in view of the shortcomings of the prior art, there is provided a kind of buffering area improved method towards page level FTL.
By the present invention, in the design of solid state disk buffer zone management level, there are good practicality and application prospect.
The present invention solves the technical scheme that its technical problem uses and comprised the following steps：
Step 1, the RAM in solid state hard disc is divided into request type discriminating module, random request treatment region module and continuous
Ask treatment region 3 modules of module；
Random request treatment region module：For caching the data page of random request, if continuously in request treatment region module
Data page adds up, by secondary access, can also be loaded into random request treatment region module.
Continuous request treatment region module：For caching the data page with high spatial locality request (i.e. continuous request).
Using the high spatial locality continuously asked in continuously request treatment region module, by prefetching one group of data page to continuous request
Treatment region module, continuous request treatment region module is improved to the disposal ability continuously asked, so as to further lifting system
Overall performance.
Request type discriminating module：For judging the request type of the new request that arrives, that is, distinguish request be random request also
It is the continuous request with high spatial locality.
Step 2, when ask arrive when, request type discriminating module judges the request type of the request.If the request be with
Machine is asked, then gives the request to random request treatment region resume module, if continuous request, then gives continuous request treatment region
Resume module；
If step 3, the data page of request are in random request treatment region module or in continuously request treatment region module, you can
It is instantly available service.The read-write type of the request is judged during service, if write request, then with the data pair in request
The data of legacy data page in module corresponding to the request are covered, to realize renewal.Conversely, then read in direct slave module
Data.
Step 4, when the data page of request is in continuous request processing module, and the data page is accumulated secondary access, then needs
The data page of the request is loaded into random request treatment region module.
Step 5, when random request treatment region module does not have memory space, according to LRU policy, selection is minimum recently every time
The cluster of access enters line replacement；When continuously request treatment region module does not have memory space, according to FIFO policy, selection every time stops
Time most long one group of cluster enters line replacement.
The present invention chooses 3 performance indications as evaluation criterion：Cache hit rate, average response time and flash block erasing
Number；Specific explanations are as follows：
1) buffering area hit rate：Refer to hit ratio of the mapping item of request in mapped cache, i.e., directly in mapped cache
In the request that is serviced account for the ratio always asked.
2) response time：Refer to the time difference that service time and arrival time are completed in request, be garbage reclamation, address of cache
The synthesis of expense and data access time, and weigh the key index of SSD performances.
3) block erasing times：The erasing times of erasing times and data block including address conversion block, directly determine SSD
Service life.
In the present invention, random request treatment region module and continuous request treatment region module all employ the thought to cluster, i.e.,
The logical page (LPAGE) for belonging to same cluster number (number of logical page (LPAGE) in cluster number=logical page number (LPN)/each cluster) is flocked together, and
And all clusters are managed using LRU policy.
Compared with background technology, what is had has the advantages that the present invention：Experimental result is shown, on average, of the invention
Buffering area innovatory algorithm compare traditional lru algorithm, buffering area hit rate lifting 32.41%, the response time is reduced
26.89%, flash block erasing times reduce 30.28%；Compared to CFLRU algorithms, buffering area hit rate lifting 26.61%, response
Time reduces 19.08%, and flash block erasing times reduce 20.55%.
Brief description of the drawings
Fig. 1 show the frame diagram for the clustering strategies that the present invention uses；
Fig. 2 is the general frame figure of the present invention；
Fig. 3 is the flow chart of the present invention；
Fig. 4 is the flow chart of the present invention.
Embodiment
The invention will be further described with reference to the accompanying drawings and examples.
As in Figure 2-4, a kind of buffering area improved method towards page level FTL of the invention, solves the use of its technical problem
Technical scheme comprise the following steps：
As shown in Figure 2：
Step 1, the RAM in solid state hard disc is divided into request type discriminating module, random request treatment region module and continuous
Ask treatment region 3 modules of module；
Random request treatment region module：For caching the data page of random request, if continuously in request treatment region module
Data page adds up, by secondary access, can also be loaded into random request treatment region module.
Continuous request treatment region module：For caching the data page with high spatial locality request (i.e. continuous request).
Using the high spatial locality continuously asked in continuously request treatment region module, by prefetching one group of data page to continuous request
Treatment region module, continuous request treatment region module is improved to the disposal ability continuously asked, so as to further lifting system
Overall performance.
Request type discriminating module：For judging the request type of the new request that arrives, that is, distinguish request be random request also
It is the continuous request with high spatial locality.
Step 2, when ask arrive when, request type discriminating module judges the request type of the request.If the request be with
Machine is asked, then gives the request to random request treatment region resume module, if continuous request, then gives continuous request treatment region
Resume module；
If step 3, the data page of request are in random request treatment region module or in continuously request treatment region module, you can
It is instantly available service.The read-write type of the request is judged during service, if write request, then with the data pair in request
The data of legacy data page in module corresponding to the request are covered, to realize renewal.Conversely, then read in direct slave module
Data.
Step 4, when the data page of request is in continuous request processing module, and the data page is accumulated secondary access, then needs
The data page of the request is loaded into random request treatment region module.
Step 5, when random request treatment region module does not have memory space, according to LRU policy, selection is minimum recently every time
The cluster of access enters line replacement；When continuously request treatment region module does not have memory space, according to FIFO policy, selection every time stops
Time most long one group of cluster enters line replacement.
The present invention chooses 3 performance indications as evaluation criterion：Cache hit rate, average response time and flash block erasing
Number；Specific explanations are as follows：
1) buffering area hit rate：Refer to hit ratio of the mapping item of request in mapped cache, i.e., directly in mapped cache
In the request that is serviced account for the ratio always asked.
2) response time：Refer to the time difference that service time and arrival time are completed in request, be garbage reclamation, address of cache
The synthesis of expense and data access time, and weigh the key index of SSD performances.
3) block erasing times：The erasing times of erasing times and data block including address conversion block, directly determine SSD
Service life.
In the present invention, random request treatment region module and continuous request treatment region module all employ the thought to cluster, i.e.,
The logical page (LPAGE) for belonging to same cluster number (number of logical page (LPAGE) in cluster number=logical page number (LPN)/each cluster) is flocked together, and
And all clusters are managed using LRU policy, as shown in Figure 1.
In fig. 2 it is described that the general frame figure of buffering area innovatory algorithm towards page level FTL a kind of, including：1、
Request type discriminating module；2nd, random request treatment region module；3rd, treatment region module is continuously asked.
Embodiment 1：
In conjunction with Fig. 3 and Fig. 4, the implementation example of the present invention is described in detail, the handling process of algorithm is described in detail in it.
In this example, the present invention weakens the size of buffer space, and random request treatment region module is asked with continuous
The cluster for the treatment of region module is asked all to be made up of 4 data pages.Assuming that the order that request reaches is as follows：(131,1, W), (0,2, R),
(12,4, W), (2,1, W), wherein, three parameters in bracket represent respectively request initial logic page number, request size and
Request type.Assuming that random request treatment region module and continuous request treatment region module all do not have memory space, such as Fig. 3 institutes
Show.
Handling process of the present invention：When asking (131,1, W) to arrive, because the data of request are in continuously request treatment region mould
Block and accessed by secondary, it is necessary to be loaded into random request treatment region module, at this moment random request treatment region module is full,
Then reject, update the data page 236-239 into flash memory, then load data page 131 into random request treatment region module.When please
When asking (0,2, R) arrival, because the request is not in buffering area, then data page 0,1 read from flash memory and arrive random request treatment region
In module.When asking (12,4, W) to arrive, due to the request not in the buffer, request type discriminating module judge to need plus
The data of the request are carried into continuous request treatment region module, at this moment finds that continuous request treatment region module is full, then rejects, more
Then new data page 200-203 loads data page 12-15 into continuous request treatment region module into flash memory.When request (2,1,
When W) arriving, due to the request not in the buffer, request type discriminating module, which judges to need to load data page 2, arrives random request
In treatment region module.The end-state of buffering area is as shown in Figure 4.
Claims (3)
1. a kind of buffering area improved method towards page level FTL, it is characterised in that comprise the following steps：
Step 1, the RAM in solid state hard disc is divided into request type discriminating module, random request treatment region module and continuous request
3 modules for the treatment of region module；
Random request treatment region module：For caching the data page of random request, if the continuously data in request treatment region module
Page adds up, by secondary access, can also be loaded into random request treatment region module；
Continuous request treatment region module：For caching the data page with the request of high spatial locality；In continuously request treatment region
Using the high spatial locality continuously asked in module, by prefetching one group of data page to continuous request treatment region module, lifting
Continuous request treatment region module is to the disposal ability continuously asked；
Request type discriminating module：For judging the request type of the new request that arrives, that is, it is random request or tool to distinguish request
There is the continuous request of high spatial locality；
Step 2, when ask arrive when, request type discriminating module judges the request type of the request；If the request is at random please
Ask, then give the request to random request treatment region resume module, if continuous request, then give continuous request treatment region module
Processing；
If step 3, the data page of request are in random request treatment region module or in continuously request treatment region module, you can immediately
Serviced；The read-write type of the request is judged during service, then please to this with the data in request if write request
The data of legacy data page in module corresponding to asking are covered, to realize renewal；Conversely, then read number in direct slave module
According to；
Step 4, when the data page of request is in continuous request processing module, and the data page is accumulated secondary access, then needs this
The data page of request is loaded into random request treatment region module；
Step 5, when random request treatment region module does not have memory space, according to LRU policy, select nearest least referenced every time
Cluster enter line replacement；When continuously request treatment region module does not have memory space, according to FIFO policy, the residence time is selected every time
One group of most long cluster enters line replacement.
2. a kind of buffering area improved method towards page level FTL according to claim 1, it is characterised in that choose caching life
Middle rate, average response time and 3 performance indications of flash block erasing times are as follows as evaluation criterion, specific explanations：
1) buffering area hit rate：Refer to hit ratio of the mapping item of request in mapped cache, i.e., directly in mapped cache
Request to service accounts for the ratio always asked；
2) response time：Refer to the time difference that service time and arrival time are completed in request, be garbage reclamation, the expense of address of cache
And the synthesis of data access time, and weigh the key index of SSD performances；
3) block erasing times：The erasing times of erasing times and data block including address conversion block, directly determine making for SSD
Use the life-span.
3. a kind of buffering area improved method towards page level FTL according to claim 1, it is characterised in that at random request
Reason area's module and continuous request treatment region module employ the thought to cluster, will belong to the logical page (LPAGE) aggregation of same cluster number
Together, and using LRU policy to all clusters it is managed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710156124.2A CN107423229B (en) | 2017-03-16 | 2017-03-16 | Buffer area improvement method for page-level FTL |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710156124.2A CN107423229B (en) | 2017-03-16 | 2017-03-16 | Buffer area improvement method for page-level FTL |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107423229A true CN107423229A (en) | 2017-12-01 |
| CN107423229B CN107423229B (en) | 2020-09-01 |
Family
ID=60423534
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710156124.2A Active CN107423229B (en) | 2017-03-16 | 2017-03-16 | Buffer area improvement method for page-level FTL |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107423229B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108196795A (en) * | 2017-12-30 | 2018-06-22 | 惠龙易通国际物流股份有限公司 | A kind of date storage method, equipment and computer storage media |
| CN108762664A (en) * | 2018-02-05 | 2018-11-06 | 杭州电子科技大学 | A kind of solid state disk page grade buffer queue management method |
| CN109446117A (en) * | 2018-09-06 | 2019-03-08 | 杭州电子科技大学 | A kind of solid state hard disk page grade flash translation layer (FTL) design method |
| CN109918316A (en) * | 2019-02-26 | 2019-06-21 | 深圳忆联信息***有限公司 | A kind of method and its system reducing FTL address of cache space |
| CN110688325A (en) * | 2019-09-05 | 2020-01-14 | 苏州浪潮智能科技有限公司 | Garbage recycling method, device and equipment for solid state disk and storage medium |
| CN113076267A (en) * | 2021-04-29 | 2021-07-06 | 华侨大学 | Address conversion method based on hotspot collection and data storage device |
| CN117687932A (en) * | 2023-08-31 | 2024-03-12 | 荣耀终端有限公司 | Memory allocation method and device |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100169544A1 (en) * | 2008-12-31 | 2010-07-01 | Eom Young-Ik | Methods for distributing log block associativity for real-time system and flash memory devices performing the same |
| US20130003889A1 (en) * | 2011-06-29 | 2013-01-03 | Tektronix, Inc. | Apparatus for generation of corrected vector wideband rf signals |
| CN103176752A (en) * | 2012-07-02 | 2013-06-26 | 晶天电子（深圳）有限公司 | Super-endurance solid-state drive with Endurance Translation Layer (ETL) and diversion of temp files for reduced Flash wear |
| CN102097128B (en) * | 2010-11-25 | 2014-03-19 | 中国人民大学 | Self-adaptive buffer area replacement method based on flash memory |
| CN104102591A (en) * | 2013-04-08 | 2014-10-15 | 香港理工大学 | Computer subsystem and method for implementing flash translation layer in computer subsystem |
| CN105224240A (en) * | 2014-05-30 | 2016-01-06 | 北京忆恒创源科技有限公司 | By the method for data write storage device, device and memory device |
| CN105917318A (en) * | 2012-07-24 | 2016-08-31 | 英特尔公司 | System and method for implementing SSD-based I/O caches |
-
2017
- 2017-03-16 CN CN201710156124.2A patent/CN107423229B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100169544A1 (en) * | 2008-12-31 | 2010-07-01 | Eom Young-Ik | Methods for distributing log block associativity for real-time system and flash memory devices performing the same |
| CN102097128B (en) * | 2010-11-25 | 2014-03-19 | 中国人民大学 | Self-adaptive buffer area replacement method based on flash memory |
| US20130003889A1 (en) * | 2011-06-29 | 2013-01-03 | Tektronix, Inc. | Apparatus for generation of corrected vector wideband rf signals |
| CN103176752A (en) * | 2012-07-02 | 2013-06-26 | 晶天电子（深圳）有限公司 | Super-endurance solid-state drive with Endurance Translation Layer (ETL) and diversion of temp files for reduced Flash wear |
| CN105917318A (en) * | 2012-07-24 | 2016-08-31 | 英特尔公司 | System and method for implementing SSD-based I/O caches |
| CN104102591A (en) * | 2013-04-08 | 2014-10-15 | 香港理工大学 | Computer subsystem and method for implementing flash translation layer in computer subsystem |
| CN105224240A (en) * | 2014-05-30 | 2016-01-06 | 北京忆恒创源科技有限公司 | By the method for data write storage device, device and memory device |
Non-Patent Citations (1)
| Title |
|---|
| 姚英彪 等: "基于连续缓存和二级缓存的DFTL改进算法", 《计算机研究与发展》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108196795A (en) * | 2017-12-30 | 2018-06-22 | 惠龙易通国际物流股份有限公司 | A kind of date storage method, equipment and computer storage media |
| CN108196795B (en) * | 2017-12-30 | 2020-09-04 | 惠龙易通国际物流股份有限公司 | Data storage method and device and computer storage medium |
| CN108762664A (en) * | 2018-02-05 | 2018-11-06 | 杭州电子科技大学 | A kind of solid state disk page grade buffer queue management method |
| CN108762664B (en) * | 2018-02-05 | 2021-03-16 | 杭州电子科技大学 | Solid state disk page-level cache region management method |
| CN109446117A (en) * | 2018-09-06 | 2019-03-08 | 杭州电子科技大学 | A kind of solid state hard disk page grade flash translation layer (FTL) design method |
| CN109446117B (en) * | 2018-09-06 | 2023-02-28 | 杭州电子科技大学 | Design method for page-level flash translation layer of solid state disk |
| CN109918316A (en) * | 2019-02-26 | 2019-06-21 | 深圳忆联信息***有限公司 | A kind of method and its system reducing FTL address of cache space |
| CN110688325A (en) * | 2019-09-05 | 2020-01-14 | 苏州浪潮智能科技有限公司 | Garbage recycling method, device and equipment for solid state disk and storage medium |
| CN110688325B (en) * | 2019-09-05 | 2021-12-03 | 苏州浪潮智能科技有限公司 | Garbage recycling method, device and equipment for solid state disk and storage medium |
| CN113076267A (en) * | 2021-04-29 | 2021-07-06 | 华侨大学 | Address conversion method based on hotspot collection and data storage device |
| CN113076267B (en) * | 2021-04-29 | 2023-05-26 | 华侨大学 | Address conversion method and data storage device based on hot spot aggregation |
| CN117687932A (en) * | 2023-08-31 | 2024-03-12 | 荣耀终端有限公司 | Memory allocation method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107423229B (en) | 2020-09-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107423229A (en) | A kind of buffering area improved method towards page level FTL | |
| CN107590084A (en) | A kind of page level buffering area improved method based on classification policy | |
| CN103885728B (en) | A kind of disk buffering system based on solid-state disk | |
| CN107193646A (en) | A kind of high-efficiency dynamic paging method that framework is hosted based on mixing | |
| CN102981963B (en) | A kind of implementation method of flash translation layer (FTL) of solid-state disk | |
| CN103246613B (en) | Buffer storage and the data cached acquisition methods for buffer storage | |
| CN110262982A (en) | A kind of method of solid state hard disk address of cache | |
| JP2017033584A (en) | Apparatus and methods to reduce castouts in multi-level cache hierarchy | |
| CN102789427A (en) | Data storage device and operation method thereof | |
| CN1499382A (en) | Method for implementing cache in high efficiency in redundancy array of inexpensive discs | |
| CN101694640B (en) | Method for realizing replacement policies of shared second-level cache under multi-core architecture | |
| CN108762671A (en) | Mixing memory system and its management method based on PCM and DRAM | |
| CN109446117B (en) | Design method for page-level flash translation layer of solid state disk | |
| CN102156753A (en) | Data page caching method for file system of solid-state hard disc | |
| CN107943719A (en) | A kind of flash translation layer (FTL) control method based on requests classification | |
| CN107589908A (en) | The merging method that non-alignment updates the data in a kind of caching system based on solid-state disk | |
| US10761989B2 (en) | Method of storage management, storage system and computer program product | |
| CN106681668A (en) | Hybrid storage system and storage method based on solid state disk caching | |
| CN108845957B (en) | Replacement and write-back self-adaptive buffer area management method | |
| CN110147331B (en) | Cache data processing method and system and readable storage medium | |
| CN100377117C (en) | Method and device for converting virtual address, reading and writing high-speed buffer memory | |
| CN106909323B (en) | Page caching method suitable for DRAM/PRAM mixed main memory architecture and mixed main memory architecture system | |
| Yao et al. | An advanced adaptive least recently used buffer management algorithm for SSD | |
| CN101231637A (en) | Self-adaption pre-reading method base on file system buffer | |
| CN115203079A (en) | Method for writing data into solid state disk |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201218 Address after: 314500 Tongxiang City, Jiaxing, Zhejiang, Tung Tung Road, Wu Tung Street (East) 55, Tongxiang chamber of Commerce Building 1 unit 1702, 1703 room -A-220 Patentee after: Jiaxing Beixi Electromechanical Equipment Co.,Ltd. Address before: Room 3003-1, building 1, Gaode land center, Jianggan District, Hangzhou City, Zhejiang Province Patentee before: Zhejiang Zhiduo Network Technology Co.,Ltd. Effective date of registration: 20201218 Address after: Room 3003-1, building 1, Gaode land center, Jianggan District, Hangzhou City, Zhejiang Province Patentee after: Zhejiang Zhiduo Network Technology Co.,Ltd. Address before: 310018 No. 2 street, Xiasha Higher Education Zone, Hangzhou, Zhejiang Patentee before: HANGZHOU DIANZI University |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210203 Address after: Room 2003, 1801, 1804, No.13-1, Hai'an Road, Tianhe District, Guangzhou City, Guangdong Province Patentee after: HEYU HEALTH TECHNOLOGY Co.,Ltd. Address before: 314500 Tongxiang City, Jiaxing, Zhejiang, Tung Tung Road, Wu Tung Street (East) 55, Tongxiang chamber of Commerce Building 1 unit 1702, 1703 room -A-220 Patentee before: Jiaxing Beixi Electromechanical Equipment Co.,Ltd. |
|
| TR01 | Transfer of patent right |