CN115712389A - Scheduling method and device between data storage media and electronic equipment - Google Patents
Scheduling method and device between data storage media and electronic equipment Download PDFInfo
- Publication number
- CN115712389A CN115712389A CN202211343027.1A CN202211343027A CN115712389A CN 115712389 A CN115712389 A CN 115712389A CN 202211343027 A CN202211343027 A CN 202211343027A CN 115712389 A CN115712389 A CN 115712389A
- Authority
- CN
- China
- Prior art keywords
- shingled
- partition
- data
- disk
- flash memory
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- 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
Landscapes
- Signal Processing For Digital Recording And Reproducing (AREA)
Abstract
The invention discloses a method and a device for scheduling data storage media and electronic equipment, wherein the method comprises the following steps: judging whether the shingled disk triggers updating or not; if the shingled disk triggers updating, calculating a priority factor corresponding to the memory index space of each shingled partition in the shingled disk; selecting a target tile-overlapping partition with a priority factor meeting a preset condition; and writing the data in the high-speed storage unit corresponding to the target shingle partition into the target shingle partition. According to the invention, by designing the scheduling method between the shingled partition and the flash memory block, the disk writing operation of the composite disk in a high writing scene is reduced, and the performance overhead of the composite disk is reduced.
Description
Technical Field
The invention relates to the technical field of data storage, in particular to a method and a device for scheduling data storage media and electronic equipment.
Background
With the advent of the big data era, the demand of people for storage capacity is continuously increased, and the traditional magnetic disk cannot meet the demand for storage capacity, so a shingled magnetic disk is provided, which has higher storage density and can accommodate larger storage capacity, but the write-in efficiency of the shingled magnetic disk is lower, so a storage structure of a composite magnetic disk is provided, the storage structure of the composite magnetic disk is provided, a high-speed storage unit (such as a flash memory and the like) is added on the basis of the original shingled magnetic disk, the write-in efficiency of the magnetic disk is increased to a certain extent, but the storage structure of the composite magnetic disk still can perform too frequent read and write on a shingled partition, and the performance of the magnetic disk is reduced. Therefore, a method for scheduling data storage media based on a flash memory and a shingled composite disk storage structure is urgently needed to be provided, so that disk write-in operation of a composite disk in a high write-in scene is reduced, and performance overhead of the composite disk is reduced.
Disclosure of Invention
Therefore, the technical problem to be solved by the present invention is to overcome the defect that the existing composite magnetic disk still performs too frequent reading and writing on the shingled partition, and reduces the performance of the magnetic disk, thereby providing a scheduling method and device between data storage media, and an electronic device.
According to a first aspect, an embodiment of the present invention discloses a scheduling method between data storage media, which is applied to a storage system including a high-speed storage unit and a shingled disk, where each shingled partition in the shingled disk is associated with a corresponding high-speed storage unit; the method comprises the following steps: judging whether the shingled disk triggers updating or not; if the shingled disk triggers updating, calculating a priority factor corresponding to the memory index space of each shingled partition in the shingled disk; selecting a target tile-overlapping partition with a priority factor meeting a preset condition; and writing the data in the high-speed storage unit corresponding to the target shingle partition into the target shingle partition.
Optionally, after writing the data in the high-speed storage unit corresponding to the target shingled partition into the target shingled partition, the method further includes: data written to the high speed memory cells of the shingled partition is erased.
Optionally, the writing data in the high-speed storage unit corresponding to the target shingled partition into the target shingled partition includes: detecting whether a high-speed storage unit containing persistent data exists in a corresponding high-speed storage unit in the target shingled partition; and if the high-speed storage unit containing the persistent data is detected, erasing the persistent data existing in the high-speed storage unit containing the persistent data.
Optionally, the high-speed storage unit is a flash memory, and the method further includes: when a data reading or writing request is received, judging whether a logic address needing to be read or written in the flash memory is legal or not; if the logical address is judged to be legal, determining a memory index and a flash memory index corresponding to the data reading or writing request; and performing data reading or writing operation according to the memory index and the flash memory index.
Optionally, the high-speed storage unit is a flash memory; the method comprises the following steps: when H is present i Determining whether a flash block containing persistent data exists in the flash memory or not, wherein the flash block is greater than or equal to mu HA-epsilon HB;
wherein H i Representing the endurance factor, H, of the flash memory i i ＝λ 1 *X i /(λ 2 * M); HA denotes the persistence upper bound factor, HA = λ 1 *X/(λ 2 * M); HB denotes the persistence lower bound factor, HB = λ 1 /(λ 2 * M); mu and epsilon are constants; x is the number of pages of the flash memory contained in the flash memory i; m is the number of the associated flash memory blocks in the target shingled partition; x i The number of flash memory pages containing persistent data in the flash memory block i is set; lambda [ alpha ] 1 、λ 2 Is a constant.
Optionally, the method comprises: when T is larger than or equal to alpha G, judging that the shingled magnetic disk triggers updating;
wherein T represents the dynamic factor of the disk,
alpha is a constant; g denotes a start factor of the disk, G = beta 1 *K/P+β 2 *P/Q，β 1 、β 2 、β 1 Is a constant; k is the total capacity of the shingled magnetic disk; p is eachThe zone capacity of the shingled zones; a. The i The number of the stored memory indexes in the memory index space of the imbricated partition i is used as the number of the stored memory indexes; P/Q is the storage capacity of the memory index; K/P is the number of the shingled partitions; q is the maximum index number which can be stored in the memory index space.
Optionally, the priority factor for any shingled partition is calculated by:
R i ＝θ 1 *F i +θ 2 *(P/Q-A i )
wherein R is i Representing the priority factor of the memory index space of the shingled partition i; f i The number of high speed memory cells associated with shingled partition i; theta 1 、θ 2 Is a constant; a. The i The number of indices already stored in the memory index space.
According to a second aspect, the embodiment of the present invention further discloses a scheduling apparatus between data storage media, which is applied to a storage system including a high-speed storage unit and a shingled disk, where each shingled partition in the shingled disk is associated with a corresponding high-speed storage unit; the device comprises: the updating judgment module is used for judging whether the shingled disk triggers updating; the data calculation module is used for calculating a priority factor corresponding to the memory index space of each shingled partition in the shingled disk if the shingled disk triggers updating; the partition selection module is used for selecting a target shingled partition with the priority factor meeting the preset condition; and the data writing module is used for writing the data in the high-speed storage unit corresponding to the target shingled partition into the target shingled partition.
According to a third aspect, an embodiment of the present invention further discloses an electronic device, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to cause the at least one processor to perform the steps of the method of scheduling between data storage media as described in the first aspect or any one of the alternative embodiments of the first aspect.
According to a fourth aspect, the present invention further discloses a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps of the scheduling method between data storage media according to the first aspect or any optional implementation manner of the first aspect.
The technical scheme of the invention has the following advantages:
according to the scheduling method between the data storage media, after the shingled disk is judged to be triggered and updated, the priority factor corresponding to the memory index space of each shingled partition in the shingled disk is calculated, the target shingled partition with the priority factor meeting the preset condition is selected, and the data in the high-speed storage unit corresponding to the target shingled partition is written into the target shingled partition, so that the disk writing operation of the composite disk in a high-writing scene is reduced, and the performance overhead of the composite disk is reduced.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a flowchart illustrating a specific example of a scheduling method between data storage media according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a specific example of a scheduling method between data storage media according to an embodiment of the present invention;
FIG. 3 is a schematic block diagram of a specific example of a scheduling apparatus between data storage media according to an embodiment of the present invention;
fig. 4 is a diagram of a specific example of an electronic device in an embodiment of the present invention.
Detailed Description
The technical solutions of the present invention will be described clearly and completely with reference to the accompanying drawings, and it should be understood that the described embodiments are some, but not all embodiments of the present invention. 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 invention.
In the description of the present invention, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc., indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings, and are only for convenience of description and simplicity of description, but do not indicate or imply that the device or element being referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus, should not be construed as limiting the present invention. Furthermore, the terms "first," "second," and "third" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
In the description of the present invention, it should be noted that, unless otherwise explicitly specified or limited, the terms "mounted," "connected," and "connected" are to be construed broadly, e.g., as meaning either a fixed connection, a removable connection, or an integral connection; can be mechanically or electrically connected; the two elements may be directly connected or indirectly connected through an intermediate medium, or may be connected through the inside of the two elements, or may be connected wirelessly or through a wire. The specific meanings of the above terms in the present invention can be understood in specific cases to those skilled in the art.
In addition, the technical features involved in the different embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
The embodiment of the invention discloses a scheduling method among data storage media, which is applied to a storage system comprising a high-speed storage unit and a shingled disk, wherein each shingled partition in the shingled disk is associated with the corresponding high-speed storage unit; the high-speed storage unit can be a dynamic random access memory or a flash memory and the like, and can be determined according to actual conditions, the flash memory is selected as the high-speed storage unit in the embodiment of the application, and the association mode between each shingled partition in the shingled disk and the flash memory can be that a single flash memory block serves a single shingled partition, or multiple flash memory blocks serve a single shingled partition, and can be determined according to actual scenes; as shown in fig. 1, the method comprises the steps of:
for example, in the embodiment of the present application, the tape storage data is temporarily stored in the flash memory block, as shown in fig. 2, it is determined whether the shingled disk needs to be updated at preset intervals or in real time, where a specific determination manner may be to determine whether to write data to the shingled disk according to the current remaining amount of the shingled disk, for example, when the remaining capacity is greater than the preset capacity, a data write operation to the shingled disk is triggered, and the embodiment of the present application does not limit the preset capacity; the determination mode may also be to determine whether the shingled disk triggers updating according to relevant parameters such as the total disk capacity of the shingled disk, the data capacity of the shingled partition, and the number of memory indexes in the memory index space.
exemplarily, after a shingled disk is triggered to update, a priority factor corresponding to a memory index space of each shingled partition in the shingled disk is calculated, where in the embodiment of the present application, a certain shingled partition is selected to be updated by calculating the priority factor of the memory index space of each shingled partition, and a determination manner of the priority factor of the memory index space of each shingled partition may be determined according to the number of flash memory blocks associated with each shingled partition, for example, the more associated flash memory blocks are, which indicates that the more data to be written into the shingled partition is, the higher factor may be set for the shingled partition of the associated flash memory block, so that data in a corresponding flash memory block may be written into the shingled partition in time.
103, selecting a target tile-folding partition with a priority factor meeting a preset condition;
for example, after calculating the priority factor of each shingled partition, as shown in fig. 2, the embodiment of the present application judges the priority factor of the entire shingled partition, selects the shingled partition whose priority factor meets the preset condition for updating, and determines the preset condition according to the actual requirement.
And 104, writing the data in the high-speed storage unit corresponding to the target shingle partition into the target shingle partition.
Illustratively, as shown in fig. 2, in the embodiment of the present application, a target shingled partition is selected for updating, a flash memory block corresponding to the target shingled partition, which needs to write storage data into the target shingled partition, is selected, and data in the selected flash memory block is written into the target shingled partition.
According to the scheduling method between the data storage media, after the shingled disk is judged to be triggered and updated, the priority factor corresponding to the memory index space of each shingled partition in the shingled disk is calculated, the target shingled partition with the priority factor meeting the preset condition is selected, and the data in the high-speed storage unit corresponding to the target shingled partition is written into the target shingled partition, so that the disk writing operation of the composite disk in a high-writing scene is reduced, and the performance overhead of the composite disk is reduced.
As an optional embodiment of the invention, the method further comprises: data written to the high speed memory cells of the shingled partition is erased.
For example, after the data in the flash memory block is written into the target shingled partition, the storage system recovers the shingled partition (i.e., erases the data in the flash memory block).
As an alternative embodiment of the present invention, step 104 includes: detecting whether a high-speed storage unit containing persistent data exists in a corresponding high-speed storage unit in the target shingled partition; if the existence of the high-speed storage unit containing the persistent data is detected, the persistent data in the high-speed storage unit containing the persistent data is erased.
For example, in the embodiment of the present application, there are multiple numbers of flash memory pages in a single flash memory block, and each flash memory page stores one or more sets of data, and when data in a certain flash memory page is marked as "outdated data" because the data is stored in the flash memory page for too long or has been updated, the flash memory page corresponding to the data is marked as "persisted". Before writing data in a flash memory block corresponding to a target shingled partition, as shown in fig. 2, it is detected whether the corresponding flash memory block is a persistent flash memory block, where the persistent flash memory block may be a flash memory block including a part of flash memory pages marked as "persistent", or a flash memory block in which all flash memory pages are marked as "persistent", for example only, but not by way of limitation, and if a certain flash memory block is detected as a persistent flash memory block, data in the flash memory page marked as "persistent" in the flash memory block is erased, so that waste of space caused by storing useless data into the shingled partition can be avoided, and a new flash memory space can be vacated at the same time.
As an optional embodiment of the present invention, the high-speed storage unit is a flash memory, and the method further includes: when a data reading or writing request is received, judging whether a logic address needing to read or write data in the flash memory is legal or not; if the logical address is judged to be legal, determining a memory index and a flash memory index corresponding to the data reading or writing request; and performing data reading or writing operation according to the memory index and the flash memory index.
For example, in the embodiment of the present application, the proposed scheduling method between data storage media is applied based on a centralized address mapping system, when a read or write request of data is received, the address mapping system determines whether a logical address that needs to be read or written in a flash memory is legal, and if the logical address is legal, calculates and obtains a memory index and a flash memory index of the storage system, and performs data write or read operation according to the obtained memory index and flash memory index. When a data write operation is performed, the mapping table also needs to be updated to record information such as the time of the data write.
As an alternative embodiment of the present invention, the high speed memory unit may be a flash memory, when H i Determining whether a flash block containing persistent data exists in the flash memory or not, wherein the flash block is greater than or equal to mu HA-epsilon HB;
wherein H i Representing the persistence factor of flash i, H i ＝λ 1 *X i /(λ 2 * M); HA denotes the persistence upper bound factor, HA = λ 1 *X/(λ 2 * M); HB denotes the persistence lower limit factor, HB = λ 1 /(λ 2 * M); mu and epsilon are constants; x is the number of flash pages contained in the flash memory i; m is the number of the associated flash memory blocks in the target shingled partition; x i The number of flash memory pages containing persistent data in the flash memory block i is set; lambda [ alpha ] 1 、λ 2 Is a constant.
Illustratively, for μ, ε, λ 1 、λ 2 The selection value of (A) can be set according to the actual situation, in the specific embodiment of the invention, mu =1.4, epsilon =2.3 and lambda 1 ＝10，λ 2 =1.68, merely by way of example and without limitation.
As an optional embodiment of the present invention, when T ≧ α × G, it is determined that the shingled disk triggers an update;
wherein T represents the dynamic factor of the disk,
alpha is a constant; g denotes a start factor of the disk, G = beta 1 *K/P+β 2 *P/Q，β 1 、β 2 、β 3 Is a constant; k is the total capacity of the shingled magnetic disk; p is the partition capacity of each shingled partition; a. The i The number of the stored memory indexes in the memory index space of the tile-overlapped partition i is stored; P/Q is the storage capacity of the memory index; K/P is the number of the shingled partitions; q is the maximum number of indexes that the memory index space can store.
Illustratively, for α, β 1 、β 2 、β 3 The selection value can be set according to the actual situation, and the specific embodiment of the inventionα =0.66, β 1 ＝0.5，β 2 ＝1.2，、β 3 =0.25, merely by way of example, and not by way of limitation.
As an alternative embodiment of the present invention, the priority factor for any shingled partition is calculated by:
R i ＝θ 1 *F i +θ 2 *(P/Q-A i )
wherein R is i Representing the priority factor of the memory index space of the shingled partition i; f i The number of high-speed memory cells associated with shingled partition i; theta.theta. 1 、θ 2 Is a constant; a. The i The number of indexes already stored in the memory index space.
Illustratively, pair θ 1 、θ 2 The selection value of (A) can be set according to the actual situation, in the embodiment of the invention, theta 1 ＝0.4，θ 2 And =0.6, by way of example only, and not by way of limitation.
The scheduling method between the data storage media provided by the embodiment of the invention can be applied to the storage media (such as a flash memory and a shingled composite magnetic disk) which can not be randomly written and updated, and the overhead required by the magnetic disk during frequent writing is reduced and the efficiency of the magnetic disk under the condition of high-frequency writing is enhanced by designing the shingled partition delay updating method by utilizing the cache space provided by the flash memory. The technology can be used in the fields of flash memory with high-frequency writing requirement, shingled composite magnetic disk storage clusters, data servers and the like.
The embodiment of the invention also discloses a scheduling device between data storage media, which is applied to a storage system comprising a high-speed storage unit and the shingled disk, wherein the high-speed storage unit corresponding to each shingled partition in the shingled disk is associated; as shown in fig. 3, the apparatus includes: an update determining module 201, configured to determine whether a shingled disk triggers an update; the data calculation module 202 is configured to calculate a priority factor corresponding to a memory index space of each shingled partition in the shingled disk if the shingled disk triggers updating; the partition selection module 203 is used for selecting a target shingled partition with a priority factor meeting a preset condition; a data writing module 204, configured to write the data in the high-speed storage unit corresponding to the target shingled partition into the target shingled partition.
According to the scheduling device between the data storage media, after the shingled disk is judged to be triggered and updated, the priority factor corresponding to the memory index space of each shingled partition in the shingled disk is calculated, the target shingled partition with the priority factor meeting the preset condition is selected, and the data in the high-speed storage unit corresponding to the target shingled partition is written into the target shingled partition, so that the disk writing operation of the composite disk in a high-writing scene is reduced, and the performance overhead of the composite disk is reduced.
As an optional embodiment of the present invention, the apparatus further comprises: and the data erasing module is used for erasing the data written into the high-speed storage units of the shingled partition.
As an optional embodiment of the present invention, the data writing module includes: the storage unit detection submodule is used for detecting whether a high-speed storage unit containing persistent data exists in a corresponding high-speed storage unit in the target shingled partition; and the data erasing submodule is used for erasing the persistent data in the high-speed storage unit containing the persistent data if the high-speed storage unit containing the persistent data is detected.
As an optional embodiment of the present invention, the high speed storage unit is a flash memory, and the apparatus further includes: the legal judging module is used for judging whether a logic address which needs to read or write data in the flash memory is legal or not when receiving a data reading or writing request; the index determining module is used for determining a memory index and a flash memory index corresponding to the data reading or writing request if the logical address is judged to be legal; and the operation execution module is used for reading or writing data according to the memory index and the flash memory index.
As an optional embodiment of the present invention, the high speed storage unit may be a flash memory, and the apparatus further includes: a determination module for determining when H i Determining that a flash block containing persistent data exists in the flash memory;
wherein H i Representing the endurance factor, H, of the flash memory i i ＝λ 1 *X i /(λ 2 * M); HA denotes the persistence upper bound factor, HA = λ 1 *X/(λ 2 * M); HB denotes the persistence lower bound factor, HB = λ 1 /(λ 2 * M); mu and epsilon are constants; x is the number of flash pages contained in the flash memory i; m is the number of the associated flash memory blocks in the target shingled partition; x i The number of flash memory pages containing persistent data in the flash memory block i is set; lambda [ alpha ] 1 、λ 2 Is a constant.
As an optional embodiment of the present invention, the apparatus further comprises: the judging module is used for judging that the shingled magnetic disk triggers updating when T is larger than or equal to alpha G;
wherein, T represents the dynamic factor of the disk,
alpha is a constant; g denotes a start factor of the disk, G = beta 1 *K/P+β 2 *P/Q，β 1 、β 2 、β 3 Is a constant; k is the total capacity of the shingled magnetic disk; p is the partition capacity of each shingled partition; a. The i The number of the stored memory indexes in the memory index space of the tile-overlapped partition i is stored; P/Q is the storage capacity of the memory index; K/P is the number of the shingled partitions; q is the maximum number of indexes that the memory index space can store.
As an alternative embodiment of the present invention, the priority factor for any shingled partition is calculated by:
R i ＝θ 1 *F i +θ 2 *(P/Q-A i )
wherein R is i Representing the priority factor of the memory index space of the shingled partition i; f i The number of high-speed memory cells associated with shingled partition i; theta 1 、θ 2 Is a constant; a. The 1i The number of indices already stored in the memory index space.
An embodiment of the present invention further provides an electronic device, as shown in fig. 4, the electronic device may include a processor 401 and a memory 402, where the processor 401 and the memory 402 may be connected by a bus or in another manner, and fig. 4 takes the connection by the bus as an example.
The memory 402, which is a non-transitory computer readable storage medium, may be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as program instructions/modules corresponding to the scheduling method between data storage media in the embodiments of the present invention. The processor 401 executes various functional applications and data processing of the processor by running non-transitory software programs, instructions and modules stored in the memory 402, that is, implements the scheduling method between data storage media in the above method embodiments.
The memory 402 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created by the processor 401, and the like. Further, the memory 402 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, memory 402 may optionally include memory located remotely from processor 401, which may be connected to processor 401 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The one or more modules are stored in the memory 402 and when executed by the processor 401 perform a method of scheduling between data storage media as in the embodiment shown in fig. 1.
The details of the electronic device may be understood with reference to the corresponding related description and effects in the embodiment shown in fig. 1, and are not described herein again.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic Disk, an optical Disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a Flash Memory (Flash Memory), a Hard Disk (Hard Disk Drive, abbreviated as HDD), a Solid State Drive (SSD), or the like; the storage medium may also comprise a combination of memories of the kind described above.
Although the embodiments of the present invention have been described in conjunction with the accompanying drawings, those skilled in the art can make various modifications and variations without departing from the spirit and scope of the invention, and such modifications and variations fall within the scope defined.
Claims (10)
1. The scheduling method between data storage media is characterized by being applied to a storage system comprising high-speed storage units and shingled disks, wherein each shingled partition in the shingled disks is associated with a corresponding high-speed storage unit; the method comprises the following steps:
judging whether the shingled disk triggers updating or not;
if the shingled disk triggers updating, calculating a priority factor corresponding to the memory index space of each shingled partition in the shingled disk;
selecting a target tile-folding partition with a priority factor meeting a preset condition;
and writing the data in the high-speed storage unit corresponding to the target shingle partition into the target shingle partition.
2. The method of scheduling between data storage media of claim 1, wherein after writing the data in the high-speed storage unit corresponding to the target shingled partition into the target shingled partition, the method further comprises:
data written to the high speed memory cells of the shingled partition is erased.
3. The method for scheduling between data storage media according to claim 1, wherein the writing the data in the high-speed storage unit corresponding to the target shingled partition into the target shingled partition comprises:
detecting whether a high-speed storage unit containing persistent data exists in a corresponding high-speed storage unit in the target shingled partition;
if the existence of the high-speed storage unit containing the persistent data is detected, the persistent data in the high-speed storage unit containing the persistent data is erased.
4. The method of claim 1, wherein the high-speed storage unit is a flash memory, the method further comprising:
when a data reading or writing request is received, judging whether a logic address needing to be read or written in the flash memory is legal or not;
if the logical address is judged to be legal, determining a memory index and a flash memory index corresponding to the data reading or writing request;
and performing data reading or writing operation according to the memory index and the flash memory index.
5. The method according to claim 3, wherein the high-speed storage unit is a flash memory; the method comprises the following steps: when H is present i Determining whether a flash block containing persistent data exists in the flash memory or not, wherein the flash block is greater than or equal to mu HA-epsilon HB;
wherein H i Representing the persistence factor of flash i, H i ＝λ 1 *X i /(λ 2 * M); HA denotes the persistence upper bound factor, HA = λ 1 *X/(λ 2 *M)；HBDenotes the persistence lower limiting factor, HB = λ 1 /(λ 2 * M); mu and epsilon are constants; x is the number of pages of the flash memory contained in the flash memory i; m is the number of the associated flash memory blocks in the target shingled partition; x i The number of flash memory pages containing persistent data in the flash memory block i is set; lambda [ alpha ] 1 、λ 2 Is a constant.
6. The method of scheduling between data storage media of claim 1, the method comprising: when T is larger than or equal to alpha G, judging that the shingled magnetic disk triggers updating;
wherein, T represents the dynamic factor of the disk,
alpha is a constant; g denotes a start factor of the disk, G = beta 1 *K/P+β 2 *P/Q，β 1 、β 2 、β 3 Is a constant; k is the total capacity of the shingled magnetic disk; p is the partition capacity of each shingled partition; a. The i The number of the stored memory indexes in the memory index space of the imbricated partition i is used as the number of the stored memory indexes; P/Q is the storage capacity of the memory index; K/P is the number of the shingled partitions; q is the maximum number of indexes that the memory index space can store.
7. The method of scheduling between data storage media of claim 1 wherein the priority factor for any shingled partition is calculated by:
R i ＝θ 1 *F i +θ 2 *(P/Q-A i )
wherein R is i Representing the priority factor of the memory index space of the shingled partition i; f i The number of high speed memory cells associated with shingled partition i; theta.theta. 1 、θ 2 Is a constant; a. The i The number of indices already stored in the memory index space for shingled partition i.
8. A scheduling device between data storage media is applied to a storage system comprising high-speed storage units and shingled disks, wherein each shingled partition in the shingled disks is associated with a corresponding high-speed storage unit; the device comprises:
the updating judgment module is used for judging whether the shingled disk triggers updating;
the data calculation module is used for calculating a priority factor corresponding to the memory index space of each shingled partition in the shingled disk if the shingled disk triggers updating;
the partition selection module is used for selecting a target shingled partition with the priority factor meeting the preset condition;
and the data writing module is used for writing the data in the high-speed storage unit corresponding to the target shingled partition into the target shingled partition.
9. An electronic device, comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to cause the at least one processor to perform the steps of the method of scheduling between data storage media as claimed in any one of claims 1 to 7.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the scheduling method between data storage media according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211343027.1A CN115712389B (en) | 2022-10-28 | 2022-10-28 | Scheduling method and device among data storage media and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211343027.1A CN115712389B (en) | 2022-10-28 | 2022-10-28 | Scheduling method and device among data storage media and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115712389A true CN115712389A (en) | 2023-02-24 |
| CN115712389B CN115712389B (en) | 2023-07-04 |
Family
ID=85231655
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211343027.1A Active CN115712389B (en) | 2022-10-28 | 2022-10-28 | Scheduling method and device among data storage media and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115712389B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150318022A1 (en) * | 2013-10-21 | 2015-11-05 | Marvell World Trade Ltd. | Caching systems and methods for hard disk drives and hybrid drives |
| US20170277438A1 (en) * | 2016-03-22 | 2017-09-28 | Kabushiki Kaisha Toshiba | Method to efficiently store object data of an object storage service on a magnetic disk drive and magnetic smr disk drive |
| US20190163409A1 (en) * | 2017-10-27 | 2019-05-30 | EMC IP Holding Company LLC | Methods and devices for writing data in a disk array in storage system |
| CN110663019A (en) * | 2017-05-26 | 2020-01-07 | 微软技术许可有限责任公司 | File system for Shingled Magnetic Recording (SMR) |
| CN111400204A (en) * | 2020-02-29 | 2020-07-10 | 苏州浪潮智能科技有限公司 | Solid-state disk caching method, system and related equipment |
| CN112214169A (en) * | 2020-09-28 | 2021-01-12 | 深圳大学 | Data storage device and stored data migration method |
| CN112799595A (en) * | 2021-02-02 | 2021-05-14 | 联想(北京)有限公司 | Data processing method, device and storage medium |
| WO2021249201A1 (en) * | 2020-06-10 | 2021-12-16 | 杭州海康威视数字技术股份有限公司 | Monitoring data storage method and apparatus based on shingled magnetic recording disk |
| CN113900590A (en) * | 2021-09-28 | 2022-01-07 | 重庆紫光华山智安科技有限公司 | Shingled disk storage method, apparatus, device and medium |
| CN114221975A (en) * | 2021-11-30 | 2022-03-22 | 浙江大华技术股份有限公司 | Cloud storage data recovery method and device based on SMR disk and electronic equipment |
-
2022
- 2022-10-28 CN CN202211343027.1A patent/CN115712389B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150318022A1 (en) * | 2013-10-21 | 2015-11-05 | Marvell World Trade Ltd. | Caching systems and methods for hard disk drives and hybrid drives |
| US20170277438A1 (en) * | 2016-03-22 | 2017-09-28 | Kabushiki Kaisha Toshiba | Method to efficiently store object data of an object storage service on a magnetic disk drive and magnetic smr disk drive |
| CN110663019A (en) * | 2017-05-26 | 2020-01-07 | 微软技术许可有限责任公司 | File system for Shingled Magnetic Recording (SMR) |
| US20190163409A1 (en) * | 2017-10-27 | 2019-05-30 | EMC IP Holding Company LLC | Methods and devices for writing data in a disk array in storage system |
| CN111400204A (en) * | 2020-02-29 | 2020-07-10 | 苏州浪潮智能科技有限公司 | Solid-state disk caching method, system and related equipment |
| WO2021249201A1 (en) * | 2020-06-10 | 2021-12-16 | 杭州海康威视数字技术股份有限公司 | Monitoring data storage method and apparatus based on shingled magnetic recording disk |
| CN112214169A (en) * | 2020-09-28 | 2021-01-12 | 深圳大学 | Data storage device and stored data migration method |
| WO2022062015A1 (en) * | 2020-09-28 | 2022-03-31 | 深圳大学 | Data storage device and stored data migration method |
| CN112799595A (en) * | 2021-02-02 | 2021-05-14 | 联想(北京)有限公司 | Data processing method, device and storage medium |
| CN113900590A (en) * | 2021-09-28 | 2022-01-07 | 重庆紫光华山智安科技有限公司 | Shingled disk storage method, apparatus, device and medium |
| CN114221975A (en) * | 2021-11-30 | 2022-03-22 | 浙江大华技术股份有限公司 | Cloud storage data recovery method and device based on SMR disk and electronic equipment |
Non-Patent Citations (2)
| Title |
|---|
| JIAXIAN CHEN等: "GCIM: Toward Efficient Processing of Graph Convolutional Networks in 3D-Stacked Memory", 《IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS》, vol. 41, no. 11, XP011925142, DOI: 10.1109/TCAD.2022.3198320 * |
| 谭玉娟;刘涛;赵亚军;: "叠瓦式磁记录磁盘的研究进展", 中国科技论文, no. 14 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115712389B (en) | 2023-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107193646B (en) | High-efficiency dynamic page scheduling method based on mixed main memory architecture | |
| US10565075B2 (en) | Storage device and block storage method based on the storage device | |
| US7730358B2 (en) | Stress testing method of file system | |
| JP5458568B2 (en) | Nonvolatile storage device, information recording system, and information recording method | |
| US20090049229A1 (en) | Nonvolatile memory device, method of writing data,and method of reading out data | |
| EP1560224A2 (en) | Data recovery apparatus and method used for flash memory | |
| CN113282249B (en) | Data processing method, system, device and medium | |
| CN112463058B (en) | Fragmented data sorting method and device and storage node | |
| CN111198845A (en) | Data migration method, readable storage medium and computing device | |
| CN113590045A (en) | Data layered storage method, device and storage medium | |
| CN115756317A (en) | Storage method, storage device, electronic equipment and storage medium of shingled magnetic disk | |
| CN115834587A (en) | Method and device for selecting target storage server and electronic equipment | |
| US20110107056A1 (en) | Method for determining data correlation and a data processing method for a memory | |
| CN115712389A (en) | Scheduling method and device between data storage media and electronic equipment | |
| CN111078143B (en) | Hybrid storage method and system for data layout and scheduling based on segment mapping | |
| CN112306404A (en) | Tile recording disk data layout method, system and related equipment | |
| CN115480826B (en) | Branch predictor, branch prediction method, branch prediction device and computing equipment | |
| EP3182267B1 (en) | Method and device for isolating disk regions | |
| CN114281251B (en) | Data distribution and reprogramming optimization method for 3D TLC flash memory | |
| CN115904255A (en) | Data request method, device, equipment and storage medium | |
| CN113467724B (en) | CRC (cyclic redundancy check) code storage method, device, equipment and medium | |
| CN109992217B (en) | Service quality control method and device, electronic equipment and storage medium | |
| CN113296700A (en) | Storage space management method and device and server | |
| CN111722802A (en) | Storage space allocation method, device and equipment for metadata LSA volume | |
| CN116662603B (en) | Time shaft control method and system based on kafka, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |