[go: up one dir, main page]

WO2018176811A1 - Procédé et appareil d'inscription sur disque dur - Google Patents

Procédé et appareil d'inscription sur disque dur Download PDF

Info

Publication number
WO2018176811A1
WO2018176811A1 PCT/CN2017/107005 CN2017107005W WO2018176811A1 WO 2018176811 A1 WO2018176811 A1 WO 2018176811A1 CN 2017107005 W CN2017107005 W CN 2017107005W WO 2018176811 A1 WO2018176811 A1 WO 2018176811A1
Authority
WO
WIPO (PCT)
Prior art keywords
hard disk
cache
physical hard
written
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2017/107005
Other languages
English (en)
Chinese (zh)
Inventor
何海洋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Lenovo Beijing Ltd
Original Assignee
Lenovo Beijing Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Lenovo Beijing Ltd filed Critical Lenovo Beijing Ltd
Publication of WO2018176811A1 publication Critical patent/WO2018176811A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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/062—Securing storage systems
    • G06F3/0622—Securing storage systems in relation to access
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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 OR CALCULATING; 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/0662—Virtualisation aspects
    • G06F3/0667—Virtualisation aspects at data level, e.g. file, record or object virtualisation
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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/0674—Disk device

Definitions

  • the present disclosure relates to the field of smart device storage, and in particular, to a hard disk writing method and apparatus.
  • An object of the present disclosure is to provide a hard disk writing method and device capable of improving hard disk writing performance of a smart device, which can increase the sequential writing operation of the hard disk of the smart device to improve the writing efficiency of the hard disk.
  • An aspect of the present disclosure provides a hard disk writing method, including: generating a virtual hard disk by using a non-volatile memory technology and a physical hard disk of the smart device, where the virtual hard disk stores a data block that needs to be written into the physical hard disk; Writing the data block to the cache corresponding to the physical hard disk; and acquiring, according to the location information of the data stored by the physical hard disk, related information of consecutive free sectors in the physical hard disk, and according to the related information and the foregoing data The length of the block sequentially writes the data blocks temporarily stored in the above buffer into successive consecutive free sectors.
  • the method further includes: determining whether the cache is full; and determining, when the cache is full, determining the data in the cache. Whether the block has been written to the physical hard disk; and if not yet written to the physical hard disk, the data blocks in the cache are sequentially written to consecutive free sectors of the physical hard disk, and the data block is released. The corresponding space occupied by the above cache.
  • the method further includes: if the data block in the cache is already written to the physical hard disk, determining whether the data block in the cache is changed; if no change occurs, releasing the data block in the cache Corresponding space; and if the change has occurred, the data blocks in the cache are sequentially written to the consecutive free sectors in the physical hard disk, and the fan of the physical hard disk occupied by the data block before the change is released. Area.
  • the method further includes: defragmenting the free sectors in the physical hard disk in the process of writing the data block stored in the cache to the physical hard disk.
  • defragmenting the free sectors in the physical hard disk includes: when the data blocks in the cache are sequentially written to consecutive sectors of the physical hard disk, adjacent fans of sectors that have written data District to judge; and as If the adjacent sector is a free sector, the location of the data block in the sector is moved to merge the adjacent sectors.
  • An aspect of the present disclosure provides a hard disk writing device including an interconnected processor and a physical hard disk, wherein the physical hard disk has a cache, and the processor executes: generating a virtual hard disk by using a non-volatile memory technology and the physical hard disk.
  • the virtual hard disk stores a data block that needs to be written into the physical hard disk; the data block is written into a cache corresponding to the physical hard disk; and the continuous storage in the physical hard disk is obtained according to the location information of the data stored by the physical hard disk.
  • the processor further performs: determining, before writing the data block to the cache corresponding to the physical hard disk, whether the cache is full; when the cache is full, determining the cache Whether the above data block has been written into the physical hard disk; and if not yet written into the physical hard disk, the data blocks in the cache are sequentially written to consecutive free sectors of the physical hard disk and the data is released. The corresponding space of the above cache occupied by the block.
  • the processor further performs: if the data block in the cache is already written to the physical hard disk, determining whether the data block in the cache changes; if no change occurs, releasing the data block in the cache Corresponding space; and if the change has occurred, the data blocks in the cache are sequentially written to the consecutive free sectors in the physical hard disk, and the physical hard disk occupied by the data block before the change is released. Sector.
  • the processor further performs: defragmenting the free sectors in the physical hard disk in the process of writing the data blocks stored in the cache to the physical hard disk.
  • the foregoing processor performs: during the defragmentation process, after the data blocks in the cache are sequentially written to the sectors of the consecutive physical hard disks, performing adjacent sectors of the sectors in which the data has been written Judging; and if the adjacent sector is a free sector, moving the position of the data block in the sector to merge the adjacent sectors.
  • FIG. 1 is a flowchart of a method for writing a hard disk according to an embodiment of the present disclosure
  • FIG. 2 is a schematic diagram of a first case of writing data to a physical hard disk according to an embodiment of the present disclosure
  • FIG. 3 is a schematic diagram of a second scenario in which data is written into a physical hard disk according to an embodiment of the present disclosure
  • FIG. 4 is a schematic diagram of a third scenario in which data is written into a physical hard disk according to an embodiment of the present disclosure
  • FIG. 5 is a schematic diagram of a fourth situation in which data is written into a physical hard disk according to an embodiment of the present disclosure
  • FIG. 6 is a schematic diagram of a fifth situation in which data is written into a physical hard disk according to an embodiment of the present disclosure
  • FIG. 7 is a specific flowchart of a method for improving hard disk write performance of a smart device according to an embodiment of the present disclosure
  • FIG. 8 is a structural block diagram of a hard disk writing device according to an embodiment of the present disclosure.
  • the techniques of this disclosure may be implemented in the form of hardware and/or software (including firmware, microcode, etc.). Additionally, the techniques of this disclosure may take the form of a computer program product on a computer readable medium storing instructions for use by or in connection with an instruction execution system.
  • a computer readable medium can be any medium that can contain, store, communicate, propagate or transport the instructions.
  • a computer readable medium can include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium.
  • the computer readable medium include: a magnetic storage device such as a magnetic tape or a hard disk (HDD); an optical storage device such as a compact disk (CD-ROM); a memory such as a random access memory (RAM) or a flash memory; and/or a wired /Wireless communication link.
  • a magnetic storage device such as a magnetic tape or a hard disk (HDD)
  • an optical storage device such as a compact disk (CD-ROM)
  • a memory such as a random access memory (RAM) or a flash memory
  • RAM random access memory
  • a method for writing a hard disk which can operate a hard disk of a smart device such as a computer (such as an SMR hard disk) and improve write performance of the hard disk to avoid non-continuous writing as shown in FIG. 1
  • the data in the sector number c1 in the buffer 3 is written to the sector of the physical hard disk 4 numbered as d1
  • the data in the c2 is written into the d4, c3.
  • the data is written to d3, the data in c4 is written to d8, the data in c5 is written to d6, and the data in c6 is written to d7, and the above writing method reduces the writing performance of the hard disk.
  • the method for writing a hard disk in conjunction with the embodiment of the present disclosure in conjunction with FIG. 7 includes:
  • the virtual hard disk 2 is generated by using the non-volatile memory technology (NVDIMM) and the physical hard disk 4 of the smart device, and the virtual hard disk 2 stores the data block that needs to be written into the physical hard disk 4.
  • Non-Volatile Memory Technology NVDIMM
  • DRAM dynamic random access memory
  • the virtual hard disk 2 can be generated by using the technology in combination with the physical hard disk 4.
  • the virtual hard disk 2 is provided with at least one sector sequentially arranged, and the data block in which the physical hard disk 4 needs to be written is stored in the sector.
  • the data block is written into the cache 3 corresponding to the physical hard disk 4.
  • the cache 3 also has consecutive sectors and can store data blocks, and the writing manner can be in various forms, for example, the data blocks can be arranged according to The order of the sequences is written into the cache 3 one by one, and the data blocks can also be randomly written into the cache 3, and can also be written into the cache 3 according to a predetermined rule.
  • the related information of the consecutive free sectors in the physical hard disk 4 is acquired, and the data blocks temporarily stored in the cache 3 are sequentially written according to the related information and the length of the data block. Enter into consecutive free sectors.
  • the data block in the cache 3 is stored in the physical hard disk 4, the data block has a certain length (for example, each data block has a certain length, and a plurality of consecutive data blocks are operated during storage), and a certain length
  • a plurality of data blocks necessarily require a sufficient number of free sectors for storage.
  • a sufficient number of consecutive free sectors are required for storage, thereby ensuring that the data blocks can be consecutively written (sequentially written) into the physical according to the arrangement order.
  • the hard disk 4 when the related information of consecutive free sectors in the physical hard disk 4 is acquired, relevant information such as the length, position and number of consecutive free sectors can be detected, so that the positions of consecutive free sectors can be accurately found. And successively writing (sequentially writing) the data blocks having a certain length into the free sectors according to the arrangement order.
  • the sectors of the physical hard disk 4 are all free sectors.
  • the data in the cache 3 can be consecutively written (sequentially written) in the order of the order into the physical hard disk 4, and the number in the sector numbered c1 to c6 in the cache 3
  • the blocks are successively written into consecutive sectors of the physical hard disk 4, and the data blocks in c1 are written into d1, the data blocks in c2 are written into d2, the data blocks in c3 are written into d3, and the data blocks in c4 are written.
  • the data block in c5 is written into d5
  • the data block in c6 is written into d6, where d1 to d6 are consecutive sectors.
  • the writing method can effectively improve the writing efficiency of the hard disk and improve the overall performance of the hard disk.
  • the probability of continuously writing data to the hard disk can be effectively improved, the probability of randomly writing data to the hard disk is reduced, the time for writing data to the hard disk is saved, and the writing performance of the hard disk is improved.
  • the cache 3 before the data block is written to the cache 3 corresponding to the physical hard disk 4, it is determined whether the cache 3 has been filled; when the cache 3 has been filled, the cached data block is determined. Whether it has been written to the physical hard disk 4; if it has not been written into the physical hard disk 4, the data blocks in the cache 3 are sequentially written to the consecutive free sectors of the physical hard disk 4 and the cache occupied by the data block is released. 3 corresponding space. If the cache 3 has been filled with data, then the original data will be overwritten when the data is written to the cache 3, which will cause the original data to be lost, so the data block is written to the object.
  • the cache 3 Before determining whether the cache 3 is full before the cache 3 corresponding to the hard disk 4 can avoid data loss caused by erroneous operations. If it is determined that the cache 3 has been filled with data, it is further determined whether the data block in the cache 3 is written to the physical hard disk 4. For example, the cache 3 in FIG. 4 has been filled, and then the cache 3 is numbered c2.
  • the data block in the cache 3 has been written to the physical hard disk 4, it is determined whether the data block in the cache 3 has changed (for example, if the new data block is written in the cache 3, the data block has been changed), If no changes have occurred (for example, the data block in cache 3 has not been updated, and at this time the data has been written to physical hard disk 4), the corresponding space of the data block in cache 3 is released, so that the fan in cache 3 The zone can be written to a new block of data.
  • the data blocks in the cache 3 are sequentially written to consecutive free sectors in the physical hard disk 4, and Release the sector of physical hard disk 4 occupied by the data block before the change. Further, with reference to FIG. 5, if it is judged that the data blocks in the sectors numbered c1, c3, and c4 in the cache 3 are not updated, and at this time, the data has been written to the physical hard disk 4, c1 is released.
  • FIG. 4 has a plurality of consecutive sectors in the virtual hard disk 2, numbered from m1 to mN, and the cache 3 has consecutive sectors, numbered c1.
  • the physical hard disk 4 has a plurality of consecutive sectors d1 to dN, the shaded sectors in the figure represent that the data block has occupied the corresponding sector, and the blank sector represents the free sector, in the virtual
  • the data in m6, m8, and m9 of hard disk 2 is requested to be written to physical hard disk 4.
  • m1, m3, and m4 have respectively stored data to c1, c3, and c4, and c2, c5, and c6 in cache 3 are already occupied.
  • the data block is not written to the physical hard disk 4.
  • the search satisfies the free sector with sufficient length.
  • the original data blocks in c2, c5 and c6 are written to d7, d8 and d9.
  • the data in m6, m8, and m9 is written into c2, c5, and c6, and the information in the m6, m8, and m9 data is successfully written.
  • the virtual hard disk 2 has a plurality of consecutive sectors, numbered m1 to mN, and the cache 3 has a plurality of consecutive sectors, and the numbers are respectively C1 to c6, things
  • the hard disk 4 has a plurality of consecutive sectors d1 to dN, and the shaded sectors in the figure represent that the data block has occupied the corresponding sector, and new data requests are written in the virtual hard disk 2 in m6, m8 and m9.
  • the data in c1, c3 and c4 can be transferred to the physical hard disk 4, in The physical hard disk 4 searches for consecutive sectors d7, d8, and d9, and successively writes the data in c1, c3, and c4 to the sectors d7, d8, and d9 in accordance with the arrangement order, respectively, (for example, the data in c1 is written to d7.
  • the data in c2 is written to d8, the data in c4 is written to d9), and the data in the sector numbered d1, d3, d6 in the physical hard disk 4 originally occupied by the c1, c3, and c4 data blocks is released, and then The data in m6, m8 and m9 are written to c1, c3 and c4, and the information in m6, m8 and m9 is successfully written.
  • the hard disk writing method capable of improving the hard disk writing performance of the smart device further includes: in the process of writing the data block stored in the cache 3 into the physical hard disk 4, in the physical hard disk 4 Free sectors are defragmented. Defragmentation can combine free sectors scattered in different locations so that these free sectors have enough space or length to store new data, and enable the data in cache 3 to be consecutively written in the order of the order (sequence Write) into multiple consecutive free sectors.
  • defragmenting the free sectors in the physical hard disk includes: when the data blocks in the cache 3 are sequentially written to the sectors of the consecutive physical hard disks 4, adjacent sectors of the sectors to which the data has been written A determination is made as to if the neighboring sector is a free sector, then the location of the data block in the sector is moved to merge adjacent sectors. For example, the sectors on which the data is written in the physical hard disk 4 have free sectors on the left and right sides, and the data blocks are moved to the left or right so that the left and right sides have free sectors merged into consecutive free sectors. In order to achieve the purpose of finishing debris. As further described below with reference to FIG.
  • the original data in c1, c3 and c4 are continuously written (sequentially written) into d1, d2 and d3 according to the new mapping relationship, and then m6 is added.
  • the data in m8 and m9 are written to c1, c3, and c4, and the information in the m6, m8, and m9 data is successfully written.
  • the original d1 and d5 fragments can be organized to form consecutive free sectors d4 and d5 for storing new data.
  • the embodiment of the present disclosure further provides a hard disk writing device capable of improving the hard disk writing performance of the smart device.
  • a hard disk writing device capable of improving the hard disk writing performance of the smart device.
  • the processor 1 and the physical hard disk 4 are connected to each other, and the physical hard disk 4 has a cache 3 , which is combined with FIG. 7 .
  • Processor 1 executes:
  • the virtual hard disk 2 is generated by the non-volatile memory technology (NVDIMM) and the physical hard disk 4 of the smart device, and the virtual hard disk 2 stores data blocks that need to be written to the physical hard disk 4.
  • Non-Volatile Memory Technology (NVDIMM) is in an integration
  • DRAM dynamic random access memory
  • non-volatile memory chip can still save the complete memory data when the power is completely cut off.
  • the technology can be used in combination with the physical hard disk 4 to generate the virtual hard disk 2
  • the virtual hard disk 2 is provided with at least one sector sequentially arranged, and the sector stores data blocks that need to be written to the physical hard disk 4.
  • the processor 1 can write the data block into the cache 3 corresponding to the physical hard disk 4.
  • the cache 3 also has consecutive sectors and can store the data block, and the writing manner can be in various forms, for example, the data block can be followed.
  • the order of the arrangement is written into the cache 3 one by one, and the data blocks can also be randomly written into the cache 3, and can also be written into the cache 3 according to a predetermined rule.
  • the processor 1 can acquire related information of consecutive free sectors in the physical hard disk 4 according to the location information of the data stored by the physical hard disk 4, and sequentially store the data block order in the cache 3 according to the related information and the length of the data block. Write to consecutive free sectors.
  • the data block in the cache 3 is stored in the physical hard disk 4, the data block has a certain length (for example, each data block has a certain length, and a plurality of consecutive data blocks are operated during storage), and a certain length
  • a plurality of data blocks necessarily require a sufficient number of free sectors for storage.
  • a sufficient number of consecutive free sectors are required for storage, thereby ensuring that the data blocks can be consecutively written (sequentially written) into the physical according to the arrangement order.
  • the data blocks in the sectors numbered c1 to c6 in the cache 3 are consecutive Write to the contiguous sector of the physical hard disk 4, and the data block in c1 is written into d1, the data block in c2 is written in d2, and the data block in c3 is written in d3, the number in c4 According to the block write d4, the data block in c5 is written into d5, and the data block in c6 is written into d6, where d1 to d6 are consecutive sectors.
  • the writing method can effectively improve the writing efficiency of the hard disk and improve the overall performance of the hard disk.
  • the processor 1 further performs: determining whether the cache 3 has been filled before writing the data block to the cache 3 corresponding to the physical hard disk 4; when the cache 3 has been filled, Determining whether the data block in the cache is written into the physical hard disk 4; and if not yet written into the physical hard disk 4, sequentially writing the data blocks in the cache 3 to consecutive free sectors of the physical hard disk 4 and The corresponding space of the cache 3 occupied by the data block is released. If the cache 3 has been filled with data, then the original data will be overwritten when the data is written to the cache 3, which will cause the original data to be lost.
  • the data block is written to the cache corresponding to the physical hard disk 4 Before determining whether the cache 3 is full, it can avoid data loss caused by misoperation. If it is determined that the cache 3 has been filled with data, it is further determined whether the data block in the cache 3 is written to the physical hard disk 4. For example, the cache 3 in FIG. 4 has been filled, and then the cache 3 is numbered c2.
  • the processor 1 further performs: if the data block in the cache 3 has been written into the physical hard disk 4, it is determined whether the data block in the cache 3 is changed (for example, the new data block is written in the cache 3 to indicate the data. The block has been changed), if no changes have occurred (for example, the data block in cache 3 has not been updated, and at this time the data has been written to physical hard disk 4), then the corresponding space of the data block in cache 3 is released, The sectors in cache 3 can be written to new data blocks. If the processor 1 judges that the data block in the cache 3 has changed (for example, a new data block is written in the cache 3), the data blocks in the cache 3 are sequentially written to consecutive free sectors in the physical hard disk 4.
  • the virtual hard disk 2 has a plurality of consecutive sectors, numbered m1 to mN, and the cache 3 has a plurality of consecutive sectors, respectively numbered c1.
  • the physical hard disk 4 has a plurality of consecutive sectors d1 to dN, the shaded sectors in the figure represent that the data block has occupied the corresponding sector, and the blank sector represents the free sector
  • the processor 1 requires that the data in m6, m8 and m9 in virtual hard disk 2 be written to physical hard disk 4, at this time m1, m3 and m4 have respectively stored data to c1, c3 and c4, and c2, c5 and c6 have been cached 3 Occupied but the data block is not written to the physical hard disk 4, the processor 1 searches the physical hard disk 4 to satisfy a free sector having a sufficient length, and after finding d7, d8 and d9, the original c2, c5 and c6 The
  • the virtual hard disk 2 has a plurality of consecutive sectors, numbered m1 to mN, respectively, and the cache 3 has a plurality of consecutive sectors, and the numbers are respectively C1 to c6, the physical hard disk 4 has a plurality of consecutive sectors d1 to dN, the shaded sectors in the figure represent that the data block has occupied the corresponding sector, and the processor 1 requires m6, m8 in the virtual hard disk 2.
  • the data in m9 is written to the physical hard disk 4, at this time m1, m3 and m4 have respectively stored the data to c1, c3 and c4, and the cache 3 has been filled, and the data in c1, c3 and c4 can be transferred to
  • the processor 1 searches the physical hard disk 4 for consecutive sectors d7, d8, and d9, and successively writes the data in c1, c3, and c4 to the sectors d7, d8, and d9 in accordance with the arrangement order.
  • the processor 1 further performs: during the process of writing the data block stored in the cache 3 to the physical hard disk 4 Defragment the free sectors in physical hard disk 4. Defragmentation can combine free sectors scattered in different locations so that these free sectors have enough space or length to store new data, and enable the data in cache 3 to be consecutively written in the order of the order (sequence Write) into multiple consecutive free sectors.
  • the processor 1 performs during the defragmentation process: when the data blocks in the cache 3 are sequentially written to the sectors of the contiguous physical hard disk 4, the neighboring sectors of the sectors in which the data has been written are judged. If the neighboring sector is a free sector, the location of the data block in the sector is moved to merge adjacent sectors. For example, the sectors on which the data is written in the physical hard disk 4 have free sectors on the left and right sides, and the processor 1 moves the data blocks to the left or right so that the left and right sides have free sectors merged into continuous idle. Sectors to achieve the purpose of defragmentation. As further described below in conjunction with FIG.
  • the processor 1 requests that data in m6, m8, and m9 in the virtual hard disk 2 be written to the physical hard disk 4, at which time m1, m3, and m4 have respectively stored data to c1, c3, and c4, And the cache 3 has been filled, the processor 1 can transfer the data in c1, c3 and c4 to d2, d3 and d4 in the physical hard disk 4 (if the data in c1 is written to d2, the data in c3 is written The data in d3, c4 is written to d4), although d2, d3 and d4 are consecutive sectors, but the free sectors d1 and d5 appear on both sides thereof, and d1 and d5 cannot store data separately due to the small length, the processor 1 adjust the mapping relationship, the original m4 is finally stored in d4 and adjusted to store m4 in d1, and the original data in c1, c3 and c4 are continuously written (sequentially written) to d1 according to the
  • the data in m6, m8, and m9 are correspondingly written to c1, c3, and c4, and the information in m6, m8, and m9 is successfully written.
  • the original d1 and d5 fragments can be organized to form consecutive free sectors d4 and d5 for storing new data.
  • processor 1 may, for example, comprise a general purpose microprocessor, an instruction set processor and/or a related chipset and/or a special purpose microprocessor (e.g., an application specific integrated circuit (ASIC)), and the like.
  • the processor 1 may also include an onboard memory for caching purposes.
  • the hard disk includes a computer readable storage medium.
  • a computer readable storage medium may be, for example, any medium that can contain, store, communicate, propagate or transport the instructions.
  • a readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium.
  • Specific examples of the readable storage medium include: a magnetic storage device such as a magnetic tape or a hard disk (HDD); an optical storage device such as a compact disk (CD-ROM); a memory such as a random access memory (RAM) or a flash memory; and/or a wired /Wireless communication link.
  • the computer readable storage medium can include a computer program, which can include code/computer executable instructions that, when executed by processor 1, cause processor 1 to perform, for example, the method flow described above in the method embodiments and any What is the deformation.
  • the computer program can be configured to have, for example, computer program code comprising a computer program module.
  • the code in a computer program can include one or more program modules, including, for example, A, module B, .
  • the division manner and number of modules are not fixed, and those skilled in the art may use suitable program modules or program module combinations according to actual conditions.
  • the processor 1 may be The method flow as described in the above method embodiments and any variations thereof are performed.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Memory System Of A Hierarchy Structure (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

La presénte invention concerne un procédé et un appareil d'inscription sur disque dur. Le procédé comporte les étapes consistant à: générer un disque dur virtuel (2) en employant une technologie de mémoire non volatile et un disque dur physique (4) d'un dispositif intelligent (S102), le disque dur virtuel (2) stockant des blocs de données qui doivent être écrits dans le disque dur physique (4); écrire les blocs de données dans une antémémoire (3) correspondant au disque dur physique (4) (S104); et obtenir des informations associées de secteurs inactifs continus du disque dur physique (4) en fonction d'informations de position de données stockées dans le disque dur physique (4), et écrire les blocs de données temporairement stockés en antémémoire (3) dans les secteurs inactifs continus d'après les informations associées et les longueurs des blocs de données (S106).
PCT/CN2017/107005 2017-03-27 2017-10-20 Procédé et appareil d'inscription sur disque dur Ceased WO2018176811A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710188400.3A CN106980471B (zh) 2017-03-27 2017-03-27 一种提高智能设备的硬盘写入性能的方法及装置
CN201710188400.3 2017-03-27

Publications (1)

Publication Number Publication Date
WO2018176811A1 true WO2018176811A1 (fr) 2018-10-04

Family

ID=59338981

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/107005 Ceased WO2018176811A1 (fr) 2017-03-27 2017-10-20 Procédé et appareil d'inscription sur disque dur

Country Status (2)

Country Link
CN (1) CN106980471B (fr)
WO (1) WO2018176811A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106980471B (zh) * 2017-03-27 2020-08-25 联想(北京)有限公司 一种提高智能设备的硬盘写入性能的方法及装置
CN110968271B (zh) * 2019-11-25 2024-02-20 北京劲群科技有限公司 一种高性能数据存储方法、系统与装置
CN113282582B (zh) * 2021-05-21 2023-06-20 海南超船电子商务有限公司 一种船位数据的高效存储方法及系统

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101539842A (zh) * 2009-04-27 2009-09-23 杭州华三通信技术有限公司 磁盘阵列系统的数据写入方法及磁盘阵列系统
CN102185929A (zh) * 2011-06-02 2011-09-14 杭州华三通信技术有限公司 一种基于san资源的视频监控数据存储方法及其装置
CN102622412A (zh) * 2011-11-28 2012-08-01 中兴通讯股份有限公司 一种分布式文件系统中的并发写入方法及装置
CN105306865A (zh) * 2015-10-29 2016-02-03 南京秦杜明视信息技术有限公司 一种视频监控数据系统
US9268709B2 (en) * 2012-10-18 2016-02-23 Marvell International Ltd. Storage controllers and storage control methods
CN106980471A (zh) * 2017-03-27 2017-07-25 联想(北京)有限公司 一种提高智能设备的硬盘写入性能的方法及装置

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101398823B (zh) * 2007-09-26 2012-05-09 新奥特硅谷视频技术有限责任公司 利用虚拟文件系统技术实现远程存储的方法及系统
US9729659B2 (en) * 2013-03-14 2017-08-08 Microsoft Technology Licensing, Llc Caching content addressable data chunks for storage virtualization
CN105138286A (zh) * 2015-08-11 2015-12-09 智云创新（北京）科技有限公司 一种在磁盘文件系统中混合利用ssd和smr硬盘的方法
CN105353985A (zh) * 2015-11-03 2016-02-24 国云科技股份有限公司 一种提高虚拟机临时文件读取速度的方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101539842A (zh) * 2009-04-27 2009-09-23 杭州华三通信技术有限公司 磁盘阵列系统的数据写入方法及磁盘阵列系统
CN102185929A (zh) * 2011-06-02 2011-09-14 杭州华三通信技术有限公司 一种基于san资源的视频监控数据存储方法及其装置
CN102622412A (zh) * 2011-11-28 2012-08-01 中兴通讯股份有限公司 一种分布式文件系统中的并发写入方法及装置
US9268709B2 (en) * 2012-10-18 2016-02-23 Marvell International Ltd. Storage controllers and storage control methods
CN105306865A (zh) * 2015-10-29 2016-02-03 南京秦杜明视信息技术有限公司 一种视频监控数据系统
CN106980471A (zh) * 2017-03-27 2017-07-25 联想(北京)有限公司 一种提高智能设备的硬盘写入性能的方法及装置

Also Published As

Publication number Publication date
CN106980471B (zh) 2020-08-25
CN106980471A (zh) 2017-07-25

Similar Documents

Publication Publication Date Title
US7979631B2 (en) Method of prefetching data in hard disk drive, recording medium including program to execute the method, and apparatus to perform the method
JP4829365B1 (ja) データ記憶装置及びデータ書き込み方法
EP3869343B1 (fr) Dispositif de stockage et son procédé de fonctionnement
US20160054936A1 (en) Information processing system and nonvolatile storage unit
US20150046670A1 (en) Storage system and writing method thereof
CN108459826A (zh) 一种处理io请求的方法及装置
US9842057B2 (en) Storage apparatus, storage system, and data read method
WO2015145647A1 (fr) Dispositif de stockage, procédé de traitement de données et système de stockage
TW201643690A (zh) 資料儲存系統及其特定指令執行方法
CN103678166A (zh) 一种采用固态硬盘作为计算机高速缓存的实现方法及系统
JP6790515B2 (ja) ソリッドステートドライブ
WO2018082695A1 (fr) Procédé et dispositif de remplacement de cache
US20190042134A1 (en) Storage control apparatus and deduplication method
US10733107B2 (en) Non-volatile memory apparatus and address classification method thereof
CN105917303B (zh) 一种控制器、识别数据块稳定性的方法和存储系统
WO2018176811A1 (fr) Procédé et appareil d'inscription sur disque dur
CN102279825B (zh) 一种固态硬盘控制器的智能dma控制器
CN105389268A (zh) 资料储存系统及其运作方法
CN104917788A (zh) 一种数据存储方法及装置
CN107273306B (zh) 一种固态硬盘的数据读取、数据写入方法及固态硬盘
WO2015196811A1 (fr) Procédé et appareil de renouvellement du mappage d'un disque, et dispositif électronique
AU2015203828B2 (en) Implementing enhanced performance with read before write to phase change memory to avoid write cancellations
CN108334457B (zh) 一种io处理方法及装置
US10831370B1 (en) Deduplicated and compressed non-volatile memory cache
US8655892B2 (en) Data reorganization

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17903799

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17903799

Country of ref document: EP

Kind code of ref document: A1