CN112114751A - IO data flushing method, device, equipment and readable storage medium - Google Patents
IO data flushing method, device, equipment and readable storage medium Download PDFInfo
- Publication number
- CN112114751A CN112114751A CN202010956151.XA CN202010956151A CN112114751A CN 112114751 A CN112114751 A CN 112114751A CN 202010956151 A CN202010956151 A CN 202010956151A CN 112114751 A CN112114751 A CN 112114751A
- Authority
- CN
- China
- Prior art keywords
- data
- brushing
- historical
- current
- flushing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000011010 flushing procedure Methods 0.000 title claims abstract description 74
- 238000000034 method Methods 0.000 title claims abstract description 44
- 230000001680 brushing effect Effects 0.000 claims abstract description 148
- 238000004364 calculation method Methods 0.000 claims abstract description 13
- 238000004590 computer program Methods 0.000 claims description 10
- 230000004044 response Effects 0.000 claims description 7
- 238000004891 communication Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 4
- 230000005236 sound signal Effects 0.000 description 4
- 239000013598 vector Substances 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003370 grooming effect Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/061—Improving I/O performance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- 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/0614—Improving the reliability of storage systems
- G06F3/0619—Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Security & Cryptography (AREA)
- Cleaning Implements For Floors, Carpets, Furniture, Walls, And The Like (AREA)
Abstract
The application discloses an IO data flushing method, an IO data flushing device, IO data flushing equipment and a computer readable storage medium, wherein the method comprises the following steps: obtaining a plurality of historical IO (input/output) lower brushing volumes; carrying out weighted average calculation on a plurality of historical IO (input/output) lower brushing amounts according to the lower brushing weight to obtain the current IO lower brushing amount; flushing IO data according to the current IO flushing amount; when IO data is refreshed, acquiring historical IO refreshing amount and performing weighted average calculation to obtain data amount refreshed this time, namely current IO refreshing amount, and refreshing the IO data according to the current IO refreshing amount; through considering historical IO down-brushing volume when carrying out IO data down-brushing at every turn, can be so that the data volume of IO down-brushing at every turn is in relatively steady state, avoids brushing few IO data or brushing extremely many IO data down suddenly, and then the holding performance is stable, avoids appearing the performance shake.
Description
Technical Field
The present application relates to the field of storage technologies, and in particular, to an IO data flushing method, an IO data flushing device, and a computer-readable storage medium.
Background
With the increasing of the application scale of big data, the processing requirement of mass data puts higher demands on the storage performance of the computer system, and users prefer to have a stable use environment. The related art has the problem of performance jitter, that is, the data amount of each time IO (i.e. I/O, Input/Output) data is flushed is the IO amount returned by the lower layer, and the IO amount may be extremely large or extremely small. Performance jitter causes long response delay of an I/O request, and affects user experience, and particularly in real-time transaction applications, large performance jitter affects user request completion time, and in severe cases, transaction data errors and even loss of critical data are caused.
Therefore, how to solve the problem of performance jitter in the related art is a technical problem to be solved by those skilled in the art.
Disclosure of Invention
In view of this, an object of the present application is to provide an IO data flushing method, an IO data flushing device, and a computer readable storage medium, which can enable a data amount of each IO flushing to be in a relatively stable state, maintain stable performance, and avoid performance jitter.
In order to solve the technical problem, the present application provides an IO data flushing method, including:
obtaining a plurality of historical IO (input/output) lower brushing volumes;
carrying out weighted average calculation on the plurality of historical IO lower brushing amounts according to the lower brushing weight to obtain the current IO lower brushing amount;
and flushing the IO data according to the current IO flushing amount.
Optionally, the obtaining of a plurality of historical IO lower brushing volumes includes:
judging whether the number of the historical IO lower brushing amount is smaller than a preset number or not;
if the number of the historical IO output brushes is not less than the preset number, obtaining the latest generated historical IO output brushes with the preset number;
and if the number of the historical IO lower brushing volumes is smaller than the preset number, obtaining the historical IO lower brushing volume, and obtaining the IO number fed back by the lower layer as the historical IO lower brushing volume.
Optionally, the obtaining of a plurality of historical IO lower brushing volumes includes:
obtaining a plurality of historical IO (input/output) brushing amounts according to a preset period;
and/or the presence of a gas in the gas,
and if the IO data to be brushed exist, acquiring a plurality of historical IO brushing amounts.
Optionally, the flushing IO data according to the current IO flushing amount includes:
judging whether the data volume of the IO data to be refreshed is larger than the current IO refresh volume;
if the data size of the IO data to be refreshed is larger than the current IO refreshing size, determining target IO data in the IO data to be refreshed, and refreshing the target IO data;
and if the data volume of the IO data to be refreshed is not larger than the current IO refreshing volume, refreshing all the IO data to be refreshed.
Optionally, the determining target IO data in the IO data to be flushed includes:
and determining the IO data to be refreshed acquired first as the target IO data according to the acquiring sequence of the IO data to be refreshed until the data volume of the target IO data reaches the current IO refreshing volume.
Optionally, the method further comprises:
if the data size of the IO data to be refreshed is larger than the current IO refreshing size, determining the current IO refreshing size as a new historical IO refreshing size;
and if the data volume of the IO data to be refreshed is not larger than the current IO refreshing volume, determining all the data volume of the IO data to be refreshed or the current IO refreshing volume as the new historical IO refreshing volume.
Optionally, after the IO data is flushed according to the current IO flushing amount, the method further includes:
and sending the lower brushing response information corresponding to the IO data.
The application also provides a device is brushed under IO data, include:
the acquisition module is used for acquiring a plurality of historical IO (input/output) lower brushing amounts;
the lower brushing amount calculating module is used for carrying out weighted average calculation on the plurality of historical IO lower brushing amounts according to the lower brushing weight to obtain the current IO lower brushing amount;
and the lower brushing module is used for brushing the IO data according to the current IO lower brushing amount.
The application also provides IO data down-brushing equipment, which comprises a memory and a processor, wherein:
the memory is used for storing a computer program;
the processor is configured to execute the computer program to implement the IO data flushing method.
The application also provides a computer readable storage medium for storing a computer program, wherein the computer program realizes the IO data flushing method when being executed by a processor.
According to the IO data downloading and brushing method, a plurality of historical IO downloading and brushing amounts are obtained; carrying out weighted average calculation on a plurality of historical IO (input/output) lower brushing amounts according to the lower brushing weight to obtain the current IO lower brushing amount; and brushing the IO data according to the current IO brushing amount.
Therefore, when IO data is refreshed, the historical IO refreshing amount is obtained and weighted average calculation is carried out to obtain the current refreshing amount, namely the current IO refreshing amount, and the IO data is refreshed according to the current IO refreshing amount. Historical IO down-brushing amount is considered when IO data down-brushing is carried out at every time, so that the data amount of IO down-brushing at every time is in a relatively stable state, few IO data or too many IO data are prevented from being suddenly down-brushed, performance stability is maintained, performance jitter is prevented from occurring, and the problem of performance jitter existing in the related art is solved.
In addition, the application also provides an IO data downloading and brushing device, IO data downloading and brushing equipment and a computer readable storage medium, and the beneficial effects are also achieved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of an IO data flushing method provided in an embodiment of the present application;
fig. 2 is a schematic structural diagram of an IO data flushing apparatus according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of an IO data flushing device according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Referring to fig. 1, fig. 1 is a flowchart of an IO data flushing method according to an embodiment of the present disclosure. The method comprises the following steps:
s101: and acquiring a plurality of historical IO (input/output) lower brushing amounts.
The historical IO lower brushing amount is the lower brushing amount adopted when IO data is brushed down before brushing down at this time, the specific number of the lower brushing amount is a preset number, and the specific size of the preset number is not limited, for example, 5 or 10 lower brushing amounts can be adopted. The form of the historical IO brushing amount is not limited, and may be a specific data amount, for example, 1 KB; or may be a multiple of the unit amount of data, for example may be 5, i.e. a 5 times unit amount of data. The specific obtaining time of the historical IO dropping amount is not limited, and in a feasible implementation manner, IO data can be dropped according to a preset period, so that the historical IO dropping amount can be obtained according to the preset period, for example, the historical IO dropping amount can be obtained according to a period of once per second; in another feasible implementation manner, IO data can be flushed in real time, specifically, whether IO data to be flushed exists can be detected after one-time flushing of the IO data is completed, and if IO data to be flushed exists, the IO data can be immediately flushed. Therefore, a plurality of historical IO brushing amounts can be obtained when the existence of the IO data to be brushed is detected.
Further, in one possible implementation, the number of historical IO down-runs may be less than a preset number. At this time, the IO number fed back by the lower layer may be used as the historical IO brushing amount, so as to calculate the current IO brushing amount. The S101 step may include:
step 11: and judging whether the number of the historical IO lower brushing amount is smaller than a preset number.
Step 12: and if the number of the historical IO down-brushing data is not less than the preset number, obtaining the latest generated historical IO down-brushing number with the preset number.
Step 13: and if the number of the lower layer is smaller than the preset number, obtaining the historical IO lower brushing amount, and obtaining the IO number fed back by the lower layer as the historical IO lower brushing amount.
When the historical IO lower brushing amount is obtained, whether the historical IO lower brushing amount is smaller than a preset amount or not can be judged first. If the number of the historical IO lower brush volumes is not less than the preset number, the number of the historical IO lower brush volumes is enough, and the current IO lower brush volume can be generated by directly using the historical IO lower brush volume, so that the newly generated historical IO lower brush volumes with the preset number are obtained. The IO data lower brushing operations are arranged in time sequence, the corresponding historical IO lower brushing amounts are also arranged in time sequence, in order to guarantee stable performance, the newly generated historical IO lower brushing amounts with the preset number can be obtained, namely, the historical IO data amounts are sequenced from short to long according to the time from the current moment, and the historical IO lower brushing amounts are obtained from the sequence head until the obtained historical IO lower brushing amounts reach the preset number.
If the number of the historical IO lower brushing amount is smaller than the preset number, the current IO lower brushing amount cannot be generated by only using the historical IO lower brushing amount, and the historical IO lower brushing amount needs to be supplemented. In this embodiment, the historical IO lower brushing amount may be supplemented by the IO number fed back by the lower layer. The number of the IO fed back by the lower layer may be the number of the IO fed back by the lower layer at the current time, or may be the number of the IO fed back by the lower layer before the earliest historical IO flushing amount. For example, in a possible embodiment, the number of the missing historical IO down-brushing amounts is 1, and at this time, the IO number fed back by the lower layer at the current time may be used as the historical IO down-brushing amount, or the IO number fed back by the lower layer in one down-brushing operation before the earliest generated historical IO down-brushing amount may be used as the historical IO down-brushing amount. In another feasible implementation manner, the number of the missing historical IO drop amounts is multiple, at this time, the historical IO drop amounts cannot be supplemented by only the IO amount fed back by the lower layer at the current time, and part of the IO amount fed back by the lower layer in one or more time of the operation of dropping before the earliest generated historical IO drop amount is inevitably obtained as the historical IO drop amount. The sum of the number of obtained IO and the number of historical IO down-stroke amounts should be equal to a preset number. The brushing amount of each historical IO can be stored in a vector form according to the time sequence, or can be in an array form. For example, when the number of historical IO lower brushing volumes is t, vectors with length t may be formed in chronological order.
S102: and carrying out weighted average calculation on the plurality of historical IO (input/output) lower brushing amounts according to the lower brushing weight to obtain the current IO lower brushing amount.
The brushing weight corresponds to each historical IO brushing amount and is used for carrying out weighted average calculation. It should be noted that, in a possible implementation, the specific size of each of the brushing weights may be the same, in this case, the average value is calculated for a plurality of historical IO brushing amounts. In another possible implementation, the specific values of the respective brushing weights are different, and since the historical IO brushing amount closer to the current time has a reference meaning, a larger brushing weight may be set for the historical IO brushing amount closer to the current time, and a smaller brushing weight may be set for the historical IO brushing amount farther from the current time. The embodiment does not limit the specific form of the brushing weight, and may be an integer or a fraction, for example. Each brush down weight may be stored in the form of a vector, which may be, for example, a ═ 1/t,1/t, …, 1/t.
After weighted average calculation is carried out by using the brushing weight, the current IO brushing amount can be obtained. The data volume of the current brushing is determined according to the historical brushing operation condition, so that the data volume of each brushing can be kept relatively stable, namely the data volume of each IO brushing is in a relatively stable state, and performance jitter is avoided.
S103: and brushing the IO data according to the current IO brushing amount.
And after the current IO lower brushing amount is determined, the IO data is brushed according to the current IO lower brushing amount. The embodiment does not limit the specific brushing mode of the IO data, and reference may be made to related technologies. The data amount of the data to be brushed waiting to be brushed down may be smaller than the current IO brushing amount or may be larger than the current IO brushing amount, so the S103 step may include:
step 21: and judging whether the data size of the IO data to be refreshed is larger than the current IO refresh size.
When the IO data is refreshed, whether the IO data to be refreshed is larger than the current IO refresh amount or not can be judged. The data size of IO data to be flushed may be a specific data size, or may be a multiple of a unit data size.
Step 22: and if the current IO download amount is larger than the current IO download amount, determining target IO data in the IO data to be downloaded, and downloading the target IO data.
If the data size of the IO data to be flushed is larger than the current IO flushing size, the IO data of the current IO flushing size can be flushed, and therefore the target IO data can be determined in the IO data to be flushed and can be flushed. The specific manner of determining the target IO data is not limited in this embodiment, for example, the target IO data may be determined according to the sequence of the acquisition time, or the target IO data may be determined according to the data weight of the IO data to be flushed. And after the target IO data is determined, the target IO data is refreshed.
In an embodiment, the target IO sequence may be determined according to the acquisition time sequence of the IO data to be flushed. Specifically, determining the target IO data in the IO data to be flushed may include:
step 31: determining the IO data to be brushed acquired first as target IO data according to the acquisition sequence of the IO data to be brushed until the data volume of the target IO data reaches the current IO brushing volume.
In order to avoid overlong IO request response time of the user, the target IO data can be determined according to the obtaining sequence of the IO data. Specifically, the IO data to be flushed are sorted according to the obtaining sequence, and the IO data to be flushed obtained first is determined as the target IO data until the data size of the target IO data reaches the current IO flushing size.
Step 23: and if the current IO download brushing amount is not larger than the current IO download brushing amount, downloading all IO data to be downloaded and brushed.
If the data size of the IO data to be flushed is not larger than the current IO flushing size, it indicates that the IO data cannot be flushed according to the current IO flushing size, and at this time, all IO data to be flushed can be flushed, that is, more IO data can be flushed as far as possible.
Further, after the current IO cut-off amount is determined, the current IO cut-off amount can be used for expanding the historical IO data amount so as to determine the current IO cut-off amount in the subsequent cut-off process. The method can also comprise the following steps:
step 41: and if the current IO lower brushing amount is larger than the current IO lower brushing amount, determining the current IO lower brushing amount as a new historical IO lower brushing amount.
Step 42: if the current IO lower brushing amount is not larger than the current IO lower brushing amount, determining the data amount of all IO data to be lower brushed or the current IO lower brushing amount as a new historical IO lower brushing amount
Because the data size of the IO data actually brushed may be different from the current IO brushing size, how to generate a new historical IO brushing size may be determined according to the data size of the IO data to be brushed. Specifically, when the data size of the IO data to be flushed is larger than the current IO flushing size, it is described that the data size of the current IO flushing is the current IO flushing size, and therefore the current IO flushing size can be determined as the new historical IO flushing size. If the data size of the IO data to be flushed is not greater than the current IO flushing size, it indicates that the data size of the IO data actually flushed may be smaller than the current IO flushing size, and at this time, the data size of all the IO data to be flushed may be determined as a new historical IO flushing size, or the current IO flushing size may be determined as a new historical IO flushing size. Determining the data volume of all IO data to be refreshed as a new historical IO refreshing volume, so that the current IO refreshing volume calculated subsequently is closer to the actual refreshing condition; the current IO lower brushing amount is determined as the new historical IO lower brushing amount, so that the current IO lower brushing amount calculated subsequently is more stable.
Further, after the IO data is flushed, flushing response information corresponding to the IO data may also be sent, so as to respond to the IO request of the user.
By applying the IO data downloading method provided by the embodiment of the application, when the IO data is downloaded, the historical IO downloading amount is obtained and weighted average calculation is performed to obtain the data amount of the current downloading, namely the current IO downloading amount, and the IO data is downloaded according to the current IO downloading amount. Historical IO down-brushing amount is considered when IO data down-brushing is carried out at every time, so that the data amount of IO down-brushing at every time is in a relatively stable state, few IO data or too many IO data are prevented from being suddenly down-brushed, performance stability is maintained, performance jitter is prevented from occurring, and the problem of performance jitter existing in the related art is solved.
The IO data flushing device provided in the embodiment of the present application is introduced below, and the IO data flushing device described below and the IO data flushing method described above may be referred to in a corresponding manner.
Referring to fig. 2, fig. 2 is a schematic structural diagram of an IO data flushing apparatus according to an embodiment of the present application, including:
an obtaining module 110, configured to obtain a plurality of historical IO brushing amounts;
the lower brushing amount calculating module 120 is configured to perform weighted average calculation on a plurality of historical IO lower brushing amounts according to the lower brushing weights to obtain a current IO lower brushing amount;
and the brushing-down module 130 is configured to brush down the IO data according to the current IO brushing-down amount.
Optionally, the obtaining module 110 includes:
the quantity judging unit is used for judging whether the quantity of the historical IO lower brushing quantity is smaller than a preset quantity or not;
the first obtaining unit is used for obtaining the historical IO lower brushing amount of the latest generated preset number if the historical IO lower brushing amount is not less than the preset number;
and the second obtaining unit is used for obtaining the historical IO lower brushing amount if the number of the lower layer lower brushing amount is smaller than the preset number, and obtaining the IO number fed back by the lower layer as the historical IO lower brushing amount.
Optionally, the obtaining module 110 includes:
the period obtaining unit is used for obtaining a plurality of historical IO (input/output) brushing amounts according to a preset period;
and/or the presence of a gas in the gas,
and the real-time acquisition unit is used for acquiring a plurality of historical IO (input/output) lower brushing amounts if IO data to be brushed are detected.
Optionally, lower brush module 130, comprising:
the lower brushing amount judging unit is used for judging whether the data amount of the IO data to be brushed is larger than the current IO lower brushing amount or not;
the part brushing unit is used for determining target IO data in the IO data to be brushed and brushing the target IO data if the data volume of the IO data to be brushed is larger than the current IO brushing volume;
and the all-down-brushing unit is used for down-brushing all the IO data to be down-brushed if the data volume of the IO data to be down-brushed is not larger than the current IO down-brushing volume.
Optionally, a partial under brush unit comprising:
and selecting the subunits, and determining the IO data to be brushed acquired first as target IO data according to the acquisition sequence of the IO data to be brushed until the data volume of the target IO data reaches the current IO brushing volume.
Optionally, the method further comprises:
the first determining module is used for determining the current IO lower brushing amount as a new historical IO lower brushing amount if the data amount of the IO data to be lower brushed is larger than the current IO lower brushing amount;
and the second determining module is used for determining the data size of all the IO data to be refreshed or the current IO refresh rate as the new historical IO refresh rate if the data size of the IO data to be refreshed is not larger than the current IO refresh rate.
Optionally, the method further comprises:
and the response module is used for sending the brushing response information corresponding to the IO data.
The IO data flushing device provided in the embodiment of the present application is introduced below, and the IO data flushing device described below and the IO data flushing method described above may be referred to in a corresponding manner.
Referring to fig. 3, fig. 3 is a schematic structural diagram of an IO data flushing device according to an embodiment of the present disclosure. Wherein the IO data swipe device 100 may include a processor 101 and a memory 102, and may further include one or more of a multimedia component 103, an information input/information output (I/O) interface 104, and a communication component 105.
The processor 101 is configured to control an overall operation of the IO data flushing device 100 to complete all or part of the steps in the IO data flushing method; memory 102 is used to store various types of data to support the operation of the IO data grooming device 100, which may include, for example, instructions for any application or method operating on the IO data grooming device 100, as well as application-related data. The Memory 102 may be implemented by any type or combination of volatile and non-volatile Memory devices, such as one or more of Static Random Access Memory (SRAM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Erasable Programmable Read-Only Memory (EPROM), Programmable Read-Only Memory (PROM), Read-Only Memory (ROM), magnetic Memory, flash Memory, magnetic or optical disk.
The multimedia component 103 may include a screen and an audio component. Wherein the screen may be, for example, a touch screen and the audio component is used for outputting and/or inputting audio signals. For example, the audio component may include a microphone for receiving external audio signals. The received audio signal may further be stored in the memory 102 or transmitted through the communication component 105. The audio assembly also includes at least one speaker for outputting audio signals. The I/O interface 104 provides an interface between the processor 101 and other interface modules, such as a keyboard, mouse, buttons, etc. These buttons may be virtual buttons or physical buttons. The communication component 105 is used for wired or wireless communication between the IO data downstroke device 100 and other devices. Wireless Communication, such as Wi-Fi, bluetooth, Near Field Communication (NFC), 2G, 3G, or 4G, or a combination of one or more of them, so that the corresponding Communication component 105 may include: Wi-Fi part, Bluetooth part, NFC part.
The IO data flushing Device 100 may be implemented by one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), controllers, microcontrollers, microprocessors, or other electronic components, and is configured to perform the IO data flushing method according to the above embodiments.
The following describes a computer-readable storage medium provided in an embodiment of the present application, and the computer-readable storage medium described below and the IO data flushing method described above may be referred to correspondingly.
The application also provides a computer readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps of the IO data flushing method are implemented.
The computer-readable storage medium may include: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts among the embodiments are referred to each other. The device disclosed by the embodiment corresponds to the method disclosed by the embodiment, so that the description is simple, and the relevant points can be referred to the method part for description.
Those of skill would further appreciate that the various illustrative components and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
Finally, it should also be noted that, herein, relationships such as first and second, etc., are intended only to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms include, or any other variation is intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that includes a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus.
The principle and the implementation of the present application are explained herein by applying specific examples, and the above description of the embodiments is only used to help understand the method and the core idea of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.
Claims (10)
1. An IO data flushing method is characterized by comprising the following steps:
obtaining a plurality of historical IO (input/output) lower brushing volumes;
carrying out weighted average calculation on the plurality of historical IO lower brushing amounts according to the lower brushing weight to obtain the current IO lower brushing amount;
and flushing the IO data according to the current IO flushing amount.
2. The IO data flushing method of claim 1, wherein the obtaining a plurality of historical IO flushing amounts comprises:
judging whether the number of the historical IO lower brushing amount is smaller than a preset number or not;
if the number of the historical IO output brushes is not less than the preset number, obtaining the latest generated historical IO output brushes with the preset number;
and if the number of the historical IO lower brushing volumes is smaller than the preset number, obtaining the historical IO lower brushing volume, and obtaining the IO number fed back by the lower layer as the historical IO lower brushing volume.
3. The IO data flushing method of claim 1, wherein the obtaining a plurality of historical IO flushing amounts comprises:
obtaining a plurality of historical IO (input/output) brushing amounts according to a preset period;
and/or the presence of a gas in the gas,
and if the IO data to be brushed exist, acquiring a plurality of historical IO brushing amounts.
4. The IO data flushing method according to any one of claims 1 to 3, wherein flushing IO data according to the current IO flushing amount includes:
judging whether the data volume of the IO data to be refreshed is larger than the current IO refresh volume;
if the data size of the IO data to be refreshed is larger than the current IO refreshing size, determining target IO data in the IO data to be refreshed, and refreshing the target IO data;
and if the data volume of the IO data to be refreshed is not larger than the current IO refreshing volume, refreshing all the IO data to be refreshed.
5. The IO data flushing method according to claim 4, wherein the determining target IO data in the IO data to be flushed includes:
and determining the IO data to be refreshed acquired first as the target IO data according to the acquiring sequence of the IO data to be refreshed until the data volume of the target IO data reaches the current IO refreshing volume.
6. The IO data flushing method of claim 4, further comprising:
if the data size of the IO data to be refreshed is larger than the current IO refreshing size, determining the current IO refreshing size as a new historical IO refreshing size;
and if the data volume of the IO data to be refreshed is not larger than the current IO refreshing volume, determining all the data volume of the IO data to be refreshed or the current IO refreshing volume as the new historical IO refreshing volume.
7. The IO data flushing method according to claim 1, wherein after flushing IO data according to the current IO flushing amount, further comprising:
and sending the lower brushing response information corresponding to the IO data.
8. The utility model provides a device is brushed down to IO data which characterized in that includes:
the acquisition module is used for acquiring a plurality of historical IO (input/output) lower brushing amounts;
the lower brushing amount calculating module is used for carrying out weighted average calculation on the plurality of historical IO lower brushing amounts according to the lower brushing weight to obtain the current IO lower brushing amount;
and the lower brushing module is used for brushing the IO data according to the current IO lower brushing amount.
9. An IO data flushing device, comprising a memory and a processor, wherein:
the memory is used for storing a computer program;
the processor is configured to execute the computer program to implement the IO data flushing method according to any one of claims 1 to 7.
10. A computer-readable storage medium storing a computer program, wherein the computer program when executed by a processor implements the IO data flushing method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010956151.XA CN112114751A (en) | 2020-09-11 | 2020-09-11 | IO data flushing method, device, equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010956151.XA CN112114751A (en) | 2020-09-11 | 2020-09-11 | IO data flushing method, device, equipment and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112114751A true CN112114751A (en) | 2020-12-22 |
Family
ID=73801945
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010956151.XA Pending CN112114751A (en) | 2020-09-11 | 2020-09-11 | IO data flushing method, device, equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112114751A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114138199A (en) * | 2021-11-30 | 2022-03-04 | 苏州浪潮智能科技有限公司 | Data brushing path management method and device, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108132756A (en) * | 2016-11-30 | 2018-06-08 | 成都华为技术有限公司 | A kind of method and apparatus that brush is carried out to storage array |
| CN110688066A (en) * | 2019-09-06 | 2020-01-14 | 苏州浪潮智能科技有限公司 | Data processing method, system, electronic equipment and storage medium |
| CN111177104A (en) * | 2019-12-28 | 2020-05-19 | 浪潮(北京)电子信息产业有限公司 | Log downloading and flushing method and device of NAS storage system |
-
2020
- 2020-09-11 CN CN202010956151.XA patent/CN112114751A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108132756A (en) * | 2016-11-30 | 2018-06-08 | 成都华为技术有限公司 | A kind of method and apparatus that brush is carried out to storage array |
| CN110688066A (en) * | 2019-09-06 | 2020-01-14 | 苏州浪潮智能科技有限公司 | Data processing method, system, electronic equipment and storage medium |
| CN111177104A (en) * | 2019-12-28 | 2020-05-19 | 浪潮(北京)电子信息产业有限公司 | Log downloading and flushing method and device of NAS storage system |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114138199A (en) * | 2021-11-30 | 2022-03-04 | 苏州浪潮智能科技有限公司 | Data brushing path management method and device, electronic equipment and storage medium |
| CN114138199B (en) * | 2021-11-30 | 2023-08-18 | 苏州浪潮智能科技有限公司 | Management method and device for data brushing path, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10958748B2 (en) | Resource push method and apparatus | |
| US10877639B2 (en) | Page shortcut display method, apparatus, terminal, and server, and storage medium | |
| WO2019114423A1 (en) | Method and apparatus for merging model prediction values, and device | |
| JP2020074154A (en) | Optimization of user interface data caching for future action | |
| CN110321273B (en) | Service statistics method and device | |
| US10887210B2 (en) | Online techniques for parameter mean and variance estimation in dynamic regression models | |
| CN109981785B (en) | Method and device for pushing information | |
| CN104883376A (en) | Application program recommendation method and terminal | |
| US11425012B2 (en) | Dynamically generating visualizations of data based on correlation measures and search history | |
| CN109582872A (en) | A kind of information-pushing method, device, electronic equipment and storage medium | |
| CN104243590A (en) | Resource object recommendation method and device | |
| CN107807841B (en) | Server simulation method, device, equipment and readable storage medium | |
| TW201933830A (en) | Traffic switching method and device and computer equipment | |
| CN112631939A (en) | Use case configuration method, use case configuration device, and readable storage medium | |
| CN112114751A (en) | IO data flushing method, device, equipment and readable storage medium | |
| US20180218415A1 (en) | Data center and information processing device | |
| CN111882039A (en) | Physical machine sales data prediction method and device, computer equipment and storage medium | |
| CN109948050B (en) | Information processing method and apparatus, storage medium, and electronic device | |
| US11683391B2 (en) | Predicting microservices required for incoming requests | |
| CN111131864A (en) | Data transmission method, device and system | |
| CN112564996A (en) | Pressure test flow scheduling method, pressure test flow control device and computer readable medium | |
| CN115086194A (en) | Data transmission method for cloud application, computing equipment and computer storage medium | |
| CN111210279B (en) | Target user prediction method and device and electronic equipment | |
| CN111880996B (en) | Bare metal data acquisition method, device, equipment and readable storage medium | |
| CN105786791B (en) | Data subject acquisition methods and 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20201222 |
|
| RJ01 | Rejection of invention patent application after publication |