CN116382569A - Data processing method, device, hard disk and medium - Google Patents
Data processing method, device, hard disk and medium Download PDFInfo
- Publication number
- CN116382569A CN116382569A CN202310184624.2A CN202310184624A CN116382569A CN 116382569 A CN116382569 A CN 116382569A CN 202310184624 A CN202310184624 A CN 202310184624A CN 116382569 A CN116382569 A CN 116382569A
- Authority
- CN
- China
- Prior art keywords
- read
- count
- data
- write command
- period
- 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
- 238000003672 processing method Methods 0.000 title claims abstract description 27
- 238000000034 method Methods 0.000 claims abstract description 35
- 238000004590 computer program Methods 0.000 claims description 4
- 238000004891 communication Methods 0.000 claims description 3
- 239000007787 solid Substances 0.000 abstract description 26
- 238000012005 ligant binding assay Methods 0.000 description 40
- 101100072644 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) INO2 gene Proteins 0.000 description 24
- 238000010586 diagram Methods 0.000 description 17
- 102100040381 Dol-P-Glc:Glc(2)Man(9)GlcNAc(2)-PP-Dol alpha-1,2-glucosyltransferase Human genes 0.000 description 8
- 101000890957 Homo sapiens Dol-P-Glc:Glc(2)Man(9)GlcNAc(2)-PP-Dol alpha-1,2-glucosyltransferase Proteins 0.000 description 8
- 230000009286 beneficial effect Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 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/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/064—Management of blocks
-
- 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/0659—Command handling arrangements, e.g. command buffers, queues, command scheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
- G06F3/0679—Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]
-
- 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 provides a data processing method, a device, a hard disk and a medium, wherein the method comprises the following steps: determining a first page allocation policy based on the read-write command data acquired during the first period; processing a first read-write command received after the first period based on the first page allocation policy; determining a second page allocation policy based on the read-write command data acquired during the second period; processing a second read-write command received after the second period based on the second page allocation policy. The problem of the solid state disk performance relatively poor among the prior art is solved.
Description
Technical Field
The present disclosure relates to the field of data processing technologies, and in particular, to a data processing method, a device, a hard disk, and a medium.
Background
Solid State Disks (SSDs) typically store data via Flash memory (NAND Flash Memory, nand Flash). The interface performance of SSD can reach more than 6Gb/sec, but the read-write rate of Nand Flash is only 40MB/sec, aiming at the difference in performance, a concurrent data distribution strategy is generally adopted to improve the throughput of the solid state disk, and the time delay is reduced.
In the prior art, a single data allocation strategy is generally used for writing data. However, when a single strategy is adopted for data writing, good throughput and time delay cannot be obtained yet, so that the performance of the solid state disk is poor.
Disclosure of Invention
The application provides a data processing method, a data processing device, a hard disk and a medium, which are used for solving the problem of poor performance of a solid state disk in the prior art.
In a first aspect, the present application provides a data processing method, including: determining a first page allocation policy based on the read-write command data acquired during the first period; processing a first read-write command received after the first period based on the first page allocation policy; determining a second page allocation policy based on the read-write command data acquired during the second period; processing a second read-write command received after the second period based on the second page allocation policy.
In one embodiment, the read-write command data includes one or more of the following: write command count, read command count, large data volume count, and small data volume count.
In one specific embodiment, before determining the first page allocation policy based on the read-write command data acquired during the first period, the method includes: counting a plurality of read-write commands acquired in a first period of time to acquire a write command count, a read command count, a large data volume count and a small data volume count in the first period of time; the determining a first page allocation policy based on the read-write command data acquired during the first period includes: and determining a corresponding first page allocation strategy according to the write command count, the read command count, the large data volume count and the small data volume count in the first period.
In one embodiment, the counting the plurality of read/write commands acquired in the first period to acquire a write command count, a read command count, a large data volume count, and a small data volume count in the first period includes: acquiring a plurality of read-write commands in the first period; when each read command exists in the acquired read-write commands, increasing the read command count by 1, and acquiring the data quantity corresponding to the read command; when each write command exists in the acquired read-write commands, increasing the write command count by 1, and acquiring the data quantity corresponding to the write command; sequentially determining whether the data volume corresponding to each read command is greater than or equal to a preset data volume threshold, and increasing the large data volume count by 1 when the data volume corresponding to each read command is determined to be greater than or equal to the preset data volume threshold; sequentially determining whether the data volume corresponding to each write command is greater than or equal to the preset data volume threshold, and increasing the large data volume count by 1 when the data volume corresponding to each write command is determined to be greater than or equal to the preset data volume threshold; sequentially determining whether the data quantity corresponding to each read command is smaller than the preset data quantity threshold value, and increasing the small data quantity count by 1 when the data quantity corresponding to each read command is smaller than the preset data quantity threshold value; and sequentially determining whether the data quantity corresponding to each write command is smaller than the preset data quantity threshold value, and increasing the small data quantity count by 1 when the data quantity corresponding to each write command is determined to be smaller than the preset data quantity threshold value.
In one specific embodiment, the determining the corresponding first page allocation policy according to the write command count, the read command count, the large data volume count, and the small data volume count in the first period includes: determining a first page allocation strategy as a chip priority WPCD strategy under the condition that the write command count in the first period is larger than the read command count and the large data volume count is larger than the small data volume count; determining that the first page allocation policy is a face priority PWCD policy in the case where the write command count is greater than the read command count and the large data amount count is less than the small data amount count within the first period; determining a first page allocation strategy as a channel priority CWDP strategy under the condition that the write command count in the first period is smaller than the read command count and the large data volume count is larger than the small data volume count; and determining the first page allocation strategy as a wafer bulk-first DPWC strategy under the condition that the write command count in the first period is smaller than the read command count and the large data volume count is smaller than the small data volume count.
In one specific embodiment, the processing the first read-write command received after the first period based on the first page allocation policy includes: when the first read-write command received after the first period is determined to be a write command, writing data corresponding to the first read-write command into a physical page of a flash memory chip according to a data writing sequence corresponding to the first page allocation strategy; and generating a physical page number according to the physical block address of the physical page to which the data is written and the first page allocation strategy, and storing the physical page number and the logical block address carried by the first read-write command in a corresponding manner.
In one specific embodiment, the processing the first read-write command received after the first period based on the first page allocation policy includes: when a first read-write command received after the first period is determined to be a read command, inquiring a physical page number corresponding to a logical block address carried by the first read-write command; and reading the data corresponding to the first read-write command according to the physical block address in the physical page number.
In a second aspect, the present application provides a data processing apparatus comprising: a determining unit configured to determine a first page allocation policy based on the read-write command data acquired in the first period; a processing unit configured to process a first read-write command received after the first period based on the first page allocation policy; the determining unit is further configured to determine a second page allocation policy based on the read-write command data acquired in the second period; the processing unit is further configured to process a second read/write command received after the second period based on the second page allocation policy.
In a third aspect, the present application provides a hard disk comprising: a processor, a memory, a communication interface; the memory is used for storing executable instructions of the processor; wherein the processor is configured to perform the data processing method of the first aspect via execution of the executable instructions.
In a fourth aspect, the present application provides a readable storage medium having stored thereon a computer program which, when executed by a processor, implements the data processing method of the first aspect.
The application provides a data processing method, a device, a hard disk and a medium, wherein the method comprises the following steps: determining a first page allocation policy based on the read-write command data acquired during the first period; processing a first read-write command received after the first period based on the first page allocation policy; determining a second page allocation policy based on the read-write command data acquired during the second period; a second read-write command received after the second period of time is processed based on the second page allocation policy. Compared with the prior art that the solid state disk adopts a single page allocation strategy to perform data allocation, the method and the device for allocating the data based on the read-write command data in different time periods determine the page allocation strategy, and process the read-write command received after corresponding time periods based on the determined page allocation strategy, so that the solid state disk can adjust the page allocation strategy according to the service characteristics of different time periods, and the page allocation strategy which is more suitable for the current service scene is adopted to perform data allocation, thereby effectively improving the throughput of the solid state disk, reducing the time delay, and solving the problems of lower throughput and larger time delay caused by adopting the single page allocation strategy in the prior art.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, a brief description will be given below of the drawings that are needed in the embodiments or the prior art descriptions, it being obvious that the drawings in the following description are some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort to a person skilled in the art.
FIG. 1a is a schematic diagram of a solid state disk;
FIG. 1b is a schematic diagram of data allocation using a CWDP strategy;
FIG. 2a is a flowchart illustrating a first embodiment of a data processing method provided in the present application;
FIG. 2b is a schematic diagram of data distribution using WPCD policy;
FIG. 3 is a flowchart illustrating a second embodiment of a data processing method provided in the present application;
FIG. 4a is a flowchart illustrating a third embodiment of a data processing method according to the present application;
FIG. 4b is a schematic diagram of data distribution using PWCD strategy;
FIG. 4c is a schematic diagram of data distribution using DPWC strategy;
FIG. 5 is a flowchart illustrating a fourth embodiment of a data processing method provided in the present application;
FIG. 6 is a schematic diagram of an embodiment of a data processing apparatus according to the present application;
FIG. 7 is a schematic diagram of a hard disk embodiment provided in the present application;
fig. 8 is a schematic structural diagram of a computing device provided in the present application.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions of 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 apparent that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which a person of ordinary skill in the art would have, based on the embodiments in this application, come within the scope of protection of this application.
The terms "first," "second," "third," "fourth" and the like in the description and in the claims of this application and in the above-described figures, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that embodiments of the present application described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
The terms referred to in this application are explained first:
page allocation (Palloc ) policy: that is, the data distribution method determines the order of writing the data corresponding to the write command received by the hard disk into the physical pages of the hard disk. Page allocation policies include a number of different ways of data allocation with Channel-first, with Die-first, with Plane-first, and with Way-first.
The structure of the solid state disk SSD is described below. Fig. 1a is a schematic structural diagram of a solid state disk. Solid state disks typically include multiple channels, as illustrated in FIG. 1a, for example, solid state disks include CHA, CHB, CHC and CHD channels. Each channel is provided with a plurality of Flash chips. Each Flash Chip is made up of a plurality of Die wafer volumes Die, illustratively four Die of Die0, die1, die2, die 3. Each Die is composed of a plurality of planes, each Plane is composed of a plurality of blocks, each Block is in turn composed of a plurality of pages.
The solid state disk SSD generally stores data through Flash Nand Flash. The interface performance of SSD can reach more than 6Gb/sec, but the read-write rate of Nand Flash is only 40MB/sec, aiming at the difference in performance, a concurrent data distribution strategy is generally adopted to improve the throughput of the solid state disk, and the time delay is reduced.
In one embodiment, a multi-Channel or multi-Chip based system level concurrent page allocation policy or a multi-Die or multi-Plane based Flash level concurrent page allocation policy is employed for data writing.
Illustratively, a channel priority CWDP policy in a system-level concurrent allocation policy is adopted for data allocation. Fig. 1b is a schematic diagram of data allocation using CWDP policy. The solid state disk shown in fig. 1b includes two Channel channels: CH1 and CH2, and two Flash chips Flash Chip are mounted on each Channel: WAY1 and WAY2, each Flash Chip includes two Die: DIE1 and DIE2, each DIE comprising two planes: PL1 and PL2, each Plane includes one physical Page.
Data with logical block addresses (Logic Block Address, abbreviated as LBA) of "1" to "16" are written into physical pages, according to CWDP policy, data with LBA of "1" is written into pages corresponding to PL1 in DIE1 in WAY1 on CH1, data with LBA of "2" is written into pages corresponding to PL1 in DIE1 in WAY1 on CH2, data with LBA of "3" is written into pages corresponding to PL1 in DIE1 in WAY2 on CH1, data with LBA of "4" is written into pages corresponding to PL1 in WAY2 on CH2, data with LBA of "5" is written into pages corresponding to PL1 in DIE2 in WAY1 on CH1, data with LBA of "6" is written into pages corresponding to PL1 in DIE2 in WAY1 on CH2, data with LBA of "7" is written into pages corresponding to PL1 in WAY2 on WAY2, and data with LBA of "4" is written into pages corresponding to PL1 in WAY2 on CH2, and data with priority of "37 is written into pages corresponding to PL2 in WAY2 on CH2, and priority is written into pages of" PLE 2.
However, from a performance perspective, the system-level Channel and Channel striping based page allocation scheme is not optimal; meanwhile, the concurrency mechanisms of the system level and the Flash level are not mutually independent to a great extent, and the parallelism of the Flash level is influenced by the adopted concurrency mechanism of the system level; second, for most current parallel data access methods, internal resources are severely underutilized.
For example, the current common system-level concurrent allocation policy CWDP is considered the optimal balloc policy, but cwds do not fully utilize resources across all traffic types for optimal performance.
Based on the method, the data is written by adopting a single strategy, and good throughput and time delay cannot be obtained, so that the performance of the solid state disk is poor.
The application also provides a data processing method which can dynamically adjust the page allocation strategy to improve the throughput of the solid state disk and reduce the time delay.
The following describes the technical scheme of the present application in detail through specific embodiments. It should be noted that the following embodiments may be combined with each other, and the same or similar concepts or processes may not be described in detail in some embodiments.
Fig. 2a is a flowchart of a first embodiment of a data processing method provided in the present application. Referring to fig. 2a, the data processing method specifically includes the following steps:
step S201: a first page allocation policy is determined based on the read-write command data acquired during the first period.
Step S202: a first read-write command received after the first period is processed based on the first page allocation policy.
In this embodiment, the read-write command data may include one or more of the following: write command count, read command count, large data volume count, and small data volume count.
The method comprises the steps that a plurality of read commands and write commands are acquired by a solid state disk in a first period, the write commands are counted to be the number of the write commands acquired in the first period, the read commands are counted to be the number of the read commands acquired in the first period, the large data volume is counted to be the number of the commands with the large data volume corresponding to the read commands or the write commands acquired in the first period, and the small data volume is counted to be the number of the commands with the small data volume corresponding to the read commands or the write commands acquired in the first period. Illustratively, the first period of time may be 5 minutes. The embodiment of the present application does not limit the division manner of the large data amount and the small data amount, for example, the data amount of 64kB or more is regarded as the large data amount, and the data amount of 64kB or less is regarded as the small data amount.
Based on the read-write command data acquired in the first period, before determining the first page allocation policy, counting the plurality of read-write commands acquired in the first period to acquire a write command count, a read command count, a large data amount count, and a small data amount count in the first period.
And determining a corresponding first page allocation strategy according to the write command count, the read command count, the large data volume count and the small data volume count in the first period.
Specifically, according to the write command count and the read command count in the first period, it may be determined that the traffic in the first period is write-intensive traffic or read-intensive traffic. Illustratively, when there are more read commands than write commands in the first period, then it is a read intensive traffic.
The traffic in the first period may be determined to be either a large data volume traffic or a small data volume traffic based on the large data volume count and the small data volume count in the first period. Illustratively, when the data volume corresponding to the write command and the read command in the first period is large, the data volume is large.
Different types of traffic may correspond to different page allocation policies. In an exemplary embodiment, according to the write command count, the read command count, the large data volume count, and the small data volume count in the first period, it is determined that the service in the first period is a read-intensive large data volume service, and the page allocation policy corresponding to the service is a CWDP policy, and then it is determined that the first page allocation policy is a CWDP policy.
A first read-write command received after a first period of time is processed based on the first page allocation policy. For example, if the first read/write command received after the first period is a write command, the data corresponding to the first read/write command is written to the solid state disk based on the CWDP policy in the manner shown in fig. 1 b.
Step S203: a second page allocation policy is determined based on the read-write command data acquired during the second period.
The manner of determining the second page allocation policy based on the read-write command data acquired in the second period may refer to the manner of determining the first page allocation policy based on the read-write command data acquired in the first period. The duration of the second period and the duration of the first period may be the same or different.
In one example, the page allocation policy may be determined periodically. For example, the page allocation policy may be determined every 1 hour.
In one example, the page allocation policy may be changed based on changes in read-write command data. For example, the page allocation policy may be changed based on the write command count, the read command count, the large data amount count, and the small data amount count. The threshold value can be set for the read-write command data, the read-write command data is monitored in real time, and when the read-write command data is determined to be changed, the page allocation strategy is redetermined.
Further, the second period and the first period may be continuous or discontinuous.
In one example, the second period and the first period may be continuous, i.e., read-write command data is continuously acquired for a period of time, and a page allocation policy is determined.
In one example, the second period of time and the first period of time may be discontinuous, i.e., after determining the first page allocation policy based on the read-write command data acquired during the first period of time, the second page allocation policy is determined based on the read-write command data acquired during the second period of time after a period of time.
Step S204: a second read-write command received after the second period of time is processed based on the second page allocation policy.
Illustratively, the traffic in the second period is determined to be write-intensive high data volume traffic based on the write command count, the read command count, the high data volume count, and the low data volume count in the second period, and the page allocation policy corresponding to the traffic is a chip-priority WPCD policy. At this time, a second read-write command received after a second period is processed based on the WPCD policy. For example, if the second read-write command received after the second period is a write command, writing data corresponding to the second read-write command into the solid state disk based on the WPCD policy.
Taking the example of writing data with LBAs of "1" to "16" to a physical page, fig. 2b is a schematic diagram of data allocation using WPCD policy. According to the WPCD policy, data with LBA of "1" is written into pages corresponding to PL1 of DIE1 in WAY1 on CH1, data with LBA of "2" is written into pages corresponding to PL1 of DIE1 in WAY2 on CH1, data with LBA of "3" is written into pages corresponding to PL2 of DIE1 in WAY1 on CH1, data with LBA of "4" is written into pages corresponding to PL2 of DIE1 in WAY2 on CH1, data with LBA of "5" is written into pages corresponding to PL1 of DIE1 in WAY1 on CH2, data with LBA of "6" is written into pages corresponding to PL1 of DIE1 in WAY2 on CH2, data with LBA of "7" is written into pages corresponding to PL2 of DIE1 in WAY1 on CH2, data with LBA of "8" is written into pages corresponding to DIE 2 in WAY2 of DIE1 on WAY2, and priority is given to priority, and then Page of "4" is written into pages corresponding to PL1 in WAY1 on WAY2 on CH2, and priority is given to priority, and then Page data with priority is allocated to PLe, which is the priority.
In the present embodiment, a first page allocation policy is determined based on read-write command data acquired in a first period; processing a first read-write command received after the first period based on the first page allocation policy; determining a second page allocation policy based on the read-write command data acquired during the second period; a second read-write command received after the second period of time is processed based on the second page allocation policy. Compared with the prior art that the solid state disk adopts a single page allocation strategy to perform data allocation, the method and the device for allocating the data based on the read-write command data in different time periods determine the page allocation strategy, and process the read-write command received after corresponding time periods based on the determined page allocation strategy, so that the solid state disk can adjust the page allocation strategy according to the service characteristics of different time periods, and the page allocation strategy which is more suitable for the current service scene is adopted to perform data allocation, thereby effectively improving the throughput of the solid state disk, reducing the time delay, and solving the problems of lower throughput and larger time delay caused by adopting the single page allocation strategy in the prior art.
Fig. 3 is a schematic flow chart of a second embodiment of a data processing method provided in the present application, on the basis of the embodiments shown in fig. 2a to 2b, a plurality of read/write commands acquired in a first period are counted to acquire a write command count, a read command count, a large data volume count and a small data volume count in the first period, and specifically includes the following steps:
step S301: a plurality of read-write commands within the first period of time are acquired.
Step S302: when each read command exists in the acquired read-write commands, the read command count is increased by 1, and the data quantity corresponding to the read command is acquired.
Step S303: when each of the acquired read-write commands is determined to exist, the write command count is increased by 1, and the data amount corresponding to the write command is acquired.
Step S304: and sequentially determining whether the data quantity corresponding to each read command is greater than or equal to a preset data quantity threshold value, and increasing the large data quantity count by 1 when the data quantity corresponding to each read command is determined to be greater than or equal to the preset data quantity threshold value.
Step S305: and sequentially determining whether the data quantity corresponding to each write command is greater than or equal to the preset data quantity threshold value, and increasing the large data quantity count by 1 when the data quantity corresponding to each write command is determined to be greater than or equal to the preset data quantity threshold value.
Step S306: and sequentially determining whether the data quantity corresponding to each read command is smaller than the preset data quantity threshold value, and increasing the small data quantity count by 1 when the data quantity corresponding to each read command is determined to be smaller than the preset data quantity threshold value.
Step S307: and sequentially determining whether the data quantity corresponding to each write command is smaller than the preset data quantity threshold value, and increasing the small data quantity count by 1 when the data quantity corresponding to each write command is determined to be smaller than the preset data quantity threshold value.
In the present embodiment, a plurality of read-write commands within a first period of time is acquired, and the first period of time may be 5 minutes, for example.
Upon determining that each of the acquired plurality of read-write commands exists, the read command count is incremented by 1. Illustratively, 2 read commands are acquired within a preset time, the read command count is 2. The data amount corresponding to the 2 read commands is 35kB and 80kB.
Upon determining that each of the acquired plurality of read-write commands exists, the write command count is incremented by 1. Illustratively, if 3 write commands are acquired within a preset time, the write command count is 3. The data amounts corresponding to the 3 write commands are obtained as 100kB, 20kB and 50kB, respectively.
Sequentially determining whether the data quantity corresponding to each read command is greater than or equal to a preset data quantity threshold value, and increasing the large data quantity count by 1 when the data quantity corresponding to each read command is determined to be greater than or equal to the preset data quantity threshold value; when it is determined that the data amount is smaller than the preset data amount threshold, the small data amount count is increased by 1. Sequentially determining whether the data amount corresponding to each write command is greater than or equal to the preset data amount threshold, and increasing the large data amount count by 1 when the data amount corresponding to each write command is determined to be greater than or equal to the preset data amount threshold; when it is determined that the data amount is smaller than the preset data amount threshold, the small data amount count is increased by 1. Illustratively, the preset data amount threshold is 64kB.
In the foregoing example, the acquired 2 read commands correspond to data amounts of 35kB and 80kB. The data amounts corresponding to the acquired 3 write commands are 100kB, 20kB and 50kB, respectively. The large data amount count is 2 and the small data amount count is 3.
In this embodiment, statistics of the read command count, the write command count, the large data amount count, and the small data amount count are performed on the plurality of read/write commands in the first period, and preconditions are provided for determining the page allocation policy based on the statistical data subsequently.
Similarly, counting the plurality of read/write commands acquired in the second period to acquire the write command count, the read command count, the large data amount count, and the small data amount count in the second period may be performed with reference to steps S301 to S307 described above.
Fig. 4a is a schematic flow chart of a third embodiment of a data processing method provided in the present application, and based on the embodiments shown in fig. 2a to 3, a corresponding first page allocation policy is determined according to a write command count, a read command count, a large data volume count, and a small data volume count in a first period, and specifically includes the following steps:
step S401: in the case where the write command count is greater than the read command count and the large data volume count is greater than the small data volume count for the first period, the first page allocation policy is determined to be a chip-first WPCD policy.
In this embodiment, according to the write command count and the read command count in the first period, it may be determined that the service in the first period is a write-intensive service or a read-intensive service. When the write command count in the first period is greater than the read command count, the traffic in the first period is write-intensive traffic. On the basis of the large data volume count and the small data volume count, the service in the first period can be determined to be the large data volume service or the small data volume service. When the large data volume count is greater than the small data volume count, the traffic of the first period is large data volume traffic. Thus, when it is determined that the write command count is greater than the read command count and the large data volume count is greater than the small data volume count for the first period, the traffic for the first period is write-intensive large data volume traffic.
The page allocation strategy corresponding to the write-intensive large-data-volume service is a WPCD strategy, namely, data allocation is carried out in a Way of first Way priority, then Plane priority, then Channel priority and finally taking Die into consideration. Taking the example of writing data with LBAs of "1" to "16" to a physical page, WPCD policy is used for data allocation with reference to fig. 2 b.
Step S402: in the case where the write command count is greater than the read command count and the large data volume count is less than the small data volume count for the first period, the first page allocation policy is determined to be a face priority PWCD policy.
In this embodiment, according to the write command count and the read command count in the first period, it may be determined that the service in the first period is a write-intensive service or a read-intensive service. When the write command count in the first period is greater than the read command count, the traffic in the first period is write-intensive traffic. On the basis of the large data volume count and the small data volume count, the service in the first period can be determined to be the large data volume service or the small data volume service. When the large data volume count is smaller than the small data volume count, the traffic of the first period is the small data volume traffic. Thus, when it is determined that the write command count is greater than the read command count and the large data volume count is less than the small data volume count for the first period, the traffic for the first period is write-intensive small data volume traffic.
The page allocation strategy corresponding to the writing dense small data volume service is a PWCD strategy, namely, data allocation is carried out according to the mode of first Plane priority, then Way priority, then Channel priority and finally taking Die into consideration. Taking the example of writing the data with LBAs of "1" to "16" into physical pages, fig. 4b is a schematic diagram of data allocation using the PWCD policy.
According to the PWCD policy, data with LBA of "1" is written into pages corresponding to PL1 of DIE1 in WAY1 on CH1, data with LBA of "2" is written into pages corresponding to PL2 of DIE1 in WAY1 on CH1, data with LBA of "3" is written into pages corresponding to PL1 of DIE1 in WAY2 on CH1, data with LBA of "4" is written into pages corresponding to PL2 of DIE1 in WAY2 on CH1, data with LBA of "5" is written into pages corresponding to PL1 of DIE1 in WAY1 on CH2, data with LBA of "6" is written into pages corresponding to PL2 of DIE1 in WAY1 on CH2, data with LBA of "7" is written into pages corresponding to PL1 of DIE1 in WAY2 on CH2, data with LBA of "8" is written into pages corresponding to PL2 of DIE1 in WAY2, and priority is given to Page of DIE 2 in WAY2, and priority is given to Page of "4" before being assigned to PLE, which data with priority is written into PLE 2, and priority is given to PLE, and priority.
Step S403: in the case that the write command count is less than the read command count and the large data volume count is greater than the small data volume count in the first period, determining that the first page allocation policy is a lane-first CWDP policy.
In this embodiment, according to the write command count and the read command count in the first period, it may be determined that the service in the first period is a write-intensive service or a read-intensive service. When the write command count in the first period is less than the read command count, the traffic in the first period is read intensive traffic. On the basis of the large data volume count and the small data volume count, the service in the first period can be determined to be the large data volume service or the small data volume service. When the large data volume count is greater than the small data volume count, the traffic of the first period is large data volume traffic. Thus, when it is determined that the write command count is less than the read command count and the large data volume count is greater than the small data volume count for the first period, the traffic for the first period is a read intensive large data volume traffic.
The page allocation strategy corresponding to the read intensive large data volume service is a CWDP strategy, namely, data allocation is carried out according to the modes of Channel priority, way priority, die priority and Plane consideration. Taking the example of writing the data with LBAs of "1" to "16" into physical pages, fig. 1b is a schematic diagram of data allocation using the CWDP policy.
Step S404: and determining the first page allocation strategy as a wafer bulk-first DPWC strategy under the condition that the write command count in the first period is smaller than the read command count and the large data volume count is smaller than the small data volume count.
In this embodiment, according to the write command count and the read command count in the first period, it may be determined that the service in the first period is a write-intensive service or a read-intensive service. When the write command count in the first period is less than the read command count, the traffic in the first period is read intensive traffic. On the basis of the large data volume count and the small data volume count, the service in the first period can be determined to be the large data volume service or the small data volume service. When the large data volume count is smaller than the small data volume count, the traffic of the first period is the small data volume traffic. Thus, when it is determined that the write command count is less than the read command count and the large data volume count is less than the small data volume count, the traffic of the first period is a read intensive small data volume traffic.
The page allocation strategy corresponding to the read intensive small data volume service is a DPWC strategy, namely, data allocation is carried out according to the modes of first Die priority, then Plane priority, then Way priority and finally considering channels. Taking the example of writing data with LBAs of "1" to "16" to a physical page, fig. 4c is a schematic diagram of data allocation using a DPWC policy.
According to the DPWC strategy, data with LBA of "1" is written into pages corresponding to PL1 of DIE1 in WAY1 on CH1, data with LBA of "2" is written into pages corresponding to PL1 of DIE2 in WAY1 on CH1, data with LBA of "3" is written into pages corresponding to PL2 of DIE1 in WAY1 on CH1, data with LBA of "4" is written into pages corresponding to PL2 of DIE2 in WAY1 on CH1, data with LBA of "5" is written into pages corresponding to PL1 of DIE1 in WAY2 on CH1, data with LBA of "6" is written into pages corresponding to PL1 of DIE2 in WAY2 on CH1, data with LBA of "7" is written into pages corresponding to PL2 of DIE1 in WAY2 on CH1, data with LBA of "8" is written into pages corresponding to DIE2 in WAY2 on WAY1, and priority is given to PLE 2, and priority is given to data with PLE of "4" in WAY2, which priority is written into Page of DIE2 in WAY2 on CH1, and priority is finally, and priority is given to PLE, and priority.
In this embodiment, the service type of the service in the first period is determined according to the write command count, the read command count, the large data volume count and the small data volume count in the first period, so as to determine the corresponding page allocation policy, thereby determining the page allocation policy according to the characteristics of the service, and providing preconditions for performing data allocation by adopting the page allocation policy more suitable for the current service scenario in the following steps to improve the performance of the solid state disk.
Likewise, determining the corresponding second page allocation policy according to the write command count, the read command count, the large data amount count, and the small data amount count in the second period may be performed with reference to steps S401 to S404 described above.
Fig. 5 is a flow chart of a fourth embodiment of a data processing method provided in the present application, where based on the embodiments shown in fig. 2a to fig. 4c, a first read-write command received after a first period of time is processed based on a first page allocation policy, and specifically includes the following steps:
step S501: a command type of a first read-write command received after a first period of time is determined.
When it is determined that the first read-write command received after the first period is a write command, step S502 is performed; upon determining that the first read-write command received after the first period is a read command, step S504 is performed.
Step S502: and writing the data corresponding to the first read-write command into the physical page of the flash memory chip according to the data writing sequence corresponding to the first page allocation strategy.
Step S503: and generating a physical page number according to the physical block address of the physical page to which the data is written and the first page allocation strategy, and storing the physical page number and the logical block address carried by the first read-write command in a corresponding manner.
In this embodiment, when it is determined that the first read/write command received after the first period is a write command, data corresponding to the write command is written into a physical page of the flash memory chip according to a data writing order corresponding to the first page allocation policy. Illustratively, the data is written into the physical pages according to the data write order corresponding to the WPCD policy.
The physical block address PBA of the physical page includes ChannelID, chipID, dieID, planeID, blockID and PageID, and generates a physical page number according to the physical block address of the physical page to which data is written and the first page allocation policy. Illustratively, channelID, chipID and DieID total 4 bits, planeID 8 bits, blockID 10 bits, pageID 8 bits, a page allocation policy of 2 bits, and a physical block address and page allocation policy are combined to generate a 32bit physical page number (Physical Page Number, PPN for short). And storing the physical page number and the logical block address LBA carried by the first read-write command correspondingly.
Step S504: and inquiring a physical page number corresponding to the logical block address carried by the first read-write command.
Step S505: and reading the data corresponding to the first read-write command according to the physical block address in the physical page number.
In this embodiment, when it is determined that the first read-write command received after the first period is a read command, the physical page number PPN corresponding to the logical block address LBA carried by the first read-write command is queried. And reading the data corresponding to the first read-write command according to the physical block address PBA in the PPN.
In this embodiment, the first read-write command received after the first period is processed based on the first page allocation policy, so that the page allocation policy is adjusted according to the characteristics of the service, and the page allocation policy more suitable for the current service scenario is adopted to perform data allocation, thereby further improving the throughput of the solid state disk and reducing the time delay.
Likewise, processing the second read/write command received after the second period based on the second page allocation policy may be performed with reference to the above-described steps S501 to S505.
The following are device embodiments of the present application, which may be used to perform method embodiments of the present application. For details not disclosed in the device embodiments of the present application, please refer to the method embodiments of the present application.
FIG. 6 is a schematic diagram of an embodiment of a data processing apparatus according to the present application; as shown in fig. 6, the data processing apparatus 60 includes: a determination unit 61 and a processing unit 62. Wherein the determining unit 61 is configured to determine a first page allocation policy based on the read-write command data acquired in the first period; the processing unit 62 is configured to process the first read-write command received after the first period based on the first page allocation policy; the determining unit 61 is further configured to determine a second page allocation policy based on the read-write command data acquired during the second period; the processing unit 62 is further configured to process a second read-write command received after the second period of time based on the second page allocation policy.
The data processing device provided in the embodiment of the present application may execute the technical solution shown in the foregoing method embodiment, and its implementation principle and beneficial effects are similar, and will not be described herein again.
In one possible embodiment, the read-write command data includes one or more of the following: write command count, read command count, large data volume count, and small data volume count.
In a possible embodiment, the data processing apparatus 60 further includes an obtaining unit for counting the plurality of read-write commands obtained in the first period to obtain the write command count, the read command count, the large data amount count, and the small data amount count in the first period before the determining unit 61 determines the first page allocation policy based on the read-write command data obtained in the first period. The determining unit 61 is specifically configured to determine the corresponding first page allocation policy according to the write command count, the read command count, the large data amount count, and the small data amount count in the first period.
In a possible embodiment, the acquiring unit is specifically configured to acquire a plurality of read-write commands in the first period; when each read command exists in the acquired read-write commands, increasing the read command count by 1, and acquiring the data quantity corresponding to the read command; when each write command exists in the acquired read-write commands, increasing the write command count by 1, and acquiring the data quantity corresponding to the write command; sequentially determining whether the data quantity corresponding to each read command is greater than or equal to a preset data quantity threshold value, and increasing the large data quantity count by 1 when the data quantity corresponding to each read command is determined to be greater than or equal to the preset data quantity threshold value; sequentially determining whether the data amount corresponding to each write command is greater than or equal to the preset data amount threshold, and increasing the large data amount count by 1 when the data amount corresponding to each write command is determined to be greater than or equal to the preset data amount threshold; sequentially determining whether the data quantity corresponding to each read command is smaller than the preset data quantity threshold value, and increasing the small data quantity count by 1 when the data quantity corresponding to each read command is determined to be smaller than the preset data quantity threshold value; and sequentially determining whether the data quantity corresponding to each write command is smaller than the preset data quantity threshold value, and increasing the small data quantity count by 1 when the data quantity corresponding to each write command is determined to be smaller than the preset data quantity threshold value.
The data processing device provided in the embodiment of the present application may execute the technical solution shown in the foregoing method embodiment, and its implementation principle and beneficial effects are similar, and will not be described herein again.
In a possible embodiment, the determining unit 61 is specifically configured to determine that the first page allocation policy is a chip-priority WPCD policy in a case where the write command count is greater than the read command count and the large data volume count is greater than the small data volume count in the first period; determining that the first page allocation policy is a face priority PWCD policy in the case where the write command count is greater than the read command count and the large data volume count is less than the small data volume count within the first period; determining that the first page allocation policy is a channel priority CWDP policy when the write command count is less than the read command count and the large data volume count is greater than the small data volume count within the first period; and determining the first page allocation strategy as a wafer bulk-first DPWC strategy under the condition that the write command count in the first period is smaller than the read command count and the large data volume count is smaller than the small data volume count.
The data processing device provided in the embodiment of the present application may execute the technical solution shown in the foregoing method embodiment, and its implementation principle and beneficial effects are similar, and will not be described herein again.
In a possible implementation manner, the processing unit 62 is specifically configured to, when determining that the first read-write command received after the first period is a write command, write data corresponding to the first read-write command into a physical page of the flash memory chip according to a data write sequence corresponding to the first page allocation policy; and generating a physical page number according to the physical block address of the physical page to which the data is written and the first page allocation strategy, and storing the physical page number and the logical block address carried by the first read-write command in a corresponding manner.
In a possible implementation manner, the processing unit 62 is specifically configured to, when determining that the first read-write command received after the first period is a read command, query a physical page number corresponding to a logical block address carried by the first read-write command; and reading the data corresponding to the first read-write command according to the physical block address in the physical page number.
The data processing device provided in the embodiment of the present application may execute the technical solution shown in the foregoing method embodiment, and its implementation principle and beneficial effects are similar, and will not be described herein again.
Fig. 7 is a schematic structural diagram of a hard disk provided in the present application. As shown in fig. 7, the hard disk 70 includes: a processor 71, a memory 72, and a communication interface 73; wherein the memory 72 is for storing executable instructions of the processor 71; the processor 71 is configured to perform the technical solutions of any of the method embodiments described above via execution of executable instructions.
Alternatively, the memory 72 may be separate or integrated with the processor 71.
Alternatively, when the memory 72 is a device separate from the processor 71, the hard disk 70 may further include: bus 74 for connecting the above devices.
The hard disk is used for executing the technical scheme in any of the method embodiments, and the implementation principle and the technical effect are similar, and are not repeated here.
The embodiment of the application also provides a computing device. Fig. 8 is a schematic structural diagram of a computing device provided in the present application. As shown in fig. 8, computing device 80 includes a processor 81 and a hard disk 82. Wherein the processor 81 comprises a processor interface 811 and the hard disk 82 comprises a hard disk connector 822. The processor 81 is connected to the hard disk 82 via a processor interface 811 and a hard disk connector 822.
In one possible implementation, computing device 80 may also include a patch cord, and processor 81 may be connected to hard disk 82 through a processor interface 811, the patch cord, and a hard disk connector 822.
The computing device may be a terminal device (mobile phone, computer) or a server.
The computing device is configured to execute the technical scheme in any of the foregoing method embodiments, and its implementation principle and technical effects are similar, and are not described herein again.
The embodiment of the application also provides a readable storage medium, on which a computer program is stored, which when executed by a processor implements the technical solution provided by any of the foregoing embodiments.
Those of ordinary skill in the art will appreciate that: all or part of the steps for implementing the method embodiments described above may be performed by hardware associated with program instructions. The foregoing program may be stored in a computer readable storage medium. The program, when executed, performs steps including the method embodiments described above; and the aforementioned storage medium includes: various media that can store program code, such as ROM, RAM, magnetic or optical disks.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features can be replaced equivalently; such modifications and substitutions do not depart from the spirit of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present application.
Claims (10)
1. A method of data processing, comprising:
determining a first page allocation policy based on the read-write command data acquired during the first period;
processing a first read-write command received after the first period based on the first page allocation policy;
determining a second page allocation policy based on the read-write command data acquired during the second period;
processing a second read-write command received after the second period based on the second page allocation policy.
2. The data processing method according to claim 1, wherein the read-write command data includes one or more of:
write command count, read command count, large data volume count, and small data volume count.
3. The data processing method according to claim 2, wherein before determining the first page allocation policy based on the read-write command data acquired during the first period, the method comprises:
counting a plurality of read-write commands acquired in a first period of time to acquire a write command count, a read command count, a large data volume count and a small data volume count in the first period of time;
the determining a first page allocation policy based on the read-write command data acquired during the first period includes:
And determining a corresponding first page allocation strategy according to the write command count, the read command count, the large data volume count and the small data volume count in the first period.
4. A data processing method according to claim 3, wherein said counting a plurality of read-write commands acquired during a first period to acquire a write command count, a read command count, a large data amount count, and a small data amount count during said first period comprises:
acquiring a plurality of read-write commands in the first period;
when each read command exists in the acquired read-write commands, increasing the read command count by 1, and acquiring the data quantity corresponding to the read command;
when each write command exists in the acquired read-write commands, increasing the write command count by 1, and acquiring the data quantity corresponding to the write command;
sequentially determining whether the data volume corresponding to each read command is greater than or equal to a preset data volume threshold, and increasing the large data volume count by 1 when the data volume corresponding to each read command is determined to be greater than or equal to the preset data volume threshold;
sequentially determining whether the data volume corresponding to each write command is greater than or equal to the preset data volume threshold, and increasing the large data volume count by 1 when the data volume corresponding to each write command is determined to be greater than or equal to the preset data volume threshold;
Sequentially determining whether the data quantity corresponding to each read command is smaller than the preset data quantity threshold value, and increasing the small data quantity count by 1 when the data quantity corresponding to each read command is smaller than the preset data quantity threshold value;
and sequentially determining whether the data quantity corresponding to each write command is smaller than the preset data quantity threshold value, and increasing the small data quantity count by 1 when the data quantity corresponding to each write command is determined to be smaller than the preset data quantity threshold value.
5. A data processing method according to claim 3, wherein said determining a corresponding first page allocation policy based on a write command count, a read command count, a large data volume count, and a small data volume count within said first period of time comprises:
determining a first page allocation strategy as a chip priority WPCD strategy under the condition that the write command count in the first period is larger than the read command count and the large data volume count is larger than the small data volume count;
determining that the first page allocation policy is a face priority PWCD policy in the case where the write command count is greater than the read command count and the large data amount count is less than the small data amount count within the first period;
determining a first page allocation strategy as a channel priority CWDP strategy under the condition that the write command count in the first period is smaller than the read command count and the large data volume count is larger than the small data volume count;
And determining the first page allocation strategy as a wafer bulk-first DPWC strategy under the condition that the write command count in the first period is smaller than the read command count and the large data volume count is smaller than the small data volume count.
6. The data processing method according to any one of claims 1 to 5, characterized in that the processing of the first read-write command received after the first period based on the first page allocation policy includes:
when the first read-write command received after the first period is determined to be a write command, writing data corresponding to the first read-write command into a physical page of a flash memory chip according to a data writing sequence corresponding to the first page allocation strategy;
and generating a physical page number according to the physical block address of the physical page to which the data is written and the first page allocation strategy, and storing the physical page number and the logical block address carried by the first read-write command in a corresponding manner.
7. The data processing method of claim 6, wherein the processing the first read-write command received after the first period based on the first page allocation policy comprises:
when a first read-write command received after the first period is determined to be a read command, inquiring a physical page number corresponding to a logical block address carried by the first read-write command;
And reading the data corresponding to the first read-write command according to the physical block address in the physical page number.
8. A data processing apparatus, comprising:
a determining unit configured to determine a first page allocation policy based on the read-write command data acquired in the first period;
a processing unit configured to process a first read-write command received after the first period based on the first page allocation policy;
the determining unit is further configured to determine a second page allocation policy based on the read-write command data acquired in the second period;
the processing unit is further configured to process a second read/write command received after the second period based on the second page allocation policy.
9. A hard disk comprising:
a processor, a memory, a communication interface;
the memory is used for storing executable instructions of the processor;
wherein the processor is configured to perform the data processing method of any one of claims 1 to 7 via execution of the executable instructions.
10. A readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the data processing method of any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310184624.2A CN116382569A (en) | 2023-02-28 | 2023-02-28 | Data processing method, device, hard disk and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310184624.2A CN116382569A (en) | 2023-02-28 | 2023-02-28 | Data processing method, device, hard disk and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116382569A true CN116382569A (en) | 2023-07-04 |
Family
ID=86973991
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310184624.2A Pending CN116382569A (en) | 2023-02-28 | 2023-02-28 | Data processing method, device, hard disk and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116382569A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116795735A (en) * | 2023-08-23 | 2023-09-22 | 四川云海芯科微电子科技有限公司 | Solid state disk space allocation method, device, medium and system |
-
2023
- 2023-02-28 CN CN202310184624.2A patent/CN116382569A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116795735A (en) * | 2023-08-23 | 2023-09-22 | 四川云海芯科微电子科技有限公司 | Solid state disk space allocation method, device, medium and system |
| CN116795735B (en) * | 2023-08-23 | 2023-11-03 | 四川云海芯科微电子科技有限公司 | Solid state disk space allocation method, device, medium and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10552055B2 (en) | Multi-tier scheme for logical storage management | |
| KR101629615B1 (en) | Apparatus and method for low power low latency high capacity storage class memory | |
| KR101870062B1 (en) | Storage module and method for adaptive burst mode | |
| US20130117527A1 (en) | Method and apparatus for thin provisioning | |
| US11899580B2 (en) | Cache space management method and apparatus | |
| CN111079917A (en) | Tensor data block access method and device | |
| US20170003911A1 (en) | Information processing device | |
| US20220083275A1 (en) | Method for enhancing quality of service of solid-state drive and solid-state drive | |
| CN116382569A (en) | Data processing method, device, hard disk and medium | |
| US8977800B2 (en) | Multi-port cache memory apparatus and method | |
| CN116795735B (en) | Solid state disk space allocation method, device, medium and system | |
| CN115079936A (en) | Data writing method and device | |
| CN117215485A (en) | ZNS SSD management method, data writing method, storage device and controller | |
| CN115543187A (en) | Data processing method and equipment | |
| CN108170380B (en) | Method for improving sequential reading performance of solid state disk and solid state disk | |
| CN104899158A (en) | Memory access optimization method and memory access optimization device | |
| CN103064926B (en) | Data processing method and device | |
| TW202038106A (en) | Storage device, control method therefor and storage medium | |
| CN114816322A (en) | External sorting method and device of SSD and SSD memory | |
| CN114047886A (en) | NVME command processing method, system, electronic equipment and storage medium | |
| CN101493726B (en) | Solid-state hard disk management method, apparatus and system | |
| CN115793957A (en) | Method and device for writing data and computer storage medium | |
| CN107608914B (en) | Access method and device of multi-channel storage equipment and mobile terminal | |
| CN107066208B (en) | Asymmetric read-write method of external memory device and NVM (non-volatile memory) external memory device | |
| CN110825660A (en) | HBase-based optimization method, system and equipment for Julient suspension |
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 |