CN110825652B - Method, device and equipment for eliminating cache data on disk block - Google Patents

Method, device and equipment for eliminating cache data on disk block Download PDF

Info

Publication number
CN110825652B
CN110825652B CN201810902088.4A CN201810902088A CN110825652B CN 110825652 B CN110825652 B CN 110825652B CN 201810902088 A CN201810902088 A CN 201810902088A CN 110825652 B CN110825652 B CN 110825652B
Authority
CN
China
Prior art keywords
disk
hole
disk block
block
blocks
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810902088.4A
Other languages
Chinese (zh)
Other versions
CN110825652A (en
Inventor
王文铎
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Alibaba Group Holding Ltd
Original Assignee
Alibaba Group Holding Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Alibaba Group Holding Ltd filed Critical Alibaba Group Holding Ltd
Priority to CN201810902088.4A priority Critical patent/CN110825652B/en
Publication of CN110825652A publication Critical patent/CN110825652A/en
Application granted granted Critical
Publication of CN110825652B publication Critical patent/CN110825652B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/0253—Garbage collection, i.e. reclamation of unreferenced 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/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0866—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches for peripheral storage systems, e.g. disk cache
    • G06F12/0871—Allocation or management of cache space
    • 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/0604—Improving or facilitating administration, e.g. storage 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/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
    • G06F3/0656—Data buffering arrangements
    • 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/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

The application discloses a method for eliminating cache data on a disk block, which comprises the following steps: determining a hole value or a hole proportion of a disk block for caching data; determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks; and eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks. The problem of the disk space waste that does not perceive disk cavity size when the cache data on the disk block is eliminated is solved.

Description

Method, device and equipment for eliminating cache data on disk block
Technical Field
The present disclosure relates to computer technologies, and in particular, to a method, an apparatus, an electronic device, and a storage device for eliminating cached data on a disk block. The application also relates to a second method, a device, electronic equipment and storage equipment for eliminating the cache data on the disk block.
Background
As more and more users use the cloud, active deletion of data cached in cloud disk blocks by the user is one of the frequent scenarios. In this scenario, since some of the data written to a disk block is manually deleted, a hole appears in the disk block. The disk block is a basic unit for managing a disk, that is, the disk is divided into a plurality of blocks according to a fixed size, and each block is a disk block. The hole refers to that after all or part of the data of the cache data on the disk block is deleted, the disk space originally occupied by the corresponding deleted data is still occupied, and the part of the disk space is the hole or is the disk hole. For example, a virtual machine of a 100G disk is created for a user at the cloud, the virtual machine file is in qcow2 file format, and as user data stored on the virtual machine by the user increases, the virtual machine file is bigger and bigger, and if the user deletes a large amount of user data in the virtual machine, the size of the virtual machine file is not reduced immediately, so that a hole appears on a disk block.
In the prior art, the old data of each disk block is generally eliminated according to the sequence from the disk head to the disk tail, so that space is provided for caching new data, and the size of a disk cavity is not perceived by sequentially eliminating the disk blocks, so that a large amount of effective data exists on the disk blocks which are eliminated first, and then the situation that the sequence is eliminated is waited for although a large amount of disk cavities exist on the disk blocks which are eliminated later, thereby causing the waste of the disk space.
Disclosure of Invention
The application provides a processing method of a disk cavity, which adopts a reasonable elimination mode for a disk and solves the problem of disk space waste caused by the fact that the size of the disk cavity cannot be perceived when cache data on a disk block is eliminated.
The application provides a method for eliminating cache data on a disk block, which comprises the following steps:
determining a hole value or a hole proportion of a disk block for caching data;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks;
and eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
Optionally, the determining a hole value or a hole proportion of the disk block for caching data includes:
determining a cavity of a disk block, wherein after all or part of data of cache data on the disk block is deleted, if the disk space occupied by the deleted data is not data but still in an occupied state, the disk space is the cavity of the disk block;
Determining the space size occupied by the cavity of the disk block, wherein the space size is the cavity value of the disk block; or alternatively, the first and second heat exchangers may be,
and determining the ratio of the cavity value of the disk block to the total space size of the disk block, wherein the ratio is the cavity ratio of the disk block.
Optionally, the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole value or the hole proportion of the disk blocks includes:
and sequencing the disk blocks according to the size of the hole value or the size of the hole proportion to obtain the disk block operation sequence of the cache data on the eliminated disk blocks.
Optionally, the sorting the disk blocks according to the size of the hole value or the size of the hole proportion to obtain the operation sequence of the disk blocks for eliminating the cache data on the disk blocks includes:
and taking the sequence of the hole value or the hole proportion from large to small as the disk block operation sequence of the cache data on the obsolete disk blocks.
Optionally, the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole value or the hole proportion of the disk blocks includes:
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using each disk block index according to the size of the hole value or the hole proportion of each disk block; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: the order of the void value or the void proportion is from small to large;
And taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
Optionally, the generating, according to the size of the hole proportion of each disk block, an elimination queue for eliminating the disk block by using each disk block index includes:
and generating the elimination queue by using each disk block index through adopting a linked list structure according to the size of the hole value or the size sorting of the hole proportion of the disk block.
Optionally, the generating the elimination queue by using each disk block index with a linked list structure according to the size of the hole value or the size of the hole proportion of the disk block includes:
inserting the disk block index with small hole proportion into the head part of the linked list, and inserting the disk block index with large hole proportion into the tail part of the linked list; or alternatively, the first and second heat exchangers may be,
and inserting the disk block index with small hole value into the head part of the linked list, and inserting the disk block index with large hole value into the tail part of the linked list.
Optionally, the method for eliminating the cache data on the disk block further includes:
moving the disc block index in the elimination queue according to the change of the hole value or the hole proportion of the disc block corresponding to the disc block index; and/or the number of the groups of groups,
moving the disc block index of the disc block with the hole value or the hole proportion meeting the hole size condition to the tail part of the elimination queue; and/or the number of the groups of groups,
And moving the disk block index of the disk block with the largest hole value or the largest hole proportion to the tail part of the elimination queue.
Optionally, the eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks includes:
obtaining a disk block index from the tail of the elimination queue;
determining a corresponding disk block according to the disk block index;
and eliminating the cache data on the disk block.
Optionally, the method for eliminating the cache data on the disk block further includes:
counting the access heat value of each disk block, wherein the access heat value is the number of times of access of cache data on the disk block in a certain time;
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block index according to the access heat value of the disk blocks; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: accessing the order of the heat values from big to small;
the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks comprises the following steps:
inserting or moving a disk block index of a disk block with a hole value or a hole proportion meeting the hole size condition to the tail part of the elimination queue;
The step of eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks comprises the following steps:
and eliminating the cache data on the disk blocks according to the disk block index at the tail part of the elimination queue.
Optionally, the method for eliminating the cache data on the disk block further includes:
determining a disk block with a hole value or a hole proportion meeting the hole size condition;
the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks comprises the following steps:
and determining the operation sequence of the disk blocks with the hole values or the hole proportions meeting the hole size conditions according to the hole values or the hole proportions of the disk blocks with the hole sizes meeting the hole size conditions.
Optionally, the determining, according to the hole value or the hole ratio of the disk block whose hole value or hole ratio meets the hole size condition, the operation sequence of the disk block whose hole value or hole ratio meets the hole size condition for eliminating the cache data on the disk block includes:
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block indexes of the disk blocks with the hole values or the hole proportions according to the hole values or the hole proportions of the disk blocks with the hole sizes; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: the order of the void value or the void proportion is from small to large;
And taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
The application also provides a second method for eliminating the cache data on the disk block, which comprises the following steps:
determining an access heat value of a disk block for caching data;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the access heat value of the disk blocks;
and eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
Optionally, the determining the access heat value of the disk block for caching data includes:
and determining the access heat value of the disk block according to the number of times the data on the disk block is accessed in a certain time.
Optionally, the determining, according to the access heat value of the disk block, the operation sequence of the disk block for eliminating the cache data on the disk block includes:
determining the heat sequencing of the disk blocks according to the access heat value of the disk blocks;
and taking the sequence of the access heat value from low to high as the disk block operation sequence of the cache data on the obsolete disk blocks.
Optionally, the determining, according to the access heat value of the disk block, the operation sequence of the disk block for eliminating the cache data on the disk block includes:
Establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block index according to the access heat value of each disk block; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: accessing the order of the heat values from big to small;
and taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
Optionally, the eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks includes:
obtaining a disk block index from the tail of the elimination queue;
determining a corresponding disk block according to the disk block index;
and eliminating the cache data on the disk block.
Optionally, the method for eliminating the cache data on the disk block further includes:
moving the disk block index according to the change of the access heat value of the disk block corresponding to the disk block index in the elimination queue; and/or the number of the groups of groups,
inserting a disk block index of a disk block with the access heat value meeting the access heat condition into an elimination queue; and/or the number of the groups of groups,
and moving the disk block index of the disk block with the lowest access heat value to the tail part of the elimination queue.
Optionally, the generating, according to the access heat value of each disk block, a retirement queue for retired disk blocks using the disk block index includes:
and generating the elimination queue by using a disk block index by adopting a linked list structure according to the high-low ordering of the access heat value of the disk block.
Optionally, the generating the elimination queue by using a linked list structure according to the high-low ordering of the access heat value of the disk block includes:
and inserting the disk block index with high access heat value into the head part of the linked list, and inserting the disk block index with low access heat value into the tail part of the linked list.
Optionally, the method for eliminating the cache data on the disk block further includes:
counting the hole value of each disk block, wherein the hole value is the size of the disk space of which the data is still in an occupied state after all or part of data of cache data on the disk block is deleted;
and inserting the disc block index of the disc block with the hole value meeting the hole size condition into the elimination queue or moving the disc block index to the tail part of the elimination queue.
The application also provides a device for eliminating the cache data on the disk block, comprising:
the hole size determining unit is used for determining a hole value or a hole proportion of the disk block for caching data;
The operation sequence determining unit is used for determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks;
and the elimination unit is used for eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
The application also provides a second device for eliminating the cache data on the disk block, comprising:
an access heat determining unit for determining an access heat value of a disk block for caching data;
an operation sequence determining unit, configured to determine a disk block operation sequence of eliminating cache data on the disk block according to the access heat value of the disk block;
and the elimination unit is used for eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
The application also provides an electronic device comprising:
a memory, and a processor;
the memory is for storing computer-executable instructions, and the processor is for executing the computer-executable instructions:
determining a hole value or a hole proportion of a disk block for caching data;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks;
and eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
The application also provides a second electronic device comprising:
a memory, and a processor;
the memory is for storing computer-executable instructions, and the processor is for executing the computer-executable instructions:
determining an access heat value of a disk block for caching data;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the access heat value of the disk blocks;
and eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
The present application also provides a storage device storing instructions capable of being loaded by a processor and performing the steps of:
determining a hole value or a hole proportion of a disk block for caching data;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks;
and eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
The present application also provides a second storage device storing instructions capable of being loaded by a processor and performing the steps of:
determining an access heat value of a disk block for caching data;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the access heat value of the disk blocks;
And eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
Compared with the prior art, the application has the following advantages:
according to the method for eliminating the cache data on the disk block, the disk block operation sequence of the cache data on the disk block is determined according to the hole value or the hole proportion of the disk block, so that a more reasonable elimination sequence can be adopted for the disk, and the problem of disk space waste caused by the fact that the size of the disk hole is not perceived when the cache data on the disk block is eliminated is solved.
Drawings
FIG. 1 is a process flow diagram of a method for eliminating cached data on a disk block according to a first embodiment of the present application;
FIG. 2 is a schematic diagram of a first embodiment of the present application for creating a linked list according to a disk block index;
FIG. 3 is a schematic diagram of moving a block index in a linked list, as encompassed by the first embodiment of the present application;
FIG. 4 is a process flow diagram of a method for eliminating cached data on a disk block according to a second embodiment of the present application;
FIG. 5 is a schematic diagram of creating a linked list according to a disk block index according to a second embodiment of the present application;
FIG. 6 is a schematic diagram of moving a block index in a linked list, as encompassed by a second embodiment of the present application;
FIG. 7 is a schematic diagram of an apparatus for eliminating cached data on a disk block according to a third embodiment of the present disclosure;
FIG. 8 is a schematic diagram of an apparatus for eliminating cached data on a disk block according to a fourth embodiment of the present disclosure;
fig. 9 is a schematic diagram of an electronic device provided in the present application.
Detailed Description
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present application. This application is, however, susceptible of embodiment in many other ways than those herein described and similar generalizations can be made by those skilled in the art without departing from the spirit of the application and the application is therefore not limited to the specific embodiments disclosed below.
The first embodiment of the application provides a method for eliminating cache data on a disk block.
A method for eliminating cache data on a disk block according to an embodiment of the present application is described below with reference to fig. 1 to 3. FIG. 1 is a process flow diagram of a method for eliminating cached data on a disk block according to a first embodiment of the present application; FIG. 2 is a schematic diagram of a first embodiment of the present application for creating a linked list according to a disk block index; fig. 3 is a schematic diagram of moving a block index in a linked list, which is included in the first embodiment of the present application.
The method for eliminating the cache data on the disk block shown in fig. 1 comprises the following steps: step S101 to step S103.
Step S101, determining a hole value or a hole ratio of the disk block for caching data.
The data is cached on the disk, so that a user can quickly acquire content stored in the cloud, in order to facilitate management of the disk, the disk is generally divided into a plurality of blocks according to fixed length for management, each fixed-length block is a disk block, the disk block is a basic unit for management of the disk, for example, the disk is divided into a plurality of disk blocks according to 8M, and the space size of one disk block is 8M. How to eliminate the cache data on the disk block directly affects the availability of disk space utilization and the cache hit rate. In the prior art, new data is generally covered with old data on a disk according to the offset sequence of disk blocks, and after the whole disk is covered once, the new data is covered from the beginning again.
The application provides a method for eliminating cache data on a disk block, which is used for determining a more reasonable elimination sequence for the disk block according to the hole value or the hole proportion of the disk block. After all or part of the data of the cache data on the disk block is deleted, if the disk space occupied by the deleted data is not occupied but still is occupied, the disk space is a cavity of the disk block. The method for eliminating the cache data on the disk blocks provided by the embodiment can sense the size of the disk holes, so that the disk blocks with the size of the holes can be eliminated preferentially, and the disk space can be utilized effectively.
The step is to determine the hole value or hole proportion of the disk block.
In the embodiment of the application, the hole value or the hole proportion of the disk block for caching data is determined through the following processing:
determining the space size occupied by the cavity of the disk block, wherein the space size is the cavity value of the disk block; or alternatively, the first and second heat exchangers may be,
and determining the ratio of the cavity value of the disk block to the total space size of the disk block, wherein the ratio is the cavity ratio of the disk block.
The preferred specific calculation method of the cavity value comprises the following steps:
if the cache data on the disk block is deleted, adding the space size corresponding to the deleted cache data to the hole value of the disk block to obtain the current hole value of the disk block.
Step S102, determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks.
The method comprises the steps of determining the operation sequence of the disk blocks, so that the disk blocks are operated one by one according to the operation sequence of the disk blocks in the subsequent steps, and cache data on the disk blocks are eliminated.
In this embodiment of the present application, specifically includes:
and sequencing the disk blocks according to the size of the hole value or the size of the hole proportion to obtain the disk block operation sequence of the cache data on the eliminated disk blocks.
Preferably, the sequence of the hole value or the hole proportion from large to small is used as the disk block operation sequence of the cache data on the obsolete disk blocks.
In the embodiment of the application, the disk block index is introduced, the logically eliminating queue for identifying the operation sequence of the disk block is maintained through the disk block index, namely, the disk block index is stored in the eliminating queue, when the disk block is operated according to the operation sequence of the disk block identified by the eliminating queue, the disk block index at the corresponding position is taken out, the real disk block is found according to the disk block index, and the cache data on the disk block is eliminated. The disk block operation sequence is determined specifically by the following processes:
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using each disk block index according to the size of the hole value or the hole proportion of each disk block; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: the order of the void value or the void proportion is from small to large;
and taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
In the embodiment of the present application, to determine a more appropriate disk block operation sequence, the following processing is further performed:
moving the disc block index in the elimination queue according to the change of the hole value or the hole proportion of the disc block corresponding to the disc block index; and/or the number of the groups of groups,
moving the disc block index of the disc block with the hole value or the hole proportion meeting the hole size condition to the tail part of the elimination queue; and/or the number of the groups of groups,
and moving the disk block index of the disk block with the largest hole value or the largest hole proportion to the tail part of the elimination queue.
In an exemplary implementation manner of the embodiment of the present application, in order to construct the elimination queue by using a linked list structure, specifically, according to the size of the hole value or the size of the hole proportion of the disk block, the elimination queue is generated by using each disk block index by adopting the linked list structure. And in the process of generating the elimination queue by using each disk block index by adopting a linked list structure, the method comprises the following steps of:
inserting the disk block index with small hole proportion into the head part of the linked list, and inserting the disk block index with large hole proportion into the tail part of the linked list; or alternatively, the first and second heat exchangers may be,
and inserting the disk block index with small hole value into the head part of the linked list, and inserting the disk block index with large hole value into the tail part of the linked list.
Referring to fig. 2 and 3, fig. 2 is a schematic diagram illustrating a linked list establishment according to a disk block index, including: a disk 201 divided into disk blocks for management and a elimination queue 202 formed by the index of the disk blocks; an index is built in memory for each disk block 201, and the indexes are linked into a linked list by using a linked list structure, so as to form a elimination queue 202 for the disk block indexes. When 202 is generated, according to the hole value or hole proportion (shown as hole proportion) of each disk block, the disk block indexes of the disk blocks with large hole proportion are placed at the tail part of the linked list, the disk block indexes of the disk blocks with small hole proportion are placed at the head part of the linked list, for example, the disk block with large hole proportion indicated by 15, the disk block with large hole proportion indicated by 23810 are inserted into the tail part of the linked list one by one; the hole proportion of the disk block indicated by 16 is least placed at the head of the linked list, and the hole proportion of the disk block indicated by 13, 14, 23808 and 23809 is smaller, so that the position is close to the head of the linked list. When the buffer data (or old data is covered) needs to be eliminated to vacate the disk space to write new data, a disk block with large hole proportion is found out from the tail part of the linked list, and the buffer data on the disk block is deleted. Fig. 3 is a schematic diagram of moving the block index in the linked list, where the block index is in the retired queue 302 formed by the block index, and when the hole value or hole proportion on the block indicated by 23809 becomes larger, the block index 23809 is moved from the position originally near the head of the linked list to the position near the tail of the linked list.
The processing can make the indexes of the disk blocks with large hole values or large hole proportions put at the tail part of the elimination queue as much as possible, when the cache data on the corresponding disk blocks are eliminated by the disk block indexes obtained from the tail part of the elimination queue, the disk blocks with large holes can be eliminated preferentially, the utilization rate of the disk space is improved, and the effective data of the disk blocks with the cache data are reserved preferentially because the ineffective space of the disk blocks with the cache data is eliminated preferentially, so that the cache hit rate can be improved. When a user accesses cloud or internet data, if there is data to be accessed in the cache as cache hit, if there is no data to be accessed in the cache and the accessed data needs to be fetched to the original server, the cache hit rate can be estimated as miss according to the following formula: cache hit rate = hit number/(hit number + miss number).
In an exemplary implementation manner of the embodiment of the present application, in order to preferentially eliminate the buffered data on the disk blocks meeting the hole size condition, for example, the hole proportion reaches 80% of the hole size threshold, the buffered data on the disk blocks are preferentially eliminated. The specific treatment comprises the following steps:
Determining a disk block with a hole value or a hole proportion meeting the hole size condition;
the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks comprises the following steps:
and determining the operation sequence of the disk blocks with the hole values or the hole proportions meeting the hole size conditions according to the hole values or the hole proportions of the disk blocks with the hole sizes meeting the hole size conditions.
Preferably, the disk block index is used to determine the operation sequence of the disk block in which the hole value or the hole proportion of the cache data on the eliminated disk block meets the hole size condition according to the hole value or the hole proportion of the disk block in which the hole value or the hole proportion meets the hole size condition, and the method specifically comprises the following steps:
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block indexes of the disk blocks with the hole values or the hole proportions according to the hole values or the hole proportions of the disk blocks with the hole sizes; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: the order of the void value or the void proportion is from small to large;
And taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
In the process of preferentially eliminating the cache data on the disk block meeting the hole size condition, the method further comprises the following steps:
and inserting the disc block index of the disc block with the hole value or the hole proportion meeting the hole size condition into the elimination queue.
And step S103, eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
The step is to operate the disk blocks in sequence, wherein the operation of the disk blocks is to eliminate the cache data on the disk blocks.
In this embodiment of the present application, the following processing includes eliminating the buffered data on the disk block according to the operation sequence of the disk block:
obtaining a disk block index from the tail of the elimination queue;
determining a corresponding disk block according to the disk block index;
and eliminating the cache data on the disk block.
Because the disk block operation sequence determined in step S102 has preferentially inserted or moved the disk block with a large hole or a large hole proportion to the tail of the elimination queue, the disk block index at the tail of the elimination queue is taken out to eliminate the cache data on the disk block indicated by the disk block index, so that the disk space utilization rate can be saved.
An exemplary implementation manner of the embodiment of the present application includes that, considering the access heat of the disk blocks, determining the operation sequence of the disk blocks according to the access heat of the disk blocks, and combining the hole values or hole proportions of the disk blocks, once the disk blocks meeting the hole size condition exist, preferentially eliminating the disk blocks meeting the hole size condition. The specific treatment comprises the following steps:
counting the access heat value of each disk block, wherein the access heat value is the number of times of access of cache data on the disk block in a certain time;
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block index according to the access heat value of the disk blocks; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: accessing the order of the heat values from big to small;
the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks comprises the following steps:
inserting or moving a disk block index of a disk block with a hole value or a hole proportion meeting the hole size condition to the tail part of the elimination queue;
The step of eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks comprises the following steps:
and eliminating the cache data on the disk blocks according to the disk block index at the tail part of the elimination queue.
Based on the embodiment of the method for eliminating the cache data on the disk block provided in the first embodiment of the present application, the second embodiment of the present application provides a second method for eliminating the cache data on the disk block.
The second method for eliminating the buffered data on the disk block is described below with reference to fig. 4 to 6. Since this embodiment is based on the first embodiment of the present application, the description is relatively simple, and the relevant parts should be referred to the corresponding description of the first embodiment of the present application.
The method for eliminating the cache data on the magnetic disk shown in fig. 4 comprises the following steps: step S401 to step S403.
In step S401, an access heat value of a disk block for caching data is determined.
The data is cached on the disk, so that a user can quickly acquire content stored in the cloud, in order to facilitate management of the disk, the disk is generally divided into a plurality of blocks according to fixed length for management, each fixed-length block is a disk block, the disk block is a basic unit for management of the disk, for example, the disk is divided into a plurality of disk blocks according to 8M, and the space size of one disk block is 8M. How to eliminate the cache data on the disk block directly affects the availability of disk space utilization and the cache hit rate. In the prior art, new data is generally covered with old data on a disk according to the offset sequence of disk blocks, and after the whole disk is covered once, the new data is covered from the beginning again.
The application provides a method for eliminating cache data on a disk block, which determines a more reasonable elimination sequence for the disk block according to the access heat of the disk block.
This step is to determine the access heat value of the disk block. The access heat is an index for measuring how frequently data is accessed.
According to the embodiment of the application, the access heat value of the disk block is determined according to the number of times that the data on the disk block is accessed in a certain time.
Step S402, determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the access heat value of the disk blocks.
The method comprises the steps of determining the operation sequence of the disk blocks, so that the disk blocks are operated one by one according to the operation sequence of the disk blocks in the subsequent steps, and cache data on the disk blocks are eliminated.
In this embodiment of the present application, specifically includes:
determining the heat sequencing of the disk blocks according to the access heat value of the disk blocks;
and taking the sequence of the access heat value from low to high as the disk block operation sequence of the cache data on the obsolete disk blocks. Therefore, the cached data on the disk block with the lowest access heat value can be further preferentially eliminated, so that the frequently accessed data can be uncovered with higher probability, the data are not required to be frequently acquired from the original server, and the disk cache is effectively utilized.
In the embodiment of the application, the disk block index is introduced, the logically eliminating queue for identifying the operation sequence of the disk block is maintained through the disk block index, namely, the disk block index is stored in the eliminating queue, when the disk block is operated according to the operation sequence of the disk block identified by the eliminating queue, the disk block index at the corresponding position is taken out, the real disk block is found according to the disk block index, and the cache data on the disk block is eliminated. The disk block operation sequence is determined specifically by the following processes:
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block index according to the access heat value of each disk block; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: accessing the order of the heat values from big to small;
and taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
In the embodiment of the present application, to determine a more appropriate disk block operation sequence, the following processing is further performed:
moving the disk block index according to the change of the access heat value of the disk block corresponding to the disk block index in the elimination queue; and/or the number of the groups of groups,
Inserting a disk block index of a disk block with the access heat value meeting the access heat condition into an elimination queue; and/or the number of the groups of groups,
and moving the disk block index of the disk block with the lowest access heat value to the tail part of the elimination queue.
In an exemplary implementation manner of the embodiment of the present application, in order to construct the elimination queue by using a linked list structure, specifically, according to the high-low ordering of the access heat value of the disk block, the elimination queue is generated by using the disk block index by adopting the linked list structure. And in the process of generating the elimination queue by using each disk block index by adopting a linked list structure, the method comprises the following steps of:
and inserting the disk block index with high access heat value into the head part of the linked list, and inserting the disk block index with low access heat value into the tail part of the linked list.
Referring to fig. 5, fig. 5 is a schematic diagram illustrating a linked list establishment according to a disk block index, including: a disk 501 for dividing into disk blocks for management and a elimination queue 502 formed by the index of the disk blocks; an index is built for each disk block of 501 in the memory, the elimination sequence of the disk blocks is determined, and then the index of the eliminated disk blocks is formed into an elimination queue 502 by using a linked list structure. When 502 is generated, the disc block index of the disc block with low access heat value is placed at the tail part of the linked list, the disc block index of the disc block with high access heat value is placed at the head part of the linked list, for example, the disc block with low access heat value indicated by 15 and the disc block with low access heat value indicated by 23810 are inserted into the tail part of the linked list one by one; the disk block access heat value indicated by 16 is highest in the linked list head, and the access heat values of the disk blocks indicated by 13, 14, 23808 and 23809 are higher, so that the position is close to the linked list head. When the cached data (or old data is covered) needs to be eliminated to vacate the disk space to write new data, a disk block with low access heat value is found out from the tail part of the linked list, and the cached data on the disk block is deleted.
The processing can enable indexes of the disk blocks with low access heat to be placed at the tail part of the elimination queue as much as possible, when cache data on the corresponding disk blocks are eliminated by the index of the disk blocks obtained from the tail part of the elimination queue, the disk blocks with low access heat can be eliminated preferentially, the utilization rate of disk space is improved, the disk blocks with frequently accessed cache data are reserved preferentially, and the utilization rate of disk cache can be improved.
Step S403, eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
The step is to operate the disk blocks in sequence, wherein the operation of the disk blocks is to eliminate the cache data on the disk blocks.
In this embodiment of the present application, the following processing includes eliminating the buffered data on the disk block according to the operation sequence of the disk block:
obtaining a disk block index from the tail of the elimination queue;
determining a corresponding disk block according to the disk block index;
and eliminating the cache data on the disk block.
An exemplary implementation manner of the embodiment of the present application includes that, considering the size of a hole of a disk block, determining an operation sequence of the disk block according to the access heat of the disk block, and combining the hole value or the hole proportion of the disk block, once the disk block meeting the hole size condition exists, preferentially eliminating the disk block meeting the hole size condition. The specific treatment comprises the following steps:
Counting the hole value of each disk block, wherein the hole value is the size of the disk space of which the data is still in an occupied state after all or part of data of cache data on the disk block is deleted;
and inserting the disc block index of the disc block with the hole value meeting the hole size condition into the elimination queue or moving the disc block index to the tail part of the elimination queue.
Fig. 6 is a schematic diagram of moving a disk block index in a linked list, in a retire queue 602 formed by the disk block indexes, when a hole value or a hole proportion on a disk block indicated by 23809 becomes large, a hole size condition is met, for example, the hole proportion reaches a hole threshold value 80%, and the disk block index 23809 is directly moved from a position originally close to the head of the linked list to a position close to the tail of the linked list without considering the access heat of the disk block, so that the buffered data on the disk block can be retired preferentially as much as possible, and the relative retire sequence of other disk blocks is not changed.
The operation sequence of the disk blocks is determined according to the access heat of the disk blocks and the size of the holes of the disk blocks, so that the cache data on the disk blocks are eliminated, and the disk blocks with low access heat values and meeting the hole conditions can be eliminated preferentially, so that the data of the disk blocks which are frequently accessed and have no holes or small holes are not eliminated frequently, and the cache hit rate and the efficiency of disk cache are improved.
Corresponding to the embodiment of the method for eliminating the cache data on the disk block provided in the first embodiment of the present application, a third embodiment of the present application provides an apparatus for eliminating the cache data on the disk block.
Referring to fig. 7, a schematic diagram of an apparatus for eliminating cache data on a disk block according to a third embodiment of the present application is shown. Since the apparatus embodiments are substantially similar to the method embodiments, the description is relatively simple, and reference should be made to the corresponding descriptions of the method embodiments for relevant parts.
The device for eliminating the cache data on the disk block shown in fig. 7 comprises:
a hole size determining unit 701, configured to determine a hole value or a hole proportion of a disk block for caching data;
an operation sequence determining unit 702, configured to determine a disk block operation sequence of eliminating cache data on a disk block according to a hole value or a hole proportion of the disk block;
and the elimination unit 703 is configured to eliminate the buffered data on the disk blocks according to the operation sequence of the disk blocks.
Optionally, the hole size determining unit 701 is specifically configured to:
determining a cavity of a disk block, wherein after all or part of data of cache data on the disk block is deleted, if the disk space occupied by the deleted data is not data but still in an occupied state, the disk space is the cavity of the disk block;
Determining the space size occupied by the cavity of the disk block, wherein the space size is the cavity value of the disk block; or alternatively, the first and second heat exchangers may be,
and determining the ratio of the cavity value of the disk block to the total space size of the disk block, wherein the ratio is the cavity ratio of the disk block.
Optionally, the operation sequence determining unit 702 is specifically configured to:
and sequencing the disk blocks according to the size of the hole value or the size of the hole proportion to obtain the disk block operation sequence of the cache data on the eliminated disk blocks.
Optionally, the operation sequence determining unit 702 is specifically configured to:
and taking the sequence of the hole value or the hole proportion from large to small as the disk block operation sequence of the cache data on the obsolete disk blocks.
Optionally, the operation sequence determining unit 702 is specifically configured to:
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using each disk block index according to the size of the hole value or the hole proportion of each disk block; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: the order of the void value or the void proportion is from small to large;
And taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
Optionally, the operation sequence determining unit 702 includes a linked list subunit, where the linked list subunit is configured to:
and generating the elimination queue by using each disk block index through adopting a linked list structure according to the size of the hole value or the size sorting of the hole proportion of the disk block.
Optionally, the linked list subunit is specifically configured to:
inserting the disk block index with small hole proportion into the head part of the linked list, and inserting the disk block index with large hole proportion into the tail part of the linked list; or alternatively, the first and second heat exchangers may be,
and inserting the disk block index with small hole value into the head part of the linked list, and inserting the disk block index with large hole value into the tail part of the linked list.
Optionally, the device for eliminating the cache data on the disk block further includes an index operation unit, where the index operation unit is configured to:
moving the disc block index in the elimination queue according to the change of the hole value or the hole proportion of the disc block corresponding to the disc block index; and/or the number of the groups of groups,
moving the disc block index of the disc block with the hole value or the hole proportion meeting the hole size condition to the tail part of the elimination queue; and/or the number of the groups of groups,
and moving the disk block index of the disk block with the largest hole value or the largest hole proportion to the tail part of the elimination queue.
Optionally, the elimination unit 703 is specifically configured to:
obtaining a disk block index from the tail of the elimination queue;
determining a corresponding disk block according to the disk block index;
and eliminating the cache data on the disk block.
Optionally, the device for eliminating the cache data on the disk block includes an access heat determining unit, where the access heat determining unit is configured to:
counting the access heat value of each disk block, wherein the access heat value is the number of times of access of cache data on the disk block in a certain time;
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block index according to the access heat value of the disk blocks; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: accessing the order of the heat values from big to small;
accordingly, the operation sequence determining unit 702 is specifically configured to:
inserting or moving a disk block index of a disk block with a hole value or a hole proportion meeting the hole size condition to the tail part of the elimination queue;
the elimination unit 703 is specifically configured to:
And eliminating the cache data on the disk blocks according to the disk block index at the tail part of the elimination queue.
Optionally, the device for eliminating the cache data on the disk block further includes a condition elimination unit, where the condition elimination unit is specifically configured to:
determining a disk block with a hole value or a hole proportion meeting the hole size condition;
the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks comprises the following steps:
and determining the operation sequence of the disk blocks with the hole values or the hole proportions meeting the hole size conditions according to the hole values or the hole proportions of the disk blocks with the hole sizes meeting the hole size conditions.
Optionally, the condition elimination unit is specifically configured to:
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block indexes of the disk blocks with the hole values or the hole proportions according to the hole values or the hole proportions of the disk blocks with the hole sizes; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: the order of the void value or the void proportion is from small to large;
And taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
Corresponding to the embodiment of the method for eliminating the cache data on the disk block provided by the second embodiment of the application, the fourth embodiment of the application provides a second device for eliminating the cache data on the disk block.
Referring to fig. 8, a schematic diagram of an apparatus for eliminating cache data on a disk block according to a fourth embodiment of the present application is shown. Since the apparatus embodiments are substantially similar to the method embodiments, the description is relatively simple, and reference should be made to the corresponding descriptions of the method embodiments for relevant parts.
The device for eliminating the cache data on the disk block shown in fig. 8 comprises:
an access heat determining unit 801, configured to determine an access heat value of a disk block for caching data;
an operation sequence determining unit 802, configured to determine a disk block operation sequence of eliminating cache data on a disk block according to an access heat value of the disk block;
and the elimination unit 803 is configured to eliminate the buffered data on the disk blocks according to the operation sequence of the disk blocks.
Optionally, the access heat determining unit 801 is specifically configured to:
and determining the access heat value of the disk block according to the number of times the data on the disk block is accessed in a certain time.
Optionally, the operation sequence determining unit 802 is specifically configured to:
determining the heat sequencing of the disk blocks according to the access heat value of the disk blocks;
and taking the sequence of the access heat value from low to high as the disk block operation sequence of the cache data on the obsolete disk blocks.
Optionally, the operation sequence determining unit 802 is specifically configured to:
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block index according to the access heat value of each disk block; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: accessing the order of the heat values from big to small;
and taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
Optionally, the eliminating unit 803 is specifically configured to:
obtaining a disk block index from the tail of the elimination queue;
determining a corresponding disk block according to the disk block index;
and eliminating the cache data on the disk block.
Optionally, the device for eliminating the cache data on the disk block further includes an index operation unit, where the index operation unit is configured to:
Moving the disk block index according to the change of the access heat value of the disk block corresponding to the disk block index in the elimination queue; and/or the number of the groups of groups,
inserting a disk block index of a disk block with the access heat value meeting the access heat condition into an elimination queue; and/or the number of the groups of groups,
and moving the disk block index of the disk block with the lowest access heat value to the tail part of the elimination queue.
Optionally, the operation sequence determining unit 802 includes a linked list subunit, where the linked list subunit is specifically configured to:
and generating the elimination queue by using a disk block index by adopting a linked list structure according to the high-low ordering of the access heat value of the disk block.
Optionally, the linked list subunit is specifically configured to:
and inserting the disk block index with high access heat value into the head part of the linked list, and inserting the disk block index with low access heat value into the tail part of the linked list.
Optionally, the device for eliminating the cache data on the disk block further includes a hole subunit, where the hole subunit is configured to:
counting the hole value of each disk block, wherein the hole value is the size of the disk space of which the data is still in an occupied state after all or part of data of cache data on the disk block is deleted;
and inserting the disc block index of the disc block with the hole value meeting the hole size condition into the elimination queue or moving the disc block index to the tail part of the elimination queue.
The fifth embodiment of the present application provides an electronic device for implementing the method for eliminating the cached data on the disk block provided in the first embodiment, and referring to fig. 9, a schematic diagram of an electronic device provided in the fifth embodiment of the present application is shown.
The embodiments of the electronic device provided in the present application are described more simply, and the relevant portions should be referred to the corresponding descriptions of the first embodiment.
A fifth embodiment of the present application provides an electronic device, including:
a memory 901 and a processor 902;
the memory 901 is configured to store computer executable instructions, and the processor 902 is configured to execute the computer executable instructions:
determining a hole value or a hole proportion of a disk block for caching data;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks;
and eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
Optionally, the processor 902 is further configured to execute the following computer executable instructions:
after all or part of the data of the cache data on the disk block is deleted, if the disk space occupied by the deleted data is not data but still in an occupied state, the disk space is a cavity of the disk block;
Determining the space size occupied by the cavity of the disk block, wherein the space size is the cavity value of the disk block; or alternatively, the first and second heat exchangers may be,
and determining the ratio of the cavity value of the disk block to the total space size of the disk block, wherein the ratio is the cavity ratio of the disk block.
Optionally, the processor 902 is further configured to execute the following computer executable instructions:
and sequencing the disk blocks according to the size of the hole value or the size of the hole proportion to obtain the disk block operation sequence of the cache data on the eliminated disk blocks.
Optionally, the processor 902 is further configured to execute the following computer executable instructions:
and taking the sequence of the hole value or the hole proportion from large to small as the disk block operation sequence of the cache data on the obsolete disk blocks.
Optionally, the processor 902 is further configured to execute the following computer executable instructions:
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using each disk block index according to the size of the hole value or the hole proportion of each disk block; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: the order of the void value or the void proportion is from small to large;
And taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
Optionally, the processor 902 is further configured to execute the following computer executable instructions:
and generating the elimination queue by using each disk block index through adopting a linked list structure according to the size of the hole value or the size sorting of the hole proportion of the disk block.
Optionally, the processor 902 is further configured to execute the following computer executable instructions:
inserting the disk block index with small hole proportion into the head part of the linked list, and inserting the disk block index with large hole proportion into the tail part of the linked list; or alternatively, the first and second heat exchangers may be,
and inserting the disk block index with small hole value into the head part of the linked list, and inserting the disk block index with large hole value into the tail part of the linked list.
Optionally, the processor 902 is further configured to execute the following computer executable instructions:
moving the disc block index in the elimination queue according to the change of the hole value or the hole proportion of the disc block corresponding to the disc block index; and/or the number of the groups of groups,
moving the disc block index of the disc block with the hole value or the hole proportion meeting the hole size condition to the tail part of the elimination queue; and/or the number of the groups of groups,
and moving the disk block index of the disk block with the largest hole value or the largest hole proportion to the tail part of the elimination queue.
Optionally, the processor 902 is further configured to execute the following computer executable instructions:
obtaining a disk block index from the tail of the elimination queue;
determining a corresponding disk block according to the disk block index;
and eliminating the cache data on the disk block.
Optionally, the processor 902 is further configured to execute the following computer executable instructions:
counting the access heat value of each disk block, wherein the access heat value is the number of times of access of cache data on the disk block in a certain time;
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block index according to the access heat value of the disk blocks; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: accessing the order of the heat values from big to small;
the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks comprises the following steps:
inserting or moving a disk block index of a disk block with a hole value or a hole proportion meeting the hole size condition to the tail part of the elimination queue;
The step of eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks comprises the following steps:
and eliminating the cache data on the disk blocks according to the disk block index at the tail part of the elimination queue.
Optionally, the processor 902 is further configured to execute the following computer executable instructions:
determining a disk block with a hole value or a hole proportion meeting the hole size condition;
the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks comprises the following steps:
and determining the operation sequence of the disk blocks with the hole values or the hole proportions meeting the hole size conditions according to the hole values or the hole proportions of the disk blocks with the hole sizes meeting the hole size conditions.
Optionally, the processor 902 is further configured to execute the following computer executable instructions:
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block indexes of the disk blocks with the hole values or the hole proportions according to the hole values or the hole proportions of the disk blocks with the hole sizes; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: the order of the void value or the void proportion is from small to large;
And taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
A sixth embodiment of the present application provides an electronic device for implementing the method for eliminating the buffered data on the disk block provided in the second embodiment, and the schematic diagram is similar to fig. 9.
The embodiments of the electronic device provided in the present application are described in a relatively simple manner, and reference should be made to the corresponding descriptions of the second embodiment.
A sixth embodiment of the present application provides an electronic device, including:
a memory, and a processor;
the memory is for storing computer-executable instructions, and the processor is for executing the computer-executable instructions:
determining an access heat value of a disk block for caching data;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the access heat value of the disk blocks;
and eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
Optionally, the processor is further configured to execute the following computer executable instructions:
and determining the access heat value of the disk block according to the number of times the data on the disk block is accessed in a certain time.
Optionally, the processor is further configured to execute the following computer executable instructions:
Determining the heat sequencing of the disk blocks according to the access heat value of the disk blocks;
and taking the sequence of the access heat value from low to high as the disk block operation sequence of the cache data on the obsolete disk blocks.
Optionally, the processor is further configured to execute the following computer executable instructions:
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block index according to the access heat value of each disk block; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: accessing the order of the heat values from big to small;
and taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
Optionally, the processor is further configured to execute the following computer executable instructions:
obtaining a disk block index from the tail of the elimination queue;
determining a corresponding disk block according to the disk block index;
and eliminating the cache data on the disk block.
Optionally, the processor is further configured to execute the following computer executable instructions:
moving the disk block index according to the change of the access heat value of the disk block corresponding to the disk block index in the elimination queue; and/or the number of the groups of groups,
Inserting a disk block index of a disk block with the access heat value meeting the access heat condition into an elimination queue; and/or the number of the groups of groups,
and moving the disk block index of the disk block with the lowest access heat value to the tail part of the elimination queue.
Optionally, the processor is further configured to execute the following computer executable instructions:
and generating the elimination queue by using a disk block index by adopting a linked list structure according to the high-low ordering of the access heat value of the disk block.
Optionally, the processor is further configured to execute the following computer executable instructions:
and inserting the disk block index with high access heat value into the head part of the linked list, and inserting the disk block index with low access heat value into the tail part of the linked list.
Optionally, the processor is further configured to execute the following computer executable instructions:
counting the hole value of each disk block, wherein the hole value is the size of the disk space of which the data is still in an occupied state after all or part of data of cache data on the disk block is deleted;
and inserting the disc block index of the disc block with the hole value meeting the hole size condition into the elimination queue or moving the disc block index to the tail part of the elimination queue.
A seventh embodiment of the present application provides a storage device for the method provided in the first embodiment, which is described in a relatively simple manner, and relevant portions refer to corresponding descriptions of the first embodiment.
The present application provides a storage device storing instructions that are capable of being loaded by a processor and performing the steps of:
determining a hole value or a hole proportion of a disk block for caching data;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks;
and eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
An eighth embodiment of the present application provides a storage device for the method provided in the second embodiment, which is described in a relatively simple manner, and relevant portions refer to corresponding descriptions of the second embodiment.
The present application provides a storage device storing instructions that are capable of being loaded by a processor and performing the steps of:
determining an access heat value of a disk block for caching data;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the access heat value of the disk blocks;
and eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
In one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.
1. Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer readable media, as defined herein, does not include non-transitory computer readable media (transmission media), such as modulated data signals and carrier waves.
2. It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
While the preferred embodiment has been described, it is not intended to limit the invention thereto, and any person skilled in the art may make variations and modifications without departing from the spirit and scope of the present invention, so that the scope of the present invention shall be defined by the claims of the present application.

Claims (25)

1. A method of eliminating cached data on a disk block, comprising:
determining a hole value or a hole proportion of a disk block for caching data; wherein, the determining the hole value or hole proportion of the disk block for caching data includes: determining a cavity of a disk block, wherein after all or part of data of cache data on the disk block is deleted, if the disk space occupied by the deleted data is not data but still in an occupied state, the disk space is the cavity of the disk block; determining the space size occupied by the cavity of the disk block, wherein the space size is the cavity value of the disk block; or determining the ratio of the cavity value of the disk block to the total space size of the disk block, wherein the ratio is the cavity ratio of the disk block;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks; the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks comprises the following steps: sorting the disk blocks according to the size of the hole value or the size of the hole proportion to obtain the disk block operation sequence of the cache data on the obsolete disk blocks;
And eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
2. The method of claim 1, wherein the sorting the disk blocks according to the hole value size or the hole proportion size to obtain the disk block operation sequence of the cache data on the obsolete disk blocks comprises:
and taking the sequence of the hole value or the hole proportion from large to small as the disk block operation sequence of the cache data on the obsolete disk blocks.
3. The method of claim 1, wherein determining the order of operations of the disk blocks to eliminate the buffered data on the disk blocks based on the hole values or the hole proportions of the disk blocks comprises:
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using each disk block index according to the size of the hole value or the hole proportion of each disk block; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: the order of the void value or the void proportion is from small to large;
and taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
4. The method of claim 3, wherein generating a retire queue for retired disk blocks using each disk block index based on the size of the hole fraction for each disk block, comprises:
and generating the elimination queue by using each disk block index through adopting a linked list structure according to the size of the hole value or the size sorting of the hole proportion of the disk block.
5. The method of claim 4, wherein the generating the retirement queue using each disk block index in a linked list structure according to the size of the hole value or the size of the hole proportion of the disk blocks comprises:
inserting the disk block index with small hole proportion into the head part of the linked list, and inserting the disk block index with large hole proportion into the tail part of the linked list; or alternatively, the first and second heat exchangers may be,
and inserting the disk block index with small hole value into the head part of the linked list, and inserting the disk block index with large hole value into the tail part of the linked list.
6. A method according to claim 3, further comprising:
moving the disc block index in the elimination queue according to the change of the hole value or the hole proportion of the disc block corresponding to the disc block index; and/or the number of the groups of groups,
moving the disc block index of the disc block with the hole value or the hole proportion meeting the hole size condition to the tail part of the elimination queue; and/or the number of the groups of groups,
And moving the disk block index of the disk block with the largest hole value or the largest hole proportion to the tail part of the elimination queue.
7. The method of claim 3, wherein the eliminating the buffered data on the disk blocks in the order of operation of the disk blocks comprises:
obtaining a disk block index from the tail of the elimination queue;
determining a corresponding disk block according to the disk block index;
and eliminating the cache data on the disk block.
8. The method as recited in claim 1, further comprising:
counting the access heat value of each disk block, wherein the access heat value is the number of times of access of cache data on the disk block in a certain time;
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block index according to the access heat value of the disk blocks; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: accessing the order of the heat values from big to small;
the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks comprises the following steps:
Inserting or moving a disk block index of a disk block with a hole value or a hole proportion meeting the hole size condition to the tail part of the elimination queue;
the step of eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks comprises the following steps:
and eliminating the cache data on the disk blocks according to the disk block index at the tail part of the elimination queue.
9. The method as recited in claim 1, further comprising:
determining a disk block with a hole value or a hole proportion meeting the hole size condition;
the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks comprises the following steps:
and determining the operation sequence of the disk blocks with the hole values or the hole proportions meeting the hole size conditions according to the hole values or the hole proportions of the disk blocks with the hole sizes meeting the hole size conditions.
10. The method according to claim 9, wherein determining the operation order of the disk blocks for which the hole value or the hole ratio of the buffered data on the eliminated disk block meets the hole size condition according to the hole value or the hole ratio of the disk block meeting the hole size condition comprises:
Establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block indexes of the disk blocks with the hole values or the hole proportions according to the hole values or the hole proportions of the disk blocks with the hole sizes; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: the order of the void value or the void proportion is from small to large;
and taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
11. A method of eliminating cached data on a disk block, comprising:
determining an access heat value of a disk block for caching data;
determining a hole value or a hole proportion of a disk block for caching data; wherein, the determining the hole value or hole proportion of the disk block for caching data includes: determining a cavity of a disk block, wherein after all or part of data of cache data on the disk block is deleted, if the disk space occupied by the deleted data is not data but still in an occupied state, the disk space is the cavity of the disk block;
Determining the space size occupied by the cavity of the disk block, wherein the space size is the cavity value of the disk block, or determining the ratio of the cavity value of the disk block to the total space size of the disk block, and the ratio is the cavity ratio of the disk block;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the size of the hole values or the size of the hole proportion of the disk blocks and the access heat value of the disk blocks;
and eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
12. The method of claim 11, wherein determining the access heat value for the disk block for caching data comprises:
and determining the access heat value of the disk block according to the number of times the data on the disk block is accessed in a certain time.
13. The method of claim 11, wherein determining the order of operations for the disk blocks to eliminate the buffered data on the disk blocks based on the size of the hole values or the size of the hole ratios of the disk blocks and the access heat values of the disk blocks comprises:
determining the heat sequencing of the disk blocks according to the access heat value of the disk blocks;
and taking the sequence of the access heat value from low to high as the disk block operation sequence of the cache data on the obsolete disk blocks.
14. The method of claim 11, wherein determining the order of operations for the disk blocks to eliminate the buffered data on the disk blocks based on the size of the hole values or the size of the hole ratios of the disk blocks and the access heat values of the disk blocks comprises:
establishing a disk block index for indicating the disk block for each disk block;
generating an elimination queue for eliminating the disk blocks by using the disk block index according to the access heat value of each disk block; the order of the disk blocks indicated by the disk block indexes stored in the order from the head of the queue to the tail of the queue in the elimination queue is as follows: accessing the order of the heat values from big to small;
and taking the sequence from the tail part of the queue to the head part of the queue as the disk block operation sequence.
15. The method of claim 14, wherein the eliminating the buffered data on the disk blocks in the order of disk block operation comprises:
obtaining a disk block index from the tail of the elimination queue;
determining a corresponding disk block according to the disk block index;
and eliminating the cache data on the disk block.
16. The method as recited in claim 14, further comprising:
Moving the disk block index according to the change of the access heat value of the disk block corresponding to the disk block index in the elimination queue; and/or the number of the groups of groups,
inserting a disk block index of a disk block with the access heat value meeting the access heat condition into an elimination queue; and/or the number of the groups of groups,
and moving the disk block index of the disk block with the lowest access heat value to the tail part of the elimination queue.
17. The method of claim 14, wherein generating a retire queue for retireing disk blocks using the disk block index based on the access heat value for each disk block comprises:
and generating the elimination queue by using a disk block index by adopting a linked list structure according to the high-low ordering of the access heat value of the disk block.
18. The method of claim 17, wherein the generating the retirement queue using a linked list structure according to a high-low ordering of access heat values for the disk blocks comprises:
and inserting the disk block index with high access heat value into the head part of the linked list, and inserting the disk block index with low access heat value into the tail part of the linked list.
19. The method as recited in claim 14, further comprising:
counting the hole value of each disk block, wherein the hole value is the size of the disk space of which the data is still in an occupied state after all or part of data of cache data on the disk block is deleted;
And inserting the disc block index of the disc block with the hole value meeting the hole size condition into the elimination queue or moving the disc block index to the tail part of the elimination queue.
20. An apparatus for eliminating cached data on a disk block, comprising:
the hole size determining unit is used for determining a hole value or a hole proportion of the disk block for caching data; wherein, the determining the hole value or hole proportion of the disk block for caching data includes: determining a cavity of a disk block, wherein after all or part of data of cache data on the disk block is deleted, if the disk space occupied by the deleted data is not data but still in an occupied state, the disk space is the cavity of the disk block; determining the space size occupied by the cavity of the disk block, wherein the space size is the cavity value of the disk block; or determining the ratio of the cavity value of the disk block to the total space size of the disk block, wherein the ratio is the cavity ratio of the disk block;
the operation sequence determining unit is used for determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks; the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks comprises the following steps: sorting the disk blocks according to the size of the hole value or the size of the hole proportion to obtain the disk block operation sequence of the cache data on the obsolete disk blocks;
And the elimination unit is used for eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
21. An apparatus for eliminating cached data on a disk block, comprising:
an access heat determining unit for determining an access heat value of a disk block for caching data;
the operation sequence determining unit is used for determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the size of the hole values or the size of the hole proportions of the disk blocks and the access heat value of the disk blocks;
the elimination unit is used for eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks;
wherein, still include:
determining a hole value or a hole proportion of a disk block for caching data; wherein, the determining the hole value or hole proportion of the disk block for caching data includes: determining a cavity of a disk block, wherein after all or part of data of cache data on the disk block is deleted, if the disk space occupied by the deleted data is not data but still in an occupied state, the disk space is the cavity of the disk block;
and determining the space size occupied by the cavity of the disk block, wherein the space size is the cavity value of the disk block, or determining the ratio of the cavity value of the disk block to the total space size of the disk block, and the ratio is the cavity ratio of the disk block.
22. An electronic device, comprising:
a memory, and a processor;
the memory is for storing computer-executable instructions, and the processor is for executing the computer-executable instructions:
determining a hole value or a hole proportion of a disk block for caching data; wherein, the determining the hole value or hole proportion of the disk block for caching data includes: determining a cavity of a disk block, wherein after all or part of data of cache data on the disk block is deleted, if the disk space occupied by the deleted data is not data but still in an occupied state, the disk space is the cavity of the disk block; determining the space size occupied by the cavity of the disk block, wherein the space size is the cavity value of the disk block; or determining the ratio of the cavity value of the disk block to the total space size of the disk block, wherein the ratio is the cavity ratio of the disk block;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks; the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks comprises the following steps: sorting the disk blocks according to the size of the hole value or the size of the hole proportion to obtain the disk block operation sequence of the cache data on the obsolete disk blocks;
And eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
23. An electronic device, comprising:
a memory, and a processor;
the memory is for storing computer-executable instructions, and the processor is for executing the computer-executable instructions:
determining an access heat value of a disk block for caching data;
determining a hole value or a hole proportion of a disk block for caching data; wherein, the determining the hole value or hole proportion of the disk block for caching data includes: determining a cavity of a disk block, wherein after all or part of data of cache data on the disk block is deleted, if the disk space occupied by the deleted data is not data but still in an occupied state, the disk space is the cavity of the disk block;
determining the space size occupied by the cavity of the disk block, wherein the space size is the cavity value of the disk block, or determining the ratio of the cavity value of the disk block to the total space size of the disk block, and the ratio is the cavity ratio of the disk block;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the size of the hole values or the size of the hole proportion of the disk blocks and the access heat value of the disk blocks;
And eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
24. A storage device storing instructions capable of being loaded by a processor and performing the steps of:
determining a hole value or a hole proportion of a disk block for caching data; wherein, the determining the hole value or hole proportion of the disk block for caching data includes: determining a cavity of a disk block, wherein after all or part of data of cache data on the disk block is deleted, if the disk space occupied by the deleted data is not data but still in an occupied state, the disk space is the cavity of the disk block; determining the space size occupied by the cavity of the disk block, wherein the space size is the cavity value of the disk block; or determining the ratio of the cavity value of the disk block to the total space size of the disk block, wherein the ratio is the cavity ratio of the disk block;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks; the determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the hole values or the hole proportions of the disk blocks comprises the following steps: sorting the disk blocks according to the size of the hole value or the size of the hole proportion to obtain the disk block operation sequence of the cache data on the obsolete disk blocks;
And eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
25. A storage device storing instructions capable of being loaded by a processor and performing the steps of:
determining an access heat value of a disk block for caching data;
determining a hole value or a hole proportion of a disk block for caching data; wherein, the determining the hole value or hole proportion of the disk block for caching data includes: determining a cavity of a disk block, wherein after all or part of data of cache data on the disk block is deleted, if the disk space occupied by the deleted data is not data but still in an occupied state, the disk space is the cavity of the disk block;
determining the space size occupied by the cavity of the disk block, wherein the space size is the cavity value of the disk block, or determining the ratio of the cavity value of the disk block to the total space size of the disk block, and the ratio is the cavity ratio of the disk block;
determining the operation sequence of the disk blocks for eliminating the cache data on the disk blocks according to the size of the hole values or the size of the hole proportion of the disk blocks and the access heat value of the disk blocks;
and eliminating the cache data on the disk blocks according to the operation sequence of the disk blocks.
CN201810902088.4A 2018-08-09 2018-08-09 Method, device and equipment for eliminating cache data on disk block Active CN110825652B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810902088.4A CN110825652B (en) 2018-08-09 2018-08-09 Method, device and equipment for eliminating cache data on disk block

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810902088.4A CN110825652B (en) 2018-08-09 2018-08-09 Method, device and equipment for eliminating cache data on disk block

Publications (2)

Publication Number Publication Date
CN110825652A CN110825652A (en) 2020-02-21
CN110825652B true CN110825652B (en) 2023-06-13

Family

ID=69541536

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810902088.4A Active CN110825652B (en) 2018-08-09 2018-08-09 Method, device and equipment for eliminating cache data on disk block

Country Status (1)

Country Link
CN (1) CN110825652B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114579049A (en) * 2022-02-14 2022-06-03 阿里巴巴（中国）有限公司 Method and device for adjusting stored data, electronic equipment and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1172812A1 (en) * 2000-07-14 2002-01-16 O.T.B. Group B.V. Method and device for producing a DVD
CN101739346A (en) * 2009-12-04 2010-06-16 北京工业大学 Method for carrying out centralized control on internal memory of safety control module
CN104750715A (en) * 2013-12-27 2015-07-01 中国移动通信集团公司 Data elimination method, device and system in caching system and related server equipment
CN107305475A (en) * 2016-04-22 2017-10-31 中国科学院微电子研究所 A kind of flashcache mixes the buffer scheduling method and system of storage system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1172812A1 (en) * 2000-07-14 2002-01-16 O.T.B. Group B.V. Method and device for producing a DVD
CN101739346A (en) * 2009-12-04 2010-06-16 北京工业大学 Method for carrying out centralized control on internal memory of safety control module
CN104750715A (en) * 2013-12-27 2015-07-01 中国移动通信集团公司 Data elimination method, device and system in caching system and related server equipment
CN107305475A (en) * 2016-04-22 2017-10-31 中国科学院微电子研究所 A kind of flashcache mixes the buffer scheduling method and system of storage system

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Jae-Hoon An 等.Block I/O Accelerator Technique to Improve Data Access Performance based Linux Multiple Disk.RACS '16: Proceedings of the International Conference on Research in Adaptive and Convergent Systems.2016,全文. *
张剑,肖正文."虚拟存储"管理技术中的淘汰算法.安徽教育学院学报.2001,(第6期),全文. *
田令平.小型嵌入式操作系统内核设计与实现策略研究.中国优秀硕士学位论文全文数据库 .2006,(第10期),全文. *

Also Published As

Publication number Publication date
CN110825652A (en) 2020-02-21

Similar Documents

Publication Publication Date Title
US10133679B2 (en) Read cache management method and apparatus based on solid state drive
CN105205014B (en) A kind of date storage method and device
TWI691931B (en) Picture loading method and device
US9336152B1 (en) Method and system for determining FIFO cache size
CN108647151A (en) It is a kind of to dodge system metadata rule method, apparatus, equipment and storage medium entirely
WO2016141735A1 (en) Cache data determination method and device
US9727479B1 (en) Compressing portions of a buffer cache using an LRU queue
CN110555001B (en) Data processing method, device, terminal and medium
CN107491523A (en) The method and device of data storage object
US10466922B2 (en) Accelerating concurrent access to a file in a memory-based file system
CN108984130A (en) A kind of the caching read method and its device of distributed storage
CN109558456A (en) A kind of file migration method, apparatus, equipment and readable storage medium storing program for executing
CN112214420A (en) Data caching method, storage control device and storage equipment
CN109471843A (en) A kind of metadata cache method, system and relevant apparatus
CN110825652B (en) Method, device and equipment for eliminating cache data on disk block
CN105574008B (en) Task scheduling method and device applied to distributed file system
CN107102900B (en) Management method of shared memory space
US9858204B2 (en) Cache device, cache system, and cache method
US10606795B2 (en) Methods for managing a buffer cache and devices thereof
JP2018511131A (en) Hierarchical cost-based caching for online media
CN115934583A (en) Hierarchical caching method, device and system
CN110658999B (en) Information updating method, device, equipment and computer readable storage medium
US11003578B2 (en) Method and system for parallel mark processing
KR101463333B1 (en) Apparatus and method for caching web browser information based on resource type
CN107506156B (en) Io optimization method of block device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant